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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.0K May 27 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 27 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 27 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 27 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 65K May 27 10:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 249K May 27 10:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 27 10:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 27 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 27 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 27 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 27 10:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K May 27 10:52 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 787K 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-N12-CTLCardinality-2024-00
FORMULA_NAME LastZero-PT-N12-CTLCardinality-2024-01
FORMULA_NAME LastZero-PT-N12-CTLCardinality-2024-02
FORMULA_NAME LastZero-PT-N12-CTLCardinality-2024-03
FORMULA_NAME LastZero-PT-N12-CTLCardinality-2024-04
FORMULA_NAME LastZero-PT-N12-CTLCardinality-2024-05
FORMULA_NAME LastZero-PT-N12-CTLCardinality-2024-06
FORMULA_NAME LastZero-PT-N12-CTLCardinality-2024-07
FORMULA_NAME LastZero-PT-N12-CTLCardinality-2024-08
FORMULA_NAME LastZero-PT-N12-CTLCardinality-2024-09
FORMULA_NAME LastZero-PT-N12-CTLCardinality-2024-10
FORMULA_NAME LastZero-PT-N12-CTLCardinality-2024-11
FORMULA_NAME LastZero-PT-N12-CTLCardinality-2024-12
FORMULA_NAME LastZero-PT-N12-CTLCardinality-2024-13
FORMULA_NAME LastZero-PT-N12-CTLCardinality-2024-14
FORMULA_NAME LastZero-PT-N12-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781099700924

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-N12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-10 13:55:02] [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:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 13:55:02] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2026-06-10 13:55:02] [INFO ] Transformed 364 places.
[2026-06-10 13:55:02] [INFO ] Transformed 2485 transitions.
[2026-06-10 13:55:02] [INFO ] Parsed PT model containing 364 places and 2485 transitions and 7743 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 170 places in 13 ms
Reduce places removed 170 places and 1601 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA LastZero-PT-N12-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N12-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N12-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N12-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 884/884 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 884
Applied a total of 1 rules in 25 ms. Remains 192 /193 variables (removed 1) and now considering 884/884 (removed 0) transitions.
[2026-06-10 13:55:02] [INFO ] Flow matrix only has 818 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-6011954832598958548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14655275327680824792.kers'
[2026-06-10 13:55:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6011954832598958548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14655275327680824792.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 818 rows 191 cols 2206 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-06-10 13:55:02] [INFO ] Computed 12 invariants in 2 ms
Computed 12 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14655275327680824792.kers
Total runtime 4 ms.
[2026-06-10 13:55:02] [INFO ] Implicit Places using invariants in 376 ms returned []
[2026-06-10 13:55:02] [INFO ] Flow matrix only has 818 transitions (discarded 66 similar events)
[2026-06-10 13:55:02] [INFO ] Invariant cache hit.
[2026-06-10 13:55:02] [INFO ] State equation strengthened by 156 read => feed constraints.
[2026-06-10 13:55:05] [INFO ] Implicit Places using invariants and state equation in 2591 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3003 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 191/193 places, 884/884 transitions.
Applied a total of 0 rules in 8 ms. Remains 191 /191 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3066 ms. Remains : 191/193 places, 884/884 transitions.
Starting structural reductions in LTL mode, iteration 0 : 191/191 places, 884/884 transitions.
Applied a total of 0 rules in 6 ms. Remains 191 /191 variables (removed 0) and now considering 884/884 (removed 0) transitions.
[2026-06-10 13:55:05] [INFO ] Flow matrix only has 818 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-11351097854610648000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9502948918449215862.kers'
[2026-06-10 13:55:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11351097854610648000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9502948918449215862.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 818 rows 190 cols 2194 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-06-10 13:55:05] [INFO ] Computed 11 invariants in 5 ms
Computed 11 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9502948918449215862.kers
Total runtime 6 ms.
[2026-06-10 13:55:05] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-06-10 13:55:05] [INFO ] Flow matrix only has 818 transitions (discarded 66 similar events)
[2026-06-10 13:55:05] [INFO ] Invariant cache hit.
[2026-06-10 13:55:05] [INFO ] State equation strengthened by 156 read => feed constraints.
[2026-06-10 13:55:06] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
Running 872 sub problems to find dead transitions.
[2026-06-10 13:55:06] [INFO ] Flow matrix only has 818 transitions (discarded 66 similar events)
[2026-06-10 13:55:06] [INFO ] Invariant cache hit.
[2026-06-10 13:55:06] [INFO ] State equation strengthened by 156 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 872 unsolved
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
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 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 TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem 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 TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem 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 TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem 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 TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 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 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 TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem 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 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 TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
At refinement iteration 2 (OVERLAPS) 818/1008 variables, 190/201 constraints. Problems are: Problem set: 649 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1008 variables, 156/357 constraints. Problems are: Problem set: 649 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1008 variables, 0/357 constraints. Problems are: Problem set: 649 solved, 223 unsolved
Problem TDEAD645 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/1009 variables, 1/358 constraints. Problems are: Problem set: 650 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1009/1009 variables, and 358 constraints, problems are : Problem set: 650 solved, 222 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 191/191 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 872/872 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 650 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 11/11 constraints. Problems are: Problem set: 650 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/11 constraints. Problems are: Problem set: 650 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 818/1008 variables, 190/201 constraints. Problems are: Problem set: 650 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1008 variables, 156/357 constraints. Problems are: Problem set: 650 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1008 variables, 222/579 constraints. Problems are: Problem set: 650 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1008 variables, 0/579 constraints. Problems are: Problem set: 650 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 1/1009 variables, 1/580 constraints. Problems are: Problem set: 650 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1009 variables, 0/580 constraints. Problems are: Problem set: 650 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1009/1009 variables, and 580 constraints, problems are : Problem set: 650 solved, 222 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 191/191 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 222/872 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60369ms problems are : Problem set: 650 solved, 222 unsolved
Search for dead transitions found 650 dead transitions in 60392ms
Found 650 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 650 transitions
Dead transitions reduction (with SMT) removed 650 transitions
Starting structural reductions in LTL mode, iteration 1 : 191/191 places, 234/884 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 183 transition count 226
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 183 transition count 226
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 176 transition count 219
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 176 transition count 219
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 170 transition count 207
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 170 transition count 207
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 165 transition count 202
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 165 transition count 202
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 160 transition count 192
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 160 transition count 192
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 155 transition count 187
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 155 transition count 187
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 151 transition count 179
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 151 transition count 179
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 147 transition count 175
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 147 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 145 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 145 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 144 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 144 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 143 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 143 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 142 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 142 transition count 167
Applied a total of 98 rules in 29 ms. Remains 142 /191 variables (removed 49) and now considering 167/234 (removed 67) transitions.
[2026-06-10 13:56:07] [INFO ] Flow matrix only has 122 transitions (discarded 45 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12661311666263635141.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16133569998709820765.kers'
[2026-06-10 13:56:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12661311666263635141.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16133569998709820765.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 122 rows 141 cols 292 entries
Finished phase 1 with 118 SingleSign rule and 1 generalized
[2026-06-10 13:56:07] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16133569998709820765.kers
Total runtime 1 ms.
[2026-06-10 13:56:07] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-06-10 13:56:07] [INFO ] Flow matrix only has 122 transitions (discarded 45 similar events)
[2026-06-10 13:56:07] [INFO ] Invariant cache hit.
[2026-06-10 13:56:07] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-06-10 13:56:07] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 142/191 places, 167/884 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61974 ms. Remains : 142/191 places, 167/884 transitions.
Support contains 34 out of 142 places after structural reductions.
[2026-06-10 13:56:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-06-10 13:56:07] [INFO ] Flatten gal took : 31 ms
FORMULA LastZero-PT-N12-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 13:56:07] [INFO ] Flatten gal took : 15 ms
[2026-06-10 13:56:07] [INFO ] Input system was already deterministic with 167 transitions.
Support contains 28 out of 142 places (down from 34) after GAL structural reductions.
FORMULA LastZero-PT-N12-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1080 resets) in 2084 ms. (19 steps per ms) remains 8/20 properties
BEST_FIRST walk for 40004 steps (165 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (165 resets) in 90 ms. (439 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (165 resets) in 136 ms. (291 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (164 resets) in 155 ms. (256 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (168 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (166 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (165 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (164 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
[2026-06-10 13:56:08] [INFO ] Flow matrix only has 122 transitions (discarded 45 similar events)
[2026-06-10 13:56:08] [INFO ] Invariant cache hit.
[2026-06-10 13:56:08] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 58/71 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/74 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 66/140 variables, 74/85 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 9/94 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 4/144 variables, 2/96 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 4/148 variables, 2/98 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2/150 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/150 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/152 variables, 1/101 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 1/102 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/152 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 2/154 variables, 1/103 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/154 variables, 1/104 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/154 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 2/156 variables, 1/105 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/156 variables, 1/106 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/156 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 2/158 variables, 1/107 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/158 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 2/160 variables, 1/108 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/160 variables, 1/109 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/160 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 1/161 variables, 1/110 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/161 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 37/198 variables, 38/148 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/198 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 63/261 variables, 54/202 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/261 variables, 9/211 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/261 variables, 3/214 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/261 variables, 0/214 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 37 (OVERLAPS) 2/263 variables, 2/216 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/263 variables, 2/218 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/263 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 40 (OVERLAPS) 1/264 variables, 1/219 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/264 variables, 1/220 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/264 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 43 (OVERLAPS) 0/264 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 220 constraints, problems are : Problem set: 1 solved, 6 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 47/58 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/60 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 54/114 variables, 60/77 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 9/86 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 2/88 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 4/118 variables, 2/90 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 4/122 variables, 2/92 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2/124 variables, 1/93 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/124 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/126 variables, 1/94 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/126 variables, 1/95 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/126 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2/128 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/128 variables, 1/97 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/128 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 2/130 variables, 1/98 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/130 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/130 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 2/132 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/132 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 2/134 variables, 1/101 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/134 variables, 1/102 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/134 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 1/135 variables, 1/103 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/135 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 32 (OVERLAPS) 38/173 variables, 29/132 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/173 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 86/259 variables, 66/198 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/259 variables, 9/207 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/259 variables, 13/220 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/259 variables, 4/224 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/259 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 39 (OVERLAPS) 4/263 variables, 4/228 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/263 variables, 4/232 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/263 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 42 (OVERLAPS) 1/264 variables, 1/233 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/264 variables, 1/234 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/264 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 45 (OVERLAPS) 0/264 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 234 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1324 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 142/142 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1843ms problems are : Problem set: 1 solved, 6 unsolved
Finished Parikh walk after 29 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Parikh walk visited 6 properties in 72 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA LastZero-PT-N12-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 13:56:10] [INFO ] Flatten gal took : 8 ms
[2026-06-10 13:56:10] [INFO ] Flatten gal took : 9 ms
[2026-06-10 13:56:10] [INFO ] Input system was already deterministic with 167 transitions.
Computed a total of 142 stabilizing places and 167 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 142 transition count 167
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA LastZero-PT-N12-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 167/167 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 134 transition count 157
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 134 transition count 157
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 127 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 127 transition count 148
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 120 transition count 136
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 120 transition count 136
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 113 transition count 127
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 113 transition count 127
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 107 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 107 transition count 116
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 102 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 102 transition count 111
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 98 transition count 103
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 98 transition count 103
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 92 place count 94 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 96 place count 94 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 91 transition count 93
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 91 transition count 93
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 105 place count 88 transition count 90
Iterating global reduction 0 with 3 rules applied. Total rules applied 108 place count 88 transition count 90
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 86 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 86 transition count 86
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 84 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 84 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 83 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 83 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 82 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 82 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 81 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 81 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 80 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 80 transition count 78
Applied a total of 124 rules in 18 ms. Remains 80 /142 variables (removed 62) and now considering 78/167 (removed 89) transitions.
[2026-06-10 13:56:10] [INFO ] Flow matrix only has 58 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-16296413909467157753.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13386722098221550940.kers'
[2026-06-10 13:56:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16296413909467157753.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13386722098221550940.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 58 rows 77 cols 133 entries
Finished phase 1 with 54 SingleSign rule and 3 generalized
[2026-06-10 13:56:10] [INFO ] Computed 23 invariants in 5 ms
Computed 23 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13386722098221550940.kers
Total runtime 5 ms.
[2026-06-10 13:56:10] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-06-10 13:56:10] [INFO ] Flow matrix only has 58 transitions (discarded 20 similar events)
[2026-06-10 13:56:10] [INFO ] Invariant cache hit.
[2026-06-10 13:56:10] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-06-10 13:56:10] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2026-06-10 13:56:10] [INFO ] Flow matrix only has 58 transitions (discarded 20 similar events)
[2026-06-10 13:56:10] [INFO ] Invariant cache hit.
[2026-06-10 13:56:10] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 58/138 variables, 80/116 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 23/139 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 139 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2146 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 58/138 variables, 80/116 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 23/139 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 66/205 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 205 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1547 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 80/80 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3697ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3699ms
Starting structural reductions in LTL mode, iteration 1 : 80/142 places, 78/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3855 ms. Remains : 80/142 places, 78/167 transitions.
[2026-06-10 13:56:14] [INFO ] Flatten gal took : 7 ms
[2026-06-10 13:56:14] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:56:14] [INFO ] Input system was already deterministic with 78 transitions.
[2026-06-10 13:56:14] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:56:14] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:56:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality11251783284014955786.gal : 2 ms
[2026-06-10 13:56:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality2310127099091201060.ctl : 2 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/CTLCardinality11251783284014955786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2310127099091201060.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,1.31878e+06,0.025601,4324,2,367,5,1199,6,0,333,694,0


Converting to forward existential form...Done !
original formula: E((array_5_5>=1) U !(AG(!((EX((tmp_11_10>=1)) * (lastzero_3<=0))))))
=> equivalent forward existential formula: [(EY((FwdU(FwdU(Init,(array_5_5>=1)),TRUE) * (lastzero_3<=0))) * (tmp_11_10>=1))] != FALSE
Hit Full ! (commute/partial/dont) 75/0/3
(forward)formula 0,1,0.032057,4628,1,0,10,1964,17,2,727,1187,8
FORMULA LastZero-PT-N12-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 167/167 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 135 transition count 158
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 135 transition count 158
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 129 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 129 transition count 150
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 124 transition count 142
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 124 transition count 142
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 120 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 120 transition count 137
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 116 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 116 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 113 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 113 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 110 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 110 transition count 121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 107 transition count 118
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 107 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 104 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 104 transition count 112
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 101 transition count 109
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 101 transition count 109
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 99 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 99 transition count 105
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 97 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 97 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 96 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 96 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 95 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 95 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 94 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 94 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 93 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 93 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 92 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 92 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 91 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 91 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 90 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 90 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 89 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 89 transition count 91
Applied a total of 106 rules in 23 ms. Remains 89 /142 variables (removed 53) and now considering 91/167 (removed 76) transitions.
[2026-06-10 13:56:14] [INFO ] Flow matrix only has 66 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13240673181617423161.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3679886668183822216.kers'
[2026-06-10 13:56:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13240673181617423161.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3679886668183822216.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 66 rows 88 cols 155 entries
Finished phase 1 with 65 SingleSign rule and 1 generalized
[2026-06-10 13:56:14] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3679886668183822216.kers
Total runtime 0 ms.
[2026-06-10 13:56:14] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-06-10 13:56:14] [INFO ] Flow matrix only has 66 transitions (discarded 25 similar events)
[2026-06-10 13:56:14] [INFO ] Invariant cache hit.
[2026-06-10 13:56:14] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-06-10 13:56:14] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2026-06-10 13:56:14] [INFO ] Flow matrix only has 66 transitions (discarded 25 similar events)
[2026-06-10 13:56:14] [INFO ] Invariant cache hit.
[2026-06-10 13:56:14] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 18/40 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 1/89 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 66/155 variables, 89/131 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 27/158 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 158 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3154 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 66/155 variables, 89/131 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 27/158 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 79/237 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 237 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2103 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5263ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 5263ms
Starting structural reductions in LTL mode, iteration 1 : 89/142 places, 91/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5433 ms. Remains : 89/142 places, 91/167 transitions.
[2026-06-10 13:56:19] [INFO ] Flatten gal took : 9 ms
[2026-06-10 13:56:19] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:56:19] [INFO ] Input system was already deterministic with 91 transitions.
[2026-06-10 13:56:19] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:56:19] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:56:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality3581029732711228015.gal : 2 ms
[2026-06-10 13:56:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality6512725061852879915.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/CTLCardinality3581029732711228015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6512725061852879915.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,3.02478e+06,0.016952,4536,2,470,5,1473,6,0,372,831,0


Converting to forward existential form...Done !
original formula: (AX(AF(((AG((array_13_4>0)) * (array_8_4>0)) * EG((array_10_1>0))))) + EG(((array_11_10>0)&&((process_9<=0)||(tmp_5_4>=1)))))
=> equivalent forward existential formula: [FwdG(EY((Init * !(EG(((array_11_10>0)&&((process_9<=0)||(tmp_5_4>=1))))))),!(((!(E(TRUE U !((array_13_4>0)))) *...203
Reverse transition relation is NOT exact ! Due to transitions t9, t64, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t75, t76, t77, t78, t79, t80, t81,...299
(forward)formula 0,0,0.172366,13280,1,0,353,55317,210,156,2520,43179,342
FORMULA LastZero-PT-N12-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 142/142 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 135 transition count 158
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 135 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 130 transition count 152
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 130 transition count 152
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 125 transition count 143
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 125 transition count 143
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 120 transition count 137
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 120 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 115 transition count 128
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 115 transition count 128
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 110 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 110 transition count 122
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 107 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 107 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 104 transition count 113
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 104 transition count 113
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 101 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 101 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 99 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 99 transition count 105
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 98 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 98 transition count 104
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 97 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 97 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 96 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 96 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 95 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 95 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 94 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 94 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 93 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 93 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 92 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 92 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 91 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 91 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 90 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 90 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 89 transition count 91
Applied a total of 104 rules in 51 ms. Remains 89 /142 variables (removed 53) and now considering 91/167 (removed 76) transitions.
[2026-06-10 13:56:20] [INFO ] Flow matrix only has 68 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-14886525897641676645.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7092111860139869030.kers'
[2026-06-10 13:56:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14886525897641676645.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7092111860139869030.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 68 rows 87 cols 160 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-06-10 13:56:20] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7092111860139869030.kers
Total runtime 0 ms.
[2026-06-10 13:56:20] [INFO ] Implicit Places using invariants in 51 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 88/142 places, 91/167 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 108 ms. Remains : 88/142 places, 91/167 transitions.
[2026-06-10 13:56:20] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:56:20] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:56:20] [INFO ] Input system was already deterministic with 91 transitions.
[2026-06-10 13:56:20] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:56:20] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:56:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality9561554599549915418.gal : 1 ms
[2026-06-10 13:56:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality738820458625852844.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/CTLCardinality9561554599549915418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality738820458625852844.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,1.49531e+06,0.017058,4532,2,492,5,1505,6,0,369,846,0


Converting to forward existential form...Done !
original formula: AG((EF(((tmp_9_9>0)||((array_13_6>0)&&(lastzero_4<1)))) * ((process_10<1)||(tmp_9_6<=0))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((tmp_9_9>0)||((array_13_6>0)&&(lastzero_4<1))))))] = FALSE * [(FwdU(Init,TRUE) ...201
(forward)formula 0,0,0.017883,4792,1,0,8,1505,9,2,379,846,1
FORMULA LastZero-PT-N12-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 142/142 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 134 transition count 158
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 134 transition count 158
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 128 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 128 transition count 150
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 122 transition count 140
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 122 transition count 140
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 116 transition count 132
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 116 transition count 132
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 110 transition count 122
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 110 transition count 122
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 105 transition count 116
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 105 transition count 116
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 101 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 101 transition count 109
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 97 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 97 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 94 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 94 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 91 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 91 transition count 95
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 89 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 89 transition count 92
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 106 place count 87 transition count 89
Iterating global reduction 0 with 2 rules applied. Total rules applied 108 place count 87 transition count 89
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 85 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 85 transition count 86
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 83 transition count 83
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 83 transition count 83
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 118 place count 81 transition count 80
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 81 transition count 80
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 122 place count 79 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 124 place count 79 transition count 77
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 77 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 77 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 76 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 76 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 131 place count 75 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 132 place count 75 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 133 place count 74 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 134 place count 74 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 135 place count 73 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 136 place count 73 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 137 place count 72 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 138 place count 72 transition count 67
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 140 place count 71 transition count 66
Applied a total of 140 rules in 38 ms. Remains 71 /142 variables (removed 71) and now considering 66/167 (removed 101) transitions.
[2026-06-10 13:56:20] [INFO ] Flow matrix only has 48 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-2901103945858426285.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18421848137444761649.kers'
[2026-06-10 13:56:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2901103945858426285.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18421848137444761649.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 48 rows 65 cols 107 entries
Finished phase 1 with 45 SingleSign rule and 3 generalized
[2026-06-10 13:56:20] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18421848137444761649.kers
Total runtime 0 ms.
[2026-06-10 13:56:20] [INFO ] Implicit Places using invariants in 46 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 70/142 places, 66/167 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 87 ms. Remains : 70/142 places, 66/167 transitions.
[2026-06-10 13:56:20] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:56:20] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:56:20] [INFO ] Input system was already deterministic with 66 transitions.
[2026-06-10 13:56:20] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:56:20] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:56:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality4721573063008229017.gal : 1 ms
[2026-06-10 13:56:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality1968846702975569751.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/CTLCardinality4721573063008229017.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1968846702975569751.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,642936,0.011742,4380,2,297,5,987,6,0,288,575,0


Converting to forward existential form...Done !
original formula: EF(EG((array_10_8>0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(array_10_8>0))] != FALSE
Hit Full ! (commute/partial/dont) 63/0/3
(forward)formula 0,1,0.050663,6392,1,0,42,13393,18,3,1530,8428,41
FORMULA LastZero-PT-N12-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 167/167 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 135 transition count 159
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 135 transition count 159
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 129 transition count 151
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 129 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 124 transition count 143
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 124 transition count 143
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 119 transition count 136
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 119 transition count 136
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 115 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 115 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 112 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 112 transition count 126
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 109 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 109 transition count 121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 106 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 106 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 103 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 103 transition count 112
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 100 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 100 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 98 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 98 transition count 105
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 96 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 96 transition count 102
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 95 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 95 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 94 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 94 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 93 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 93 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 92 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 92 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 91 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 91 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 90 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 90 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 89 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 89 transition count 92
Applied a total of 106 rules in 13 ms. Remains 89 /142 variables (removed 53) and now considering 92/167 (removed 75) transitions.
[2026-06-10 13:56:20] [INFO ] Flow matrix only has 66 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-4506512595107218477.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7173308989289097727.kers'
[2026-06-10 13:56:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4506512595107218477.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7173308989289097727.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 66 rows 88 cols 156 entries
Finished phase 1 with 65 SingleSign rule and 1 generalized
[2026-06-10 13:56:20] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7173308989289097727.kers
Total runtime 0 ms.
[2026-06-10 13:56:20] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-06-10 13:56:20] [INFO ] Flow matrix only has 66 transitions (discarded 26 similar events)
[2026-06-10 13:56:20] [INFO ] Invariant cache hit.
[2026-06-10 13:56:20] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-06-10 13:56:20] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2026-06-10 13:56:20] [INFO ] Flow matrix only has 66 transitions (discarded 26 similar events)
[2026-06-10 13:56:20] [INFO ] Invariant cache hit.
[2026-06-10 13:56:20] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 66/155 variables, 89/131 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 27/158 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/155 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 158 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2689 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/89 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 66/155 variables, 89/131 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 27/158 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 80/238 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/155 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 238 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2065 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4761ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4762ms
Starting structural reductions in LTL mode, iteration 1 : 89/142 places, 92/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4936 ms. Remains : 89/142 places, 92/167 transitions.
[2026-06-10 13:56:25] [INFO ] Flatten gal took : 9 ms
[2026-06-10 13:56:25] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:56:25] [INFO ] Input system was already deterministic with 92 transitions.
[2026-06-10 13:56:25] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:56:25] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:56:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality4073966140134523168.gal : 0 ms
[2026-06-10 13:56:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality17043305035967571457.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/CTLCardinality4073966140134523168.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17043305035967571457.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,2.98728e+06,0.016494,4536,2,484,5,1503,6,0,373,850,0


Converting to forward existential form...Done !
original formula: AF((AF((array_9_5<=0)) * EX((!(A((tmp_11_4<=0) U (array_12_5<=array_8_8))) * AX((array_6_1>array_11_2))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((array_9_5<=0)))) * EX((!(!((E(!((array_12_5<=array_8_8)) U (!((tmp_11_4<=0)) * !((array_12...257
Reverse transition relation is NOT exact ! Due to transitions t8, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t75, t76, t77, t78, t79, t80, t81, t82,...299
(forward)formula 0,0,0.441619,26504,1,0,691,136685,220,353,2409,158664,661
FORMULA LastZero-PT-N12-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 142/142 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 135 transition count 158
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 135 transition count 158
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 129 transition count 151
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 129 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 124 transition count 141
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 124 transition count 141
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 119 transition count 136
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 119 transition count 136
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 114 transition count 126
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 114 transition count 126
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 109 transition count 121
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 109 transition count 121
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 106 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 106 transition count 115
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 103 transition count 112
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 103 transition count 112
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 100 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 100 transition count 106
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 97 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 97 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 96 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 96 transition count 101
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 95 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 95 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 94 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 94 transition count 98
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 93 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 93 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 92 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 92 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 91 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 91 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 90 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 90 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 89 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 89 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 88 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 88 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 87 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 87 transition count 88
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 110 place count 86 transition count 87
Applied a total of 110 rules in 32 ms. Remains 86 /142 variables (removed 56) and now considering 87/167 (removed 80) transitions.
[2026-06-10 13:56:25] [INFO ] Flow matrix only has 66 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10894944840926735711.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6033984879083107577.kers'
[2026-06-10 13:56:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10894944840926735711.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6033984879083107577.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 66 rows 84 cols 155 entries
Finished phase 1 with 63 SingleSign rule and 0 generalized
[2026-06-10 13:56:25] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6033984879083107577.kers
Total runtime 0 ms.
[2026-06-10 13:56:25] [INFO ] Implicit Places using invariants in 48 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 85/142 places, 87/167 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 83 ms. Remains : 85/142 places, 87/167 transitions.
[2026-06-10 13:56:25] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:56:25] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:56:25] [INFO ] Input system was already deterministic with 87 transitions.
[2026-06-10 13:56:25] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:56:25] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:56:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality16408757608320697982.gal : 0 ms
[2026-06-10 13:56:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality4793916531981772857.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/CTLCardinality16408757608320697982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4793916531981772857.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,1.10621e+06,0.01532,4488,2,443,5,1394,6,0,357,797,0


Converting to forward existential form...Done !
original formula: EF(((tmp_12_2<=tmp_8_5) * (AG((array_5_4<1)) + AG((tmp_13_12>0)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (tmp_12_2<=tmp_8_5)) * !(E(TRUE U !((array_5_4<1)))))] != FALSE + [((FwdU(Init,TRUE) * (tm...216
Reverse transition relation is NOT exact ! Due to transitions t7, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t75,...309
(forward)formula 0,1,0.10544,9876,1,0,229,36260,197,99,2280,24174,199
FORMULA LastZero-PT-N12-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 167/167 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 134 transition count 157
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 134 transition count 157
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 127 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 127 transition count 148
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 120 transition count 136
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 120 transition count 136
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 113 transition count 127
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 113 transition count 127
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 106 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 106 transition count 115
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 100 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 100 transition count 108
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 95 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 95 transition count 99
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 90 transition count 93
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 90 transition count 93
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 108 place count 86 transition count 86
Iterating global reduction 0 with 4 rules applied. Total rules applied 112 place count 86 transition count 86
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 116 place count 82 transition count 81
Iterating global reduction 0 with 4 rules applied. Total rules applied 120 place count 82 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 123 place count 79 transition count 76
Iterating global reduction 0 with 3 rules applied. Total rules applied 126 place count 79 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 76 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 76 transition count 72
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 134 place count 74 transition count 69
Iterating global reduction 0 with 2 rules applied. Total rules applied 136 place count 74 transition count 69
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 138 place count 72 transition count 66
Iterating global reduction 0 with 2 rules applied. Total rules applied 140 place count 72 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 142 place count 70 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 144 place count 70 transition count 63
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 146 place count 68 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 148 place count 68 transition count 60
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 150 place count 66 transition count 57
Iterating global reduction 0 with 2 rules applied. Total rules applied 152 place count 66 transition count 57
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 154 place count 64 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 156 place count 64 transition count 54
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 62 transition count 51
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 62 transition count 51
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 161 place count 61 transition count 50
Iterating global reduction 0 with 1 rules applied. Total rules applied 162 place count 61 transition count 50
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 163 place count 60 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 164 place count 60 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 59 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 59 transition count 47
Applied a total of 166 rules in 11 ms. Remains 59 /142 variables (removed 83) and now considering 47/167 (removed 120) transitions.
[2026-06-10 13:56:26] [INFO ] Flow matrix only has 36 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5885206659296854547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2935575812004012896.kers'
[2026-06-10 13:56:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5885206659296854547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2935575812004012896.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 36 rows 48 cols 71 entries
Finished phase 1 with 25 SingleSign rule and 11 generalized
[2026-06-10 13:56:26] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2935575812004012896.kers
Total runtime 0 ms.
[2026-06-10 13:56:26] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-06-10 13:56:26] [INFO ] Flow matrix only has 36 transitions (discarded 11 similar events)
[2026-06-10 13:56:26] [INFO ] Invariant cache hit.
[2026-06-10 13:56:26] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-06-10 13:56:26] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 35 sub problems to find dead transitions.
[2026-06-10 13:56:26] [INFO ] Flow matrix only has 36 transitions (discarded 11 similar events)
[2026-06-10 13:56:26] [INFO ] Invariant cache hit.
[2026-06-10 13:56:26] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 36/95 variables, 59/82 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 12/94 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 0/95 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 94 constraints, problems are : Problem set: 0 solved, 35 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 59/59 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 36/95 variables, 59/82 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 12/94 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 35/129 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 0/95 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 129 constraints, problems are : Problem set: 0 solved, 35 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 59/59 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1055ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 1055ms
Starting structural reductions in LTL mode, iteration 1 : 59/142 places, 47/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1164 ms. Remains : 59/142 places, 47/167 transitions.
[2026-06-10 13:56:27] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:56:27] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:56:27] [INFO ] Input system was already deterministic with 47 transitions.
[2026-06-10 13:56:27] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:56:27] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:56:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality12968546645933337213.gal : 0 ms
[2026-06-10 13:56:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality7957232482454859518.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/CTLCardinality12968546645933337213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7957232482454859518.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,797161,0.00773,4192,2,170,5,649,6,0,238,389,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.008468,4192,1,0,6,649,7,1,366,389,1
FORMULA LastZero-PT-N12-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 142/142 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 134 transition count 157
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 134 transition count 157
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 128 transition count 149
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 128 transition count 149
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 122 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 122 transition count 139
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 116 transition count 131
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 116 transition count 131
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 110 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 110 transition count 121
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 105 transition count 115
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 105 transition count 115
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 100 transition count 106
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 100 transition count 106
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 95 transition count 100
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 95 transition count 100
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 96 place count 91 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 91 transition count 93
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 87 transition count 88
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 87 transition count 88
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 111 place count 84 transition count 83
Iterating global reduction 0 with 3 rules applied. Total rules applied 114 place count 84 transition count 83
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 117 place count 81 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 120 place count 81 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 122 place count 79 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 124 place count 79 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 77 transition count 73
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 77 transition count 73
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 130 place count 75 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 132 place count 75 transition count 70
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 134 place count 73 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 136 place count 73 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 138 place count 71 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 140 place count 71 transition count 64
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 142 place count 69 transition count 61
Iterating global reduction 0 with 2 rules applied. Total rules applied 144 place count 69 transition count 61
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 146 place count 67 transition count 58
Iterating global reduction 0 with 2 rules applied. Total rules applied 148 place count 67 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 149 place count 66 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 150 place count 66 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 151 place count 65 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 152 place count 65 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 153 place count 64 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 64 transition count 54
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 156 place count 63 transition count 53
Applied a total of 156 rules in 22 ms. Remains 63 /142 variables (removed 79) and now considering 53/167 (removed 114) transitions.
[2026-06-10 13:56:27] [INFO ] Flow matrix only has 40 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1549732795296444241.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8077349198754936979.kers'
[2026-06-10 13:56:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1549732795296444241.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8077349198754936979.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 40 rows 53 cols 82 entries
Finished phase 1 with 32 SingleSign rule and 8 generalized
[2026-06-10 13:56:27] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8077349198754936979.kers
Total runtime 0 ms.
[2026-06-10 13:56:27] [INFO ] Implicit Places using invariants in 41 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 62/142 places, 53/167 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 66 ms. Remains : 62/142 places, 53/167 transitions.
[2026-06-10 13:56:27] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:56:27] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:56:27] [INFO ] Input system was already deterministic with 53 transitions.
[2026-06-10 13:56:27] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:56:27] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:56:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality3592943252587919941.gal : 0 ms
[2026-06-10 13:56:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality2445670719729899762.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/CTLCardinality3592943252587919941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2445670719729899762.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,695466,0.012759,4244,2,204,5,752,6,0,251,442,0


Converting to forward existential form...Done !
original formula: EG((array_13_4<1))
=> equivalent forward existential formula: [FwdG(Init,(array_13_4<1))] != FALSE
Hit Full ! (commute/partial/dont) 51/0/2
(forward)formula 0,1,0.047825,6084,1,0,44,12271,18,4,1305,8388,42
FORMULA LastZero-PT-N12-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-06-10 13:56:27] [INFO ] Flatten gal took : 12 ms
[2026-06-10 13:56:27] [INFO ] Flatten gal took : 7 ms
Total runtime 85379 ms.

BK_STOP 1781099787459

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

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