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.r338-smll-178021499200225.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 ErlangenMainframeV2-PT-bP03C03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200225
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.5K May 27 09:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 27 09:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 27 09:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 27 09:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 27 10:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 10:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.8K May 27 09:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 27 09:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 27 09:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 27 09:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 105K May 26 18:17 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 ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-00
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-01
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-02
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-03
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-04
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-05
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-06
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-07
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-08
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-09
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-10
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-11
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-12
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-13
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-14
FORMULA_NAME ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1780371825969

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP03C03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-02 03:43:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-02 03:43:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 03:43:48] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2026-06-02 03:43:48] [INFO ] Transformed 219 places.
[2026-06-02 03:43:48] [INFO ] Transformed 331 transitions.
[2026-06-02 03:43:48] [INFO ] Found NUPN structural information;
[2026-06-02 03:43:48] [INFO ] Parsed PT model containing 219 places and 331 transitions and 1585 arcs in 332 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 84 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 331/331 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 192 transition count 304
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 192 transition count 304
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 186 transition count 298
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 186 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 185 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 185 transition count 297
Applied a total of 68 rules in 67 ms. Remains 185 /219 variables (removed 34) and now considering 297/331 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16874735082608269694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7730731955963140154.kers'
[2026-06-02 03:43:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16874735082608269694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7730731955963140154.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 297 rows 185 cols 1517 entries
Finished phase 1 with 168 SingleSign rule and 3 generalized
[2026-06-02 03:43:48] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7730731955963140154.kers
Total runtime 4 ms.
[2026-06-02 03:43:49] [INFO ] Implicit Places using invariants in 483 ms returned []
[2026-06-02 03:43:49] [INFO ] Invariant cache hit.
[2026-06-02 03:43:49] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2026-06-02 03:43:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (OVERLAPS) 297/482 variables, 185/211 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 214 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (OVERLAPS) 297/482 variables, 185/214 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 296/510 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 5/515 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 3/518 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 518 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60611ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 60644ms
Starting structural reductions in LTL mode, iteration 1 : 185/219 places, 297/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61740 ms. Remains : 185/219 places, 297/331 transitions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 297/297 transitions.
Applied a total of 0 rules in 8 ms. Remains 185 /185 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2026-06-02 03:44:50] [INFO ] Invariant cache hit.
[2026-06-02 03:44:50] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-06-02 03:44:50] [INFO ] Invariant cache hit.
[2026-06-02 03:44:50] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 405 ms. Remains : 185/185 places, 297/297 transitions.
Support contains 84 out of 185 places after structural reductions.
[2026-06-02 03:44:51] [INFO ] Flatten gal took : 90 ms
[2026-06-02 03:44:51] [INFO ] Flatten gal took : 43 ms
[2026-06-02 03:44:51] [INFO ] Input system was already deterministic with 297 transitions.
RANDOM walk for 40000 steps (8 resets) in 3020 ms. (13 steps per ms) remains 8/65 properties
BEST_FIRST walk for 40000 steps (8 resets) in 441 ms. (90 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 244 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 322 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 192 ms. (207 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 317 ms. (125 steps per ms) remains 5/6 properties
[2026-06-02 03:44:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 136/148 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 37/185 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 297/482 variables, 185/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/482 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 199 constraints, problems are : Problem set: 0 solved, 5 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 136/148 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 4 (OVERLAPS) 37/185 variables, 4/16 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 297/482 variables, 185/202 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 4/206 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 1/207 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/482 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 207 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1335 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1803ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 402 ms.
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 297/297 transitions.
Graph (trivial) has 164 edges and 185 vertex of which 11 / 185 are part of one of the 5 SCC in 12 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 179 transition count 231
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 67 rules applied. Total rules applied 122 place count 125 transition count 218
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 place count 120 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 129 place count 119 transition count 217
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 129 place count 119 transition count 204
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 27 rules applied. Total rules applied 156 place count 105 transition count 204
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 177 place count 84 transition count 167
Iterating global reduction 4 with 21 rules applied. Total rules applied 198 place count 84 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 199 place count 84 transition count 166
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 199 place count 84 transition count 162
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 207 place count 80 transition count 162
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 215 place count 72 transition count 114
Ensure Unique test removed 2 places
Iterating global reduction 5 with 10 rules applied. Total rules applied 225 place count 70 transition count 114
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 229 place count 66 transition count 82
Iterating global reduction 5 with 4 rules applied. Total rules applied 233 place count 66 transition count 82
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 279 place count 43 transition count 59
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 280 place count 42 transition count 57
Iterating global reduction 5 with 1 rules applied. Total rules applied 281 place count 42 transition count 57
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 293 place count 36 transition count 77
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 301 place count 36 transition count 69
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 302 place count 35 transition count 66
Iterating global reduction 6 with 1 rules applied. Total rules applied 303 place count 35 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 304 place count 35 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 311 place count 35 transition count 58
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 317 place count 35 transition count 52
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 331 place count 29 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 339 place count 29 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 341 place count 28 transition count 44
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 342 place count 28 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 343 place count 27 transition count 58
Applied a total of 343 rules in 118 ms. Remains 27 /185 variables (removed 158) and now considering 58/297 (removed 239) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 27/185 places, 58/297 transitions.
RANDOM walk for 2928 steps (0 resets) in 77 ms. (37 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2026-06-02 03:44:55] [INFO ] Flatten gal took : 55 ms
[2026-06-02 03:44:55] [INFO ] Flatten gal took : 57 ms
[2026-06-02 03:44:55] [INFO ] Input system was already deterministic with 297 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 297/297 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 151 transition count 255
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 151 transition count 255
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 84 place count 135 transition count 221
Ensure Unique test removed 1 places
Iterating global reduction 0 with 17 rules applied. Total rules applied 101 place count 134 transition count 221
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 108 place count 127 transition count 169
Iterating global reduction 0 with 7 rules applied. Total rules applied 115 place count 127 transition count 169
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 118 place count 124 transition count 160
Iterating global reduction 0 with 3 rules applied. Total rules applied 121 place count 124 transition count 160
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 123 place count 122 transition count 158
Iterating global reduction 0 with 2 rules applied. Total rules applied 125 place count 122 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 126 place count 121 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 127 place count 121 transition count 157
Applied a total of 127 rules in 52 ms. Remains 121 /185 variables (removed 64) and now considering 157/297 (removed 140) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1749063589966845835.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7498652344999924658.kers'
[2026-06-02 03:44:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1749063589966845835.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7498652344999924658.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 121 cols 505 entries
Finished phase 1 with 106 SingleSign rule and 2 generalized
[2026-06-02 03:44:55] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7498652344999924658.kers
Total runtime 2 ms.
[2026-06-02 03:44:55] [INFO ] Implicit Places using invariants in 113 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 118 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/185 places, 157/297 transitions.
Applied a total of 0 rules in 2 ms. Remains 120 /120 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 174 ms. Remains : 120/185 places, 157/297 transitions.
[2026-06-02 03:44:55] [INFO ] Flatten gal took : 17 ms
[2026-06-02 03:44:55] [INFO ] Flatten gal took : 19 ms
[2026-06-02 03:44:55] [INFO ] Input system was already deterministic with 157 transitions.
[2026-06-02 03:44:55] [INFO ] Flatten gal took : 16 ms
[2026-06-02 03:44:55] [INFO ] Flatten gal took : 15 ms
[2026-06-02 03:44:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality226558832401804559.gal : 6 ms
[2026-06-02 03:44:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality6240517460723509497.ctl : 3 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/CTLCardinality226558832401804559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6240517460723509497.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.33869e+08,0.556586,13988,2,2862,5,38855,6,0,639,45519,0


Converting to forward existential form...Done !
original formula: EF(AG(EF((!(E(((p23==0)||(p15==1)) U (p114==0))) + (EX((p49==1)) * AX(((p50==0)||(p56==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U (!(E(((p23==0)||(p15==1)) U (p114==0))) + (EX((p49==1)) * !(EX(!(((p50...190
Reverse transition relation is NOT exact ! Due to transitions t3, t12, t16, t19, t27, t67, t70, t77, t83, t86, t89, t90, t91, t92, t94, t96, t98, t99, t102...311
(forward)formula 0,0,13.9755,325072,1,0,354,2.18327e+06,342,190,4215,1.48334e+06,450
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 297/297 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 156 transition count 252
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 156 transition count 252
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 72 place count 142 transition count 211
Ensure Unique test removed 1 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 87 place count 141 transition count 211
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 92 place count 136 transition count 179
Iterating global reduction 0 with 5 rules applied. Total rules applied 97 place count 136 transition count 179
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 100 place count 133 transition count 172
Iterating global reduction 0 with 3 rules applied. Total rules applied 103 place count 133 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 104 place count 132 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 105 place count 132 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 106 place count 131 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 107 place count 131 transition count 170
Applied a total of 107 rules in 24 ms. Remains 131 /185 variables (removed 54) and now considering 170/297 (removed 127) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17507215931940334037.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-252357687273018018.kers'
[2026-06-02 03:45:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17507215931940334037.kers, --Pflows, --basisKERS=/tmp/petrispot-output-252357687273018018.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 131 cols 581 entries
Finished phase 1 with 115 SingleSign rule and 3 generalized
[2026-06-02 03:45:10] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-252357687273018018.kers
Total runtime 2 ms.
[2026-06-02 03:45:10] [INFO ] Implicit Places using invariants in 89 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 130/185 places, 170/297 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 130/185 places, 170/297 transitions.
[2026-06-02 03:45:10] [INFO ] Flatten gal took : 12 ms
[2026-06-02 03:45:10] [INFO ] Flatten gal took : 10 ms
[2026-06-02 03:45:10] [INFO ] Input system was already deterministic with 170 transitions.
[2026-06-02 03:45:10] [INFO ] Flatten gal took : 10 ms
[2026-06-02 03:45:10] [INFO ] Flatten gal took : 11 ms
[2026-06-02 03:45:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality14157824076044420795.gal : 6 ms
[2026-06-02 03:45:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality9144587666280709163.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/CTLCardinality14157824076044420795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9144587666280709163.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84473e+09,0.849327,26876,2,7459,5,93117,6,0,692,84242,0


Converting to forward existential form...Done !
original formula: E(AX(!(((((!(((p146==0)||(p37==1))) + EX(TRUE)) * (((p218==0)||(p44==1))||(p189==1))) * (((p179==0)||(p38==1))&&(p72==0))) + EG(EX((p22==...255
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(((((!(((p146==0)||(p37==1))) + EX(TRUE)) * (((p218==0)||(p44==1))||(p189==1))) * (((p179==0...319
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t11, t14, t18, t27, t30, t34, t38, t41, t53, t54, t57, t60, t71, t73, t75, t82, t85, ...371
Detected timeout of ITS tools.
[2026-06-02 03:45:40] [INFO ] Flatten gal took : 11 ms
[2026-06-02 03:45:40] [INFO ] Applying decomposition
[2026-06-02 03:45:40] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9779259592737803292.txt' '-o' '/tmp/graph9779259592737803292.bin' '-w' '/tmp/graph9779259592737803292.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9779259592737803292.bin' '-l' '-1' '-v' '-w' '/tmp/graph9779259592737803292.weights' '-q' '0' '-e' '0.001'
[2026-06-02 03:45:40] [INFO ] Decomposing Gal with order
[2026-06-02 03:45:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 03:45:40] [INFO ] Removed a total of 160 redundant transitions.
[2026-06-02 03:45:40] [INFO ] Flatten gal took : 94 ms
[2026-06-02 03:45:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 14 ms.
[2026-06-02 03:45:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality18003358418731678323.gal : 8 ms
[2026-06-02 03:45:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality2694203666818951386.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/CTLCardinality18003358418731678323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2694203666818951386.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.84473e+09,0.124536,7904,581,106,6521,499,541,14000,118,1601,0


Converting to forward existential form...Done !
original formula: E(AX(!(((((!(((i4.i1.u26.p146==0)||(i0.i0.u6.p37==1))) + EX(TRUE)) * (((i6.i1.u40.p218==0)||(i0.i0.u6.p44==1))||(i6.i0.u35.p189==1))) * (...394
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(((((!(((i4.i1.u26.p146==0)||(i0.i0.u6.p37==1))) + EX(TRUE)) * (((i6.i1.u40.p218==0)||(i0.i0...458
Reverse transition relation is NOT exact ! Due to transitions t30, t71, t92, t96, t108, t109, t113, i0.i0.t100, i0.i0.u6.t2, i0.i0.u6.t3, i0.i1.t156, i0.i1...562
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,26.8324,654392,1,0,793577,2474,3233,4.55092e+06,622,10462,624258
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 297/297 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 153 transition count 257
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 153 transition count 257
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 79 place count 138 transition count 223
Ensure Unique test removed 1 places
Iterating global reduction 0 with 16 rules applied. Total rules applied 95 place count 137 transition count 223
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 101 place count 131 transition count 181
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 108 place count 130 transition count 181
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 112 place count 126 transition count 163
Iterating global reduction 0 with 4 rules applied. Total rules applied 116 place count 126 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 125 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 125 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 119 place count 124 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 124 transition count 161
Applied a total of 120 rules in 17 ms. Remains 124 /185 variables (removed 61) and now considering 161/297 (removed 136) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-103154924645594074.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-499653330281412976.kers'
[2026-06-02 03:46:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-103154924645594074.kers, --Pflows, --basisKERS=/tmp/petrispot-output-499653330281412976.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 161 rows 124 cols 505 entries
Finished phase 1 with 110 SingleSign rule and 2 generalized
[2026-06-02 03:46:07] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-499653330281412976.kers
Total runtime 1 ms.
[2026-06-02 03:46:07] [INFO ] Implicit Places using invariants in 120 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/185 places, 161/297 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 123/185 places, 161/297 transitions.
[2026-06-02 03:46:07] [INFO ] Flatten gal took : 13 ms
[2026-06-02 03:46:07] [INFO ] Flatten gal took : 13 ms
[2026-06-02 03:46:07] [INFO ] Input system was already deterministic with 161 transitions.
[2026-06-02 03:46:07] [INFO ] Flatten gal took : 12 ms
[2026-06-02 03:46:07] [INFO ] Flatten gal took : 12 ms
[2026-06-02 03:46:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality16640135365203465345.gal : 4 ms
[2026-06-02 03:46:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality9758926043662222823.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/CTLCardinality16640135365203465345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9758926043662222823.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.03941e+08,0.34949,11344,2,3539,5,34127,6,0,655,25473,0


Converting to forward existential form...Done !
original formula: A(AX(!(EG(E((p101==0) U ((p119==0)||(p19==1)))))) U !((AG(AF(((p8==0)||(p35==1)))) + EX((((p6==0)||(p139==1))&&(p6==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((!(E(TRUE U !(!(EG(!(((p8==0)||(p35==1)))))))) + EX((((p6==0)||(p139==1))&&(p6==1))))))))) * ...418
Reverse transition relation is NOT exact ! Due to transitions t11, t15, t18, t26, t70, t73, t81, t90, t92, t93, t96, t97, t100, t101, t102, t105, t106, t10...288
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.79131,63272,1,0,401,334125,365,199,4533,257254,523
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 297/297 transitions.
Graph (trivial) has 167 edges and 185 vertex of which 11 / 185 are part of one of the 5 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 178 transition count 235
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 68 rules applied. Total rules applied 123 place count 124 transition count 221
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 128 place count 119 transition count 221
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 128 place count 119 transition count 209
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 153 place count 106 transition count 209
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 174 place count 85 transition count 172
Iterating global reduction 3 with 21 rules applied. Total rules applied 195 place count 85 transition count 172
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 195 place count 85 transition count 169
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 201 place count 82 transition count 169
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 211 place count 72 transition count 118
Ensure Unique test removed 3 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 224 place count 69 transition count 118
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 229 place count 64 transition count 84
Iterating global reduction 3 with 5 rules applied. Total rules applied 234 place count 64 transition count 84
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 274 place count 44 transition count 64
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 278 place count 40 transition count 57
Iterating global reduction 3 with 4 rules applied. Total rules applied 282 place count 40 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 288 place count 40 transition count 51
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 294 place count 37 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 295 place count 36 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 297 place count 34 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 301 place count 34 transition count 43
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 4 with 2 rules applied. Total rules applied 303 place count 34 transition count 41
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 305 place count 32 transition count 41
Applied a total of 305 rules in 73 ms. Remains 32 /185 variables (removed 153) and now considering 41/297 (removed 256) transitions.
[2026-06-02 03:46:10] [INFO ] Flow matrix only has 37 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-805418178374752348.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12698478093153746295.kers'
[2026-06-02 03:46:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-805418178374752348.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12698478093153746295.kers]
Normalized transition count is 36 out of 37 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 36 rows 29 cols 89 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-06-02 03:46:10] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12698478093153746295.kers
Total runtime 2 ms.
[2026-06-02 03:46:10] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-06-02 03:46:10] [INFO ] Flow matrix only has 37 transitions (discarded 4 similar events)
[2026-06-02 03:46:10] [INFO ] Invariant cache hit.
[2026-06-02 03:46:11] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2026-06-02 03:46:11] [INFO ] Redundant transitions in 1 ms returned []
Running 26 sub problems to find dead transitions.
[2026-06-02 03:46:11] [INFO ] Flow matrix only has 37 transitions (discarded 4 similar events)
[2026-06-02 03:46:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 5/32 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 36/68 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 0/68 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 68/69 variables, and 40 constraints, problems are : Problem set: 0 solved, 26 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 5/32 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 36/68 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 26/66 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/68 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 68/69 variables, and 66 constraints, problems are : Problem set: 0 solved, 26 unsolved in 793 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1664ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 1666ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/185 places, 41/297 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1909 ms. Remains : 32/185 places, 41/297 transitions.
[2026-06-02 03:46:12] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:46:12] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:46:12] [INFO ] Input system was already deterministic with 41 transitions.
[2026-06-02 03:46:12] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:46:12] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:46:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality8882491031828982312.gal : 1 ms
[2026-06-02 03:46:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality11089603615206242161.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/CTLCardinality8882491031828982312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11089603615206242161.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,27648,0.014917,4052,2,57,5,518,5,0,170,448,0


Converting to forward existential form...Done !
original formula: AG(EF((p99==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p99==1))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.035818,4472,1,0,8,3127,12,2,739,2342,5
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 297/297 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 151 transition count 247
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 151 transition count 247
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 84 place count 135 transition count 202
Ensure Unique test removed 2 places
Iterating global reduction 0 with 18 rules applied. Total rules applied 102 place count 133 transition count 202
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 110 place count 125 transition count 161
Ensure Unique test removed 1 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 119 place count 124 transition count 161
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 125 place count 118 transition count 148
Iterating global reduction 0 with 6 rules applied. Total rules applied 131 place count 118 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 133 place count 116 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 135 place count 116 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 115 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 115 transition count 145
Applied a total of 137 rules in 17 ms. Remains 115 /185 variables (removed 70) and now considering 145/297 (removed 152) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7937803135154097018.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11957677557528893449.kers'
[2026-06-02 03:46:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7937803135154097018.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11957677557528893449.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 145 rows 115 cols 400 entries
Finished phase 1 with 103 SingleSign rule and 1 generalized
[2026-06-02 03:46:12] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11957677557528893449.kers
Total runtime 2 ms.
[2026-06-02 03:46:12] [INFO ] Implicit Places using invariants in 92 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 114/185 places, 145/297 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 114/185 places, 145/297 transitions.
[2026-06-02 03:46:12] [INFO ] Flatten gal took : 8 ms
[2026-06-02 03:46:12] [INFO ] Flatten gal took : 8 ms
[2026-06-02 03:46:12] [INFO ] Input system was already deterministic with 145 transitions.
[2026-06-02 03:46:12] [INFO ] Flatten gal took : 8 ms
[2026-06-02 03:46:12] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:46:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality18193107158353010879.gal : 1 ms
[2026-06-02 03:46:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality8342489769536854210.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/CTLCardinality18193107158353010879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8342489769536854210.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,3.73518e+08,0.121643,6180,2,973,5,9594,6,0,603,9266,0


Converting to forward existential form...Done !
original formula: AG(((EX((p120==0)) + (p153==0)) + (p193==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((p193==1))) * !((p153==0))) * !(EX((p120==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t15, t19, t27, t70, t80, t89, t91, t92, t93, t95, t96, t98, t99, t102, t129, t130, t131,...256
(forward)formula 0,1,0.611232,16728,1,0,214,67911,306,122,3513,55914,297
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 297/297 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 152 transition count 248
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 152 transition count 248
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 83 place count 135 transition count 202
Ensure Unique test removed 2 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 102 place count 133 transition count 202
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 108 place count 127 transition count 168
Iterating global reduction 0 with 6 rules applied. Total rules applied 114 place count 127 transition count 168
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 118 place count 123 transition count 156
Iterating global reduction 0 with 4 rules applied. Total rules applied 122 place count 123 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 122 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 122 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 121 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 121 transition count 154
Applied a total of 126 rules in 20 ms. Remains 121 /185 variables (removed 64) and now considering 154/297 (removed 143) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9736139162867314952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-450958970178882112.kers'
[2026-06-02 03:46:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9736139162867314952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-450958970178882112.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 154 rows 121 cols 459 entries
Finished phase 1 with 107 SingleSign rule and 2 generalized
[2026-06-02 03:46:13] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-450958970178882112.kers
Total runtime 1 ms.
[2026-06-02 03:46:13] [INFO ] Implicit Places using invariants in 105 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 120/185 places, 154/297 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 128 ms. Remains : 120/185 places, 154/297 transitions.
[2026-06-02 03:46:13] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:46:13] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:46:13] [INFO ] Input system was already deterministic with 154 transitions.
[2026-06-02 03:46:13] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:46:13] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:46:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality1339022163894343937.gal : 2 ms
[2026-06-02 03:46:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality60190039491334722.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/CTLCardinality1339022163894343937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality60190039491334722.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.06601e+08,0.362004,11344,2,3852,5,32826,6,0,636,23920,0


Converting to forward existential form...Done !
original formula: EF(EX((EX((((p5==1)&&(p129==0))&&(p52==1))) * !(E(AF((p125==1)) U !(((p6==0)||(p10==1))))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * EX((((p5==1)&&(p129==0))&&(p52==1)))) * !(E(!(EG(!((p125==1)))) U !(((p6==0)||(p10==1))...169
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t12, t16, t19, t27, t69, t79, t90, t91, t92, t94, t95, t97, t98, t99, t100, t139, t14...258
(forward)formula 0,1,2.69831,69820,1,0,358,369575,337,205,4045,308380,435
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 297/297 transitions.
Graph (trivial) has 164 edges and 185 vertex of which 11 / 185 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 178 transition count 236
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
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 1 with 65 rules applied. Total rules applied 119 place count 125 transition count 224
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 124 place count 121 transition count 223
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 127 place count 120 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 128 place count 119 transition count 221
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 128 place count 119 transition count 209
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 25 rules applied. Total rules applied 153 place count 106 transition count 209
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 175 place count 84 transition count 171
Iterating global reduction 5 with 22 rules applied. Total rules applied 197 place count 84 transition count 171
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 197 place count 84 transition count 168
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 203 place count 81 transition count 168
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 213 place count 71 transition count 117
Ensure Unique test removed 3 places
Iterating global reduction 5 with 13 rules applied. Total rules applied 226 place count 68 transition count 117
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 231 place count 63 transition count 83
Iterating global reduction 5 with 5 rules applied. Total rules applied 236 place count 63 transition count 83
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 272 place count 45 transition count 65
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 276 place count 41 transition count 58
Iterating global reduction 5 with 4 rules applied. Total rules applied 280 place count 41 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 286 place count 41 transition count 52
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 292 place count 38 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 293 place count 37 transition count 48
Applied a total of 293 rules in 31 ms. Remains 37 /185 variables (removed 148) and now considering 48/297 (removed 249) transitions.
[2026-06-02 03:46:16] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2835346689510660572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5182172882933697402.kers'
[2026-06-02 03:46:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2835346689510660572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5182172882933697402.kers]
Normalized transition count is 39 out of 40 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 39 rows 35 cols 102 entries
Finished phase 1 with 26 SingleSign rule and 1 generalized
[2026-06-02 03:46:16] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5182172882933697402.kers
Total runtime 0 ms.
[2026-06-02 03:46:16] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-06-02 03:46:16] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
[2026-06-02 03:46:16] [INFO ] Invariant cache hit.
[2026-06-02 03:46:16] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2026-06-02 03:46:16] [INFO ] Redundant transitions in 1 ms returned []
Running 31 sub problems to find dead transitions.
[2026-06-02 03:46:16] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
[2026-06-02 03:46:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 5/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 39/76 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/76 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/77 variables, and 47 constraints, problems are : Problem set: 0 solved, 31 unsolved in 1388 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 5/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 39/76 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 31/78 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 0/76 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/77 variables, and 78 constraints, problems are : Problem set: 0 solved, 31 unsolved in 1035 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2448ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 2448ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/185 places, 48/297 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2592 ms. Remains : 37/185 places, 48/297 transitions.
[2026-06-02 03:46:19] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:46:19] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:46:19] [INFO ] Input system was already deterministic with 48 transitions.
[2026-06-02 03:46:19] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:46:19] [INFO ] Flatten gal took : 9 ms
[2026-06-02 03:46:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality1436467821222117777.gal : 1 ms
[2026-06-02 03:46:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality17374800959987725769.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/CTLCardinality1436467821222117777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17374800959987725769.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,43680,0.021053,4188,2,200,5,1151,6,0,194,1069,0


Converting to forward existential form...Done !
original formula: AF(EG(EF(AG(((p179==0)&&(p4==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U !(E(TRUE U !(((p179==0)&&(p4==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t37, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.096226,5716,1,0,76,8252,120,40,1271,7350,108
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 297/297 transitions.
Graph (trivial) has 152 edges and 185 vertex of which 11 / 185 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 178 transition count 243
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
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 1 with 56 rules applied. Total rules applied 103 place count 132 transition count 233
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 108 place count 129 transition count 231
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 127 transition count 231
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 110 place count 127 transition count 219
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 25 rules applied. Total rules applied 135 place count 114 transition count 219
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 154 place count 95 transition count 192
Iterating global reduction 4 with 19 rules applied. Total rules applied 173 place count 95 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 174 place count 95 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 174 place count 95 transition count 190
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 176 place count 94 transition count 190
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 183 place count 87 transition count 138
Ensure Unique test removed 2 places
Iterating global reduction 5 with 9 rules applied. Total rules applied 192 place count 85 transition count 138
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 195 place count 82 transition count 108
Iterating global reduction 5 with 3 rules applied. Total rules applied 198 place count 82 transition count 108
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 240 place count 61 transition count 87
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 243 place count 58 transition count 80
Iterating global reduction 5 with 3 rules applied. Total rules applied 246 place count 58 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 250 place count 58 transition count 76
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 5 with 4 rules applied. Total rules applied 254 place count 56 transition count 74
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 255 place count 56 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 256 place count 55 transition count 73
Applied a total of 256 rules in 58 ms. Remains 55 /185 variables (removed 130) and now considering 73/297 (removed 224) transitions.
[2026-06-02 03:46:19] [INFO ] Flow matrix only has 67 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13642939020980334633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5973587156500351648.kers'
[2026-06-02 03:46:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13642939020980334633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5973587156500351648.kers]
Normalized transition count is 66 out of 67 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 66 rows 53 cols 208 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-06-02 03:46:19] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5973587156500351648.kers
Total runtime 5 ms.
[2026-06-02 03:46:19] [INFO ] Implicit Places using invariants in 86 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 54/185 places, 73/297 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 72
Applied a total of 2 rules in 7 ms. Remains 53 /54 variables (removed 1) and now considering 72/73 (removed 1) transitions.
[2026-06-02 03:46:19] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6534964937111475689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8741254271536917841.kers'
[2026-06-02 03:46:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6534964937111475689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8741254271536917841.kers]
Normalized transition count is 65 out of 66 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 65 rows 51 cols 204 entries
Finished phase 1 with 42 SingleSign rule and 1 generalized
[2026-06-02 03:46:19] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8741254271536917841.kers
Total runtime 1 ms.
[2026-06-02 03:46:19] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-06-02 03:46:19] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
[2026-06-02 03:46:19] [INFO ] Invariant cache hit.
[2026-06-02 03:46:19] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 53/185 places, 72/297 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 332 ms. Remains : 53/185 places, 72/297 transitions.
[2026-06-02 03:46:19] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:46:19] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:46:19] [INFO ] Input system was already deterministic with 72 transitions.
[2026-06-02 03:46:19] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:46:19] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:46:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality13219746205806340031.gal : 1 ms
[2026-06-02 03:46:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality10445741175452006437.ctl : 17 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/CTLCardinality13219746205806340031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10445741175452006437.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,543900,0.043248,4624,2,298,5,3108,6,0,282,2526,0


Converting to forward existential form...Done !
original formula: !(E((p215==0) U A(E(!(AG(((p118==0)||(p41==1)))) U !(((p208==0)||(p39==1)))) U E((((p34!=1)||(p119==0))||(p92==1)) U AG((p127==0))))))
=> equivalent forward existential formula: [((FwdU(Init,(p215==0)) * !(EG(!(E((((p34!=1)||(p119==0))||(p92==1)) U !(E(TRUE U !((p127==0))))))))) * !(E(!(E(...378
Reverse transition relation is NOT exact ! Due to transitions t51, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 69/0/3
(forward)formula 0,0,3.31001,76648,1,0,363,470120,185,234,2152,420814,462
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-07 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 : 185/185 places, 297/297 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 157 transition count 253
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 157 transition count 253
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 68 place count 145 transition count 230
Ensure Unique test removed 1 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 81 place count 144 transition count 230
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 87 place count 138 transition count 183
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 137 transition count 183
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 98 place count 133 transition count 170
Iterating global reduction 0 with 4 rules applied. Total rules applied 102 place count 133 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 132 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 132 transition count 169
Applied a total of 104 rules in 11 ms. Remains 132 /185 variables (removed 53) and now considering 169/297 (removed 128) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17862324594544946246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12821114248231059194.kers'
[2026-06-02 03:46:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17862324594544946246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12821114248231059194.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 169 rows 132 cols 521 entries
Finished phase 1 with 118 SingleSign rule and 2 generalized
[2026-06-02 03:46:22] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12821114248231059194.kers
Total runtime 1 ms.
[2026-06-02 03:46:23] [INFO ] Implicit Places using invariants in 95 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 131/185 places, 169/297 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 169/169 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 131/185 places, 169/297 transitions.
[2026-06-02 03:46:23] [INFO ] Flatten gal took : 8 ms
[2026-06-02 03:46:23] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:46:23] [INFO ] Input system was already deterministic with 169 transitions.
[2026-06-02 03:46:23] [INFO ] Flatten gal took : 8 ms
[2026-06-02 03:46:23] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:46:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality14081673826293057083.gal : 2 ms
[2026-06-02 03:46:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality12685623355956915592.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/CTLCardinality14081673826293057083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12685623355956915592.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.48255e+09,0.413803,15568,2,5486,5,49765,6,0,695,41932,0


Converting to forward existential form...Done !
original formula: EG(((EF(((AF(((p77==0)||(p107==1))) + (p193==1)) * AG((p69==0)))) + ((EF((E(((p145==0)||(p76==1)) U ((p16==0)||(p144==1))) + ((p77==0)&&(...305
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U ((!(EG(!(((p77==0)||(p107==1))))) + (p193==1)) * !(E(TRUE U !((p69==0)))))) + ((E(TRUE U (...698
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t26, t36, t42, t51, t55, t56, t59, t68, t74, t75, t78, t87, t94, t96, t97, t99,...334
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-06-02 03:46:53] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:46:53] [INFO ] Applying decomposition
[2026-06-02 03:46:53] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2633039114537288759.txt' '-o' '/tmp/graph2633039114537288759.bin' '-w' '/tmp/graph2633039114537288759.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2633039114537288759.bin' '-l' '-1' '-v' '-w' '/tmp/graph2633039114537288759.weights' '-q' '0' '-e' '0.001'
[2026-06-02 03:46:53] [INFO ] Decomposing Gal with order
[2026-06-02 03:46:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 03:46:53] [INFO ] Removed a total of 144 redundant transitions.
[2026-06-02 03:46:53] [INFO ] Flatten gal took : 16 ms
[2026-06-02 03:46:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2026-06-02 03:46:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality10224782874627308411.gal : 4 ms
[2026-06-02 03:46:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality14191612059703249522.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/CTLCardinality10224782874627308411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14191612059703249522.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.48255e+09,0.068803,5988,386,46,3703,323,422,5055,87,717,0


Converting to forward existential form...Done !
original formula: EG(((EF(((AF(((i4.u14.p77==0)||(i0.i0.u18.p107==1))) + (i11.u39.p193==1)) * AG((i1.u12.p69==0)))) + ((EF((E(((i6.u25.p145==0)||(i4.u14.p7...451
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U ((!(EG(!(((i4.u14.p77==0)||(i0.i0.u18.p107==1))))) + (i11.u39.p193==1)) * !(E(TRUE U !((i1...978
Reverse transition relation is NOT exact ! Due to transitions t74, t100, t113, t115, t119, i0.i0.u1.t109, i0.i0.u18.t75, i0.i1.t108, i0.i1.t152, i2.t155, i...472
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,6.52481,153144,1,0,318648,920,2774,396661,417,2565,430031
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 297/297 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 150 transition count 246
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 150 transition count 246
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 87 place count 133 transition count 200
Ensure Unique test removed 2 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 106 place count 131 transition count 200
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 114 place count 123 transition count 159
Ensure Unique test removed 1 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 123 place count 122 transition count 159
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 129 place count 116 transition count 146
Iterating global reduction 0 with 6 rules applied. Total rules applied 135 place count 116 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 137 place count 114 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 139 place count 114 transition count 144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 113 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 113 transition count 143
Applied a total of 141 rules in 7 ms. Remains 113 /185 variables (removed 72) and now considering 143/297 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7140218027845096233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1788629948171362880.kers'
[2026-06-02 03:46:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7140218027845096233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1788629948171362880.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 113 cols 396 entries
Finished phase 1 with 101 SingleSign rule and 1 generalized
[2026-06-02 03:46:59] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1788629948171362880.kers
Total runtime 2 ms.
[2026-06-02 03:47:00] [INFO ] Implicit Places using invariants in 106 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/185 places, 143/297 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 112/185 places, 143/297 transitions.
[2026-06-02 03:47:00] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:47:00] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:47:00] [INFO ] Input system was already deterministic with 143 transitions.
[2026-06-02 03:47:00] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:47:00] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:47:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality1711798805821364069.gal : 2 ms
[2026-06-02 03:47:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality2395952698031525972.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/CTLCardinality1711798805821364069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2395952698031525972.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AG(EX((p88==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX((p88==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t15, t18, t26, t66, t78, t84, t86, t87, t89, t90, t91, t93, t94, t96, t97, t100, t127, t...266
(forward)formula 0,0,1.17105,28040,1,0,221,132935,307,125,3638,105567,304
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-09 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 : 185/185 places, 297/297 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 152 transition count 256
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 152 transition count 256
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 83 place count 135 transition count 210
Ensure Unique test removed 2 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 102 place count 133 transition count 210
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 108 place count 127 transition count 168
Iterating global reduction 0 with 6 rules applied. Total rules applied 114 place count 127 transition count 168
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 118 place count 123 transition count 157
Iterating global reduction 0 with 4 rules applied. Total rules applied 122 place count 123 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 124 place count 121 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 126 place count 121 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 127 place count 120 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 128 place count 120 transition count 154
Applied a total of 128 rules in 16 ms. Remains 120 /185 variables (removed 65) and now considering 154/297 (removed 143) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18030080434931021847.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3163999734075217769.kers'
[2026-06-02 03:47:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18030080434931021847.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3163999734075217769.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 154 rows 120 cols 459 entries
Finished phase 1 with 106 SingleSign rule and 2 generalized
[2026-06-02 03:47:01] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3163999734075217769.kers
Total runtime 2 ms.
[2026-06-02 03:47:01] [INFO ] Implicit Places using invariants in 97 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/185 places, 154/297 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115 ms. Remains : 119/185 places, 154/297 transitions.
[2026-06-02 03:47:01] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:47:01] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:47:01] [INFO ] Input system was already deterministic with 154 transitions.
[2026-06-02 03:47:01] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:47:01] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:47:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality155193217424593762.gal : 1 ms
[2026-06-02 03:47:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality5223385251311553155.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/CTLCardinality155193217424593762.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5223385251311553155.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.72645e+08,0.347807,10328,2,2948,5,27904,6,0,632,22850,0


Converting to forward existential form...Done !
original formula: E(A(E(((!(AG((p49==1))) + (p152==0)) + (p197==1)) U AX((p208!=1))) U (p101!=1)) U (p53==1))
=> equivalent forward existential formula: [(FwdU(Init,!((E(!((p101!=1)) U (!(E(((!(!(E(TRUE U !((p49==1))))) + (p152==0)) + (p197==1)) U !(EX(!((p208!=1))...220
Reverse transition relation is NOT exact ! Due to transitions t11, t16, t19, t27, t68, t71, t79, t90, t91, t92, t93, t95, t96, t98, t99, t102, t103, t137, ...273
(forward)formula 0,1,17.3328,406844,1,0,956,2.36337e+06,347,592,4120,2.49563e+06,1146
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 185/185 places, 297/297 transitions.
Graph (trivial) has 165 edges and 185 vertex of which 11 / 185 are part of one of the 5 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 178 transition count 236
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 67 rules applied. Total rules applied 121 place count 125 transition count 222
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 126 place count 120 transition count 222
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 126 place count 120 transition count 210
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 151 place count 107 transition count 210
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 171 place count 87 transition count 174
Iterating global reduction 3 with 20 rules applied. Total rules applied 191 place count 87 transition count 174
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 191 place count 87 transition count 171
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 197 place count 84 transition count 171
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 205 place count 76 transition count 124
Ensure Unique test removed 3 places
Iterating global reduction 3 with 11 rules applied. Total rules applied 216 place count 73 transition count 124
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 221 place count 68 transition count 90
Iterating global reduction 3 with 5 rules applied. Total rules applied 226 place count 68 transition count 90
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 266 place count 48 transition count 70
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 271 place count 43 transition count 60
Iterating global reduction 3 with 5 rules applied. Total rules applied 276 place count 43 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 282 place count 43 transition count 54
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 288 place count 40 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 289 place count 39 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 290 place count 38 transition count 50
Applied a total of 290 rules in 23 ms. Remains 38 /185 variables (removed 147) and now considering 50/297 (removed 247) transitions.
[2026-06-02 03:47:18] [INFO ] Flow matrix only has 42 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2650188908798549382.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3245203321034389945.kers'
[2026-06-02 03:47:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2650188908798549382.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3245203321034389945.kers]
Normalized transition count is 41 out of 42 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 41 rows 34 cols 104 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-06-02 03:47:18] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3245203321034389945.kers
Total runtime 1 ms.
[2026-06-02 03:47:18] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-06-02 03:47:18] [INFO ] Flow matrix only has 42 transitions (discarded 8 similar events)
[2026-06-02 03:47:18] [INFO ] Invariant cache hit.
[2026-06-02 03:47:19] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2026-06-02 03:47:19] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2026-06-02 03:47:19] [INFO ] Flow matrix only has 42 transitions (discarded 8 similar events)
[2026-06-02 03:47:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 5/38 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 41/79 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 0/79 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/80 variables, and 47 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1051 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 5/38 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 41/79 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 33/80 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/80 variables, and 80 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2087ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2088ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/185 places, 50/297 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2264 ms. Remains : 38/185 places, 50/297 transitions.
[2026-06-02 03:47:21] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:47:21] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:47:21] [INFO ] Input system was already deterministic with 50 transitions.
[2026-06-02 03:47:21] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:47:21] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 648 steps (19 resets) in 24 ms. (25 steps per ms) remains 0/1 properties
[2026-06-02 03:47:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality803158479997355073.gal : 1 ms
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-06-02 03:47:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4298996300202831882.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality803158479997355073.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4298996300202831882.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 297/297 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 159 transition count 255
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 159 transition count 255
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 63 place count 148 transition count 217
Ensure Unique test removed 1 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 75 place count 147 transition count 217
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 77 place count 145 transition count 193
Iterating global reduction 0 with 2 rules applied. Total rules applied 79 place count 145 transition count 193
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 80 place count 144 transition count 191
Iterating global reduction 0 with 1 rules applied. Total rules applied 81 place count 144 transition count 191
Applied a total of 81 rules in 14 ms. Remains 144 /185 variables (removed 41) and now considering 191/297 (removed 106) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16322987075225734652.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17640557442626494836.kers'
[2026-06-02 03:47:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16322987075225734652.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17640557442626494836.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 191 rows 144 cols 663 entries
Finished phase 1 with 128 SingleSign rule and 3 generalized
[2026-06-02 03:47:21] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17640557442626494836.kers
Total runtime 2 ms.
[2026-06-02 03:47:21] [INFO ] Implicit Places using invariants in 124 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/185 places, 191/297 transitions.
Applied a total of 0 rules in 1 ms. Remains 143 /143 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 143/185 places, 191/297 transitions.
[2026-06-02 03:47:21] [INFO ] Flatten gal took : 8 ms
[2026-06-02 03:47:21] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:47:21] [INFO ] Input system was already deterministic with 191 transitions.
[2026-06-02 03:47:21] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:47:21] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:47:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality6864008810751627304.gal : 2 ms
[2026-06-02 03:47:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality10246304811943992778.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/CTLCardinality6864008810751627304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10246304811943992778.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.99298e+09,1.02536,26144,2,6244,5,93571,6,0,765,80610,0


Converting to forward existential form...Done !
original formula: E(((EF(!((AG((p59==0)) + EF((p34==0))))) + E(((AF(((p210==0)||(p204==1))) * E((p59==1) U (p128==0))) * !(((p35==0)||(p118==1)))) U !(((p1...408
=> equivalent forward existential formula: [(EY(((FwdU(Init,((E(TRUE U !((!(E(TRUE U !((p59==0)))) + E(TRUE U (p34==0))))) + E(((!(EG(!(((p210==0)||(p204==...561
Reverse transition relation is NOT exact ! Due to transitions t3, t12, t17, t21, t29, t77, t78, t81, t89, t92, t98, t99, t101, t104, t105, t107, t109, t110...317
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-06-02 03:47:51] [INFO ] Flatten gal took : 9 ms
[2026-06-02 03:47:51] [INFO ] Applying decomposition
[2026-06-02 03:47:51] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17631576555113126251.txt' '-o' '/tmp/graph17631576555113126251.bin' '-w' '/tmp/graph17631576555113126251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17631576555113126251.bin' '-l' '-1' '-v' '-w' '/tmp/graph17631576555113126251.weights' '-q' '0' '-e' '0.001'
[2026-06-02 03:47:51] [INFO ] Decomposing Gal with order
[2026-06-02 03:47:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 03:47:51] [INFO ] Removed a total of 218 redundant transitions.
[2026-06-02 03:47:51] [INFO ] Flatten gal took : 27 ms
[2026-06-02 03:47:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 14 ms.
[2026-06-02 03:47:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality8432784036903043887.gal : 5 ms
[2026-06-02 03:47:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality12931062018025476595.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/CTLCardinality8432784036903043887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12931062018025476595.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.99298e+09,0.156395,6760,410,78,4980,424,543,7887,113,944,0


Converting to forward existential form...Done !
original formula: E(((EF(!((AG((i2.i1.u11.p59==0)) + EF((i0.i0.u1.p34==0))))) + E(((AF(((i9.i1.u42.p210==0)||(i9.i1.u44.p204==1))) * E((i2.i1.u11.p59==1) U...636
=> equivalent forward existential formula: [(EY(((FwdU(Init,((E(TRUE U !((!(E(TRUE U !((i2.i1.u11.p59==0)))) + E(TRUE U (i0.i0.u1.p34==0))))) + E(((!(EG(!(...803
Reverse transition relation is NOT exact ! Due to transitions t29, t77, t99, t105, t117, i0.i0.u1.t113, i0.i0.u1.t114, i0.i0.u21.t78, i0.i1.t112, i0.i1.t17...459
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,6.06046,143608,1,0,241455,1704,3468,716355,589,4062,310905
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 297/297 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 150 transition count 246
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 150 transition count 246
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 87 place count 133 transition count 200
Ensure Unique test removed 2 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 106 place count 131 transition count 200
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 114 place count 123 transition count 159
Ensure Unique test removed 1 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 123 place count 122 transition count 159
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 129 place count 116 transition count 146
Iterating global reduction 0 with 6 rules applied. Total rules applied 135 place count 116 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 137 place count 114 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 139 place count 114 transition count 144
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 113 transition count 143
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 113 transition count 143
Applied a total of 141 rules in 12 ms. Remains 113 /185 variables (removed 72) and now considering 143/297 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5431981871793589766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12305461877380617839.kers'
[2026-06-02 03:47:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5431981871793589766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12305461877380617839.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 113 cols 396 entries
Finished phase 1 with 101 SingleSign rule and 1 generalized
[2026-06-02 03:47:57] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12305461877380617839.kers
Total runtime 2 ms.
[2026-06-02 03:47:57] [INFO ] Implicit Places using invariants in 88 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/185 places, 143/297 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 112/185 places, 143/297 transitions.
[2026-06-02 03:47:57] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:47:57] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:47:57] [INFO ] Input system was already deterministic with 143 transitions.
[2026-06-02 03:47:57] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:47:57] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:47:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality16349047004517541499.gal : 2 ms
[2026-06-02 03:47:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality10716833678326535648.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/CTLCardinality16349047004517541499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10716833678326535648.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,3.37157e+08,0.165799,7620,2,1534,5,16124,6,0,593,14803,0


Converting to forward existential form...Done !
original formula: EF(AX(EX(AF(((p154==0)&&(p159==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(!(EG(!(((p154==0)&&(p159==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t15, t18, t26, t68, t78, t87, t89, t90, t91, t93, t94, t96, t97, t100, t127, t128, t129,...256
(forward)formula 0,0,0.873852,24768,1,0,243,107666,309,127,3588,98701,328
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 297/297 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 151 transition count 247
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 151 transition count 247
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 85 place count 134 transition count 201
Ensure Unique test removed 2 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 104 place count 132 transition count 201
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 125 transition count 164
Ensure Unique test removed 1 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 119 place count 124 transition count 164
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 124 place count 119 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 129 place count 119 transition count 151
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 131 place count 117 transition count 149
Iterating global reduction 0 with 2 rules applied. Total rules applied 133 place count 117 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 116 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 116 transition count 148
Applied a total of 135 rules in 15 ms. Remains 116 /185 variables (removed 69) and now considering 148/297 (removed 149) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9143122486930695881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1776832092732275684.kers'
[2026-06-02 03:47:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9143122486930695881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1776832092732275684.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 116 cols 420 entries
Finished phase 1 with 104 SingleSign rule and 1 generalized
[2026-06-02 03:47:58] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1776832092732275684.kers
Total runtime 1 ms.
[2026-06-02 03:47:58] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-06-02 03:47:58] [INFO ] Invariant cache hit.
[2026-06-02 03:47:59] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2026-06-02 03:47:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/264 variables, 116/127 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 127 constraints, problems are : Problem set: 0 solved, 147 unsolved in 10265 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/264 variables, 116/127 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 147/274 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (OVERLAPS) 0/264 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 278 constraints, problems are : Problem set: 0 solved, 147 unsolved in 16447 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 26741ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 26743ms
Starting structural reductions in LTL mode, iteration 1 : 116/185 places, 148/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27042 ms. Remains : 116/185 places, 148/297 transitions.
[2026-06-02 03:48:25] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:48:25] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:48:25] [INFO ] Input system was already deterministic with 148 transitions.
[2026-06-02 03:48:25] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:48:25] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:48:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality15119136846127067805.gal : 2 ms
[2026-06-02 03:48:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality14634823318030089396.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/CTLCardinality15119136846127067805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14634823318030089396.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,4.54705e+08,0.275423,9716,2,2951,5,25424,6,0,614,19779,0


Converting to forward existential form...Done !
original formula: EG(((EF(AX(((p186==1)&&(p12==1)))) * EF(((p184==0)&&(p4==1)))) * ((p186==0)||(p39==1))))
=> equivalent forward existential formula: [FwdG(Init,((E(TRUE U !(EX(!(((p186==1)&&(p12==1)))))) * E(TRUE U ((p184==0)&&(p4==1)))) * ((p186==0)||(p39==1))...167
Reverse transition relation is NOT exact ! Due to transitions t11, t15, t18, t29, t58, t69, t72, t79, t88, t90, t91, t92, t95, t96, t98, t99, t102, t104, t...284
(forward)formula 0,0,6.77755,157204,1,0,315,993082,326,151,3939,703379,406
FORMULA ErlangenMainframeV2-PT-bP03C03-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-06-02 03:48:32] [INFO ] Flatten gal took : 15 ms
[2026-06-02 03:48:32] [INFO ] Flatten gal took : 15 ms
Total runtime 284649 ms.

BK_STOP 1780372112770

--------------------
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="ErlangenMainframeV2-PT-bP03C03"
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 ErlangenMainframeV2-PT-bP03C03, 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 r338-smll-178021499200225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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