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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.1K May 27 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 27 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 27 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 27 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 28K May 27 10:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 27 10:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 27 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 27 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 27 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 27 10:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 24K 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 486K 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-N10-CTLCardinality-2024-00
FORMULA_NAME LastZero-PT-N10-CTLCardinality-2024-01
FORMULA_NAME LastZero-PT-N10-CTLCardinality-2024-02
FORMULA_NAME LastZero-PT-N10-CTLCardinality-2024-03
FORMULA_NAME LastZero-PT-N10-CTLCardinality-2024-04
FORMULA_NAME LastZero-PT-N10-CTLCardinality-2024-05
FORMULA_NAME LastZero-PT-N10-CTLCardinality-2024-06
FORMULA_NAME LastZero-PT-N10-CTLCardinality-2024-07
FORMULA_NAME LastZero-PT-N10-CTLCardinality-2024-08
FORMULA_NAME LastZero-PT-N10-CTLCardinality-2024-09
FORMULA_NAME LastZero-PT-N10-CTLCardinality-2024-10
FORMULA_NAME LastZero-PT-N10-CTLCardinality-2024-11
FORMULA_NAME LastZero-PT-N10-CTLCardinality-2024-12
FORMULA_NAME LastZero-PT-N10-CTLCardinality-2024-13
FORMULA_NAME LastZero-PT-N10-CTLCardinality-2024-14
FORMULA_NAME LastZero-PT-N10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781099673872

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-N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-10 13:54:35] [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:54:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 13:54:35] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2026-06-10 13:54:35] [INFO ] Transformed 264 places.
[2026-06-10 13:54:35] [INFO ] Transformed 1531 transitions.
[2026-06-10 13:54:35] [INFO ] Parsed PT model containing 264 places and 1531 transitions and 4793 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 122 places in 8 ms
Reduce places removed 122 places and 981 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA LastZero-PT-N10-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 550/550 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 550
Applied a total of 1 rules in 21 ms. Remains 140 /141 variables (removed 1) and now considering 550/550 (removed 0) transitions.
[2026-06-10 13:54:35] [INFO ] Flow matrix only has 505 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-8174804568538111749.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11431829258312370421.kers'
[2026-06-10 13:54:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8174804568538111749.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11431829258312370421.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 505 rows 139 cols 1338 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-06-10 13:54:35] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11431829258312370421.kers
Total runtime 3 ms.
[2026-06-10 13:54:35] [INFO ] Implicit Places using invariants in 321 ms returned []
[2026-06-10 13:54:35] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
[2026-06-10 13:54:35] [INFO ] Invariant cache hit.
[2026-06-10 13:54:35] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-06-10 13:54:36] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1204 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2026-06-10 13:54:36] [INFO ] Flow matrix only has 505 transitions (discarded 45 similar events)
[2026-06-10 13:54:36] [INFO ] Invariant cache hit.
[2026-06-10 13:54:36] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
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 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 TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem 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 TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 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 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 TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem 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 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 TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
At refinement iteration 2 (OVERLAPS) 505/644 variables, 139/149 constraints. Problems are: Problem set: 384 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/644 variables, 110/259 constraints. Problems are: Problem set: 384 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/644 variables, 0/259 constraints. Problems are: Problem set: 384 solved, 156 unsolved
Problem TDEAD311 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/645 variables, 1/260 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/260 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/260 constraints. Problems are: Problem set: 385 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 260 constraints, problems are : Problem set: 385 solved, 155 unsolved in 22999 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 140/140 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 385 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 10/10 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 505/644 variables, 139/149 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/644 variables, 110/259 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/644 variables, 155/414 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 0/414 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 1/645 variables, 1/415 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/415 constraints. Problems are: Problem set: 385 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/415 constraints. Problems are: Problem set: 385 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 415 constraints, problems are : Problem set: 385 solved, 155 unsolved in 19637 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 140/140 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 155/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42870ms problems are : Problem set: 385 solved, 155 unsolved
Search for dead transitions found 385 dead transitions in 42893ms
Found 385 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 385 transitions
Dead transitions reduction (with SMT) removed 385 transitions
Starting structural reductions in LTL mode, iteration 1 : 140/141 places, 165/550 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 132 transition count 157
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 132 transition count 157
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 129 transition count 154
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 129 transition count 154
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 126 transition count 148
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 126 transition count 148
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 123 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 123 transition count 145
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 121 transition count 141
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 121 transition count 141
Applied a total of 38 rules in 17 ms. Remains 121 /140 variables (removed 19) and now considering 141/165 (removed 24) transitions.
[2026-06-10 13:55:19] [INFO ] Flow matrix only has 108 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14281254564493732728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10224603029313491651.kers'
[2026-06-10 13:55:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14281254564493732728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10224603029313491651.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 108 rows 120 cols 263 entries
Finished phase 1 with 100 SingleSign rule and 1 generalized
[2026-06-10 13:55:19] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10224603029313491651.kers
Total runtime 0 ms.
[2026-06-10 13:55:19] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-06-10 13:55:19] [INFO ] Flow matrix only has 108 transitions (discarded 33 similar events)
[2026-06-10 13:55:19] [INFO ] Invariant cache hit.
[2026-06-10 13:55:19] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-06-10 13:55:19] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/141 places, 141/550 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44397 ms. Remains : 121/141 places, 141/550 transitions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 141/141 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2026-06-10 13:55:19] [INFO ] Flow matrix only has 108 transitions (discarded 33 similar events)
[2026-06-10 13:55:19] [INFO ] Invariant cache hit.
[2026-06-10 13:55:19] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-06-10 13:55:19] [INFO ] Flow matrix only has 108 transitions (discarded 33 similar events)
[2026-06-10 13:55:19] [INFO ] Invariant cache hit.
[2026-06-10 13:55:19] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-06-10 13:55:20] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2026-06-10 13:55:20] [INFO ] Flow matrix only has 108 transitions (discarded 33 similar events)
[2026-06-10 13:55:20] [INFO ] Invariant cache hit.
[2026-06-10 13:55:20] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 1/121 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 108/229 variables, 121/187 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 49/236 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/229 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 236 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8853 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 46/65 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 1/121 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 108/229 variables, 121/190 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 49/239 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 131/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 0/229 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 370 constraints, problems are : Problem set: 0 solved, 131 unsolved in 7941 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16806ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 16806ms
Finished structural reductions in LTL mode , in 1 iterations and 17037 ms. Remains : 121/121 places, 141/141 transitions.
Support contains 35 out of 121 places after structural reductions.
[2026-06-10 13:55:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-06-10 13:55:37] [INFO ] Flatten gal took : 35 ms
[2026-06-10 13:55:37] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA LastZero-PT-N10-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 13:55:37] [INFO ] Flatten gal took : 14 ms
[2026-06-10 13:55:37] [INFO ] Input system was already deterministic with 141 transitions.
Support contains 16 out of 121 places (down from 35) after GAL structural reductions.
FORMULA LastZero-PT-N10-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N10-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1288 resets) in 929 ms. (43 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40003 steps (227 resets) in 200 ms. (199 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (227 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (228 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (227 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (229 resets) in 63 ms. (625 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (227 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (228 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (226 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
[2026-06-10 13:55:37] [INFO ] Flow matrix only has 108 transitions (discarded 33 similar events)
[2026-06-10 13:55:37] [INFO ] Invariant cache hit.
[2026-06-10 13:55:37] [INFO ] State equation strengthened by 49 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 58/69 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/73 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 68/141 variables, 73/85 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 13/98 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 32/173 variables, 32/130 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 10 (OVERLAPS) 55/228 variables, 47/177 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/228 variables, 7/184 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 4/188 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/188 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1/229 variables, 1/189 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/229 variables, 1/190 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/229 variables, 0/190 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/229 variables, 0/190 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 190 constraints, problems are : Problem set: 2 solved, 6 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 52/59 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 11/17 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/19 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 4/63 variables, 4/23 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 60/123 variables, 63/86 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 13/99 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 2/101 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 24/147 variables, 24/125 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 0/125 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 53/200 variables, 39/164 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 4/168 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 3/171 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/200 variables, 4/175 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/200 variables, 0/175 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 5/205 variables, 2/177 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/205 variables, 3/180 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/205 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 1/206 variables, 1/181 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/206 variables, 0/181 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 1/207 variables, 1/182 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/207 variables, 1/183 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/207 variables, 0/183 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 4/211 variables, 5/188 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/211 variables, 1/189 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/211 variables, 0/189 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 7/218 variables, 8/197 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/218 variables, 0/197 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 11/229 variables, 10/207 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/229 variables, 2/209 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/229 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 0/229 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 209 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1468 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 121/121 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1821ms problems are : Problem set: 2 solved, 6 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 46 ms.
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA LastZero-PT-N10-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 8 ms
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 8 ms
[2026-06-10 13:55:39] [INFO ] Input system was already deterministic with 141 transitions.
Computed a total of 121 stabilizing places and 141 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 121 transition count 141
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 141/141 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 113 transition count 133
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 113 transition count 133
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 106 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 106 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 99 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 99 transition count 112
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 92 transition count 99
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 92 transition count 99
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 85 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 85 transition count 91
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 79 transition count 80
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 79 transition count 80
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 73 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 73 transition count 73
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 100 place count 69 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 104 place count 69 transition count 66
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 108 place count 65 transition count 61
Iterating global reduction 0 with 4 rules applied. Total rules applied 112 place count 65 transition count 61
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 115 place count 62 transition count 56
Iterating global reduction 0 with 3 rules applied. Total rules applied 118 place count 62 transition count 56
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 120 place count 60 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 122 place count 60 transition count 54
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 58 transition count 50
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 58 transition count 50
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 128 place count 56 transition count 48
Iterating global reduction 0 with 2 rules applied. Total rules applied 130 place count 56 transition count 48
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 132 place count 54 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 134 place count 54 transition count 44
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 136 place count 52 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 138 place count 52 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 139 place count 51 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 51 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 50 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 50 transition count 39
Applied a total of 142 rules in 22 ms. Remains 50 /121 variables (removed 71) and now considering 39/141 (removed 102) transitions.
[2026-06-10 13:55:39] [INFO ] Flow matrix only has 30 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3224209262651626557.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-659414233715300942.kers'
[2026-06-10 13:55:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3224209262651626557.kers, --Pflows, --basisKERS=/tmp/petrispot-output-659414233715300942.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 30 rows 40 cols 59 entries
Finished phase 1 with 20 SingleSign rule and 10 generalized
[2026-06-10 13:55:39] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-659414233715300942.kers
Total runtime 2 ms.
[2026-06-10 13:55:39] [INFO ] Implicit Places using invariants in 41 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/121 places, 39/141 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 49/121 places, 39/141 transitions.
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:39] [INFO ] Input system was already deterministic with 39 transitions.
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality202902814271064486.gal : 2 ms
[2026-06-10 13:55:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality3797452621935190444.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/CTLCardinality202902814271064486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3797452621935190444.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,88573,0.046031,4016,2,142,5,537,6,0,198,323,0


Converting to forward existential form...Done !
original formula: (EG((lastzero_5<1)) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(EG((lastzero_5<1))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, Intersection with reachable at each st...214
(forward)formula 0,0,0.081231,6080,1,0,175,13967,99,74,1157,12030,175
FORMULA LastZero-PT-N10-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 141/141 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 114 transition count 134
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 114 transition count 134
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 108 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 108 transition count 123
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 102 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 102 transition count 116
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 96 transition count 105
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 96 transition count 105
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 90 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 90 transition count 98
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 85 transition count 89
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 85 transition count 89
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 80 transition count 83
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 80 transition count 83
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 77 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 77 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 74 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 74 transition count 74
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 72 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 72 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 71 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 71 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 70 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 70 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 69 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 69 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 68 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 68 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 67 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 67 transition count 64
Applied a total of 108 rules in 16 ms. Remains 67 /121 variables (removed 54) and now considering 64/141 (removed 77) transitions.
[2026-06-10 13:55:39] [INFO ] Flow matrix only has 48 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3567597706227686317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5100779625513404356.kers'
[2026-06-10 13:55:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3567597706227686317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5100779625513404356.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 48 rows 65 cols 111 entries
Finished phase 1 with 45 SingleSign rule and 2 generalized
[2026-06-10 13:55:39] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5100779625513404356.kers
Total runtime 0 ms.
[2026-06-10 13:55:39] [INFO ] Implicit Places using invariants in 44 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/121 places, 64/141 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 66/121 places, 64/141 transitions.
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:39] [INFO ] Input system was already deterministic with 64 transitions.
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:39] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality16064295347923001870.gal : 1 ms
[2026-06-10 13:55:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality8315733738187297789.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/CTLCardinality16064295347923001870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8315733738187297789.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,137862,0.011108,4344,2,286,5,971,6,0,275,561,0


Converting to forward existential form...Done !
original formula: E(!(EF(((process_10<=0)||(array_10_9>=1)))) U EX(EF((tmp_11_10>0))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,!(E(TRUE U ((process_10<=0)||(array_10_9>=1)))))),TRUE) * (tmp_11_10>0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62,...259
(forward)formula 0,1,0.053921,6660,1,0,160,16023,155,68,1843,10186,145
FORMULA LastZero-PT-N10-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 141/141 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 112 transition count 132
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 112 transition count 132
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 105 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 105 transition count 119
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 98 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 98 transition count 111
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 91 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 91 transition count 98
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 84 transition count 90
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 84 transition count 90
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 79 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 79 transition count 81
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 74 transition count 75
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 74 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 95 place count 71 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 71 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 68 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 68 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 106 place count 66 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 108 place count 66 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 65 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 65 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 64 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 64 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 63 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 63 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 60 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 60 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 59 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 59 transition count 53
Applied a total of 122 rules in 32 ms. Remains 59 /121 variables (removed 62) and now considering 53/141 (removed 88) transitions.
[2026-06-10 13:55:40] [INFO ] Flow matrix only has 39 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16879333104997923685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10161200922848574190.kers'
[2026-06-10 13:55:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16879333104997923685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10161200922848574190.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 39 rows 53 cols 86 entries
Finished phase 1 with 35 SingleSign rule and 4 generalized
[2026-06-10 13:55:40] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10161200922848574190.kers
Total runtime 0 ms.
[2026-06-10 13:55:40] [INFO ] Implicit Places using invariants in 83 ms returned [2, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 84 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/121 places, 53/141 transitions.
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 2 place count 56 transition count 52
Applied a total of 2 rules in 21 ms. Remains 56 /57 variables (removed 1) and now considering 52/53 (removed 1) transitions.
[2026-06-10 13:55:40] [INFO ] Flow matrix only has 38 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-538484897477836689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7318851664687379718.kers'
[2026-06-10 13:55:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-538484897477836689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7318851664687379718.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 38 rows 51 cols 83 entries
Finished phase 1 with 35 SingleSign rule and 3 generalized
[2026-06-10 13:55:40] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7318851664687379718.kers
Total runtime 0 ms.
[2026-06-10 13:55:40] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-06-10 13:55:40] [INFO ] Flow matrix only has 38 transitions (discarded 14 similar events)
[2026-06-10 13:55:40] [INFO ] Invariant cache hit.
[2026-06-10 13:55:40] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-06-10 13:55:40] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 56/121 places, 52/141 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 280 ms. Remains : 56/121 places, 52/141 transitions.
[2026-06-10 13:55:40] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:40] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:40] [INFO ] Input system was already deterministic with 52 transitions.
[2026-06-10 13:55:40] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:40] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13388728360036992927.gal : 1 ms
[2026-06-10 13:55:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14872236550096900230.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13388728360036992927.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14872236550096900230.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14872236550096900230.prop.
SDD proceeding with computation,1 properties remain. new max is 4
RANDOM walk for 40000 steps (1376 resets) in 348 ms. (114 steps per ms) remains 1/1 properties
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 78
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :78 after 1500
Reachability property LastZero-PT-N10-CTLCardinality-2024-05 is true.
FORMULA LastZero-PT-N10-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,71256,0.046896,4332,2,203,11,875,6,0,231,352,0
Total reachable state count : 71256

Verifying 1 reachability properties.
Reachability property LastZero-PT-N10-CTLCardinality-2024-05 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LastZero-PT-N10-CTLCardinality-2024-05,6,0.047437,4568,2,65,11,875,7,0,233,352,0
BEST_FIRST walk for 40003 steps (251 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 123031 steps, run visited all 1 properties in 151 ms. (steps per millisecond=814 )
Probabilistic random walk after 123031 steps, saw 19169 distinct states, run finished after 155 ms. (steps per millisecond=793 ) properties seen :1
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 141/141 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 113 transition count 133
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 113 transition count 133
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 107 transition count 122
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 107 transition count 122
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 101 transition count 115
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 101 transition count 115
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 95 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 95 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 89 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 89 transition count 97
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 84 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 84 transition count 88
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 79 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 79 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 76 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 76 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 73 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 73 transition count 73
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 70 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 70 transition count 68
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 68 transition count 66
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 68 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 106 place count 66 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 108 place count 66 transition count 62
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 64 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 64 transition count 60
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 62 transition count 56
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 62 transition count 56
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 118 place count 60 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 60 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 59 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 59 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 58 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 58 transition count 51
Applied a total of 124 rules in 21 ms. Remains 58 /121 variables (removed 63) and now considering 51/141 (removed 90) transitions.
[2026-06-10 13:55:40] [INFO ] Flow matrix only has 39 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4181870306127547709.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6308441129979419252.kers'
[2026-06-10 13:55:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4181870306127547709.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6308441129979419252.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 39 rows 51 cols 84 entries
Finished phase 1 with 33 SingleSign rule and 5 generalized
[2026-06-10 13:55:40] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6308441129979419252.kers
Total runtime 1 ms.
[2026-06-10 13:55:40] [INFO ] Implicit Places using invariants in 72 ms returned [2, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 56/121 places, 51/141 transitions.
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 2 place count 55 transition count 50
Applied a total of 2 rules in 2 ms. Remains 55 /56 variables (removed 1) and now considering 50/51 (removed 1) transitions.
[2026-06-10 13:55:40] [INFO ] Flow matrix only has 38 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17279996695211825426.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3290630220185553785.kers'
[2026-06-10 13:55:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17279996695211825426.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3290630220185553785.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 38 rows 49 cols 81 entries
Finished phase 1 with 33 SingleSign rule and 4 generalized
[2026-06-10 13:55:40] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3290630220185553785.kers
Total runtime 3 ms.
[2026-06-10 13:55:40] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-06-10 13:55:40] [INFO ] Flow matrix only has 38 transitions (discarded 12 similar events)
[2026-06-10 13:55:40] [INFO ] Invariant cache hit.
[2026-06-10 13:55:40] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-06-10 13:55:40] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 55/121 places, 50/141 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 319 ms. Remains : 55/121 places, 50/141 transitions.
[2026-06-10 13:55:40] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:55:40] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:40] [INFO ] Input system was already deterministic with 50 transitions.
[2026-06-10 13:55:40] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:40] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality7759954741694037506.gal : 0 ms
[2026-06-10 13:55:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality12356371330025770758.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/CTLCardinality7759954741694037506.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12356371330025770758.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,71199,0.008622,4216,2,207,5,725,6,0,226,426,0


Converting to forward existential form...Done !
original formula: AG(AF((tmp_9_6<=process_3)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((tmp_9_6<=process_3)))] = FALSE
dead was empty
(forward)formula 0,1,0.046986,5568,1,0,35,8804,13,2,1112,5736,33
FORMULA LastZero-PT-N10-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 141/141 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 112 transition count 132
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 112 transition count 132
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 105 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 105 transition count 119
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 98 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 98 transition count 111
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 91 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 91 transition count 98
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 84 transition count 90
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 84 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 78 transition count 79
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 78 transition count 79
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 72 transition count 72
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 72 transition count 72
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 100 place count 68 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 104 place count 68 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 107 place count 65 transition count 61
Iterating global reduction 0 with 3 rules applied. Total rules applied 110 place count 65 transition count 61
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 113 place count 62 transition count 56
Iterating global reduction 0 with 3 rules applied. Total rules applied 116 place count 62 transition count 56
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 118 place count 60 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 60 transition count 54
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 122 place count 58 transition count 50
Iterating global reduction 0 with 2 rules applied. Total rules applied 124 place count 58 transition count 50
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 56 transition count 48
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 56 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 55 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 55 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 131 place count 54 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 132 place count 54 transition count 45
Applied a total of 132 rules in 26 ms. Remains 54 /121 variables (removed 67) and now considering 45/141 (removed 96) transitions.
[2026-06-10 13:55:41] [INFO ] Flow matrix only has 35 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18427980662040873946.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11269717883615965625.kers'
[2026-06-10 13:55:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18427980662040873946.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11269717883615965625.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 35 rows 45 cols 72 entries
Finished phase 1 with 27 SingleSign rule and 7 generalized
[2026-06-10 13:55:41] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11269717883615965625.kers
Total runtime 0 ms.
[2026-06-10 13:55:41] [INFO ] Implicit Places using invariants in 151 ms returned [2, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 152 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 52/121 places, 45/141 transitions.
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 2 place count 51 transition count 44
Applied a total of 2 rules in 4 ms. Remains 51 /52 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2026-06-10 13:55:41] [INFO ] Flow matrix only has 34 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9483829179332638760.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9776455912200276617.kers'
[2026-06-10 13:55:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9483829179332638760.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9776455912200276617.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 34 rows 43 cols 69 entries
Finished phase 1 with 27 SingleSign rule and 6 generalized
[2026-06-10 13:55:41] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9776455912200276617.kers
Total runtime 0 ms.
[2026-06-10 13:55:41] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-06-10 13:55:41] [INFO ] Flow matrix only has 34 transitions (discarded 10 similar events)
[2026-06-10 13:55:41] [INFO ] Invariant cache hit.
[2026-06-10 13:55:41] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-06-10 13:55:41] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 51/121 places, 44/141 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 302 ms. Remains : 51/121 places, 44/141 transitions.
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:55:41] [INFO ] Input system was already deterministic with 44 transitions.
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality17827347700933690499.gal : 0 ms
[2026-06-10 13:55:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality743421884715893013.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/CTLCardinality17827347700933690499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality743421884715893013.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,67192,0.010437,4164,2,162,5,607,6,0,208,360,0


Converting to forward existential form...Done !
original formula: EF(AG((tmp_5_5<=0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((tmp_5_5<=0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, Intersection with ...234
(forward)formula 0,1,0.035472,5632,1,0,125,11540,110,55,1244,8397,111
FORMULA LastZero-PT-N10-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 141/141 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 113 transition count 133
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 113 transition count 133
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 107 transition count 122
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 107 transition count 122
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 101 transition count 115
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 101 transition count 115
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 95 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 95 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 89 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 89 transition count 97
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 84 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 84 transition count 88
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 79 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 79 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 85 place count 76 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 88 place count 76 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 91 place count 73 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 94 place count 73 transition count 73
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 70 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 70 transition count 68
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 68 transition count 66
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 68 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 106 place count 66 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 108 place count 66 transition count 62
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 64 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 64 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 62 transition count 57
Applied a total of 116 rules in 28 ms. Remains 62 /121 variables (removed 59) and now considering 57/141 (removed 84) transitions.
[2026-06-10 13:55:41] [INFO ] Flow matrix only has 43 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2531890896146230138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5643161726109017276.kers'
[2026-06-10 13:55:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2531890896146230138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5643161726109017276.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 43 rows 57 cols 96 entries
Finished phase 1 with 39 SingleSign rule and 3 generalized
[2026-06-10 13:55:41] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5643161726109017276.kers
Total runtime 1 ms.
[2026-06-10 13:55:41] [INFO ] Implicit Places using invariants in 41 ms returned [2, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 60/121 places, 57/141 transitions.
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 2 place count 59 transition count 56
Applied a total of 2 rules in 2 ms. Remains 59 /60 variables (removed 1) and now considering 56/57 (removed 1) transitions.
[2026-06-10 13:55:41] [INFO ] Flow matrix only has 42 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11385568091229499663.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3917530748643607295.kers'
[2026-06-10 13:55:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11385568091229499663.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3917530748643607295.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 42 rows 55 cols 93 entries
Finished phase 1 with 39 SingleSign rule and 2 generalized
[2026-06-10 13:55:41] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3917530748643607295.kers
Total runtime 0 ms.
[2026-06-10 13:55:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-06-10 13:55:41] [INFO ] Flow matrix only has 42 transitions (discarded 14 similar events)
[2026-06-10 13:55:41] [INFO ] Invariant cache hit.
[2026-06-10 13:55:41] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-06-10 13:55:41] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 59/121 places, 56/141 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 165 ms. Remains : 59/121 places, 56/141 transitions.
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 11 ms
[2026-06-10 13:55:41] [INFO ] Input system was already deterministic with 56 transitions.
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality16404910673229451977.gal : 0 ms
[2026-06-10 13:55:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality763676705667385449.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/CTLCardinality16404910673229451977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality763676705667385449.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,68890,0.009364,4276,2,239,5,828,6,0,244,486,0


Converting to forward existential form...Done !
original formula: EG((tmp_9_9<=0))
=> equivalent forward existential formula: [FwdG(Init,(tmp_9_9<=0))] != FALSE
Hit Full ! (commute/partial/dont) 54/0/2
(forward)formula 0,1,0.035726,5616,1,0,35,8801,18,3,1297,5877,35
FORMULA LastZero-PT-N10-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 121/121 places, 141/141 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 112 transition count 132
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 112 transition count 132
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 105 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 105 transition count 119
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 98 transition count 111
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 98 transition count 111
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 91 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 91 transition count 98
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 85 transition count 91
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 85 transition count 91
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 80 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 80 transition count 82
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 75 transition count 76
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 75 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 72 transition count 71
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 72 transition count 71
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 69 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 69 transition count 67
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 105 place count 66 transition count 62
Iterating global reduction 0 with 3 rules applied. Total rules applied 108 place count 66 transition count 62
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 64 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 64 transition count 60
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 114 place count 62 transition count 56
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 62 transition count 56
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 118 place count 60 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 120 place count 60 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 59 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 59 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 58 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 58 transition count 51
Applied a total of 124 rules in 15 ms. Remains 58 /121 variables (removed 63) and now considering 51/141 (removed 90) transitions.
[2026-06-10 13:55:41] [INFO ] Flow matrix only has 39 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17307852090648671321.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13817351526493304119.kers'
[2026-06-10 13:55:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17307852090648671321.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13817351526493304119.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 39 rows 51 cols 84 entries
Finished phase 1 with 33 SingleSign rule and 5 generalized
[2026-06-10 13:55:41] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13817351526493304119.kers
Total runtime 0 ms.
[2026-06-10 13:55:41] [INFO ] Implicit Places using invariants in 38 ms returned [2, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 56/121 places, 51/141 transitions.
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 2 place count 55 transition count 50
Applied a total of 2 rules in 3 ms. Remains 55 /56 variables (removed 1) and now considering 50/51 (removed 1) transitions.
[2026-06-10 13:55:41] [INFO ] Flow matrix only has 38 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4482557982855485772.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12912444874304498884.kers'
[2026-06-10 13:55:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4482557982855485772.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12912444874304498884.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 38 rows 49 cols 81 entries
Finished phase 1 with 33 SingleSign rule and 4 generalized
[2026-06-10 13:55:41] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12912444874304498884.kers
Total runtime 0 ms.
[2026-06-10 13:55:41] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-06-10 13:55:41] [INFO ] Flow matrix only has 38 transitions (discarded 12 similar events)
[2026-06-10 13:55:41] [INFO ] Invariant cache hit.
[2026-06-10 13:55:41] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-06-10 13:55:41] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 55/121 places, 50/141 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 175 ms. Remains : 55/121 places, 50/141 transitions.
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:41] [INFO ] Input system was already deterministic with 50 transitions.
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality8263734046222788410.gal : 1 ms
[2026-06-10 13:55:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality5457285447316829805.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/CTLCardinality8263734046222788410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5457285447316829805.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,68711,0.009072,4220,2,277,5,921,6,0,226,508,0


Converting to forward existential form...Done !
original formula: AF((tmp_7_7>=1))
=> equivalent forward existential formula: [FwdG(Init,!((tmp_7_7>=1)))] = FALSE
Hit Full ! (commute/partial/dont) 48/0/2
(forward)formula 0,0,0.037659,5764,1,0,35,10008,19,3,1186,6561,35
FORMULA LastZero-PT-N10-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 141/141 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 113 transition count 133
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 113 transition count 133
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 106 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 106 transition count 120
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 100 transition count 113
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 100 transition count 113
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 94 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 94 transition count 102
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 89 transition count 96
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 89 transition count 96
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 85 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 85 transition count 89
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 81 transition count 84
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 81 transition count 84
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 78 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 78 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 76 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 76 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 74 transition count 73
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 74 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 73 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 73 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 72 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 72 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 71 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 71 transition count 69
Applied a total of 100 rules in 5 ms. Remains 71 /121 variables (removed 50) and now considering 69/141 (removed 72) transitions.
[2026-06-10 13:55:41] [INFO ] Flow matrix only has 54 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13076696831376229763.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7106520622421286980.kers'
[2026-06-10 13:55:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13076696831376229763.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7106520622421286980.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 54 rows 66 cols 123 entries
Finished phase 1 with 46 SingleSign rule and 5 generalized
[2026-06-10 13:55:41] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7106520622421286980.kers
Total runtime 0 ms.
[2026-06-10 13:55:41] [INFO ] Implicit Places using invariants in 50 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/121 places, 69/141 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 70/121 places, 69/141 transitions.
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:41] [INFO ] Input system was already deterministic with 69 transitions.
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 3 ms
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 2 ms
[2026-06-10 13:55:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality5923120390890805873.gal : 1 ms
[2026-06-10 13:55:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality6365185419885428392.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/CTLCardinality5923120390890805873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6365185419885428392.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,213922,0.01895,4708,2,1000,5,3399,6,0,294,1838,0


Converting to forward existential form...Done !
original formula: EF(((tmp_7_6>tmp_7_7) + EX((tmp_8_4<1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (tmp_7_6>tmp_7_7))] != FALSE + [(EY(FwdU(Init,TRUE)) * (tmp_8_4<1))] != FALSE)
(forward)formula 0,1,0.019609,4972,1,0,7,3399,8,1,301,1838,1
FORMULA LastZero-PT-N10-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-06-10 13:55:41] [INFO ] Flatten gal took : 4 ms
[2026-06-10 13:55:42] [INFO ] Flatten gal took : 5 ms
Total runtime 66942 ms.

BK_STOP 1781099742049

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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-N10"
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-N10, 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-178024402800089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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