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-178024402800105.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-N14, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800105
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.6K May 27 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 27 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 27 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 27 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 72K May 27 10:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 282K 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 7.7K May 27 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K May 27 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 27 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 27 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 16K May 27 10:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 42K 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.2M 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-N14-CTLCardinality-2024-00
FORMULA_NAME LastZero-PT-N14-CTLCardinality-2024-01
FORMULA_NAME LastZero-PT-N14-CTLCardinality-2024-02
FORMULA_NAME LastZero-PT-N14-CTLCardinality-2024-03
FORMULA_NAME LastZero-PT-N14-CTLCardinality-2024-04
FORMULA_NAME LastZero-PT-N14-CTLCardinality-2024-05
FORMULA_NAME LastZero-PT-N14-CTLCardinality-2024-06
FORMULA_NAME LastZero-PT-N14-CTLCardinality-2024-07
FORMULA_NAME LastZero-PT-N14-CTLCardinality-2024-08
FORMULA_NAME LastZero-PT-N14-CTLCardinality-2024-09
FORMULA_NAME LastZero-PT-N14-CTLCardinality-2024-10
FORMULA_NAME LastZero-PT-N14-CTLCardinality-2024-11
FORMULA_NAME LastZero-PT-N14-CTLCardinality-2024-12
FORMULA_NAME LastZero-PT-N14-CTLCardinality-2024-13
FORMULA_NAME LastZero-PT-N14-CTLCardinality-2024-14
FORMULA_NAME LastZero-PT-N14-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781099743801

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-N14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-10 13:55:44] [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:55:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 13:55:45] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2026-06-10 13:55:45] [INFO ] Transformed 480 places.
[2026-06-10 13:55:45] [INFO ] Transformed 3767 transitions.
[2026-06-10 13:55:45] [INFO ] Parsed PT model containing 480 places and 3767 transitions and 11693 arcs in 254 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 226 places in 24 ms
Reduce places removed 226 places and 2437 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA LastZero-PT-N14-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N14-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N14-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 1330/1330 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 252 transition count 1330
Applied a total of 1 rules in 28 ms. Remains 252 /253 variables (removed 1) and now considering 1330/1330 (removed 0) transitions.
[2026-06-10 13:55:45] [INFO ] Flow matrix only has 1239 transitions (discarded 91 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11241305754281453076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3131620961896192353.kers'
[2026-06-10 13:55:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11241305754281453076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3131620961896192353.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1239 rows 251 cols 3386 entries
Finished phase 1 with 238 SingleSign rule and 0 generalized
[2026-06-10 13:55:45] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3131620961896192353.kers
Total runtime 4 ms.
[2026-06-10 13:55:45] [INFO ] Implicit Places using invariants in 413 ms returned []
[2026-06-10 13:55:45] [INFO ] Flow matrix only has 1239 transitions (discarded 91 similar events)
[2026-06-10 13:55:45] [INFO ] Invariant cache hit.
[2026-06-10 13:55:46] [INFO ] State equation strengthened by 210 read => feed constraints.
[2026-06-10 13:55:52] [INFO ] Implicit Places using invariants and state equation in 7070 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7524 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 251/253 places, 1330/1330 transitions.
Applied a total of 0 rules in 11 ms. Remains 251 /251 variables (removed 0) and now considering 1330/1330 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7575 ms. Remains : 251/253 places, 1330/1330 transitions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 1330/1330 transitions.
Applied a total of 0 rules in 23 ms. Remains 251 /251 variables (removed 0) and now considering 1330/1330 (removed 0) transitions.
[2026-06-10 13:55:52] [INFO ] Flow matrix only has 1239 transitions (discarded 91 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3524380871583816770.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11959705599725035148.kers'
[2026-06-10 13:55:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3524380871583816770.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11959705599725035148.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1239 rows 250 cols 3372 entries
Finished phase 1 with 238 SingleSign rule and 0 generalized
[2026-06-10 13:55:52] [INFO ] Computed 13 invariants in 2 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11959705599725035148.kers
Total runtime 4 ms.
[2026-06-10 13:55:53] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-06-10 13:55:53] [INFO ] Flow matrix only has 1239 transitions (discarded 91 similar events)
[2026-06-10 13:55:53] [INFO ] Invariant cache hit.
[2026-06-10 13:55:53] [INFO ] State equation strengthened by 210 read => feed constraints.
[2026-06-10 13:55:57] [INFO ] Implicit Places using invariants and state equation in 4056 ms returned []
Implicit Place search using SMT with State Equation took 4229 ms to find 0 implicit places.
Running 1316 sub problems to find dead transitions.
[2026-06-10 13:55:57] [INFO ] Flow matrix only has 1239 transitions (discarded 91 similar events)
[2026-06-10 13:55:57] [INFO ] Invariant cache hit.
[2026-06-10 13:55:57] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1316 unsolved
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
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 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 TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 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 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 TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 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 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 TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 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 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 TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 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 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 TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 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 TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 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 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 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 TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1166 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 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 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
At refinement iteration 2 (OVERLAPS) 1239/1489 variables, 250/263 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1489 variables, 210/473 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1489/1490 variables, and 473 constraints, problems are : Problem set: 1014 solved, 302 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 250/251 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 1316/1316 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1014 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 13/13 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/13 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 1239/1489 variables, 250/263 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1489 variables, 210/473 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1489 variables, 302/775 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1489 variables, 0/775 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 1/1490 variables, 1/776 constraints. Problems are: Problem set: 1014 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 776 constraints, problems are : Problem set: 1014 solved, 302 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 251/251 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 302/1316 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60671ms problems are : Problem set: 1014 solved, 302 unsolved
Search for dead transitions found 1014 dead transitions in 60695ms
Found 1014 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1014 transitions
Dead transitions reduction (with SMT) removed 1014 transitions
Starting structural reductions in LTL mode, iteration 1 : 251/251 places, 316/1330 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 242 transition count 307
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 242 transition count 307
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 233 transition count 298
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 233 transition count 298
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 225 transition count 282
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 225 transition count 282
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 219 transition count 276
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 219 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 214 transition count 266
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 214 transition count 266
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 210 transition count 262
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 210 transition count 262
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 207 transition count 256
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 207 transition count 256
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 204 transition count 253
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 204 transition count 253
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 202 transition count 249
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 202 transition count 249
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 200 transition count 247
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 200 transition count 247
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 198 transition count 243
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 198 transition count 243
Applied a total of 106 rules in 36 ms. Remains 198 /251 variables (removed 53) and now considering 243/316 (removed 73) transitions.
[2026-06-10 13:56:57] [INFO ] Flow matrix only has 177 transitions (discarded 66 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10070387873186456112.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3502856797614145551.kers'
[2026-06-10 13:56:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10070387873186456112.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3502856797614145551.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 177 rows 197 cols 427 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-06-10 13:56:57] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3502856797614145551.kers
Total runtime 1 ms.
[2026-06-10 13:56:58] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-06-10 13:56:58] [INFO ] Flow matrix only has 177 transitions (discarded 66 similar events)
[2026-06-10 13:56:58] [INFO ] Invariant cache hit.
[2026-06-10 13:56:58] [INFO ] State equation strengthened by 82 read => feed constraints.
[2026-06-10 13:56:58] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 198/251 places, 243/1330 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65517 ms. Remains : 198/251 places, 243/1330 transitions.
Support contains 36 out of 198 places after structural reductions.
[2026-06-10 13:56:58] [INFO ] Flatten gal took : 46 ms
[2026-06-10 13:56:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LastZero-PT-N14-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 13:56:58] [INFO ] Flatten gal took : 22 ms
[2026-06-10 13:56:58] [INFO ] Input system was already deterministic with 243 transitions.
Support contains 34 out of 198 places (down from 36) after GAL structural reductions.
FORMULA LastZero-PT-N14-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (928 resets) in 2373 ms. (16 steps per ms) remains 14/25 properties
BEST_FIRST walk for 40004 steps (125 resets) in 106 ms. (373 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (125 resets) in 91 ms. (434 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (126 resets) in 205 ms. (194 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (124 resets) in 132 ms. (300 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (126 resets) in 68 ms. (579 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (126 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (126 resets) in 62 ms. (634 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (126 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (124 resets) in 89 ms. (444 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (125 resets) in 73 ms. (540 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (127 resets) in 44 ms. (888 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (125 resets) in 55 ms. (714 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (124 resets) in 93 ms. (425 steps per ms) remains 13/13 properties
[2026-06-10 13:56:59] [INFO ] Flow matrix only has 177 transitions (discarded 66 similar events)
[2026-06-10 13:56:59] [INFO ] Invariant cache hit.
[2026-06-10 13:56:59] [INFO ] State equation strengthened by 82 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 76/90 variables, 11/11 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 82/172 variables, 90/101 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 23/124 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/124 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 25/197 variables, 25/149 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/149 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 66/263 variables, 42/191 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 1/192 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 2/194 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 0/194 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 13/276 variables, 4/198 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 9/207 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/276 variables, 0/207 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 1/277 variables, 1/208 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/277 variables, 0/208 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 7/284 variables, 8/216 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/217 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/217 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 2/286 variables, 1/218 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/286 variables, 0/218 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 2/288 variables, 1/219 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/288 variables, 0/219 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 2/290 variables, 1/220 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/290 variables, 0/220 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 27/317 variables, 24/244 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/317 variables, 0/244 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 28 (OVERLAPS) 54/371 variables, 42/286 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/371 variables, 6/292 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/371 variables, 7/299 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/371 variables, 0/299 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 32 (OVERLAPS) 3/374 variables, 3/302 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/374 variables, 3/305 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/374 variables, 0/305 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 35 (OVERLAPS) 1/375 variables, 1/306 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/375 variables, 0/306 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 37 (OVERLAPS) 0/375 variables, 0/306 constraints. Problems are: Problem set: 5 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 306 constraints, problems are : Problem set: 5 solved, 8 unsolved in 1076 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 198/198 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 63/72 variables, 9/9 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 7/16 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 66/138 variables, 72/88 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 16/104 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 7/111 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/111 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 24/162 variables, 24/135 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/135 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 65/227 variables, 41/176 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 1/177 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 2/179 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 1/180 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 0/180 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 13/240 variables, 4/184 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 9/193 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/240 variables, 0/193 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 1/241 variables, 1/194 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/241 variables, 0/194 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 8/249 variables, 8/202 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/249 variables, 1/203 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/249 variables, 0/203 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 3/252 variables, 2/205 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/252 variables, 0/205 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 2/254 variables, 1/206 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/254 variables, 0/206 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 2/256 variables, 1/207 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/256 variables, 0/207 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 35/291 variables, 25/232 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/291 variables, 0/232 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 79/370 variables, 59/291 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/370 variables, 7/298 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/370 variables, 14/312 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/370 variables, 0/312 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 35 (OVERLAPS) 4/374 variables, 4/316 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/374 variables, 4/320 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/374 variables, 0/320 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 38 (OVERLAPS) 1/375 variables, 1/321 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/375 variables, 0/321 constraints. Problems are: Problem set: 5 solved, 8 unsolved
At refinement iteration 40 (OVERLAPS) 0/375 variables, 0/321 constraints. Problems are: Problem set: 5 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 321 constraints, problems are : Problem set: 5 solved, 8 unsolved in 2236 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 198/198 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 8/13 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3318ms problems are : Problem set: 5 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 83 ms.
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA LastZero-PT-N14-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N14-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N14-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 13:57:03] [INFO ] Flatten gal took : 12 ms
[2026-06-10 13:57:03] [INFO ] Flatten gal took : 13 ms
[2026-06-10 13:57:03] [INFO ] Input system was already deterministic with 243 transitions.
Computed a total of 198 stabilizing places and 243 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 198 transition count 243
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 243/243 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 191 transition count 235
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 191 transition count 235
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 185 transition count 226
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 185 transition count 226
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 179 transition count 217
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 179 transition count 217
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 173 transition count 208
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 173 transition count 208
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 167 transition count 199
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 167 transition count 199
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 161 transition count 190
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 161 transition count 190
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 155 transition count 181
Iterating global reduction 0 with 6 rules applied. Total rules applied 86 place count 155 transition count 181
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 150 transition count 174
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 150 transition count 174
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 100 place count 146 transition count 168
Iterating global reduction 0 with 4 rules applied. Total rules applied 104 place count 146 transition count 168
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 108 place count 142 transition count 162
Iterating global reduction 0 with 4 rules applied. Total rules applied 112 place count 142 transition count 162
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 116 place count 138 transition count 156
Iterating global reduction 0 with 4 rules applied. Total rules applied 120 place count 138 transition count 156
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 124 place count 134 transition count 150
Iterating global reduction 0 with 4 rules applied. Total rules applied 128 place count 134 transition count 150
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 131 place count 131 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 134 place count 131 transition count 146
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 137 place count 128 transition count 141
Iterating global reduction 0 with 3 rules applied. Total rules applied 140 place count 128 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 143 place count 125 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 146 place count 125 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 149 place count 122 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 152 place count 122 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 154 place count 120 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 156 place count 120 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 157 place count 119 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 158 place count 119 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 159 place count 118 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 160 place count 118 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 161 place count 117 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 162 place count 117 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 163 place count 116 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 164 place count 116 transition count 124
Applied a total of 164 rules in 35 ms. Remains 116 /198 variables (removed 82) and now considering 124/243 (removed 119) transitions.
[2026-06-10 13:57:03] [INFO ] Flow matrix only has 91 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16686387624948635173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8305962614307553378.kers'
[2026-06-10 13:57:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16686387624948635173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8305962614307553378.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 91 rows 115 cols 214 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-06-10 13:57:03] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8305962614307553378.kers
Total runtime 1 ms.
[2026-06-10 13:57:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-06-10 13:57:03] [INFO ] Flow matrix only has 91 transitions (discarded 33 similar events)
[2026-06-10 13:57:03] [INFO ] Invariant cache hit.
[2026-06-10 13:57:03] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-06-10 13:57:03] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2026-06-10 13:57:03] [INFO ] Flow matrix only has 91 transitions (discarded 33 similar events)
[2026-06-10 13:57:03] [INFO ] Invariant cache hit.
[2026-06-10 13:57:03] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 91/206 variables, 115/173 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 39/212 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Problem TDEAD104 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/207 variables, 1/213 constraints. Problems are: Problem set: 1 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 213 constraints, problems are : Problem set: 1 solved, 109 unsolved in 6734 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 116/116 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 26/26 constraints. Problems are: Problem set: 1 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 32/58 constraints. Problems are: Problem set: 1 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 91/206 variables, 115/173 constraints. Problems are: Problem set: 1 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 39/212 constraints. Problems are: Problem set: 1 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 109/321 constraints. Problems are: Problem set: 1 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 1/207 variables, 1/322 constraints. Problems are: Problem set: 1 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 322 constraints, problems are : Problem set: 1 solved, 109 unsolved in 4823 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 116/116 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 109/110 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11569ms problems are : Problem set: 1 solved, 109 unsolved
Search for dead transitions found 1 dead transitions in 11570ms
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 : 116/198 places, 123/243 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11830 ms. Remains : 116/198 places, 123/243 transitions.
[2026-06-10 13:57:15] [INFO ] Flatten gal took : 6 ms
[2026-06-10 13:57:15] [INFO ] Flatten gal took : 6 ms
[2026-06-10 13:57:15] [INFO ] Input system was already deterministic with 123 transitions.
[2026-06-10 13:57:15] [INFO ] Flatten gal took : 5 ms
[2026-06-10 13:57:15] [INFO ] Flatten gal took : 6 ms
[2026-06-10 13:57:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality1470857854266265812.gal : 3 ms
[2026-06-10 13:57:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality2580097670153810565.ctl : 4 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/CTLCardinality1470857854266265812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2580097670153810565.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,2.38468e+07,0.038378,4700,2,706,5,2099,6,0,488,1171,0


Converting to forward existential form...Done !
original formula: EG(((EX((array_15_15<1)) + AF(((array_11_2<=tmp_13_10)||(tmp_3_2<=0)))) + (array_15_2>=1)))
=> equivalent forward existential formula: [FwdG(Init,((EX((array_15_15<1)) + !(EG(!(((array_11_2<=tmp_13_10)||(tmp_3_2<=0)))))) + (array_15_2>=1)))] != FA...158
Reverse transition relation is NOT exact ! Due to transitions t17, t85, t86, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97, t98, t99, t100, t101, t...379
(forward)formula 0,1,0.342451,17156,1,0,337,76941,271,132,3361,55427,301
FORMULA LastZero-PT-N14-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 243/243 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 188 transition count 232
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 188 transition count 232
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 179 transition count 219
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 179 transition count 219
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 171 transition count 207
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 171 transition count 207
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 163 transition count 195
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 163 transition count 195
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 155 transition count 183
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 155 transition count 183
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 147 transition count 171
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 147 transition count 171
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 110 place count 139 transition count 159
Iterating global reduction 0 with 8 rules applied. Total rules applied 118 place count 139 transition count 159
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 125 place count 132 transition count 149
Iterating global reduction 0 with 7 rules applied. Total rules applied 132 place count 132 transition count 149
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 139 place count 125 transition count 138
Iterating global reduction 0 with 7 rules applied. Total rules applied 146 place count 125 transition count 138
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 153 place count 118 transition count 128
Iterating global reduction 0 with 7 rules applied. Total rules applied 160 place count 118 transition count 128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 166 place count 112 transition count 119
Iterating global reduction 0 with 6 rules applied. Total rules applied 172 place count 112 transition count 119
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 178 place count 106 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 184 place count 106 transition count 110
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 189 place count 101 transition count 103
Iterating global reduction 0 with 5 rules applied. Total rules applied 194 place count 101 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 199 place count 96 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 204 place count 96 transition count 95
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 209 place count 91 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 214 place count 91 transition count 88
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 219 place count 86 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 224 place count 86 transition count 80
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 227 place count 83 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 230 place count 83 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 231 place count 82 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 232 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 233 place count 81 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 234 place count 81 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 235 place count 80 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 236 place count 80 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 237 place count 79 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 238 place count 79 transition count 71
Applied a total of 238 rules in 29 ms. Remains 79 /198 variables (removed 119) and now considering 71/243 (removed 172) transitions.
[2026-06-10 13:57:15] [INFO ] Flow matrix only has 53 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11105856236050014016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12253052746325349720.kers'
[2026-06-10 13:57:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11105856236050014016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12253052746325349720.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 53 rows 71 cols 114 entries
Finished phase 1 with 46 SingleSign rule and 7 generalized
[2026-06-10 13:57:15] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12253052746325349720.kers
Total runtime 0 ms.
[2026-06-10 13:57:15] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-06-10 13:57:15] [INFO ] Flow matrix only has 53 transitions (discarded 18 similar events)
[2026-06-10 13:57:15] [INFO ] Invariant cache hit.
[2026-06-10 13:57:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-06-10 13:57:15] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2026-06-10 13:57:15] [INFO ] Flow matrix only has 53 transitions (discarded 18 similar events)
[2026-06-10 13:57:15] [INFO ] Invariant cache hit.
[2026-06-10 13:57:15] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 53/131 variables, 78/109 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem TDEAD58 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/132 variables, 1/130 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 130 constraints, problems are : Problem set: 1 solved, 56 unsolved in 1742 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 19/19 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 7/26 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 5/31 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 53/131 variables, 78/109 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 20/129 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 56/185 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/186 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 186 constraints, problems are : Problem set: 1 solved, 56 unsolved in 1473 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 56/57 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3220ms problems are : Problem set: 1 solved, 56 unsolved
Search for dead transitions found 1 dead transitions in 3221ms
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/198 places, 70/243 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3408 ms. Remains : 79/198 places, 70/243 transitions.
[2026-06-10 13:57:19] [INFO ] Flatten gal took : 5 ms
[2026-06-10 13:57:19] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:57:19] [INFO ] Input system was already deterministic with 70 transitions.
[2026-06-10 13:57:19] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:57:19] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:57:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality13652686084437024488.gal : 1 ms
[2026-06-10 13:57:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality6337758695098517111.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/CTLCardinality13652686084437024488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6337758695098517111.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,9.55611e+06,0.012995,4416,2,347,5,1202,6,0,323,670,0


Converting to forward existential form...Done !
original formula: E(EF(!(AF((array_7_7>=1)))) U (!(EX(TRUE)) + (array_3_3>=1)))
=> equivalent forward existential formula: ([(FwdU(Init,E(TRUE U !(!(EG(!((array_7_7>=1))))))) * !(EX(TRUE)))] != FALSE + [(FwdU(Init,E(TRUE U !(!(EG(!((ar...201
Reverse transition relation is NOT exact ! Due to transitions t6, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68,...259
(forward)formula 0,1,0.297217,18672,1,0,534,89956,171,288,2040,107012,583
FORMULA LastZero-PT-N14-CTLCardinality-2024-02 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 : 198/198 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 188 transition count 232
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 188 transition count 232
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 180 transition count 220
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 180 transition count 220
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 173 transition count 210
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 173 transition count 210
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 166 transition count 199
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 166 transition count 199
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 159 transition count 189
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 159 transition count 189
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 152 transition count 178
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 152 transition count 178
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 145 transition count 168
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 145 transition count 168
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 110 place count 139 transition count 159
Iterating global reduction 0 with 6 rules applied. Total rules applied 116 place count 139 transition count 159
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 122 place count 133 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 128 place count 133 transition count 150
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 134 place count 127 transition count 141
Iterating global reduction 0 with 6 rules applied. Total rules applied 140 place count 127 transition count 141
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 145 place count 122 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 150 place count 122 transition count 134
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 155 place count 117 transition count 126
Iterating global reduction 0 with 5 rules applied. Total rules applied 160 place count 117 transition count 126
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 164 place count 113 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 168 place count 113 transition count 121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 172 place count 109 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 176 place count 109 transition count 114
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 180 place count 105 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 184 place count 105 transition count 109
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 188 place count 101 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 192 place count 101 transition count 102
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 196 place count 97 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 200 place count 97 transition count 97
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 202 place count 95 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 204 place count 95 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 206 place count 93 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 208 place count 93 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 210 place count 91 transition count 88
Iterating global reduction 0 with 2 rules applied. Total rules applied 212 place count 91 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 214 place count 89 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 216 place count 89 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 217 place count 88 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 218 place count 88 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 219 place count 87 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 220 place count 87 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 221 place count 86 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 222 place count 86 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 223 place count 85 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 224 place count 85 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 225 place count 84 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 226 place count 84 transition count 78
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 228 place count 83 transition count 77
Applied a total of 228 rules in 50 ms. Remains 83 /198 variables (removed 115) and now considering 77/243 (removed 166) transitions.
[2026-06-10 13:57:19] [INFO ] Flow matrix only has 57 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-12332721155513790970.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14723596806137500768.kers'
[2026-06-10 13:57:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12332721155513790970.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14723596806137500768.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 57 rows 77 cols 126 entries
Finished phase 1 with 52 SingleSign rule and 5 generalized
[2026-06-10 13:57:19] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14723596806137500768.kers
Total runtime 0 ms.
[2026-06-10 13:57:19] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-06-10 13:57:19] [INFO ] Flow matrix only has 57 transitions (discarded 20 similar events)
[2026-06-10 13:57:19] [INFO ] Invariant cache hit.
[2026-06-10 13:57:19] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-06-10 13:57:19] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2026-06-10 13:57:19] [INFO ] Redundant transitions in 2 ms returned []
Running 63 sub problems to find dead transitions.
[2026-06-10 13:57:19] [INFO ] Flow matrix only has 57 transitions (discarded 20 similar events)
[2026-06-10 13:57:19] [INFO ] Invariant cache hit.
[2026-06-10 13:57:19] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 1/83 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Problem TDEAD65 is UNSAT
At refinement iteration 6 (OVERLAPS) 57/140 variables, 83/117 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 23/140 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 140 constraints, problems are : Problem set: 1 solved, 62 unsolved in 1869 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 20/20 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 5/25 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 8/33 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 1/82 variables, 1/34 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 56/138 variables, 82/116 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 22/138 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 62/200 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 2/140 variables, 1/201 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 1/202 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 62 unsolved
At refinement iteration 13 (OVERLAPS) 0/140 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 202 constraints, problems are : Problem set: 1 solved, 62 unsolved in 1966 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 62/63 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3841ms problems are : Problem set: 1 solved, 62 unsolved
Search for dead transitions found 1 dead transitions in 3842ms
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 : 83/198 places, 76/243 transitions.
Applied a total of 0 rules in 8 ms. Remains 83 /83 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2026-06-10 13:57:23] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 4070 ms. Remains : 83/198 places, 76/243 transitions.
[2026-06-10 13:57:23] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:57:23] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:57:23] [INFO ] Input system was already deterministic with 76 transitions.
[2026-06-10 13:57:23] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:57:23] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:57:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality10597373213070377864.gal : 1 ms
[2026-06-10 13:57:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality6730008615950171987.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/CTLCardinality10597373213070377864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6730008615950171987.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.80211e+06,0.014244,4404,2,333,5,1148,6,0,339,664,0


Converting to forward existential form...Done !
original formula: AF(AG((array_15_9>0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((array_15_9>0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70...280
(forward)formula 0,0,0.191967,13660,1,0,332,58383,179,164,2144,59786,287
FORMULA LastZero-PT-N14-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 243/243 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 189 transition count 233
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 189 transition count 233
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 181 transition count 222
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 181 transition count 222
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 174 transition count 211
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 174 transition count 211
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 167 transition count 201
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 167 transition count 201
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 160 transition count 190
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 160 transition count 190
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 153 transition count 180
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 153 transition count 180
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 146 transition count 169
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 146 transition count 169
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 110 place count 140 transition count 161
Iterating global reduction 0 with 6 rules applied. Total rules applied 116 place count 140 transition count 161
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 122 place count 134 transition count 151
Iterating global reduction 0 with 6 rules applied. Total rules applied 128 place count 134 transition count 151
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 134 place count 128 transition count 143
Iterating global reduction 0 with 6 rules applied. Total rules applied 140 place count 128 transition count 143
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 145 place count 123 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 150 place count 123 transition count 135
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 154 place count 119 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 158 place count 119 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 161 place count 116 transition count 125
Iterating global reduction 0 with 3 rules applied. Total rules applied 164 place count 116 transition count 125
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 167 place count 113 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 170 place count 113 transition count 121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 173 place count 110 transition count 116
Iterating global reduction 0 with 3 rules applied. Total rules applied 176 place count 110 transition count 116
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 179 place count 107 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 182 place count 107 transition count 112
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 184 place count 105 transition count 109
Iterating global reduction 0 with 2 rules applied. Total rules applied 186 place count 105 transition count 109
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 187 place count 104 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 188 place count 104 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 189 place count 103 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 190 place count 103 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 191 place count 102 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 192 place count 102 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 193 place count 101 transition count 103
Iterating global reduction 0 with 1 rules applied. Total rules applied 194 place count 101 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 195 place count 100 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 196 place count 100 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 197 place count 99 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 198 place count 99 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 199 place count 98 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 98 transition count 99
Applied a total of 200 rules in 25 ms. Remains 98 /198 variables (removed 100) and now considering 99/243 (removed 144) transitions.
[2026-06-10 13:57:23] [INFO ] Flow matrix only has 73 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-10975433808007153409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7914998610896012444.kers'
[2026-06-10 13:57:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10975433808007153409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7914998610896012444.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 73 rows 96 cols 169 entries
Finished phase 1 with 71 SingleSign rule and 1 generalized
[2026-06-10 13:57:23] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7914998610896012444.kers
Total runtime 1 ms.
[2026-06-10 13:57:23] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-06-10 13:57:23] [INFO ] Flow matrix only has 73 transitions (discarded 26 similar events)
[2026-06-10 13:57:23] [INFO ] Invariant cache hit.
[2026-06-10 13:57:23] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-06-10 13:57:23] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2026-06-10 13:57:23] [INFO ] Flow matrix only has 73 transitions (discarded 26 similar events)
[2026-06-10 13:57:23] [INFO ] Invariant cache hit.
[2026-06-10 13:57:23] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 73/170 variables, 97/139 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 30/169 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Problem TDEAD81 is UNSAT
At refinement iteration 7 (OVERLAPS) 1/171 variables, 1/170 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 170 constraints, problems are : Problem set: 1 solved, 84 unsolved in 3775 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 25/25 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/26 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 16/42 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 73/170 variables, 97/140 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 30/170 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 84/254 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/254 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 1/171 variables, 1/255 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/171 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 255 constraints, problems are : Problem set: 1 solved, 84 unsolved in 3056 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 84/85 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6845ms problems are : Problem set: 1 solved, 84 unsolved
Search for dead transitions found 1 dead transitions in 6846ms
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 : 98/198 places, 98/243 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7080 ms. Remains : 98/198 places, 98/243 transitions.
[2026-06-10 13:57:30] [INFO ] Flatten gal took : 7 ms
[2026-06-10 13:57:30] [INFO ] Flatten gal took : 5 ms
[2026-06-10 13:57:30] [INFO ] Input system was already deterministic with 98 transitions.
[2026-06-10 13:57:30] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:57:30] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:57:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality15604365311345624205.gal : 1 ms
[2026-06-10 13:57:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality14390620058955017228.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/CTLCardinality15604365311345624205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14390620058955017228.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.61798e+07,0.025194,4588,2,480,5,1546,6,0,409,883,0


Converting to forward existential form...Done !
original formula: AG(AF(EX(((tmp_14_13<=0)&&(array_7_4>0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(((tmp_14_13<=0)&&(array_7_4>0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t69, t70, t71, t72, t73, t74, t75, t76, t77, t78, t79, t80, t81, t82, t83, t84, t85, t86...310
(forward)formula 0,0,0.168065,11936,1,0,281,49349,217,107,2611,35546,250
FORMULA LastZero-PT-N14-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 188 transition count 232
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 188 transition count 232
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 180 transition count 221
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 180 transition count 221
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 173 transition count 210
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 173 transition count 210
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 166 transition count 200
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 166 transition count 200
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 159 transition count 189
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 159 transition count 189
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 152 transition count 179
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 152 transition count 179
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 145 transition count 168
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 145 transition count 168
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 110 place count 139 transition count 160
Iterating global reduction 0 with 6 rules applied. Total rules applied 116 place count 139 transition count 160
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 122 place count 133 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 128 place count 133 transition count 150
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 134 place count 127 transition count 142
Iterating global reduction 0 with 6 rules applied. Total rules applied 140 place count 127 transition count 142
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 145 place count 122 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 150 place count 122 transition count 134
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 155 place count 117 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 160 place count 117 transition count 127
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 164 place count 113 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 168 place count 113 transition count 121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 172 place count 109 transition count 115
Iterating global reduction 0 with 4 rules applied. Total rules applied 176 place count 109 transition count 115
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 180 place count 105 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 184 place count 105 transition count 109
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 188 place count 101 transition count 103
Iterating global reduction 0 with 4 rules applied. Total rules applied 192 place count 101 transition count 103
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 195 place count 98 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 198 place count 98 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 199 place count 97 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 200 place count 97 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 201 place count 96 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 202 place count 96 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 203 place count 95 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 204 place count 95 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 205 place count 94 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 206 place count 94 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 207 place count 93 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 208 place count 93 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 209 place count 92 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 210 place count 92 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 211 place count 91 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 212 place count 91 transition count 89
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 214 place count 90 transition count 88
Applied a total of 214 rules in 41 ms. Remains 90 /198 variables (removed 108) and now considering 88/243 (removed 155) transitions.
[2026-06-10 13:57:30] [INFO ] Flow matrix only has 65 transitions (discarded 23 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1739093016055474517.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5122854996491648877.kers'
[2026-06-10 13:57:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1739093016055474517.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5122854996491648877.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 65 rows 87 cols 149 entries
Finished phase 1 with 63 SingleSign rule and 1 generalized
[2026-06-10 13:57:30] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5122854996491648877.kers
Total runtime 0 ms.
[2026-06-10 13:57:31] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-06-10 13:57:31] [INFO ] Flow matrix only has 65 transitions (discarded 23 similar events)
[2026-06-10 13:57:31] [INFO ] Invariant cache hit.
[2026-06-10 13:57:31] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-06-10 13:57:31] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2026-06-10 13:57:31] [INFO ] Redundant transitions in 2 ms returned []
Running 74 sub problems to find dead transitions.
[2026-06-10 13:57:31] [INFO ] Flow matrix only has 65 transitions (discarded 23 similar events)
[2026-06-10 13:57:31] [INFO ] Invariant cache hit.
[2026-06-10 13:57:31] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 1/90 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Problem TDEAD71 is UNSAT
At refinement iteration 6 (OVERLAPS) 65/155 variables, 90/127 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 27/154 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 154 constraints, problems are : Problem set: 1 solved, 73 unsolved in 2626 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 11/36 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 1/89 variables, 1/37 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 64/153 variables, 89/126 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 26/152 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 73/225 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 2/155 variables, 1/226 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 1/227 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 0/155 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 227 constraints, problems are : Problem set: 1 solved, 73 unsolved in 2494 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 73/74 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5125ms problems are : Problem set: 1 solved, 73 unsolved
Search for dead transitions found 1 dead transitions in 5126ms
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/198 places, 87/243 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2026-06-10 13:57:36] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 5348 ms. Remains : 90/198 places, 87/243 transitions.
[2026-06-10 13:57:36] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:57:36] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:57:36] [INFO ] Input system was already deterministic with 87 transitions.
[2026-06-10 13:57:36] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:57:36] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:57:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality13129677963450903855.gal : 1 ms
[2026-06-10 13:57:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality2275141038155170377.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/CTLCardinality13129677963450903855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2275141038155170377.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.20025e+06,0.016793,4504,2,400,5,1336,6,0,372,778,0


Converting to forward existential form...Done !
original formula: AF(AG((tmp_14_13>0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((tmp_14_13>0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t75, t76, t77...300
(forward)formula 0,0,0.134246,10496,1,0,253,38033,199,95,2521,26682,231
FORMULA LastZero-PT-N14-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 243/243 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 189 transition count 233
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 189 transition count 233
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 181 transition count 222
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 181 transition count 222
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 174 transition count 211
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 174 transition count 211
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 168 transition count 203
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 168 transition count 203
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 162 transition count 193
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 162 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 156 transition count 185
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 156 transition count 185
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 150 transition count 175
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 150 transition count 175
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 101 place count 145 transition count 169
Iterating global reduction 0 with 5 rules applied. Total rules applied 106 place count 145 transition count 169
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 140 transition count 160
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 140 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 121 place count 135 transition count 154
Iterating global reduction 0 with 5 rules applied. Total rules applied 126 place count 135 transition count 154
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 130 place count 131 transition count 147
Iterating global reduction 0 with 4 rules applied. Total rules applied 134 place count 131 transition count 147
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 138 place count 127 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 142 place count 127 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 145 place count 124 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 148 place count 124 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 151 place count 121 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 154 place count 121 transition count 133
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 156 place count 119 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 158 place count 119 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 160 place count 117 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 162 place count 117 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 163 place count 116 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 164 place count 116 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 115 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 115 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 167 place count 114 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 168 place count 114 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 169 place count 113 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 170 place count 113 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 171 place count 112 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 172 place count 112 transition count 120
Applied a total of 172 rules in 15 ms. Remains 112 /198 variables (removed 86) and now considering 120/243 (removed 123) transitions.
[2026-06-10 13:57:36] [INFO ] Flow matrix only has 87 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9044834956329471546.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16486108769484208695.kers'
[2026-06-10 13:57:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9044834956329471546.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16486108769484208695.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 87 rows 110 cols 204 entries
Finished phase 1 with 85 SingleSign rule and 1 generalized
[2026-06-10 13:57:36] [INFO ] Computed 26 invariants in 1 ms
Computed 26 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16486108769484208695.kers
Total runtime 1 ms.
[2026-06-10 13:57:36] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-06-10 13:57:36] [INFO ] Flow matrix only has 87 transitions (discarded 33 similar events)
[2026-06-10 13:57:36] [INFO ] Invariant cache hit.
[2026-06-10 13:57:36] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-06-10 13:57:36] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2026-06-10 13:57:36] [INFO ] Flow matrix only has 87 transitions (discarded 33 similar events)
[2026-06-10 13:57:36] [INFO ] Invariant cache hit.
[2026-06-10 13:57:36] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 87/198 variables, 111/165 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 37/202 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Problem TDEAD97 is UNSAT
At refinement iteration 8 (OVERLAPS) 1/199 variables, 1/203 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 203 constraints, problems are : Problem set: 1 solved, 105 unsolved in 5328 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 25/25 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/26 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 28/54 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/55 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 87/198 variables, 111/166 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 37/203 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 105/308 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/308 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 1/199 variables, 1/309 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/309 constraints. Problems are: Problem set: 1 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/199 variables, 0/309 constraints. Problems are: Problem set: 1 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 309 constraints, problems are : Problem set: 1 solved, 105 unsolved in 4838 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 105/106 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10175ms problems are : Problem set: 1 solved, 105 unsolved
Search for dead transitions found 1 dead transitions in 10175ms
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 : 112/198 places, 119/243 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10403 ms. Remains : 112/198 places, 119/243 transitions.
[2026-06-10 13:57:46] [INFO ] Flatten gal took : 9 ms
[2026-06-10 13:57:46] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:57:46] [INFO ] Input system was already deterministic with 119 transitions.
[2026-06-10 13:57:46] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:57:46] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:57:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality6704180817565774521.gal : 1 ms
[2026-06-10 13:57:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality8022922649114592172.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/CTLCardinality6704180817565774521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8022922649114592172.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.90692e+07,0.025144,4776,2,699,5,2038,6,0,472,1128,0


Converting to forward existential form...Done !
original formula: AF(((EG(A(((tmp_14_10<=1)&&(array_8_8<=0)) U (array_3_1<=0))) * AF((((array_9_1>=1)||(process_5<=0))||(array_11_8>=1)))) * EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,!(((EG(!((E(!((array_3_1<=0)) U (!(((tmp_14_10<=1)&&(array_8_8<=0))) * !((array_3_1<=0)))) + EG(!((ar...259
Reverse transition relation is NOT exact ! Due to transitions t12, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97, t98, t99, t10...365
(forward)formula 0,1,0.48025,22164,1,0,384,110108,277,159,3182,89134,369
FORMULA LastZero-PT-N14-CTLCardinality-2024-07 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 : 198/198 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 187 transition count 231
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 187 transition count 231
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 178 transition count 218
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 178 transition count 218
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 170 transition count 206
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 170 transition count 206
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 162 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 162 transition count 194
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 154 transition count 182
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 154 transition count 182
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 146 transition count 170
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 146 transition count 170
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 110 place count 138 transition count 158
Iterating global reduction 0 with 8 rules applied. Total rules applied 118 place count 138 transition count 158
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 125 place count 131 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 132 place count 131 transition count 148
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 139 place count 124 transition count 137
Iterating global reduction 0 with 7 rules applied. Total rules applied 146 place count 124 transition count 137
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 153 place count 117 transition count 127
Iterating global reduction 0 with 7 rules applied. Total rules applied 160 place count 117 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 166 place count 111 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 172 place count 111 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 178 place count 105 transition count 109
Iterating global reduction 0 with 6 rules applied. Total rules applied 184 place count 105 transition count 109
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 188 place count 101 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 192 place count 101 transition count 104
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 196 place count 97 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 200 place count 97 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 204 place count 93 transition count 92
Iterating global reduction 0 with 4 rules applied. Total rules applied 208 place count 93 transition count 92
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 212 place count 89 transition count 85
Iterating global reduction 0 with 4 rules applied. Total rules applied 216 place count 89 transition count 85
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 220 place count 85 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 224 place count 85 transition count 80
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 226 place count 83 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 228 place count 83 transition count 77
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 230 place count 81 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 232 place count 81 transition count 74
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 234 place count 79 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 236 place count 79 transition count 71
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 238 place count 77 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 240 place count 77 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 241 place count 76 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 242 place count 76 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 243 place count 75 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 244 place count 75 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 245 place count 74 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 246 place count 74 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 247 place count 73 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 248 place count 73 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 249 place count 72 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 250 place count 72 transition count 61
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 252 place count 71 transition count 60
Applied a total of 252 rules in 43 ms. Remains 71 /198 variables (removed 127) and now considering 60/243 (removed 183) transitions.
[2026-06-10 13:57:47] [INFO ] Flow matrix only has 45 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-9073982456365934175.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2444295017626797231.kers'
[2026-06-10 13:57:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9073982456365934175.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2444295017626797231.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 45 rows 59 cols 91 entries
Finished phase 1 with 35 SingleSign rule and 10 generalized
[2026-06-10 13:57:47] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2444295017626797231.kers
Total runtime 0 ms.
[2026-06-10 13:57:47] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-06-10 13:57:47] [INFO ] Flow matrix only has 45 transitions (discarded 15 similar events)
[2026-06-10 13:57:47] [INFO ] Invariant cache hit.
[2026-06-10 13:57:47] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-06-10 13:57:47] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2026-06-10 13:57:47] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2026-06-10 13:57:47] [INFO ] Flow matrix only has 45 transitions (discarded 15 similar events)
[2026-06-10 13:57:47] [INFO ] Invariant cache hit.
[2026-06-10 13:57:47] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 1/71 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem TDEAD48 is UNSAT
At refinement iteration 6 (OVERLAPS) 45/116 variables, 71/99 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 17/116 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/116 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 116 constraints, problems are : Problem set: 1 solved, 45 unsolved in 1116 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 71/71 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 10/25 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/27 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 1/70 variables, 1/28 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 44/114 variables, 70/98 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 16/114 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 45/159 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 2/116 variables, 1/160 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 1/161 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 13 (OVERLAPS) 0/116 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 161 constraints, problems are : Problem set: 1 solved, 45 unsolved in 1206 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 71/71 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 45/46 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2326ms problems are : Problem set: 1 solved, 45 unsolved
Search for dead transitions found 1 dead transitions in 2327ms
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 : 71/198 places, 59/243 transitions.
Applied a total of 0 rules in 5 ms. Remains 71 /71 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2026-06-10 13:57:49] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 2538 ms. Remains : 71/198 places, 59/243 transitions.
[2026-06-10 13:57:49] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:57:49] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:57:49] [INFO ] Input system was already deterministic with 59 transitions.
[2026-06-10 13:57:49] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:57:49] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:57:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality405503026124887553.gal : 1 ms
[2026-06-10 13:57:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality7179754849144584526.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/CTLCardinality405503026124887553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7179754849144584526.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 -...282
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.37443e+06,0.010401,4324,2,218,5,822,6,0,286,483,0


Converting to forward existential form...Done !
original formula: EG(EF((array_9_3<1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (array_9_3<1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, Int...249
(forward)formula 0,1,0.110576,9976,1,0,303,38296,144,147,1747,39345,252
FORMULA LastZero-PT-N14-CTLCardinality-2024-13 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 : 198/198 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 188 transition count 232
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 188 transition count 232
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 180 transition count 221
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 180 transition count 221
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 173 transition count 210
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 173 transition count 210
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 166 transition count 200
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 166 transition count 200
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 159 transition count 189
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 159 transition count 189
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 152 transition count 179
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 152 transition count 179
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 145 transition count 168
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 145 transition count 168
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 138 transition count 158
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 138 transition count 158
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 125 place count 131 transition count 147
Iterating global reduction 0 with 7 rules applied. Total rules applied 132 place count 131 transition count 147
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 139 place count 124 transition count 137
Iterating global reduction 0 with 7 rules applied. Total rules applied 146 place count 124 transition count 137
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 152 place count 118 transition count 128
Iterating global reduction 0 with 6 rules applied. Total rules applied 158 place count 118 transition count 128
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 163 place count 113 transition count 120
Iterating global reduction 0 with 5 rules applied. Total rules applied 168 place count 113 transition count 120
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 173 place count 108 transition count 113
Iterating global reduction 0 with 5 rules applied. Total rules applied 178 place count 108 transition count 113
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 182 place count 104 transition count 107
Iterating global reduction 0 with 4 rules applied. Total rules applied 186 place count 104 transition count 107
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 190 place count 100 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 194 place count 100 transition count 101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 198 place count 96 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 202 place count 96 transition count 95
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 205 place count 93 transition count 91
Iterating global reduction 0 with 3 rules applied. Total rules applied 208 place count 93 transition count 91
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 210 place count 91 transition count 88
Iterating global reduction 0 with 2 rules applied. Total rules applied 212 place count 91 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 214 place count 89 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 216 place count 89 transition count 85
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 218 place count 87 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 220 place count 87 transition count 82
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 222 place count 85 transition count 79
Iterating global reduction 0 with 2 rules applied. Total rules applied 224 place count 85 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 225 place count 84 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 226 place count 84 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 227 place count 83 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 228 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 229 place count 82 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 230 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 231 place count 81 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 232 place count 81 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 233 place count 80 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 234 place count 80 transition count 72
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 236 place count 79 transition count 71
Applied a total of 236 rules in 37 ms. Remains 79 /198 variables (removed 119) and now considering 71/243 (removed 172) transitions.
[2026-06-10 13:57:50] [INFO ] Flow matrix only has 55 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9075434584906675134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14022187758385434336.kers'
[2026-06-10 13:57:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9075434584906675134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14022187758385434336.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 55 rows 70 cols 118 entries
Finished phase 1 with 46 SingleSign rule and 7 generalized
[2026-06-10 13:57:50] [INFO ] Computed 26 invariants in 0 ms
Computed 26 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14022187758385434336.kers
Total runtime 0 ms.
[2026-06-10 13:57:50] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-06-10 13:57:50] [INFO ] Flow matrix only has 55 transitions (discarded 16 similar events)
[2026-06-10 13:57:50] [INFO ] Invariant cache hit.
[2026-06-10 13:57:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-06-10 13:57:50] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2026-06-10 13:57:50] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2026-06-10 13:57:50] [INFO ] Flow matrix only has 55 transitions (discarded 16 similar events)
[2026-06-10 13:57:50] [INFO ] Invariant cache hit.
[2026-06-10 13:57:50] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 1/79 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem TDEAD55 is UNSAT
At refinement iteration 6 (OVERLAPS) 55/134 variables, 79/112 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 22/134 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 134 constraints, problems are : Problem set: 1 solved, 56 unsolved in 1663 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 7/25 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 7/32 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 1/78 variables, 1/33 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 54/132 variables, 78/111 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 21/132 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 56/188 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 2/134 variables, 1/189 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 1/190 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 56 unsolved
At refinement iteration 13 (OVERLAPS) 0/134 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 190 constraints, problems are : Problem set: 1 solved, 56 unsolved in 1637 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 79/79 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 56/57 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3304ms problems are : Problem set: 1 solved, 56 unsolved
Search for dead transitions found 1 dead transitions in 3304ms
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 : 79/198 places, 70/243 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2026-06-10 13:57:53] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 3489 ms. Remains : 79/198 places, 70/243 transitions.
[2026-06-10 13:57:53] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:57:53] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:57:53] [INFO ] Input system was already deterministic with 70 transitions.
[2026-06-10 13:57:53] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:57:53] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:57:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality1165635195927688064.gal : 0 ms
[2026-06-10 13:57:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality978988519345436109.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/CTLCardinality1165635195927688064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality978988519345436109.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 -...282
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,9.05847e+06,0.015042,4420,2,288,5,1031,6,0,323,607,0


Converting to forward existential form...Done !
original formula: EF(AG(((AF((tmp_10_5<=0)) * (array_6_3<=0)) * ((process_14<=0)&&(tmp_9_2<1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((!(EG(!((tmp_10_5<=0)))) * (array_6_3<=0)) * ((process_14<=0)&&(tmp_9_2<1)))))...167
Reverse transition relation is NOT exact ! Due to transitions t6, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65,...274
(forward)formula 0,1,0.114961,9736,1,0,225,38698,169,84,2032,29689,203
FORMULA LastZero-PT-N14-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-06-10 13:57:53] [INFO ] Flatten gal took : 7 ms
[2026-06-10 13:57:53] [INFO ] Flatten gal took : 6 ms
Total runtime 128765 ms.

BK_STOP 1781099873792

--------------------
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-N14"
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-N14, 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-178024402800105"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LastZero-PT-N14.tgz
mv LastZero-PT-N14 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 ;