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.r066-tall-177946967700361.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 CO4-PT-11, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700361
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.9K Mar 6 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 6 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 6 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 13:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Mar 6 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 6 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 6 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 132K Mar 3 18:30 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 CO4-PT-11-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-11-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779522656286

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 07:50:57] [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-05-23 07:50:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:50:57] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2026-05-23 07:50:57] [INFO ] Transformed 545 places.
[2026-05-23 07:50:57] [INFO ] Transformed 617 transitions.
[2026-05-23 07:50:57] [INFO ] Found NUPN structural information;
[2026-05-23 07:50:57] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 157 places in 8 ms
Reduce places removed 157 places and 177 transitions.
Support contains 48 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 440/440 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 378 transition count 438
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 61 place count 329 transition count 387
Iterating global reduction 1 with 49 rules applied. Total rules applied 110 place count 329 transition count 387
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 144 place count 295 transition count 353
Iterating global reduction 1 with 34 rules applied. Total rules applied 178 place count 295 transition count 353
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 180 place count 295 transition count 351
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 196 place count 279 transition count 335
Iterating global reduction 2 with 16 rules applied. Total rules applied 212 place count 279 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 213 place count 279 transition count 334
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 222 place count 270 transition count 325
Iterating global reduction 3 with 9 rules applied. Total rules applied 231 place count 270 transition count 325
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 233 place count 270 transition count 323
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 236 place count 267 transition count 320
Iterating global reduction 4 with 3 rules applied. Total rules applied 239 place count 267 transition count 320
Applied a total of 239 rules in 109 ms. Remains 267 /388 variables (removed 121) and now considering 320/440 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17326022012905697371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9045292667924758252.kers'
[2026-05-23 07:50:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17326022012905697371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9045292667924758252.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 320 rows 267 cols 720 entries
Finished phase 1 with 263 SingleSign rule and 0 generalized
[2026-05-23 07:50:57] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9045292667924758252.kers
Total runtime 2 ms.
[2026-05-23 07:50:58] [INFO ] Implicit Places using invariants in 412 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 457 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/388 places, 320/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 266 /266 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 587 ms. Remains : 266/388 places, 320/440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 320/320 transitions.
Applied a total of 0 rules in 6 ms. Remains 266 /266 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2000235249015783064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-558234901810265690.kers'
[2026-05-23 07:50:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2000235249015783064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-558234901810265690.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 320 rows 266 cols 718 entries
Finished phase 1 with 263 SingleSign rule and 0 generalized
[2026-05-23 07:50:58] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-558234901810265690.kers
Total runtime 1 ms.
[2026-05-23 07:50:58] [INFO ] Implicit Places using invariants in 281 ms returned []
[2026-05-23 07:50:58] [INFO ] Invariant cache hit.
[2026-05-23 07:50:58] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2026-05-23 07:50:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/584 variables, 264/267 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 2/586 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/586 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/586 variables, and 271 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 320/584 variables, 264/269 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 314/583 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 2/586 variables, 2/585 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/586 variables, and 590 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Finished structural reductions in LTL mode , in 1 iterations and 60698 ms. Remains : 266/266 places, 320/320 transitions.
Support contains 48 out of 266 places after structural reductions.
[2026-05-23 07:51:59] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-05-23 07:51:59] [INFO ] Flatten gal took : 46 ms
[2026-05-23 07:51:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-11-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 07:51:59] [INFO ] Flatten gal took : 19 ms
[2026-05-23 07:51:59] [INFO ] Input system was already deterministic with 320 transitions.
Support contains 32 out of 266 places (down from 48) after GAL structural reductions.
RANDOM walk for 40000 steps (53 resets) in 1320 ms. (30 steps per ms) remains 16/22 properties
BEST_FIRST walk for 4001 steps (29 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (27 resets) in 80 ms. (49 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (37 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (21 resets) in 70 ms. (56 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (25 resets) in 43 ms. (90 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4001 steps (20 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (37 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (35 resets) in 22 ms. (173 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (24 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (24 resets) in 38 ms. (102 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4001 steps (27 resets) in 18 ms. (210 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4003 steps (42 resets) in 9 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (32 resets) in 32 ms. (121 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (36 resets) in 12 ms. (308 steps per ms) remains 13/13 properties
[2026-05-23 07:51:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 20/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 3/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 76/119 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 150/269 variables, 53/99 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 183/452 variables, 88/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 99/551 variables, 61/248 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/551 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 24/575 variables, 13/261 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/575 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 11/586 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/586 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/586 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 586/586 variables, and 269 constraints, problems are : Problem set: 0 solved, 13 unsolved in 794 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 20/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 3/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 76/119 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 150/269 variables, 53/99 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 13/112 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 183/452 variables, 88/200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 99/551 variables, 61/261 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/551 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 24/575 variables, 13/274 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/575 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 16 (OVERLAPS) 11/586 variables, 8/282 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/586 variables, 0/282 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/586 variables, 0/282 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 586/586 variables, and 282 constraints, problems are : Problem set: 1 solved, 12 unsolved in 1862 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2665ms problems are : Problem set: 1 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 10 properties in 1980 ms.
Support contains 2 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 320/320 transitions.
Graph (trivial) has 269 edges and 266 vertex of which 3 / 266 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 399 edges and 264 vertex of which 247 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 139 rules applied. Total rules applied 141 place count 247 transition count 165
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 1 with 124 rules applied. Total rules applied 265 place count 123 transition count 165
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 265 place count 123 transition count 152
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 291 place count 110 transition count 152
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 300 place count 101 transition count 143
Iterating global reduction 2 with 9 rules applied. Total rules applied 309 place count 101 transition count 143
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 309 place count 101 transition count 140
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 315 place count 98 transition count 140
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 319 place count 94 transition count 136
Iterating global reduction 2 with 4 rules applied. Total rules applied 323 place count 94 transition count 136
Performed 38 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 399 place count 56 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 402 place count 56 transition count 86
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 405 place count 53 transition count 83
Iterating global reduction 3 with 3 rules applied. Total rules applied 408 place count 53 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 409 place count 52 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 410 place count 52 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 411 place count 52 transition count 81
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 4 with 2 rules applied. Total rules applied 413 place count 51 transition count 80
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 121 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 5 rules applied. Total rules applied 418 place count 50 transition count 76
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 421 place count 47 transition count 73
Iterating global reduction 5 with 3 rules applied. Total rules applied 424 place count 47 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 425 place count 47 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 429 place count 45 transition count 70
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 431 place count 45 transition count 68
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 433 place count 43 transition count 66
Iterating global reduction 7 with 2 rules applied. Total rules applied 435 place count 43 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 437 place count 43 transition count 64
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 459 place count 32 transition count 66
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 477 place count 32 transition count 48
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 485 place count 24 transition count 40
Iterating global reduction 9 with 8 rules applied. Total rules applied 493 place count 24 transition count 40
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 501 place count 24 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 503 place count 24 transition count 30
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 504 place count 23 transition count 29
Iterating global reduction 10 with 1 rules applied. Total rules applied 505 place count 23 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 506 place count 23 transition count 28
Free-agglomeration rule applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 510 place count 23 transition count 24
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 515 place count 19 transition count 23
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 516 place count 19 transition count 23
Graph (complete) has 41 edges and 19 vertex of which 18 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 517 place count 18 transition count 23
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 518 place count 18 transition count 22
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 519 place count 18 transition count 22
Graph (complete) has 38 edges and 18 vertex of which 17 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 520 place count 17 transition count 22
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 521 place count 17 transition count 21
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 522 place count 17 transition count 21
Graph (complete) has 35 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 523 place count 16 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 524 place count 16 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 525 place count 15 transition count 19
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t64.t70.t290.t300.t61 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 528 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 10 edges and 11 vertex of which 3 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 3 rules applied. Total rules applied 531 place count 9 transition count 15
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 5 rules applied. Total rules applied 536 place count 8 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 2 Pre rules applied. Total rules applied 536 place count 8 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 540 place count 6 transition count 9
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 21 with 2 rules applied. Total rules applied 542 place count 5 transition count 8
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 543 place count 5 transition count 7
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 22 with 2 rules applied. Total rules applied 545 place count 5 transition count 7
Applied a total of 545 rules in 60 ms. Remains 5 /266 variables (removed 261) and now considering 7/320 (removed 313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 5/266 places, 7/320 transitions.
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2026-05-23 07:52:04] [INFO ] Flatten gal took : 15 ms
[2026-05-23 07:52:04] [INFO ] Flatten gal took : 14 ms
[2026-05-23 07:52:04] [INFO ] Input system was already deterministic with 320 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 402 edges and 266 vertex of which 257 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 320/320 transitions.
Graph (trivial) has 268 edges and 266 vertex of which 3 / 266 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 400 edges and 264 vertex of which 255 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 123 place count 254 transition count 187
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 244 place count 133 transition count 187
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 244 place count 133 transition count 174
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 270 place count 120 transition count 174
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 280 place count 110 transition count 164
Iterating global reduction 2 with 10 rules applied. Total rules applied 290 place count 110 transition count 164
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 290 place count 110 transition count 160
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 298 place count 106 transition count 160
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 303 place count 101 transition count 155
Iterating global reduction 2 with 5 rules applied. Total rules applied 308 place count 101 transition count 155
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 334 place count 88 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 339 place count 88 transition count 137
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 342 place count 86 transition count 136
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 345 place count 83 transition count 133
Iterating global reduction 4 with 3 rules applied. Total rules applied 348 place count 83 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 357 place count 83 transition count 124
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 361 place count 83 transition count 120
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 365 place count 79 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 365 place count 79 transition count 119
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 367 place count 78 transition count 119
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 6 with 2 rules applied. Total rules applied 369 place count 77 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 371 place count 75 transition count 116
Applied a total of 371 rules in 48 ms. Remains 75 /266 variables (removed 191) and now considering 116/320 (removed 204) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6732954593815106843.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10312864843565743484.kers'
[2026-05-23 07:52:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6732954593815106843.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10312864843565743484.kers]
Normalized transition count is 115 out of 116 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 115 rows 75 cols 276 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-23 07:52:04] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10312864843565743484.kers
Total runtime 0 ms.
[2026-05-23 07:52:04] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-23 07:52:04] [INFO ] Invariant cache hit.
[2026-05-23 07:52:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:52:04] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2026-05-23 07:52:04] [INFO ] Redundant transitions in 3 ms returned []
Running 106 sub problems to find dead transitions.
[2026-05-23 07:52:04] [INFO ] Invariant cache hit.
[2026-05-23 07:52:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 115/190 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 1/191 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/191 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 79 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3235 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 115/190 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 106/184 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 1/191 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 185 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4706 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7955ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 7956ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/266 places, 116/320 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8110 ms. Remains : 75/266 places, 116/320 transitions.
[2026-05-23 07:52:12] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:52:12] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:52:12] [INFO ] Input system was already deterministic with 116 transitions.
[2026-05-23 07:52:12] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:52:12] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:52:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality2874790452553569901.gal : 2 ms
[2026-05-23 07:52:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality9201158749224646815.ctl : 6 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/CTLCardinality2874790452553569901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9201158749224646815.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,15391,0.030437,4484,2,220,5,1996,6,0,408,1792,0


Converting to forward existential form...Done !
original formula: AG(AF((EF((p352==0)) + ((p414==0)&&(p541!=0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(TRUE U (p352==0)) + ((p414==0)&&(p541!=0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t25, t38, t43, t48, t113, Intersection with reachable at each step enabled. (destroyed/...192
(forward)formula 0,1,0.107864,7936,1,0,155,19173,259,83,2515,15006,244
FORMULA CO4-PT-11-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 320/320 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 264 transition count 319
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 242 transition count 297
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 242 transition count 297
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 65 place count 224 transition count 279
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 224 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 224 transition count 278
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 214 transition count 268
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 214 transition count 268
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 209 transition count 263
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 209 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 209 transition count 262
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 206 transition count 259
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 205 transition count 258
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 205 transition count 258
Applied a total of 123 rules in 19 ms. Remains 205 /266 variables (removed 61) and now considering 258/320 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5317309719371528248.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2334037872708783607.kers'
[2026-05-23 07:52:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5317309719371528248.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2334037872708783607.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 205 cols 580 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-23 07:52:13] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2334037872708783607.kers
Total runtime 1 ms.
[2026-05-23 07:52:13] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-23 07:52:13] [INFO ] Invariant cache hit.
[2026-05-23 07:52:13] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2026-05-23 07:52:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 16141 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 468 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46187ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 46188ms
Starting structural reductions in LTL mode, iteration 1 : 205/266 places, 258/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46395 ms. Remains : 205/266 places, 258/320 transitions.
[2026-05-23 07:52:59] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:52:59] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:52:59] [INFO ] Input system was already deterministic with 258 transitions.
[2026-05-23 07:52:59] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:52:59] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:52:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality3558838979606249203.gal : 3 ms
[2026-05-23 07:52:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality7641362601390488557.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/CTLCardinality3558838979606249203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7641362601390488557.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,459604,0.091555,7840,2,1308,5,13523,6,0,1076,14467,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.102205,7840,1,0,6,13523,7,1,1269,14467,1
FORMULA CO4-PT-11-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 320/320 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 264 transition count 319
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 242 transition count 297
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 242 transition count 297
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 65 place count 224 transition count 279
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 224 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 224 transition count 278
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 214 transition count 268
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 214 transition count 268
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 209 transition count 263
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 209 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 209 transition count 262
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 206 transition count 259
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 205 transition count 258
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 205 transition count 258
Applied a total of 123 rules in 22 ms. Remains 205 /266 variables (removed 61) and now considering 258/320 (removed 62) transitions.
[2026-05-23 07:52:59] [INFO ] Invariant cache hit.
[2026-05-23 07:52:59] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-23 07:52:59] [INFO ] Invariant cache hit.
[2026-05-23 07:52:59] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 205/266 places, 258/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 205/266 places, 258/320 transitions.
[2026-05-23 07:52:59] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:52:59] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:52:59] [INFO ] Input system was already deterministic with 258 transitions.
[2026-05-23 07:52:59] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:52:59] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:52:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality8062479425018553382.gal : 1 ms
[2026-05-23 07:52:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality7613692771529557097.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/CTLCardinality8062479425018553382.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7613692771529557097.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,459604,0.09009,7812,2,1308,5,13523,6,0,1076,14467,0


Converting to forward existential form...Done !
original formula: EF(AX(EG(A((p339==0) U (p337==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG(!((E(!((p337==0)) U (!((p339==0)) * !((p337==0)))) + EG(!((p337==0))))))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.07177,173960,1,0,951,821525,549,561,6019,1.06186e+06,1206
FORMULA CO4-PT-11-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 320/320 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 264 transition count 319
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 242 transition count 297
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 242 transition count 297
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 65 place count 224 transition count 279
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 224 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 224 transition count 278
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 214 transition count 268
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 214 transition count 268
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 209 transition count 263
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 209 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 209 transition count 262
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 206 transition count 259
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 205 transition count 258
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 205 transition count 258
Applied a total of 123 rules in 17 ms. Remains 205 /266 variables (removed 61) and now considering 258/320 (removed 62) transitions.
[2026-05-23 07:53:04] [INFO ] Invariant cache hit.
[2026-05-23 07:53:05] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-23 07:53:05] [INFO ] Invariant cache hit.
[2026-05-23 07:53:05] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 205/266 places, 258/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 205/266 places, 258/320 transitions.
[2026-05-23 07:53:05] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:53:05] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:53:05] [INFO ] Input system was already deterministic with 258 transitions.
[2026-05-23 07:53:05] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:53:05] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:53:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality9085675648909600712.gal : 1 ms
[2026-05-23 07:53:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality11171184347297426400.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/CTLCardinality9085675648909600712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11171184347297426400.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,459604,0.093133,7844,2,1308,5,13523,6,0,1076,14467,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.103528,7844,1,0,6,13523,7,1,1269,14467,1
FORMULA CO4-PT-11-CTLCardinality-2024-03 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 : 266/266 places, 320/320 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 264 transition count 319
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 247 transition count 302
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 247 transition count 302
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 234 transition count 289
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 234 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 234 transition count 288
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 228 transition count 282
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 228 transition count 282
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 225 transition count 279
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 225 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 225 transition count 278
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 224 transition count 277
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 224 transition count 277
Applied a total of 85 rules in 24 ms. Remains 224 /266 variables (removed 42) and now considering 277/320 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13023351976229810423.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9025765056395747544.kers'
[2026-05-23 07:53:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13023351976229810423.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9025765056395747544.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 277 rows 224 cols 622 entries
Finished phase 1 with 221 SingleSign rule and 0 generalized
[2026-05-23 07:53:05] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9025765056395747544.kers
Total runtime 2 ms.
[2026-05-23 07:53:05] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-23 07:53:05] [INFO ] Invariant cache hit.
[2026-05-23 07:53:05] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2026-05-23 07:53:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 277/501 variables, 224/227 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/501 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 229 constraints, problems are : Problem set: 0 solved, 276 unsolved in 18407 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/224 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 277/501 variables, 224/229 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 276/505 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/501 variables, and 506 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48439ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 48440ms
Starting structural reductions in LTL mode, iteration 1 : 224/266 places, 277/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48647 ms. Remains : 224/266 places, 277/320 transitions.
[2026-05-23 07:53:53] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:53:53] [INFO ] Flatten gal took : 19 ms
[2026-05-23 07:53:53] [INFO ] Input system was already deterministic with 277 transitions.
[2026-05-23 07:53:54] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:53:54] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:53:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality13181215399088014677.gal : 2 ms
[2026-05-23 07:53:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality6065234624247284893.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/CTLCardinality13181215399088014677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6065234624247284893.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,515236,0.222858,12300,2,1411,5,28654,6,0,1171,39305,0


Converting to forward existential form...Done !
original formula: ((AX(EF(AX((p359==0)))) * AG(((EF((p409==1)) + AX(FALSE)) * AX((p308==0))))) * (AF((p332==1)) * AF((EX(AF((p323==0))) + ((p213==0)&&(p428...164
=> equivalent forward existential formula: (([(EY(Init) * !(E(TRUE U !(EX(!((p359==0)))))))] = FALSE * ([(EY((FwdU(Init,TRUE) * !(E(TRUE U (p409==1))))) * ...340
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t16, t17, t18, t24, t32, t41, t43, t44, t45, t46, t47, t49, t52, t100, t1...301
Hit Full ! (commute/partial/dont) 272/0/5
(forward)formula 0,0,2.24446,83876,1,0,606,383171,590,343,6830,371214,880
FORMULA CO4-PT-11-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 320/320 transitions.
Graph (trivial) has 270 edges and 266 vertex of which 3 / 266 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 400 edges and 264 vertex of which 255 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 254 transition count 186
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 246 place count 132 transition count 186
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 246 place count 132 transition count 173
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 272 place count 119 transition count 173
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 281 place count 110 transition count 164
Iterating global reduction 2 with 9 rules applied. Total rules applied 290 place count 110 transition count 164
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 290 place count 110 transition count 160
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 298 place count 106 transition count 160
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 303 place count 101 transition count 155
Iterating global reduction 2 with 5 rules applied. Total rules applied 308 place count 101 transition count 155
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 338 place count 86 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 343 place count 86 transition count 135
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 346 place count 84 transition count 134
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 348 place count 82 transition count 132
Iterating global reduction 4 with 2 rules applied. Total rules applied 350 place count 82 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 359 place count 82 transition count 123
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 363 place count 82 transition count 119
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 367 place count 78 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 367 place count 78 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 369 place count 77 transition count 118
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 6 with 2 rules applied. Total rules applied 371 place count 76 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 373 place count 74 transition count 115
Applied a total of 373 rules in 39 ms. Remains 74 /266 variables (removed 192) and now considering 115/320 (removed 205) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5690759020445310233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-770614558474806488.kers'
[2026-05-23 07:53:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5690759020445310233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-770614558474806488.kers]
Normalized transition count is 114 out of 115 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 74 cols 274 entries
Finished phase 1 with 71 SingleSign rule and 0 generalized
[2026-05-23 07:53:56] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-770614558474806488.kers
Total runtime 0 ms.
[2026-05-23 07:53:56] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-23 07:53:56] [INFO ] Invariant cache hit.
[2026-05-23 07:53:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:53:56] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2026-05-23 07:53:56] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2026-05-23 07:53:56] [INFO ] Invariant cache hit.
[2026-05-23 07:53:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 114/188 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/189 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/189 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 78 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3237 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 114/188 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 105/182 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 1/189 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 183 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4746 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7996ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 7996ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/266 places, 115/320 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8170 ms. Remains : 74/266 places, 115/320 transitions.
[2026-05-23 07:54:04] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:54:04] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:54:04] [INFO ] Input system was already deterministic with 115 transitions.
[2026-05-23 07:54:04] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:54:04] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:54:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality14769973207478193335.gal : 1 ms
[2026-05-23 07:54:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality11599837646597022515.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/CTLCardinality14769973207478193335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11599837646597022515.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,15553,0.020107,4596,2,215,5,1994,6,0,403,1929,0


Converting to forward existential form...Done !
original formula: EG(((p528==0)||(p503==1)))
=> equivalent forward existential formula: [FwdG(Init,((p528==0)||(p503==1)))] != FALSE
Hit Full ! (commute/partial/dont) 111/0/4
(forward)formula 0,1,0.05489,6096,1,0,10,10115,19,4,1947,5793,8
FORMULA CO4-PT-11-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 320/320 transitions.
Graph (trivial) has 254 edges and 266 vertex of which 3 / 266 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 400 edges and 264 vertex of which 259 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 258 transition count 203
Reduce places removed 109 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 117 rules applied. Total rules applied 229 place count 149 transition count 195
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 237 place count 141 transition count 195
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 237 place count 141 transition count 182
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 263 place count 128 transition count 182
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 272 place count 119 transition count 173
Iterating global reduction 3 with 9 rules applied. Total rules applied 281 place count 119 transition count 173
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 281 place count 119 transition count 170
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 287 place count 116 transition count 170
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 291 place count 112 transition count 166
Iterating global reduction 3 with 4 rules applied. Total rules applied 295 place count 112 transition count 166
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 327 place count 96 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 332 place count 96 transition count 145
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 335 place count 94 transition count 144
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 338 place count 91 transition count 141
Iterating global reduction 5 with 3 rules applied. Total rules applied 341 place count 91 transition count 141
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 349 place count 91 transition count 133
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 352 place count 91 transition count 130
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 356 place count 88 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 357 place count 87 transition count 129
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 357 place count 87 transition count 128
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 359 place count 86 transition count 128
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 8 with 2 rules applied. Total rules applied 361 place count 85 transition count 127
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 362 place count 85 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 364 place count 83 transition count 125
Applied a total of 364 rules in 59 ms. Remains 83 /266 variables (removed 183) and now considering 125/320 (removed 195) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6699472761491659094.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-324362600274348422.kers'
[2026-05-23 07:54:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6699472761491659094.kers, --Pflows, --basisKERS=/tmp/petrispot-output-324362600274348422.kers]
Normalized transition count is 124 out of 125 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 124 rows 83 cols 295 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-23 07:54:04] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-324362600274348422.kers
Total runtime 16 ms.
[2026-05-23 07:54:04] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-23 07:54:04] [INFO ] Invariant cache hit.
[2026-05-23 07:54:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:54:04] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2026-05-23 07:54:04] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2026-05-23 07:54:04] [INFO ] Invariant cache hit.
[2026-05-23 07:54:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 124/206 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 1/207 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 1/208 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 87 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4854 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 124/206 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 114/199 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 1/207 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 1/208 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 202 constraints, problems are : Problem set: 0 solved, 115 unsolved in 7927 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12793ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 12793ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/266 places, 125/320 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13007 ms. Remains : 83/266 places, 125/320 transitions.
[2026-05-23 07:54:17] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:54:17] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:54:17] [INFO ] Input system was already deterministic with 125 transitions.
[2026-05-23 07:54:17] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:54:17] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:54:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality12697626311447989214.gal : 1 ms
[2026-05-23 07:54:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality518850758780957773.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/CTLCardinality12697626311447989214.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality518850758780957773.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,14257,0.031648,4740,2,275,5,2794,6,0,445,2643,0


Converting to forward existential form...Done !
original formula: AF((((EF((p124==0)) * !(E(((p220==0)||(p426==1)) U AF((p422==1))))) * ((p274==1)&&(p255==0))) * ((p182==0)||(p305==1))))
=> equivalent forward existential formula: [FwdG(Init,!((((E(TRUE U (p124==0)) * !(E(((p220==0)||(p426==1)) U !(EG(!((p422==1))))))) * ((p274==1)&&(p255==0...195
Reverse transition relation is NOT exact ! Due to transitions t9, t21, t36, t42, t49, t120, t124, Intersection with reachable at each step enabled. (destr...197
(forward)formula 0,0,0.548842,24412,1,0,378,123939,288,236,2799,119043,535
FORMULA CO4-PT-11-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 320/320 transitions.
Graph (trivial) has 268 edges and 266 vertex of which 3 / 266 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 400 edges and 264 vertex of which 255 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 254 transition count 189
Reduce places removed 119 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 135 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 244 place count 133 transition count 187
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 244 place count 133 transition count 174
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 270 place count 120 transition count 174
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 280 place count 110 transition count 164
Iterating global reduction 3 with 10 rules applied. Total rules applied 290 place count 110 transition count 164
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 290 place count 110 transition count 160
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 298 place count 106 transition count 160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 303 place count 101 transition count 155
Iterating global reduction 3 with 5 rules applied. Total rules applied 308 place count 101 transition count 155
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 338 place count 86 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 343 place count 86 transition count 135
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 346 place count 84 transition count 134
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 349 place count 81 transition count 131
Iterating global reduction 5 with 3 rules applied. Total rules applied 352 place count 81 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 361 place count 81 transition count 122
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 4 rules applied. Total rules applied 365 place count 81 transition count 118
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 369 place count 77 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 369 place count 77 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 371 place count 76 transition count 117
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 7 with 2 rules applied. Total rules applied 373 place count 75 transition count 116
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 374 place count 75 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 376 place count 73 transition count 114
Applied a total of 376 rules in 23 ms. Remains 73 /266 variables (removed 193) and now considering 114/320 (removed 206) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2384866664061263197.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13578730421720113225.kers'
[2026-05-23 07:54:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2384866664061263197.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13578730421720113225.kers]
Normalized transition count is 113 out of 114 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 73 cols 272 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-23 07:54:18] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13578730421720113225.kers
Total runtime 0 ms.
[2026-05-23 07:54:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-23 07:54:18] [INFO ] Invariant cache hit.
[2026-05-23 07:54:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:54:18] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2026-05-23 07:54:18] [INFO ] Redundant transitions in 2 ms returned []
Running 104 sub problems to find dead transitions.
[2026-05-23 07:54:18] [INFO ] Invariant cache hit.
[2026-05-23 07:54:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 113/186 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 1/187 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 0/187 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 77 constraints, problems are : Problem set: 0 solved, 104 unsolved in 3251 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 113/186 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 104/180 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 181 constraints, problems are : Problem set: 0 solved, 104 unsolved in 4239 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7505ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 7506ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/266 places, 114/320 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7664 ms. Remains : 73/266 places, 114/320 transitions.
[2026-05-23 07:54:25] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:54:25] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:54:25] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-23 07:54:25] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:54:25] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:54:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality9940896876727014090.gal : 1 ms
[2026-05-23 07:54:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality14535546545121795672.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/CTLCardinality9940896876727014090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14535546545121795672.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,12097,0.019366,4564,2,222,5,2027,6,0,398,1830,0


Converting to forward existential form...Done !
original formula: EG(AF(((p395==0)||(p294==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((p395==0)||(p294==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t22, t34, t39, t44, t110, Intersection with reachable at each step enabled. (destroyed/r...191
(forward)formula 0,1,0.139713,10668,1,0,241,29161,254,146,2397,39190,371
FORMULA CO4-PT-11-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 320/320 transitions.
Graph (trivial) has 271 edges and 266 vertex of which 3 / 266 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 400 edges and 264 vertex of which 255 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 254 transition count 186
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 246 place count 132 transition count 186
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 246 place count 132 transition count 173
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 272 place count 119 transition count 173
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 281 place count 110 transition count 164
Iterating global reduction 2 with 9 rules applied. Total rules applied 290 place count 110 transition count 164
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 290 place count 110 transition count 161
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 296 place count 107 transition count 161
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 300 place count 103 transition count 157
Iterating global reduction 2 with 4 rules applied. Total rules applied 304 place count 103 transition count 157
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 336 place count 87 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 341 place count 87 transition count 136
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 344 place count 85 transition count 135
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 347 place count 82 transition count 132
Iterating global reduction 4 with 3 rules applied. Total rules applied 350 place count 82 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 359 place count 82 transition count 123
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 363 place count 82 transition count 119
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 367 place count 78 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 367 place count 78 transition count 118
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 369 place count 77 transition count 118
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 6 with 2 rules applied. Total rules applied 371 place count 76 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 373 place count 74 transition count 115
Applied a total of 373 rules in 16 ms. Remains 74 /266 variables (removed 192) and now considering 115/320 (removed 205) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16376264057111081409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9682545077548723290.kers'
[2026-05-23 07:54:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16376264057111081409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9682545077548723290.kers]
Normalized transition count is 114 out of 115 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 74 cols 276 entries
Finished phase 1 with 71 SingleSign rule and 0 generalized
[2026-05-23 07:54:26] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9682545077548723290.kers
Total runtime 0 ms.
[2026-05-23 07:54:26] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-23 07:54:26] [INFO ] Invariant cache hit.
[2026-05-23 07:54:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:54:26] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2026-05-23 07:54:26] [INFO ] Redundant transitions in 2 ms returned []
Running 105 sub problems to find dead transitions.
[2026-05-23 07:54:26] [INFO ] Invariant cache hit.
[2026-05-23 07:54:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 114/188 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/189 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 0/189 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 78 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3238 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 114/188 variables, 74/77 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 105/182 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 1/189 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 183 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4934 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8179ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 8180ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/266 places, 115/320 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8301 ms. Remains : 74/266 places, 115/320 transitions.
[2026-05-23 07:54:34] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:54:34] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:54:34] [INFO ] Input system was already deterministic with 115 transitions.
[2026-05-23 07:54:34] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:54:34] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:54:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7181518215572609761.gal : 1 ms
[2026-05-23 07:54:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1150095716050521348.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/ReachabilityCardinality7181518215572609761.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1150095716050521348.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 ...328
Loading property file /tmp/ReachabilityCardinality1150095716050521348.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 33
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :33 after 58
Reachability property CO4-PT-11-CTLCardinality-2024-12 is true.
FORMULA CO4-PT-11-CTLCardinality-2024-12 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 65 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,134,0.031495,4656,2,209,11,1603,6,0,404,1184,0
Total reachable state count : 134

Verifying 1 reachability properties.
Reachability property CO4-PT-11-CTLCardinality-2024-12 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
CO4-PT-11-CTLCardinality-2024-12,1,0.032004,4832,2,75,11,1603,7,0,407,1184,0
RANDOM walk for 40000 steps (5458 resets) in 419 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1017 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2981 steps, run visited all 1 properties in 14 ms. (steps per millisecond=212 )
Probabilistic random walk after 2981 steps, saw 933 distinct states, run finished after 18 ms. (steps per millisecond=165 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 320/320 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 264 transition count 319
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 242 transition count 297
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 242 transition count 297
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 65 place count 224 transition count 279
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 224 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 224 transition count 278
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 214 transition count 268
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 214 transition count 268
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 209 transition count 263
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 209 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 209 transition count 262
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 206 transition count 259
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 205 transition count 258
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 205 transition count 258
Applied a total of 123 rules in 16 ms. Remains 205 /266 variables (removed 61) and now considering 258/320 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5045296061858393309.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-566103354477524259.kers'
[2026-05-23 07:54:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5045296061858393309.kers, --Pflows, --basisKERS=/tmp/petrispot-output-566103354477524259.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 205 cols 580 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-23 07:54:34] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-566103354477524259.kers
Total runtime 1 ms.
[2026-05-23 07:54:34] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-23 07:54:34] [INFO ] Invariant cache hit.
[2026-05-23 07:54:34] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2026-05-23 07:54:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/463 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/463 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 210 constraints, problems are : Problem set: 0 solved, 257 unsolved in 15707 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/463 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 257/467 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/463 variables, and 468 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45738ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 45739ms
Starting structural reductions in LTL mode, iteration 1 : 205/266 places, 258/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45913 ms. Remains : 205/266 places, 258/320 transitions.
[2026-05-23 07:55:20] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:55:20] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:55:20] [INFO ] Input system was already deterministic with 258 transitions.
[2026-05-23 07:55:20] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:55:20] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:55:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality10941432024487070071.gal : 1 ms
[2026-05-23 07:55:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality18153047815712633609.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/CTLCardinality10941432024487070071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18153047815712633609.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,459604,0.09333,7796,2,1308,5,13523,6,0,1076,14467,0


Converting to forward existential form...Done !
original formula: AG(EF(AX(FALSE)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(FALSE))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
(forward)formula 0,0,1.00953,41280,1,0,352,133272,536,230,5883,135023,547
FORMULA CO4-PT-11-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 320/320 transitions.
Graph (trivial) has 267 edges and 266 vertex of which 3 / 266 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 400 edges and 264 vertex of which 255 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 254 transition count 189
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 240 place count 135 transition count 189
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 240 place count 135 transition count 176
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 266 place count 122 transition count 176
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 274 place count 114 transition count 168
Iterating global reduction 2 with 8 rules applied. Total rules applied 282 place count 114 transition count 168
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 282 place count 114 transition count 165
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 288 place count 111 transition count 165
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 293 place count 106 transition count 160
Iterating global reduction 2 with 5 rules applied. Total rules applied 298 place count 106 transition count 160
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 330 place count 90 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 335 place count 90 transition count 139
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 338 place count 88 transition count 138
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 341 place count 85 transition count 135
Iterating global reduction 4 with 3 rules applied. Total rules applied 344 place count 85 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 353 place count 85 transition count 126
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 357 place count 85 transition count 122
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 361 place count 81 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 361 place count 81 transition count 121
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 363 place count 80 transition count 121
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 6 with 2 rules applied. Total rules applied 365 place count 79 transition count 120
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 366 place count 79 transition count 120
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 77 transition count 118
Applied a total of 368 rules in 18 ms. Remains 77 /266 variables (removed 189) and now considering 118/320 (removed 202) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12667747345746719419.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13235993002763462716.kers'
[2026-05-23 07:55:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12667747345746719419.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13235993002763462716.kers]
Normalized transition count is 117 out of 118 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 117 rows 77 cols 282 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-23 07:55:21] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13235993002763462716.kers
Total runtime 1 ms.
[2026-05-23 07:55:21] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-23 07:55:21] [INFO ] Invariant cache hit.
[2026-05-23 07:55:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:55:21] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2026-05-23 07:55:21] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2026-05-23 07:55:21] [INFO ] Invariant cache hit.
[2026-05-23 07:55:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 117/194 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 1/195 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 81 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3477 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 117/194 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 108/188 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 1/195 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 189 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6577 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10063ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 10063ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/266 places, 118/320 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10198 ms. Remains : 77/266 places, 118/320 transitions.
[2026-05-23 07:55:31] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:55:31] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:55:31] [INFO ] Input system was already deterministic with 118 transitions.
[2026-05-23 07:55:31] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:55:31] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:55:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality9601002215915391093.gal : 1 ms
[2026-05-23 07:55:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality15745494732583793941.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/CTLCardinality9601002215915391093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15745494732583793941.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,16993,0.022974,4728,2,231,5,2569,6,0,418,2807,0


Converting to forward existential form...Done !
original formula: EG(EF(((p165==1) + !(E(!(((p132==0)||(p433==1))) U (p182==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p165==1) + !(E(!(((p132==0)||(p433==1))) U (p182==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t23, t35, t40, t114, t117, Intersection with reachable at each step enabled. (destroyed/...192
(forward)formula 0,1,0.121811,9252,1,0,162,25207,266,91,2774,21143,259
FORMULA CO4-PT-11-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 320/320 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 264 transition count 319
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 242 transition count 297
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 242 transition count 297
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 65 place count 224 transition count 279
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 224 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 224 transition count 278
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 214 transition count 268
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 214 transition count 268
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 209 transition count 263
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 209 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 209 transition count 262
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 207 transition count 260
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 207 transition count 260
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 206 transition count 259
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 206 transition count 259
Applied a total of 121 rules in 23 ms. Remains 206 /266 variables (removed 60) and now considering 259/320 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2479370374690175920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6429606453458390662.kers'
[2026-05-23 07:55:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2479370374690175920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6429606453458390662.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 259 rows 206 cols 582 entries
Finished phase 1 with 203 SingleSign rule and 0 generalized
[2026-05-23 07:55:31] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6429606453458390662.kers
Total runtime 3 ms.
[2026-05-23 07:55:31] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-23 07:55:31] [INFO ] Invariant cache hit.
[2026-05-23 07:55:32] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2026-05-23 07:55:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 259/465 variables, 206/209 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/465 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 211 constraints, problems are : Problem set: 0 solved, 258 unsolved in 16039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/465 variables, 206/211 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 258/469 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 470 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46080ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 46080ms
Starting structural reductions in LTL mode, iteration 1 : 206/266 places, 259/320 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46268 ms. Remains : 206/266 places, 259/320 transitions.
[2026-05-23 07:56:18] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:56:18] [INFO ] Flatten gal took : 13 ms
[2026-05-23 07:56:18] [INFO ] Input system was already deterministic with 259 transitions.
[2026-05-23 07:56:18] [INFO ] Flatten gal took : 28 ms
[2026-05-23 07:56:18] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:56:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality13077082012257351584.gal : 2 ms
[2026-05-23 07:56:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality9564725285192230967.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/CTLCardinality13077082012257351584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9564725285192230967.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,462532,0.16486,7848,2,1315,5,13606,6,0,1081,14606,0


Converting to forward existential form...Done !
original formula: EX((EX(TRUE) * EF((p289==1))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * EX(TRUE)),TRUE) * (p289==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t16, t22, t30, t39, t41, t42, t43, t44, t45, t47, t50, t94, t14...300
(forward)formula 0,1,0.934852,35016,1,0,335,90095,535,220,6073,109972,528
FORMULA CO4-PT-11-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-23 07:56:19] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:56:19] [INFO ] Flatten gal took : 5 ms
Total runtime 321779 ms.

BK_STOP 1779522979396

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-11"
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 CO4-PT-11, 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 r066-tall-177946967700361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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