Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r354-tall-178024402800113.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is LastZero-PT-N16, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 6.7K May 27 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 27 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 27 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 27 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 74K May 27 10:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 285K May 27 10:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.8K May 27 10:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 27 10:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K May 27 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 22K May 27 10:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 60K May 27 10:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 1.7M Jun 10 11:58 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-00
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-01
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-02
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-03
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-04
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-05
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-06
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-07
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-08
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-09
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-10
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-11
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-12
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-13
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-14
FORMULA_NAME LastZero-PT-N16-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781099789098

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-PT-N16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-10 13:56:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-10 13:56:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 13:56:30] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2026-06-10 13:56:30] [INFO ] Transformed 612 places.
[2026-06-10 13:56:30] [INFO ] Transformed 5425 transitions.
[2026-06-10 13:56:30] [INFO ] Parsed PT model containing 612 places and 5425 transitions and 16787 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 290 places in 23 ms
Reduce places removed 290 places and 3521 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA LastZero-PT-N16-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 321/321 places, 1904/1904 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 320 transition count 1904
Applied a total of 1 rules in 38 ms. Remains 320 /321 variables (removed 1) and now considering 1904/1904 (removed 0) transitions.
[2026-06-10 13:56:30] [INFO ] Flow matrix only has 1784 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-554189309877645246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4520436984535580217.kers'
[2026-06-10 13:56:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-554189309877645246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4520436984535580217.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1784 rows 319 cols 4926 entries
Finished phase 1 with 304 SingleSign rule and 0 generalized
[2026-06-10 13:56:30] [INFO ] Computed 16 invariants in 4 ms
Computed 16 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4520436984535580217.kers
Total runtime 7 ms.
[2026-06-10 13:56:31] [INFO ] Implicit Places using invariants in 484 ms returned []
[2026-06-10 13:56:31] [INFO ] Flow matrix only has 1784 transitions (discarded 120 similar events)
[2026-06-10 13:56:31] [INFO ] Invariant cache hit.
[2026-06-10 13:56:31] [INFO ] State equation strengthened by 272 read => feed constraints.
[2026-06-10 13:56:38] [INFO ] Implicit Places using invariants and state equation in 7438 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7968 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 319/321 places, 1904/1904 transitions.
Applied a total of 0 rules in 21 ms. Remains 319 /319 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 8041 ms. Remains : 319/321 places, 1904/1904 transitions.
Starting structural reductions in LTL mode, iteration 0 : 319/319 places, 1904/1904 transitions.
Applied a total of 0 rules in 9 ms. Remains 319 /319 variables (removed 0) and now considering 1904/1904 (removed 0) transitions.
[2026-06-10 13:56:38] [INFO ] Flow matrix only has 1784 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2734427288074119422.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11535678682943642004.kers'
[2026-06-10 13:56:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2734427288074119422.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11535678682943642004.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1784 rows 318 cols 4910 entries
Finished phase 1 with 304 SingleSign rule and 0 generalized
[2026-06-10 13:56:38] [INFO ] Computed 15 invariants in 7 ms
Computed 15 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11535678682943642004.kers
Total runtime 8 ms.
[2026-06-10 13:56:38] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-06-10 13:56:38] [INFO ] Flow matrix only has 1784 transitions (discarded 120 similar events)
[2026-06-10 13:56:38] [INFO ] Invariant cache hit.
[2026-06-10 13:56:39] [INFO ] State equation strengthened by 272 read => feed constraints.
[2026-06-10 13:56:47] [INFO ] Implicit Places using invariants and state equation in 8714 ms returned []
Implicit Place search using SMT with State Equation took 8912 ms to find 0 implicit places.
Running 1888 sub problems to find dead transitions.
[2026-06-10 13:56:47] [INFO ] Flow matrix only has 1784 transitions (discarded 120 similar events)
[2026-06-10 13:56:47] [INFO ] Invariant cache hit.
[2026-06-10 13:56:47] [INFO ] State equation strengthened by 272 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 318/2103 variables, and 15 constraints, problems are : Problem set: 0 solved, 1888 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 0/319 constraints, ReadFeed: 0/272 constraints, PredecessorRefiner: 1888/1888 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/318 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1888 unsolved
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1012 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1366 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1746 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1788 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
At refinement iteration 2 (OVERLAPS) 1784/2102 variables, 318/333 constraints. Problems are: Problem set: 1495 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2102 variables, 272/605 constraints. Problems are: Problem set: 1495 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2102 variables, 393/998 constraints. Problems are: Problem set: 1495 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2102/2103 variables, and 998 constraints, problems are : Problem set: 1495 solved, 393 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 318/319 constraints, ReadFeed: 272/272 constraints, PredecessorRefiner: 393/1888 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60984ms problems are : Problem set: 1495 solved, 393 unsolved
Search for dead transitions found 1495 dead transitions in 61010ms
Found 1495 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1495 transitions
Dead transitions reduction (with SMT) removed 1495 transitions
Starting structural reductions in LTL mode, iteration 1 : 319/319 places, 409/1904 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 305 transition count 395
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 305 transition count 395
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 41 place count 292 transition count 382
Iterating global reduction 0 with 13 rules applied. Total rules applied 54 place count 292 transition count 382
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 65 place count 281 transition count 360
Iterating global reduction 0 with 11 rules applied. Total rules applied 76 place count 281 transition count 360
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 87 place count 270 transition count 349
Iterating global reduction 0 with 11 rules applied. Total rules applied 98 place count 270 transition count 349
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 107 place count 261 transition count 331
Iterating global reduction 0 with 9 rules applied. Total rules applied 116 place count 261 transition count 331
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 124 place count 253 transition count 323
Iterating global reduction 0 with 8 rules applied. Total rules applied 132 place count 253 transition count 323
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 140 place count 245 transition count 307
Iterating global reduction 0 with 8 rules applied. Total rules applied 148 place count 245 transition count 307
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 153 place count 240 transition count 302
Iterating global reduction 0 with 5 rules applied. Total rules applied 158 place count 240 transition count 302
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 162 place count 236 transition count 294
Iterating global reduction 0 with 4 rules applied. Total rules applied 166 place count 236 transition count 294
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 170 place count 232 transition count 290
Iterating global reduction 0 with 4 rules applied. Total rules applied 174 place count 232 transition count 290
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 176 place count 230 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 178 place count 230 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 179 place count 229 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 180 place count 229 transition count 285
Applied a total of 180 rules in 42 ms. Remains 229 /319 variables (removed 90) and now considering 285/409 (removed 124) transitions.
[2026-06-10 13:57:48] [INFO ] Flow matrix only has 205 transitions (discarded 80 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13631858897920466550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9348511575595295452.kers'
[2026-06-10 13:57:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13631858897920466550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9348511575595295452.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 205 rows 228 cols 498 entries
Finished phase 1 with 199 SingleSign rule and 0 generalized
[2026-06-10 13:57:48] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9348511575595295452.kers
Total runtime 1 ms.
[2026-06-10 13:57:48] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-06-10 13:57:48] [INFO ] Flow matrix only has 205 transitions (discarded 80 similar events)
[2026-06-10 13:57:48] [INFO ] Invariant cache hit.
[2026-06-10 13:57:49] [INFO ] State equation strengthened by 95 read => feed constraints.
[2026-06-10 13:57:49] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 229/319 places, 285/1904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70714 ms. Remains : 229/319 places, 285/1904 transitions.
Support contains 33 out of 229 places after structural reductions.
[2026-06-10 13:57:49] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2026-06-10 13:57:49] [INFO ] Flatten gal took : 49 ms
FORMULA LastZero-PT-N16-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N16-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N16-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N16-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 13:57:49] [INFO ] Flatten gal took : 22 ms
[2026-06-10 13:57:49] [INFO ] Input system was already deterministic with 285 transitions.
Support contains 27 out of 229 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (816 resets) in 1637 ms. (24 steps per ms) remains 11/20 properties
BEST_FIRST walk for 40003 steps (99 resets) in 133 ms. (298 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (98 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (98 resets) in 169 ms. (235 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (98 resets) in 206 ms. (193 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (98 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (98 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (100 resets) in 69 ms. (571 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (98 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (99 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (97 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (100 resets) in 65 ms. (606 steps per ms) remains 11/11 properties
[2026-06-10 13:57:50] [INFO ] Flow matrix only has 205 transitions (discarded 80 similar events)
[2026-06-10 13:57:50] [INFO ] Invariant cache hit.
[2026-06-10 13:57:50] [INFO ] State equation strengthened by 95 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 128/144 variables, 16/16 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/16 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 3/147 variables, 3/19 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 134/281 variables, 147/166 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 40/206 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/206 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 40/321 variables, 40/246 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/321 variables, 0/246 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 10 (OVERLAPS) 88/409 variables, 62/308 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 4/312 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 10/322 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/409 variables, 0/322 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 13/422 variables, 5/327 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 11/338 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 0/338 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/423 variables, 1/339 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/423 variables, 0/339 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 4/427 variables, 5/344 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/427 variables, 2/346 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/427 variables, 0/346 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 1/428 variables, 2/348 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/428 variables, 0/348 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 5/433 variables, 3/351 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/433 variables, 1/352 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/433 variables, 1/353 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/433 variables, 0/353 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 1/434 variables, 1/354 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/434 variables, 0/354 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 0/434 variables, 0/354 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 354 constraints, problems are : Problem set: 5 solved, 6 unsolved in 980 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 229/229 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 83/89 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 11/18 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/18 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/92 variables, 3/21 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 86/178 variables, 92/113 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 18/131 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 3/134 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/134 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 44/222 variables, 43/177 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/177 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 99/321 variables, 67/244 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/321 variables, 4/248 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 9/257 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 3/260 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 0/260 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 16/337 variables, 4/264 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/337 variables, 12/276 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/337 variables, 1/277 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/337 variables, 0/277 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 2/339 variables, 2/279 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/339 variables, 0/279 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 7/346 variables, 9/288 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/346 variables, 3/291 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/346 variables, 0/291 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 4/350 variables, 2/293 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/350 variables, 0/293 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 3/353 variables, 2/295 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/353 variables, 0/295 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 2/355 variables, 1/296 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/355 variables, 0/296 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 20/375 variables, 13/309 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/375 variables, 0/309 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 54/429 variables, 39/348 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/429 variables, 6/354 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/429 variables, 9/363 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/429 variables, 0/363 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 38 (OVERLAPS) 4/433 variables, 4/367 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/433 variables, 4/371 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/433 variables, 0/371 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 41 (OVERLAPS) 1/434 variables, 1/372 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/434 variables, 0/372 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 43 (OVERLAPS) 0/434 variables, 0/372 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 372 constraints, problems are : Problem set: 5 solved, 6 unsolved in 2746 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 229/229 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 6/11 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3734ms problems are : Problem set: 5 solved, 6 unsolved
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 6 properties in 59 ms.
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
FORMULA LastZero-PT-N16-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 13:57:54] [INFO ] Flatten gal took : 14 ms
[2026-06-10 13:57:54] [INFO ] Flatten gal took : 16 ms
[2026-06-10 13:57:54] [INFO ] Input system was already deterministic with 285 transitions.
Support contains 14 out of 229 places (down from 17) after GAL structural reductions.
Computed a total of 229 stabilizing places and 285 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 229 transition count 285
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 3 formulas.
FORMULA LastZero-PT-N16-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N16-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N16-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 285/285 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 218 transition count 270
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 218 transition count 270
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 208 transition count 255
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 208 transition count 255
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 198 transition count 240
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 198 transition count 240
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 188 transition count 225
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 188 transition count 225
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 178 transition count 210
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 178 transition count 210
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 169 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 169 transition count 197
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 127 place count 162 transition count 187
Iterating global reduction 0 with 7 rules applied. Total rules applied 134 place count 162 transition count 187
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 140 place count 156 transition count 178
Iterating global reduction 0 with 6 rules applied. Total rules applied 146 place count 156 transition count 178
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 152 place count 150 transition count 169
Iterating global reduction 0 with 6 rules applied. Total rules applied 158 place count 150 transition count 169
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 164 place count 144 transition count 160
Iterating global reduction 0 with 6 rules applied. Total rules applied 170 place count 144 transition count 160
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 176 place count 138 transition count 151
Iterating global reduction 0 with 6 rules applied. Total rules applied 182 place count 138 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 187 place count 133 transition count 144
Iterating global reduction 0 with 5 rules applied. Total rules applied 192 place count 133 transition count 144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 197 place count 128 transition count 136
Iterating global reduction 0 with 5 rules applied. Total rules applied 202 place count 128 transition count 136
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 206 place count 124 transition count 131
Iterating global reduction 0 with 4 rules applied. Total rules applied 210 place count 124 transition count 131
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 214 place count 120 transition count 124
Iterating global reduction 0 with 4 rules applied. Total rules applied 218 place count 120 transition count 124
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 222 place count 116 transition count 119
Iterating global reduction 0 with 4 rules applied. Total rules applied 226 place count 116 transition count 119
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 230 place count 112 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 234 place count 112 transition count 112
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 237 place count 109 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 240 place count 109 transition count 109
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 242 place count 107 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 244 place count 107 transition count 105
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 246 place count 105 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 248 place count 105 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 249 place count 104 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 250 place count 104 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 251 place count 103 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 252 place count 103 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 253 place count 102 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 254 place count 102 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 255 place count 101 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 256 place count 101 transition count 97
Applied a total of 256 rules in 34 ms. Remains 101 /229 variables (removed 128) and now considering 97/285 (removed 188) transitions.
[2026-06-10 13:57:54] [INFO ] Flow matrix only has 71 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-171766735816007782.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2178620746266420233.kers'
[2026-06-10 13:57:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-171766735816007782.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2178620746266420233.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 71 rows 96 cols 161 entries
Finished phase 1 with 67 SingleSign rule and 4 generalized
[2026-06-10 13:57:54] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2178620746266420233.kers
Total runtime 0 ms.
[2026-06-10 13:57:55] [INFO ] Implicit Places using invariants in 505 ms returned []
[2026-06-10 13:57:55] [INFO ] Flow matrix only has 71 transitions (discarded 26 similar events)
[2026-06-10 13:57:55] [INFO ] Invariant cache hit.
[2026-06-10 13:57:55] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-06-10 13:57:55] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2026-06-10 13:57:55] [INFO ] Flow matrix only has 71 transitions (discarded 26 similar events)
[2026-06-10 13:57:55] [INFO ] Invariant cache hit.
[2026-06-10 13:57:55] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 71/171 variables, 100/141 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 28/169 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Problem TDEAD81 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/172 variables, 1/170 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/172 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 170 constraints, problems are : Problem set: 1 solved, 80 unsolved in 2977 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 26/26 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 4/30 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 11/41 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/42 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 71/171 variables, 100/142 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 28/170 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 80/250 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/250 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 1/172 variables, 1/251 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/172 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 251 constraints, problems are : Problem set: 1 solved, 80 unsolved in 2716 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 80/81 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5701ms problems are : Problem set: 1 solved, 80 unsolved
Search for dead transitions found 1 dead transitions in 5703ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 101/229 places, 96/285 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6370 ms. Remains : 101/229 places, 96/285 transitions.
[2026-06-10 13:58:00] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:58:00] [INFO ] Flatten gal took : 5 ms
[2026-06-10 13:58:00] [INFO ] Input system was already deterministic with 96 transitions.
[2026-06-10 13:58:01] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:58:01] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:58:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality7024868523849388250.gal : 2 ms
[2026-06-10 13:58:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality2222082788062822335.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7024868523849388250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2222082788062822335.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.55051e+08,0.068917,4492,2,431,5,1457,6,0,417,840,0


Converting to forward existential form...Done !
original formula: EF((AX(AG((array_12_7>=1))) * AX((array_7_6<1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((array_12_7>=1)))))))) * !(EX(!((array_7_6<1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t69, t70, t71, t72, t73, t74, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86...300
(forward)formula 0,1,0.173144,10232,1,0,239,44910,216,106,2629,29635,208
FORMULA LastZero-PT-N16-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 285/285 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 217 transition count 268
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 217 transition count 268
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 206 transition count 252
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 206 transition count 252
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 195 transition count 235
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 195 transition count 235
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 184 transition count 219
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 184 transition count 219
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 101 place count 173 transition count 202
Iterating global reduction 0 with 11 rules applied. Total rules applied 112 place count 173 transition count 202
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 122 place count 163 transition count 188
Iterating global reduction 0 with 10 rules applied. Total rules applied 132 place count 163 transition count 188
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 140 place count 155 transition count 176
Iterating global reduction 0 with 8 rules applied. Total rules applied 148 place count 155 transition count 176
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 155 place count 148 transition count 166
Iterating global reduction 0 with 7 rules applied. Total rules applied 162 place count 148 transition count 166
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 169 place count 141 transition count 155
Iterating global reduction 0 with 7 rules applied. Total rules applied 176 place count 141 transition count 155
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 183 place count 134 transition count 145
Iterating global reduction 0 with 7 rules applied. Total rules applied 190 place count 134 transition count 145
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 197 place count 127 transition count 134
Iterating global reduction 0 with 7 rules applied. Total rules applied 204 place count 127 transition count 134
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 210 place count 121 transition count 126
Iterating global reduction 0 with 6 rules applied. Total rules applied 216 place count 121 transition count 126
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 221 place count 116 transition count 118
Iterating global reduction 0 with 5 rules applied. Total rules applied 226 place count 116 transition count 118
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 230 place count 112 transition count 113
Iterating global reduction 0 with 4 rules applied. Total rules applied 234 place count 112 transition count 113
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 238 place count 108 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 242 place count 108 transition count 106
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 246 place count 104 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 250 place count 104 transition count 101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 254 place count 100 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 258 place count 100 transition count 94
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 261 place count 97 transition count 91
Iterating global reduction 0 with 3 rules applied. Total rules applied 264 place count 97 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 266 place count 95 transition count 87
Iterating global reduction 0 with 2 rules applied. Total rules applied 268 place count 95 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 270 place count 93 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 272 place count 93 transition count 85
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 274 place count 91 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 276 place count 91 transition count 81
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 278 place count 89 transition count 79
Iterating global reduction 0 with 2 rules applied. Total rules applied 280 place count 89 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 282 place count 87 transition count 75
Iterating global reduction 0 with 2 rules applied. Total rules applied 284 place count 87 transition count 75
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 286 place count 85 transition count 73
Iterating global reduction 0 with 2 rules applied. Total rules applied 288 place count 85 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 289 place count 84 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 290 place count 84 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 291 place count 83 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 292 place count 83 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 293 place count 82 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 294 place count 82 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 295 place count 81 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 296 place count 81 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 297 place count 80 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 298 place count 80 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 299 place count 79 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 300 place count 79 transition count 64
Applied a total of 300 rules in 55 ms. Remains 79 /229 variables (removed 150) and now considering 64/285 (removed 221) transitions.
[2026-06-10 13:58:01] [INFO ] Flow matrix only has 49 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10533899051014366265.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3141811702588179898.kers'
[2026-06-10 13:58:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10533899051014366265.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3141811702588179898.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 49 rows 64 cols 96 entries
Finished phase 1 with 35 SingleSign rule and 14 generalized
[2026-06-10 13:58:01] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3141811702588179898.kers
Total runtime 1 ms.
[2026-06-10 13:58:01] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-06-10 13:58:01] [INFO ] Flow matrix only has 49 transitions (discarded 15 similar events)
[2026-06-10 13:58:01] [INFO ] Invariant cache hit.
[2026-06-10 13:58:01] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-06-10 13:58:01] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2026-06-10 13:58:01] [INFO ] Flow matrix only has 49 transitions (discarded 15 similar events)
[2026-06-10 13:58:01] [INFO ] Invariant cache hit.
[2026-06-10 13:58:01] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 49/127 variables, 78/108 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 17/125 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem TDEAD56 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/128 variables, 1/126 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 126 constraints, problems are : Problem set: 1 solved, 47 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 79/79 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 14/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 49/127 variables, 78/108 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 17/125 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 47/172 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 1/128 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 173 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1039 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 79/79 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1959ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 1959ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 79/229 places, 63/285 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2192 ms. Remains : 79/229 places, 63/285 transitions.
[2026-06-10 13:58:03] [INFO ] Flatten gal took : 7 ms
[2026-06-10 13:58:03] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:58:03] [INFO ] Input system was already deterministic with 63 transitions.
[2026-06-10 13:58:03] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:58:03] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:58:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality3911983116467512977.gal : 1 ms
[2026-06-10 13:58:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality5292136346115910120.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3911983116467512977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5292136346115910120.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.45701e+07,0.010568,4360,2,226,5,873,6,0,318,521,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.011759,4360,1,0,6,873,7,1,490,521,1
FORMULA LastZero-PT-N16-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 285/285 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 218 transition count 269
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 218 transition count 269
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 207 transition count 253
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 207 transition count 253
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 196 transition count 236
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 196 transition count 236
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 77 place count 185 transition count 220
Iterating global reduction 0 with 11 rules applied. Total rules applied 88 place count 185 transition count 220
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 99 place count 174 transition count 203
Iterating global reduction 0 with 11 rules applied. Total rules applied 110 place count 174 transition count 203
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 120 place count 164 transition count 189
Iterating global reduction 0 with 10 rules applied. Total rules applied 130 place count 164 transition count 189
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 138 place count 156 transition count 177
Iterating global reduction 0 with 8 rules applied. Total rules applied 146 place count 156 transition count 177
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 153 place count 149 transition count 167
Iterating global reduction 0 with 7 rules applied. Total rules applied 160 place count 149 transition count 167
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 167 place count 142 transition count 156
Iterating global reduction 0 with 7 rules applied. Total rules applied 174 place count 142 transition count 156
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 181 place count 135 transition count 146
Iterating global reduction 0 with 7 rules applied. Total rules applied 188 place count 135 transition count 146
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 195 place count 128 transition count 135
Iterating global reduction 0 with 7 rules applied. Total rules applied 202 place count 128 transition count 135
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 208 place count 122 transition count 127
Iterating global reduction 0 with 6 rules applied. Total rules applied 214 place count 122 transition count 127
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 219 place count 117 transition count 119
Iterating global reduction 0 with 5 rules applied. Total rules applied 224 place count 117 transition count 119
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 228 place count 113 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 232 place count 113 transition count 114
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 236 place count 109 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 240 place count 109 transition count 107
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 244 place count 105 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 248 place count 105 transition count 102
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 252 place count 101 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 256 place count 101 transition count 95
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 259 place count 98 transition count 92
Iterating global reduction 0 with 3 rules applied. Total rules applied 262 place count 98 transition count 92
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 264 place count 96 transition count 88
Iterating global reduction 0 with 2 rules applied. Total rules applied 266 place count 96 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 268 place count 94 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 270 place count 94 transition count 86
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 272 place count 92 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 274 place count 92 transition count 82
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 276 place count 90 transition count 80
Iterating global reduction 0 with 2 rules applied. Total rules applied 278 place count 90 transition count 80
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 280 place count 88 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 282 place count 88 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 284 place count 86 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 286 place count 86 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 287 place count 85 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 288 place count 85 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 289 place count 84 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 290 place count 84 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 291 place count 83 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 292 place count 83 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 293 place count 82 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 294 place count 82 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 295 place count 81 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 296 place count 81 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 297 place count 80 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 298 place count 80 transition count 65
Applied a total of 298 rules in 45 ms. Remains 80 /229 variables (removed 149) and now considering 65/285 (removed 220) transitions.
[2026-06-10 13:58:03] [INFO ] Flow matrix only has 51 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5114897370527480863.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12784063634571043965.kers'
[2026-06-10 13:58:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5114897370527480863.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12784063634571043965.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 51 rows 65 cols 100 entries
Finished phase 1 with 36 SingleSign rule and 14 generalized
[2026-06-10 13:58:03] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12784063634571043965.kers
Total runtime 1 ms.
[2026-06-10 13:58:03] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-06-10 13:58:03] [INFO ] Flow matrix only has 51 transitions (discarded 14 similar events)
[2026-06-10 13:58:03] [INFO ] Invariant cache hit.
[2026-06-10 13:58:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2026-06-10 13:58:03] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 49 sub problems to find dead transitions.
[2026-06-10 13:58:03] [INFO ] Flow matrix only has 51 transitions (discarded 14 similar events)
[2026-06-10 13:58:03] [INFO ] Invariant cache hit.
[2026-06-10 13:58:03] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 51/130 variables, 79/109 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 18/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Problem TDEAD57 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/131 variables, 1/128 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 128 constraints, problems are : Problem set: 1 solved, 48 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 14/30 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 51/130 variables, 79/109 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 18/127 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 48/175 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 1/131 variables, 1/176 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 176 constraints, problems are : Problem set: 1 solved, 48 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 80/80 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 48/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2092ms problems are : Problem set: 1 solved, 48 unsolved
Search for dead transitions found 1 dead transitions in 2092ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 80/229 places, 64/285 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2372 ms. Remains : 80/229 places, 64/285 transitions.
[2026-06-10 13:58:05] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:58:05] [INFO ] Flatten gal took : 7 ms
[2026-06-10 13:58:05] [INFO ] Input system was already deterministic with 64 transitions.
[2026-06-10 13:58:05] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:58:05] [INFO ] Flatten gal took : 16 ms
[2026-06-10 13:58:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality6077893191054883230.gal : 1 ms
[2026-06-10 13:58:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality15702755148902187762.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6077893191054883230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15702755148902187762.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.1656e+07,0.011484,4368,2,274,5,1020,6,0,323,579,0


Converting to forward existential form...Done !
original formula: AF(EX((tmp_14_2>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(EX((tmp_14_2>=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, Int...249
(forward)formula 0,1,0.101475,9352,1,0,205,36366,149,71,1912,25254,185
FORMULA LastZero-PT-N16-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 285/285 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 217 transition count 269
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 217 transition count 269
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 208 transition count 255
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 208 transition count 255
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 199 transition count 242
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 199 transition count 242
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 190 transition count 228
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 190 transition count 228
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 182 transition count 216
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 182 transition count 216
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 175 transition count 206
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 175 transition count 206
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 112 place count 169 transition count 197
Iterating global reduction 0 with 6 rules applied. Total rules applied 118 place count 169 transition count 197
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 124 place count 163 transition count 188
Iterating global reduction 0 with 6 rules applied. Total rules applied 130 place count 163 transition count 188
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 136 place count 157 transition count 179
Iterating global reduction 0 with 6 rules applied. Total rules applied 142 place count 157 transition count 179
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 148 place count 151 transition count 170
Iterating global reduction 0 with 6 rules applied. Total rules applied 154 place count 151 transition count 170
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 160 place count 145 transition count 161
Iterating global reduction 0 with 6 rules applied. Total rules applied 166 place count 145 transition count 161
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 171 place count 140 transition count 154
Iterating global reduction 0 with 5 rules applied. Total rules applied 176 place count 140 transition count 154
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 180 place count 136 transition count 148
Iterating global reduction 0 with 4 rules applied. Total rules applied 184 place count 136 transition count 148
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 187 place count 133 transition count 144
Iterating global reduction 0 with 3 rules applied. Total rules applied 190 place count 133 transition count 144
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 193 place count 130 transition count 139
Iterating global reduction 0 with 3 rules applied. Total rules applied 196 place count 130 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 199 place count 127 transition count 135
Iterating global reduction 0 with 3 rules applied. Total rules applied 202 place count 127 transition count 135
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 205 place count 124 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 208 place count 124 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 210 place count 122 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 212 place count 122 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 213 place count 121 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 214 place count 121 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 215 place count 120 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 216 place count 120 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 217 place count 119 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 218 place count 119 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 219 place count 118 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 220 place count 118 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 221 place count 117 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 222 place count 117 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 223 place count 116 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 224 place count 116 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 225 place count 115 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 226 place count 115 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 227 place count 114 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 228 place count 114 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 229 place count 113 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 230 place count 113 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 231 place count 112 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 232 place count 112 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 233 place count 111 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 234 place count 111 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 235 place count 110 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 236 place count 110 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 238 place count 109 transition count 109
Applied a total of 238 rules in 78 ms. Remains 109 /229 variables (removed 120) and now considering 109/285 (removed 176) transitions.
[2026-06-10 13:58:06] [INFO ] Flow matrix only has 81 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17798628397177440670.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7052290068584869356.kers'
[2026-06-10 13:58:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17798628397177440670.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7052290068584869356.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 81 rows 105 cols 188 entries
Finished phase 1 with 77 SingleSign rule and 2 generalized
[2026-06-10 13:58:06] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7052290068584869356.kers
Total runtime 2 ms.
[2026-06-10 13:58:06] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-06-10 13:58:06] [INFO ] Flow matrix only has 81 transitions (discarded 28 similar events)
[2026-06-10 13:58:06] [INFO ] Invariant cache hit.
[2026-06-10 13:58:06] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-06-10 13:58:06] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2026-06-10 13:58:06] [INFO ] Redundant transitions in 4 ms returned []
Running 93 sub problems to find dead transitions.
[2026-06-10 13:58:06] [INFO ] Flow matrix only has 81 transitions (discarded 28 similar events)
[2026-06-10 13:58:06] [INFO ] Invariant cache hit.
[2026-06-10 13:58:06] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 1/109 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Problem TDEAD92 is UNSAT
At refinement iteration 7 (OVERLAPS) 81/190 variables, 109/161 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 34/195 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/190 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 195 constraints, problems are : Problem set: 1 solved, 92 unsolved in 3729 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 27/27 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 2/29 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 22/51 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 1/108 variables, 1/52 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 80/188 variables, 108/160 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 33/193 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 92/285 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 2/190 variables, 1/286 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 1/287 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 92 unsolved
At refinement iteration 13 (OVERLAPS) 0/190 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 287 constraints, problems are : Problem set: 1 solved, 92 unsolved in 3990 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 92/93 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7727ms problems are : Problem set: 1 solved, 92 unsolved
Search for dead transitions found 1 dead transitions in 7727ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 109/229 places, 108/285 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2026-06-10 13:58:14] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 8043 ms. Remains : 109/229 places, 108/285 transitions.
[2026-06-10 13:58:14] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:58:14] [INFO ] Flatten gal took : 9 ms
[2026-06-10 13:58:14] [INFO ] Input system was already deterministic with 108 transitions.
[2026-06-10 13:58:14] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:58:14] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:58:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality15141089460077147995.gal : 2 ms
[2026-06-10 13:58:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality11436080515042265674.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15141089460077147995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11436080515042265674.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.02764e+08,0.020398,4684,2,537,5,1712,6,0,453,986,0


Converting to forward existential form...Done !
original formula: EF((AG((tmp_15_4>0)) * (tmp_10_3<=array_16_13)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (tmp_10_3<=array_16_13)) * !(E(TRUE U !((tmp_15_4>0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t17, t73, t74, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90...349
(forward)formula 0,0,0.155018,11496,1,0,264,52063,238,113,2872,28952,229
FORMULA LastZero-PT-N16-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 285/285 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 217 transition count 268
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 217 transition count 268
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 207 transition count 254
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 207 transition count 254
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 197 transition count 238
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 197 transition count 238
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 187 transition count 224
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 187 transition count 224
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 177 transition count 208
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 177 transition count 208
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 168 transition count 196
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 168 transition count 196
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 127 place count 161 transition count 185
Iterating global reduction 0 with 7 rules applied. Total rules applied 134 place count 161 transition count 185
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 140 place count 155 transition count 177
Iterating global reduction 0 with 6 rules applied. Total rules applied 146 place count 155 transition count 177
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 152 place count 149 transition count 167
Iterating global reduction 0 with 6 rules applied. Total rules applied 158 place count 149 transition count 167
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 164 place count 143 transition count 159
Iterating global reduction 0 with 6 rules applied. Total rules applied 170 place count 143 transition count 159
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 176 place count 137 transition count 149
Iterating global reduction 0 with 6 rules applied. Total rules applied 182 place count 137 transition count 149
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 186 place count 133 transition count 144
Iterating global reduction 0 with 4 rules applied. Total rules applied 190 place count 133 transition count 144
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 194 place count 129 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 198 place count 129 transition count 137
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 202 place count 125 transition count 132
Iterating global reduction 0 with 4 rules applied. Total rules applied 206 place count 125 transition count 132
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 210 place count 121 transition count 125
Iterating global reduction 0 with 4 rules applied. Total rules applied 214 place count 121 transition count 125
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 218 place count 117 transition count 120
Iterating global reduction 0 with 4 rules applied. Total rules applied 222 place count 117 transition count 120
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 226 place count 113 transition count 113
Iterating global reduction 0 with 4 rules applied. Total rules applied 230 place count 113 transition count 113
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 233 place count 110 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 236 place count 110 transition count 110
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 238 place count 108 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 240 place count 108 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 242 place count 106 transition count 104
Iterating global reduction 0 with 2 rules applied. Total rules applied 244 place count 106 transition count 104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 246 place count 104 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 248 place count 104 transition count 100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 250 place count 102 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 252 place count 102 transition count 98
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 254 place count 100 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 256 place count 100 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 258 place count 98 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 260 place count 98 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 261 place count 97 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 262 place count 97 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 263 place count 96 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 264 place count 96 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 265 place count 95 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 266 place count 95 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 267 place count 94 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 268 place count 94 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 269 place count 93 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 270 place count 93 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 271 place count 92 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 272 place count 92 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 274 place count 91 transition count 82
Applied a total of 274 rules in 80 ms. Remains 91 /229 variables (removed 138) and now considering 82/285 (removed 203) transitions.
[2026-06-10 13:58:14] [INFO ] Flow matrix only has 63 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16624875984096747749.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18382785809839589127.kers'
[2026-06-10 13:58:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16624875984096747749.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18382785809839589127.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 63 rows 81 cols 135 entries
Finished phase 1 with 53 SingleSign rule and 8 generalized
[2026-06-10 13:58:14] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18382785809839589127.kers
Total runtime 0 ms.
[2026-06-10 13:58:14] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-06-10 13:58:14] [INFO ] Flow matrix only has 63 transitions (discarded 19 similar events)
[2026-06-10 13:58:14] [INFO ] Invariant cache hit.
[2026-06-10 13:58:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-06-10 13:58:14] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2026-06-10 13:58:14] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2026-06-10 13:58:14] [INFO ] Flow matrix only has 63 transitions (discarded 19 similar events)
[2026-06-10 13:58:14] [INFO ] Invariant cache hit.
[2026-06-10 13:58:14] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 1/91 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Problem TDEAD69 is UNSAT
At refinement iteration 6 (OVERLAPS) 63/154 variables, 91/129 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 25/154 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/154 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 154 constraints, problems are : Problem set: 1 solved, 65 unsolved in 2055 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 91/91 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 8/29 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 8/37 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/90 variables, 1/38 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 62/152 variables, 90/128 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 24/152 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 65/217 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 2/154 variables, 1/218 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 1/219 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 65 unsolved
At refinement iteration 13 (OVERLAPS) 0/154 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 219 constraints, problems are : Problem set: 1 solved, 65 unsolved in 2130 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 91/91 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 65/66 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4198ms problems are : Problem set: 1 solved, 65 unsolved
Search for dead transitions found 1 dead transitions in 4198ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 91/229 places, 81/285 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2026-06-10 13:58:18] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 4513 ms. Remains : 91/229 places, 81/285 transitions.
[2026-06-10 13:58:18] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:58:18] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:58:18] [INFO ] Input system was already deterministic with 81 transitions.
[2026-06-10 13:58:18] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:58:18] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:58:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality3246879109429717533.gal : 1 ms
[2026-06-10 13:58:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality9529561354058954828.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3246879109429717533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9529561354058954828.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.70166e+07,0.020167,4456,2,339,5,1196,6,0,372,698,0


Converting to forward existential form...Done !
original formula: AF((AG((tmp_7_2>0)) * (tmp_14_8>0)))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((tmp_7_2>0)))) * (tmp_14_8>0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t72, t73...290
(forward)formula 0,0,0.142722,11052,1,0,245,45226,188,89,2460,31925,226
FORMULA LastZero-PT-N16-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 285/285 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 217 transition count 268
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 217 transition count 268
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 206 transition count 252
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 206 transition count 252
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 195 transition count 235
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 195 transition count 235
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 184 transition count 219
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 184 transition count 219
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 101 place count 173 transition count 202
Iterating global reduction 0 with 11 rules applied. Total rules applied 112 place count 173 transition count 202
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 122 place count 163 transition count 188
Iterating global reduction 0 with 10 rules applied. Total rules applied 132 place count 163 transition count 188
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 140 place count 155 transition count 176
Iterating global reduction 0 with 8 rules applied. Total rules applied 148 place count 155 transition count 176
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 155 place count 148 transition count 166
Iterating global reduction 0 with 7 rules applied. Total rules applied 162 place count 148 transition count 166
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 169 place count 141 transition count 155
Iterating global reduction 0 with 7 rules applied. Total rules applied 176 place count 141 transition count 155
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 183 place count 134 transition count 145
Iterating global reduction 0 with 7 rules applied. Total rules applied 190 place count 134 transition count 145
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 197 place count 127 transition count 134
Iterating global reduction 0 with 7 rules applied. Total rules applied 204 place count 127 transition count 134
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 210 place count 121 transition count 126
Iterating global reduction 0 with 6 rules applied. Total rules applied 216 place count 121 transition count 126
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 221 place count 116 transition count 118
Iterating global reduction 0 with 5 rules applied. Total rules applied 226 place count 116 transition count 118
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 230 place count 112 transition count 113
Iterating global reduction 0 with 4 rules applied. Total rules applied 234 place count 112 transition count 113
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 238 place count 108 transition count 106
Iterating global reduction 0 with 4 rules applied. Total rules applied 242 place count 108 transition count 106
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 246 place count 104 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 250 place count 104 transition count 101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 254 place count 100 transition count 94
Iterating global reduction 0 with 4 rules applied. Total rules applied 258 place count 100 transition count 94
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 261 place count 97 transition count 91
Iterating global reduction 0 with 3 rules applied. Total rules applied 264 place count 97 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 266 place count 95 transition count 87
Iterating global reduction 0 with 2 rules applied. Total rules applied 268 place count 95 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 270 place count 93 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 272 place count 93 transition count 85
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 274 place count 91 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 276 place count 91 transition count 81
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 278 place count 89 transition count 79
Iterating global reduction 0 with 2 rules applied. Total rules applied 280 place count 89 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 282 place count 87 transition count 75
Iterating global reduction 0 with 2 rules applied. Total rules applied 284 place count 87 transition count 75
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 286 place count 85 transition count 73
Iterating global reduction 0 with 2 rules applied. Total rules applied 288 place count 85 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 289 place count 84 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 290 place count 84 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 291 place count 83 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 292 place count 83 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 293 place count 82 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 294 place count 82 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 295 place count 81 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 296 place count 81 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 297 place count 80 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 298 place count 80 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 299 place count 79 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 300 place count 79 transition count 64
Applied a total of 300 rules in 32 ms. Remains 79 /229 variables (removed 150) and now considering 64/285 (removed 221) transitions.
[2026-06-10 13:58:18] [INFO ] Flow matrix only has 49 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14006641929207464504.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8090442443314799984.kers'
[2026-06-10 13:58:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14006641929207464504.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8090442443314799984.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 49 rows 64 cols 96 entries
Finished phase 1 with 35 SingleSign rule and 14 generalized
[2026-06-10 13:58:18] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8090442443314799984.kers
Total runtime 0 ms.
[2026-06-10 13:58:18] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-06-10 13:58:19] [INFO ] Flow matrix only has 49 transitions (discarded 15 similar events)
[2026-06-10 13:58:19] [INFO ] Invariant cache hit.
[2026-06-10 13:58:19] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-06-10 13:58:19] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2026-06-10 13:58:19] [INFO ] Flow matrix only has 49 transitions (discarded 15 similar events)
[2026-06-10 13:58:19] [INFO ] Invariant cache hit.
[2026-06-10 13:58:19] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 14/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 49/127 variables, 78/108 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 17/125 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem TDEAD56 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/128 variables, 1/126 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 126 constraints, problems are : Problem set: 1 solved, 47 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 79/79 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 14/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 49/127 variables, 78/108 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 17/125 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 47/172 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 1/128 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 173 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1050 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 79/79 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1914ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 1914ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 79/229 places, 63/285 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2106 ms. Remains : 79/229 places, 63/285 transitions.
[2026-06-10 13:58:21] [INFO ] Flatten gal took : 6 ms
[2026-06-10 13:58:21] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:58:21] [INFO ] Input system was already deterministic with 63 transitions.
[2026-06-10 13:58:21] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:58:21] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:58:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality2319132411526419516.gal : 0 ms
[2026-06-10 13:58:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality13058185915541297422.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2319132411526419516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13058185915541297422.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.45701e+07,0.011861,4360,2,226,5,873,6,0,318,521,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.013051,4360,1,0,6,873,7,1,490,521,1
FORMULA LastZero-PT-N16-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 229/229 places, 285/285 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 216 transition count 267
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 216 transition count 267
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 205 transition count 251
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 205 transition count 251
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 194 transition count 234
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 194 transition count 234
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 183 transition count 218
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 183 transition count 218
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 101 place count 172 transition count 201
Iterating global reduction 0 with 11 rules applied. Total rules applied 112 place count 172 transition count 201
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 122 place count 162 transition count 187
Iterating global reduction 0 with 10 rules applied. Total rules applied 132 place count 162 transition count 187
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 139 place count 155 transition count 176
Iterating global reduction 0 with 7 rules applied. Total rules applied 146 place count 155 transition count 176
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 152 place count 149 transition count 168
Iterating global reduction 0 with 6 rules applied. Total rules applied 158 place count 149 transition count 168
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 164 place count 143 transition count 158
Iterating global reduction 0 with 6 rules applied. Total rules applied 170 place count 143 transition count 158
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 176 place count 137 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 182 place count 137 transition count 150
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 187 place count 132 transition count 142
Iterating global reduction 0 with 5 rules applied. Total rules applied 192 place count 132 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 196 place count 128 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 200 place count 128 transition count 137
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 204 place count 124 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 208 place count 124 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 211 place count 121 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 214 place count 121 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 217 place count 118 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 220 place count 118 transition count 121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 223 place count 115 transition count 118
Iterating global reduction 0 with 3 rules applied. Total rules applied 226 place count 115 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 229 place count 112 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 232 place count 112 transition count 112
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 235 place count 109 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 238 place count 109 transition count 109
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 240 place count 107 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 242 place count 107 transition count 105
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 244 place count 105 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 246 place count 105 transition count 103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 248 place count 103 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 250 place count 103 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 252 place count 101 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 254 place count 101 transition count 97
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 256 place count 99 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 258 place count 99 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 260 place count 97 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 262 place count 97 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 263 place count 96 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 264 place count 96 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 265 place count 95 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 266 place count 95 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 267 place count 94 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 268 place count 94 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 269 place count 93 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 270 place count 93 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 271 place count 92 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 272 place count 92 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 273 place count 91 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 274 place count 91 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 276 place count 90 transition count 81
Applied a total of 276 rules in 39 ms. Remains 90 /229 variables (removed 139) and now considering 81/285 (removed 204) transitions.
[2026-06-10 13:58:21] [INFO ] Flow matrix only has 61 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6588912699760023190.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3987478376468882928.kers'
[2026-06-10 13:58:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6588912699760023190.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3987478376468882928.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 61 rows 79 cols 130 entries
Finished phase 1 with 51 SingleSign rule and 9 generalized
[2026-06-10 13:58:21] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3987478376468882928.kers
Total runtime 3 ms.
[2026-06-10 13:58:21] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-06-10 13:58:21] [INFO ] Flow matrix only has 61 transitions (discarded 20 similar events)
[2026-06-10 13:58:21] [INFO ] Invariant cache hit.
[2026-06-10 13:58:21] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-06-10 13:58:21] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2026-06-10 13:58:21] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2026-06-10 13:58:21] [INFO ] Flow matrix only has 61 transitions (discarded 20 similar events)
[2026-06-10 13:58:21] [INFO ] Invariant cache hit.
[2026-06-10 13:58:21] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 1/90 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Problem TDEAD66 is UNSAT
At refinement iteration 6 (OVERLAPS) 61/151 variables, 90/127 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 24/151 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 151 constraints, problems are : Problem set: 1 solved, 64 unsolved in 1926 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 90/90 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 20/20 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 9/29 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 7/36 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/89 variables, 1/37 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 60/149 variables, 89/126 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 23/149 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 64/213 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 2/151 variables, 1/214 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 1/215 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 0/215 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 13 (OVERLAPS) 0/151 variables, 0/215 constraints. Problems are: Problem set: 1 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 215 constraints, problems are : Problem set: 1 solved, 64 unsolved in 2026 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 90/90 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 64/65 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3957ms problems are : Problem set: 1 solved, 64 unsolved
Search for dead transitions found 1 dead transitions in 3958ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 90/229 places, 80/285 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2026-06-10 13:58:25] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 4198 ms. Remains : 90/229 places, 80/285 transitions.
[2026-06-10 13:58:25] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:58:25] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:58:25] [INFO ] Input system was already deterministic with 80 transitions.
[2026-06-10 13:58:25] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:58:25] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:58:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality4259296458979931812.gal : 1 ms
[2026-06-10 13:58:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality15142610705579060707.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4259296458979931812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15142610705579060707.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44701e+07,0.014764,4444,2,336,5,1178,6,0,367,686,0


Converting to forward existential form...Done !
original formula: EG(A((tmp_11_7<=0) U AF((array_7_2>=1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EG(!((array_7_2>=1))))) U (!((tmp_11_7<=0)) * !(!(EG(!((array_7_2>=1))))))) + EG(!(!(EG(!((a...185
Reverse transition relation is NOT exact ! Due to transitions t9, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t72, t73,...284
(forward)formula 0,0,0.353306,21044,1,0,516,107976,190,320,2265,128438,603
FORMULA LastZero-PT-N16-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2026-06-10 13:58:25] [INFO ] Flatten gal took : 10 ms
[2026-06-10 13:58:25] [INFO ] Flatten gal took : 8 ms
Total runtime 115427 ms.

BK_STOP 1781099905721

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LastZero-PT-N16"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is LastZero-PT-N16, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r354-tall-178024402800113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LastZero-PT-N16.tgz
mv LastZero-PT-N16 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;