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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.6K May 27 08:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 27 08:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 27 08:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 27 08:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 27 10:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 27 10:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 08:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 27 08:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 27 08:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 27 08:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:31 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 64K 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 ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-00
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-01
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-02
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-03
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-04
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-05
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-06
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-07
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-08
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-09
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-10
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-11
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-12
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-13
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-14
FORMULA_NAME ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1780260344668

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP02C02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-31 20:45:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-31 20:45:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 20:45:46] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2026-05-31 20:45:46] [INFO ] Transformed 193 places.
[2026-05-31 20:45:46] [INFO ] Transformed 255 transitions.
[2026-05-31 20:45:46] [INFO ] Found NUPN structural information;
[2026-05-31 20:45:46] [INFO ] Parsed PT model containing 193 places and 255 transitions and 805 arcs in 273 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 83 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 255/255 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 168 transition count 230
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 168 transition count 230
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 165 transition count 227
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 165 transition count 227
Applied a total of 56 rules in 48 ms. Remains 165 /193 variables (removed 28) and now considering 227/255 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1931465078286245848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6886478423316495888.kers'
[2026-05-31 20:45:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1931465078286245848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6886478423316495888.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 227 rows 165 cols 749 entries
Finished phase 1 with 152 SingleSign rule and 3 generalized
[2026-05-31 20:45:47] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6886478423316495888.kers
Total runtime 2 ms.
[2026-05-31 20:45:47] [INFO ] Implicit Places using invariants in 369 ms returned []
[2026-05-31 20:45:47] [INFO ] Invariant cache hit.
[2026-05-31 20:45:47] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2026-05-31 20:45:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 227/392 variables, 165/189 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/392 variables, and 192 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 227/392 variables, 165/194 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 226/420 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 7/427 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 428 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60258ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60307ms
Starting structural reductions in LTL mode, iteration 1 : 165/193 places, 227/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61158 ms. Remains : 165/193 places, 227/255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 227/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 165 /165 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2026-05-31 20:46:48] [INFO ] Invariant cache hit.
[2026-05-31 20:46:48] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-31 20:46:48] [INFO ] Invariant cache hit.
[2026-05-31 20:46:48] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 165/165 places, 227/227 transitions.
Support contains 83 out of 165 places after structural reductions.
[2026-05-31 20:46:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-31 20:46:49] [INFO ] Flatten gal took : 92 ms
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-31 20:46:49] [INFO ] Flatten gal took : 46 ms
[2026-05-31 20:46:49] [INFO ] Input system was already deterministic with 227 transitions.
Support contains 69 out of 165 places (down from 83) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3375 ms. (11 steps per ms) remains 7/57 properties
BEST_FIRST walk for 40000 steps (8 resets) in 200 ms. (199 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 174 ms. (228 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 133 ms. (298 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 145 ms. (273 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 3/4 properties
[2026-05-31 20:46:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 81/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 75/161 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/165 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 227/392 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/392 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 175 constraints, problems are : Problem set: 0 solved, 3 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 81/86 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 75/161 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/165 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 227/392 variables, 165/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/392 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 181 constraints, problems are : Problem set: 0 solved, 3 unsolved in 890 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1238ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 441 ms.
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 227/227 transitions.
Graph (trivial) has 152 edges and 165 vertex of which 10 / 165 are part of one of the 5 SCC in 11 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 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 160 transition count 164
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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 66 rules applied. Total rules applied 120 place count 107 transition count 151
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 126 place count 102 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 127 place count 101 transition count 150
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 127 place count 101 transition count 141
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 145 place count 92 transition count 141
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 161 place count 76 transition count 123
Iterating global reduction 4 with 16 rules applied. Total rules applied 177 place count 76 transition count 123
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 177 place count 76 transition count 118
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 187 place count 71 transition count 118
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 196 place count 62 transition count 82
Ensure Unique test removed 1 places
Iterating global reduction 4 with 10 rules applied. Total rules applied 206 place count 61 transition count 82
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 208 place count 59 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 210 place count 59 transition count 74
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 4 with 40 rules applied. Total rules applied 250 place count 39 transition count 54
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 266 place count 31 transition count 70
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 278 place count 31 transition count 58
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 281 place count 28 transition count 49
Iterating global reduction 5 with 3 rules applied. Total rules applied 284 place count 28 transition count 49
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 289 place count 28 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 291 place count 27 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 301 place count 27 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 303 place count 26 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 304 place count 26 transition count 46
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 308 place count 26 transition count 42
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 315 place count 22 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 318 place count 22 transition count 36
Applied a total of 318 rules in 107 ms. Remains 22 /165 variables (removed 143) and now considering 36/227 (removed 191) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 22/165 places, 36/227 transitions.
RANDOM walk for 276 steps (0 resets) in 14 ms. (18 steps per ms) remains 0/2 properties
[2026-05-31 20:46:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-31 20:46:52] [INFO ] Flatten gal took : 19 ms
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-31 20:46:52] [INFO ] Flatten gal took : 18 ms
[2026-05-31 20:46:52] [INFO ] Input system was already deterministic with 227 transitions.
Support contains 68 out of 165 places (down from 69) after GAL structural reductions.
Computed a total of 18 stabilizing places and 18 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 227/227 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 133 transition count 193
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 133 transition count 193
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 77 place count 120 transition count 165
Iterating global reduction 0 with 13 rules applied. Total rules applied 90 place count 120 transition count 165
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 96 place count 114 transition count 149
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 103 place count 113 transition count 149
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 108 place count 108 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 113 place count 108 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 115 place count 106 transition count 137
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 106 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 118 place count 105 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 119 place count 105 transition count 136
Applied a total of 119 rules in 56 ms. Remains 105 /165 variables (removed 60) and now considering 136/227 (removed 91) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17231349458165725467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6583686935592336897.kers'
[2026-05-31 20:46:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17231349458165725467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6583686935592336897.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 136 rows 105 cols 370 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-31 20:46:52] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6583686935592336897.kers
Total runtime 2 ms.
[2026-05-31 20:46:52] [INFO ] Implicit Places using invariants in 102 ms returned [15]
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 : 104/165 places, 136/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 168 ms. Remains : 104/165 places, 136/227 transitions.
[2026-05-31 20:46:52] [INFO ] Flatten gal took : 14 ms
[2026-05-31 20:46:52] [INFO ] Flatten gal took : 13 ms
[2026-05-31 20:46:52] [INFO ] Input system was already deterministic with 136 transitions.
[2026-05-31 20:46:52] [INFO ] Flatten gal took : 12 ms
[2026-05-31 20:46:52] [INFO ] Flatten gal took : 13 ms
[2026-05-31 20:46:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality13949603711213584576.gal : 6 ms
[2026-05-31 20:46:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality3984239103429978176.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/CTLCardinality13949603711213584576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3984239103429978176.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,4.54336e+07,0.091199,5228,2,607,5,5447,6,0,554,5692,0


Converting to forward existential form...Done !
original formula: AG(A(A((AF((p20==1)) * AX((p45==1))) U !(((p123==0)||(p142==1)))) U (p94==0)))
=> equivalent forward existential formula: ((([FwdG((FwdU((FwdU(FwdU(Init,TRUE),!((p94==0))) * !((p94==0))),!(!(((p123==0)||(p142==1))))) * !(!(((p123==0)|...487
Hit Full ! (commute/partial/dont) 131/0/5
(forward)formula 0,0,0.327601,11672,1,0,28,39843,20,1,2619,28744,28
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 165/165 places, 227/227 transitions.
Graph (trivial) has 154 edges and 165 vertex of which 12 / 165 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 157 transition count 168
Reduce places removed 50 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 63 rules applied. Total rules applied 114 place count 107 transition count 155
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 119 place count 102 transition count 155
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 119 place count 102 transition count 145
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 139 place count 92 transition count 145
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 156 place count 75 transition count 126
Iterating global reduction 3 with 17 rules applied. Total rules applied 173 place count 75 transition count 126
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 173 place count 75 transition count 124
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 177 place count 73 transition count 124
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 187 place count 63 transition count 87
Ensure Unique test removed 2 places
Iterating global reduction 3 with 12 rules applied. Total rules applied 199 place count 61 transition count 87
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 202 place count 58 transition count 77
Iterating global reduction 3 with 3 rules applied. Total rules applied 205 place count 58 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 206 place count 57 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 57 transition count 75
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 239 place count 41 transition count 59
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 240 place count 40 transition count 57
Iterating global reduction 3 with 1 rules applied. Total rules applied 241 place count 40 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 245 place count 40 transition count 53
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 3 with 4 rules applied. Total rules applied 249 place count 38 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 37 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 251 place count 36 transition count 50
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 255 place count 36 transition count 46
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 257 place count 36 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 259 place count 34 transition count 44
Applied a total of 259 rules in 39 ms. Remains 34 /165 variables (removed 131) and now considering 44/227 (removed 183) transitions.
[2026-05-31 20:46:53] [INFO ] Flow matrix only has 42 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5147557388905095547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3549039177564238592.kers'
[2026-05-31 20:46:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5147557388905095547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3549039177564238592.kers]
Normalized transition count is 41 out of 42 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 41 rows 32 cols 98 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-31 20:46:53] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3549039177564238592.kers
Total runtime 0 ms.
[2026-05-31 20:46:53] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-31 20:46:53] [INFO ] Flow matrix only has 42 transitions (discarded 2 similar events)
[2026-05-31 20:46:53] [INFO ] Invariant cache hit.
[2026-05-31 20:46:53] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2026-05-31 20:46:53] [INFO ] Redundant transitions in 1 ms returned []
Running 31 sub problems to find dead transitions.
[2026-05-31 20:46:53] [INFO ] Flow matrix only has 42 transitions (discarded 2 similar events)
[2026-05-31 20:46:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 5/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 41/75 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 0/75 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/76 variables, and 41 constraints, problems are : Problem set: 0 solved, 31 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 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/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 5/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 41/75 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/75 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/76 variables, and 72 constraints, problems are : Problem set: 0 solved, 31 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1590ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 1590ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/165 places, 44/227 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1746 ms. Remains : 34/165 places, 44/227 transitions.
[2026-05-31 20:46:54] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:46:54] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:46:54] [INFO ] Input system was already deterministic with 44 transitions.
[2026-05-31 20:46:54] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:46:54] [INFO ] Flatten gal took : 2 ms
[2026-05-31 20:46:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality6848769050143900474.gal : 1 ms
[2026-05-31 20:46:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality18091091397092017137.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/CTLCardinality6848769050143900474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18091091397092017137.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,19008,0.024917,4048,2,106,5,554,5,0,181,416,0


Converting to forward existential form...Done !
original formula: EG(AG(((p164==0) + EF((p190==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((p164==0) + E(TRUE U (p190==0)))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.03901,4364,1,0,7,2198,17,2,846,901,11
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 227/227 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 135 transition count 197
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 135 transition count 197
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 72 place count 123 transition count 175
Iterating global reduction 0 with 12 rules applied. Total rules applied 84 place count 123 transition count 175
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 117 transition count 157
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 117 transition count 157
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 111 transition count 141
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 111 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 111 place count 108 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 114 place count 108 transition count 137
Applied a total of 114 rules in 28 ms. Remains 108 /165 variables (removed 57) and now considering 137/227 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6478455693838006992.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18087769944985357386.kers'
[2026-05-31 20:46:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6478455693838006992.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18087769944985357386.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 137 rows 108 cols 381 entries
Finished phase 1 with 96 SingleSign rule and 2 generalized
[2026-05-31 20:46:55] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-18087769944985357386.kers
Total runtime 5 ms.
[2026-05-31 20:46:55] [INFO ] Implicit Places using invariants in 251 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 252 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/165 places, 137/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 107 /107 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 284 ms. Remains : 107/165 places, 137/227 transitions.
[2026-05-31 20:46:55] [INFO ] Flatten gal took : 14 ms
[2026-05-31 20:46:55] [INFO ] Flatten gal took : 16 ms
[2026-05-31 20:46:55] [INFO ] Input system was already deterministic with 137 transitions.
[2026-05-31 20:46:55] [INFO ] Flatten gal took : 12 ms
[2026-05-31 20:46:55] [INFO ] Flatten gal took : 12 ms
[2026-05-31 20:46:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality4821966785156355530.gal : 5 ms
[2026-05-31 20:46:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality322354406198842274.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/CTLCardinality4821966785156355530.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality322354406198842274.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,4.56745e+07,0.114586,5588,2,776,5,6688,6,0,567,7227,0


Converting to forward existential form...Done !
original formula: EF((((AX(A((p46==0) U (p96==0))) * EX(((p141==0)&&(p188==1)))) * (EG((p155==0)) * (p27==1))) * ((p43==0)||(p184==1))))
=> equivalent forward existential formula: [FwdG((((FwdU(Init,TRUE) * ((p43==0)||(p184==1))) * (!(EX(!(!((E(!((p96==0)) U (!((p46==0)) * !((p96==0)))) + EG...237
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t14, t17, t25, t66, t76, t84, t87, t88, t90, t108, t109, t114, t115, Intersection ...241
Hit Full ! (commute/partial/dont) 133/0/4
(forward)formula 0,1,0.642944,20068,1,0,262,78505,312,139,3544,86148,355
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 227/227 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 133 transition count 193
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 133 transition count 193
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 121 transition count 166
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 121 transition count 166
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 116 transition count 151
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 116 transition count 151
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 103 place count 111 transition count 141
Iterating global reduction 0 with 5 rules applied. Total rules applied 108 place count 111 transition count 141
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 110 place count 109 transition count 139
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 109 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 108 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 108 transition count 138
Applied a total of 114 rules in 11 ms. Remains 108 /165 variables (removed 57) and now considering 138/227 (removed 89) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-308625107681584960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4693426730148043402.kers'
[2026-05-31 20:46:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-308625107681584960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4693426730148043402.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 138 rows 108 cols 383 entries
Finished phase 1 with 96 SingleSign rule and 2 generalized
[2026-05-31 20:46:56] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4693426730148043402.kers
Total runtime 1 ms.
[2026-05-31 20:46:56] [INFO ] Implicit Places using invariants in 62 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/165 places, 138/227 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /107 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 107/165 places, 138/227 transitions.
[2026-05-31 20:46:56] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:46:56] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:46:56] [INFO ] Input system was already deterministic with 138 transitions.
[2026-05-31 20:46:56] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:46:56] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:46:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality2797303415403283672.gal : 2 ms
[2026-05-31 20:46:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality414292977343918795.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/CTLCardinality2797303415403283672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality414292977343918795.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.54067e+07,0.056179,5468,2,699,5,6113,6,0,568,6571,0


Converting to forward existential form...Done !
original formula: AF(EX(AG((p17!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U !((p17!=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t14, t17, t25, t65, t68, t75, t84, t86, t88, t89, t91, t109, t110, t111, t116, Intersec...246
(forward)formula 0,0,10.4796,267784,1,0,534,1.09661e+06,304,337,3513,2.06958e+06,562
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 227/227 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 136 transition count 196
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 136 transition count 196
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 68 place count 126 transition count 179
Iterating global reduction 0 with 10 rules applied. Total rules applied 78 place count 126 transition count 179
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 123 transition count 168
Ensure Unique test removed 1 places
Iterating global reduction 0 with 4 rules applied. Total rules applied 85 place count 122 transition count 168
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 88 place count 119 transition count 159
Iterating global reduction 0 with 3 rules applied. Total rules applied 91 place count 119 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 92 place count 118 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 93 place count 118 transition count 158
Applied a total of 93 rules in 12 ms. Remains 118 /165 variables (removed 47) and now considering 158/227 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8010172352867585323.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6564592718414344817.kers'
[2026-05-31 20:47:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8010172352867585323.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6564592718414344817.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 158 rows 118 cols 454 entries
Finished phase 1 with 108 SingleSign rule and 1 generalized
[2026-05-31 20:47:06] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6564592718414344817.kers
Total runtime 1 ms.
[2026-05-31 20:47:06] [INFO ] Implicit Places using invariants in 79 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/165 places, 158/227 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 158/158 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 117/165 places, 158/227 transitions.
[2026-05-31 20:47:06] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:47:06] [INFO ] Flatten gal took : 19 ms
[2026-05-31 20:47:06] [INFO ] Input system was already deterministic with 158 transitions.
[2026-05-31 20:47:06] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:47:06] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:47:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality16421810845679998852.gal : 3 ms
[2026-05-31 20:47:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality7407124215878751221.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/CTLCardinality16421810845679998852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7407124215878751221.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.04849e+08,0.180438,9172,2,1880,5,23674,6,0,628,22068,0


Converting to forward existential form...Done !
original formula: !(E(((p147==0)||(p148==1)) U (!(EX(EX(((p147==0)||(p54==1))))) + AG(EX(A(((p169==0)||(p14==1)) U ((p161==0)||(p32==1))))))))
=> equivalent forward existential formula: ([(FwdU(Init,((p147==0)||(p148==1))) * !(EX(EX(((p147==0)||(p54==1))))))] = FALSE * [(FwdU(Init,((p147==0)||(p14...315
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t15, t19, t26, t29, t71, t74, t81, t87, t90, t93, t94, t95, t96, t98, t100, t102, t1...277
Hit Full ! (commute/partial/dont) 150/0/8
(forward)formula 0,0,1.07855,34708,1,0,272,156085,353,138,4128,142988,356
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-06 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 : 165/165 places, 227/227 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 144 transition count 204
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 144 transition count 204
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 137 transition count 190
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 137 transition count 190
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 135 transition count 175
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 135 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 134 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 134 transition count 174
Applied a total of 62 rules in 10 ms. Remains 134 /165 variables (removed 31) and now considering 174/227 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4248746634643357061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13304948404166916101.kers'
[2026-05-31 20:47:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4248746634643357061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13304948404166916101.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 134 cols 511 entries
Finished phase 1 with 121 SingleSign rule and 3 generalized
[2026-05-31 20:47:08] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13304948404166916101.kers
Total runtime 2 ms.
[2026-05-31 20:47:08] [INFO ] Implicit Places using invariants in 72 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/165 places, 174/227 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 133/165 places, 174/227 transitions.
[2026-05-31 20:47:08] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:47:08] [INFO ] Flatten gal took : 10 ms
[2026-05-31 20:47:08] [INFO ] Input system was already deterministic with 174 transitions.
[2026-05-31 20:47:08] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:47:08] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:47:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality9101314475943536722.gal : 1 ms
[2026-05-31 20:47:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality9881355390040820277.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/CTLCardinality9101314475943536722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9881355390040820277.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: ((EX(((EF((p63==0)) * AX(((p155==0)||(p12==1)))) * (((p154==0) + EX((p182==1))) * EF((p68==1))))) + AX((p169==1))) + (A((!(EX(((p151==0)|...386
=> equivalent forward existential formula: [(EY(((Init * !((!((E(!((E(TRUE U ((p164==1)&&((p47==0)||(p170==1)))) * !(((p115==0)||(p41==1))))) U (!((!(EX(((...638
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t9, t13, t16, t20, t28, t31, t37, t39, t45, t50, t57, t62, t65, t77, t78, t81, t90, t...331
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,19.1683,460076,1,0,455,3.19441e+06,398,236,4770,2.08007e+06,563
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 227/227 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 137 transition count 197
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 137 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 128 transition count 173
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 128 transition count 173
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 123 transition count 158
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 123 transition count 158
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 120 transition count 152
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 120 transition count 152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 119 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 119 transition count 151
Applied a total of 92 rules in 6 ms. Remains 119 /165 variables (removed 46) and now considering 151/227 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12370511838980121116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13460619884000856592.kers'
[2026-05-31 20:47:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12370511838980121116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13460619884000856592.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 119 cols 421 entries
Finished phase 1 with 107 SingleSign rule and 2 generalized
[2026-05-31 20:47:27] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13460619884000856592.kers
Total runtime 1 ms.
[2026-05-31 20:47:27] [INFO ] Implicit Places using invariants in 62 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/165 places, 151/227 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 118/165 places, 151/227 transitions.
[2026-05-31 20:47:27] [INFO ] Flatten gal took : 9 ms
[2026-05-31 20:47:27] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:47:27] [INFO ] Input system was already deterministic with 151 transitions.
[2026-05-31 20:47:27] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:47:27] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:47:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality13158304674918141358.gal : 2 ms
[2026-05-31 20:47:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality5087606286259801266.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/CTLCardinality13158304674918141358.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5087606286259801266.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.4405e+08,0.082811,6324,2,936,5,8994,6,0,625,11208,0


Converting to forward existential form...Done !
original formula: AG(((EF(((p12==0)||(p49==1))) + AG(!(E(((p47==0)||(p172==1)) U (p15==0))))) + (((AG((p144==1)) + AF((p46==1))) + (AX(AF((p20==1))) + (p1=...258
=> equivalent forward existential formula: ([FwdG(EY((((FwdU(Init,TRUE) * !((E(TRUE U ((p12==0)||(p49==1))) + !(E(TRUE U !(!(E(((p47==0)||(p172==1)) U (p15...876
Reverse transition relation is NOT exact ! Due to transitions t9, t14, t18, t26, t67, t70, t77, t80, t86, t87, t88, t89, t90, t91, t93, t97, t100, t103, t1...271
(forward)formula 0,1,0.757607,25812,1,0,279,111734,369,147,3872,118157,378
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 165/165 places, 227/227 transitions.
Graph (trivial) has 149 edges and 165 vertex of which 12 / 165 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 157 transition count 169
Reduce places removed 49 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 61 rules applied. Total rules applied 111 place count 108 transition count 157
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 118 place count 104 transition count 154
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 121 place count 101 transition count 154
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 121 place count 101 transition count 144
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 141 place count 91 transition count 144
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 156 place count 76 transition count 127
Iterating global reduction 4 with 15 rules applied. Total rules applied 171 place count 76 transition count 127
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 171 place count 76 transition count 125
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 175 place count 74 transition count 125
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 184 place count 65 transition count 89
Ensure Unique test removed 2 places
Iterating global reduction 4 with 11 rules applied. Total rules applied 195 place count 63 transition count 89
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 198 place count 60 transition count 79
Iterating global reduction 4 with 3 rules applied. Total rules applied 201 place count 60 transition count 79
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 202 place count 59 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 203 place count 59 transition count 77
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 235 place count 43 transition count 61
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 236 place count 42 transition count 59
Iterating global reduction 4 with 1 rules applied. Total rules applied 237 place count 42 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 240 place count 42 transition count 56
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 4 with 4 rules applied. Total rules applied 244 place count 40 transition count 54
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 40 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 246 place count 40 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 39 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 248 place count 38 transition count 52
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 252 place count 38 transition count 48
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 5 with 2 rules applied. Total rules applied 254 place count 38 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 256 place count 36 transition count 46
Applied a total of 256 rules in 62 ms. Remains 36 /165 variables (removed 129) and now considering 46/227 (removed 181) transitions.
[2026-05-31 20:47:28] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3264279276279715868.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1784144669668782098.kers'
[2026-05-31 20:47:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3264279276279715868.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1784144669668782098.kers]
Normalized transition count is 43 out of 44 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 43 rows 34 cols 106 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-31 20:47:28] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1784144669668782098.kers
Total runtime 1 ms.
[2026-05-31 20:47:28] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-31 20:47:28] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2026-05-31 20:47:28] [INFO ] Invariant cache hit.
[2026-05-31 20:47:28] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2026-05-31 20:47:28] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2026-05-31 20:47:28] [INFO ] Flow matrix only has 44 transitions (discarded 2 similar events)
[2026-05-31 20:47:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 5/36 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 43/79 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/79 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/80 variables, and 43 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1133 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 5/36 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 43/79 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 32/75 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/80 variables, and 75 constraints, problems are : Problem set: 0 solved, 32 unsolved in 978 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2136ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2138ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/165 places, 46/227 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2374 ms. Remains : 36/165 places, 46/227 transitions.
[2026-05-31 20:47:30] [INFO ] Flatten gal took : 5 ms
[2026-05-31 20:47:30] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:47:30] [INFO ] Input system was already deterministic with 46 transitions.
[2026-05-31 20:47:30] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:47:30] [INFO ] Flatten gal took : 3 ms
[2026-05-31 20:47:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality10116642434186524224.gal : 1 ms
[2026-05-31 20:47:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality2974318259498141584.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/CTLCardinality10116642434186524224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2974318259498141584.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,29160,0.031212,4140,2,113,5,1071,5,0,191,981,0


Converting to forward existential form...Done !
original formula: EF(!(A((((p162==0)||(p117==1)) * EF(((p92==0)||(p189==1)))) U AF((p56!=1)))))
=> equivalent forward existential formula: ([FwdG((FwdU(FwdU(Init,TRUE),!(!(EG(!((p56!=1)))))) * !((((p162==0)||(p117==1)) * E(TRUE U ((p92==0)||(p189==1))...240
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 42/0/4
(forward)formula 0,1,0.061066,4800,1,0,12,4327,34,6,942,2900,17
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 227/227 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 135 transition count 195
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 135 transition count 195
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 72 place count 123 transition count 168
Iterating global reduction 0 with 12 rules applied. Total rules applied 84 place count 123 transition count 168
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 117 transition count 152
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 97 place count 116 transition count 152
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 103 place count 110 transition count 140
Iterating global reduction 0 with 6 rules applied. Total rules applied 109 place count 110 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 112 place count 107 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 115 place count 107 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 116 place count 106 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 117 place count 106 transition count 135
Applied a total of 117 rules in 19 ms. Remains 106 /165 variables (removed 59) and now considering 135/227 (removed 92) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5512980680944559113.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13272320848060744850.kers'
[2026-05-31 20:47:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5512980680944559113.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13272320848060744850.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 106 cols 358 entries
Finished phase 1 with 96 SingleSign rule and 1 generalized
[2026-05-31 20:47:30] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13272320848060744850.kers
Total runtime 1 ms.
[2026-05-31 20:47:31] [INFO ] Implicit Places using invariants in 101 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/165 places, 135/227 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 105/165 places, 135/227 transitions.
[2026-05-31 20:47:31] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:47:31] [INFO ] Flatten gal took : 11 ms
[2026-05-31 20:47:31] [INFO ] Input system was already deterministic with 135 transitions.
[2026-05-31 20:47:31] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:47:31] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:47:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality3064431230398616761.gal : 2 ms
[2026-05-31 20:47:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality5724433814354353691.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/CTLCardinality3064431230398616761.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5724433814354353691.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.92911e+07,0.10146,5488,2,825,5,6139,6,0,557,6756,0


Converting to forward existential form...Done !
original formula: EF(AX((AG(((p127==0)||(p159==1))) * ((p123==0)||(p188==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((!(E(TRUE U !(((p127==0)||(p159==1))))) * ((p123==0)||(p188==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t11, t14, t22, t26, t37, t44, t57, t68, t78, t86, t87, t89, t90, t92, t108, t109, t1...259
(forward)formula 0,1,2.0076,48484,1,0,245,250802,293,134,3299,241788,328
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 227/227 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 137 transition count 197
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 137 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 128 transition count 175
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 128 transition count 175
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 124 transition count 169
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 124 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 122 transition count 159
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 122 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 121 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 121 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 120 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 120 transition count 157
Applied a total of 90 rules in 15 ms. Remains 120 /165 variables (removed 45) and now considering 157/227 (removed 70) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17408053457250025301.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12930348759147830498.kers'
[2026-05-31 20:47:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17408053457250025301.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12930348759147830498.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 120 cols 461 entries
Finished phase 1 with 108 SingleSign rule and 2 generalized
[2026-05-31 20:47:33] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12930348759147830498.kers
Total runtime 1 ms.
[2026-05-31 20:47:33] [INFO ] Implicit Places using invariants in 81 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/165 places, 157/227 transitions.
Applied a total of 0 rules in 1 ms. Remains 119 /119 variables (removed 0) and now considering 157/157 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 119/165 places, 157/227 transitions.
[2026-05-31 20:47:33] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:47:33] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:47:33] [INFO ] Input system was already deterministic with 157 transitions.
[2026-05-31 20:47:33] [INFO ] Flatten gal took : 8 ms
[2026-05-31 20:47:33] [INFO ] Flatten gal took : 7 ms
[2026-05-31 20:47:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality4321241947407323297.gal : 2 ms
[2026-05-31 20:47:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality9234909205286214733.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/CTLCardinality4321241947407323297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9234909205286214733.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(!(((EG(AG((p13==1))) * AF(!(((p161==0)||(p101==1))))) * AX((EG((p190==1)) * EX(((p138==0)||(p163==1))))))) U ((AG(EF(EG(((p31==0)||(p16...236
=> equivalent forward existential formula: [((FwdU(Init,!(((EG(!(E(TRUE U !((p13==1))))) * !(EG(!(!(((p161==0)||(p101==1))))))) * !(EX(!((EG((p190==1)) * E...342
Reverse transition relation is NOT exact ! Due to transitions t9, t13, t16, t24, t27, t59, t73, t76, t83, t89, t92, t95, t96, t99, t101, t103, t105, t107, ...291
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.64546,65476,1,0,298,351086,364,156,4463,287634,398
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-13 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 : 165/165 places, 227/227 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 132 transition count 192
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 132 transition count 192
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 78 place count 120 transition count 165
Iterating global reduction 0 with 12 rules applied. Total rules applied 90 place count 120 transition count 165
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 96 place count 114 transition count 149
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 103 place count 113 transition count 149
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 109 place count 107 transition count 137
Iterating global reduction 0 with 6 rules applied. Total rules applied 115 place count 107 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 118 place count 104 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 121 place count 104 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 122 place count 103 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 123 place count 103 transition count 132
Applied a total of 123 rules in 14 ms. Remains 103 /165 variables (removed 62) and now considering 132/227 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4480147469858116409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18156531604031140937.kers'
[2026-05-31 20:47:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4480147469858116409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18156531604031140937.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 132 rows 103 cols 352 entries
Finished phase 1 with 93 SingleSign rule and 1 generalized
[2026-05-31 20:47:36] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18156531604031140937.kers
Total runtime 1 ms.
[2026-05-31 20:47:36] [INFO ] Implicit Places using invariants in 83 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/165 places, 132/227 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 102/165 places, 132/227 transitions.
[2026-05-31 20:47:36] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:47:36] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:47:36] [INFO ] Input system was already deterministic with 132 transitions.
[2026-05-31 20:47:36] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:47:36] [INFO ] Flatten gal took : 6 ms
[2026-05-31 20:47:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality15427082049110217650.gal : 2 ms
[2026-05-31 20:47:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality5914639717875387009.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/CTLCardinality15427082049110217650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5914639717875387009.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.58567e+07,0.053612,5348,2,609,5,5465,6,0,542,6049,0


Converting to forward existential form...Done !
original formula: EF((EX((((p152==0)||(p48==1))&&(p46==1))) * ((AF((p98==0)) + (p67==0)) + (p142==1))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * EX((((p152==0)||(p48==1))&&(p46==1)))) * !(EG(!((p98==0)))))] != FALSE + [((FwdU(Init,TRU...307
Reverse transition relation is NOT exact ! Due to transitions t9, t13, t16, t24, t64, t74, t77, t81, t83, t84, t86, t87, t89, t105, t106, t111, Intersecti...244
(forward)formula 0,1,0.32406,13412,1,0,216,48554,288,113,3176,45595,301
FORMULA ErlangenMainframeV1-PT-bP02C02-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-31 20:47:36] [INFO ] Flatten gal took : 10 ms
[2026-05-31 20:47:36] [INFO ] Flatten gal took : 9 ms
Total runtime 109912 ms.

BK_STOP 1780260456610

--------------------
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="ErlangenMainframeV1-PT-bP02C02"
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 ErlangenMainframeV1-PT-bP02C02, 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-178021499100057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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