fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r194-tall-177969914000273
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for NoC3x3-PT-2A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12086.235 3600000.00 3676293.00 29097.70 TTTTTFFFTF?FTFT? normal

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.r194-tall-177969914000273.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 NoC3x3-PT-2A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000273
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 7.1K Mar 8 06:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 8 06:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 8 06:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 8 06:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 16 08:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 16 08:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 8 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Mar 8 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 8 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 8 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 16 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 127K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-00
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-01
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-02
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-03
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-04
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-05
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-06
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-07
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-08
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-09
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-10
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-11
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-12
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-13
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-14
FORMULA_NAME NoC3x3-PT-2A-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779742514199

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 20:55:15] [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-25 20:55:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 20:55:15] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2026-05-25 20:55:15] [INFO ] Transformed 361 places.
[2026-05-25 20:55:15] [INFO ] Transformed 428 transitions.
[2026-05-25 20:55:15] [INFO ] Found NUPN structural information;
[2026-05-25 20:55:15] [INFO ] Parsed PT model containing 361 places and 428 transitions and 1697 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 93 out of 361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 361/361 places, 428/428 transitions.
Ensure Unique test removed 22 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 339 transition count 428
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 84 place count 277 transition count 351
Ensure Unique test removed 16 places
Iterating global reduction 1 with 78 rules applied. Total rules applied 162 place count 261 transition count 351
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 205 place count 261 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 225 place count 261 transition count 288
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 230 place count 256 transition count 288
Applied a total of 230 rules in 64 ms. Remains 256 /361 variables (removed 105) and now considering 288/428 (removed 140) transitions.
[2026-05-25 20:55:15] [INFO ] Flow matrix only has 273 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12112821466114188489.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10146727995306146405.kers'
[2026-05-25 20:55:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12112821466114188489.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10146727995306146405.kers]
Normalized transition count is 272 out of 273 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 272 rows 250 cols 980 entries
Finished phase 1 with 129 SingleSign rule and 43 generalized
[2026-05-25 20:55:15] [INFO ] Computed 84 invariants in 1 ms
Computed 84 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10146727995306146405.kers
Total runtime 2 ms.
[2026-05-25 20:55:16] [INFO ] Implicit Places using invariants in 322 ms returned [9, 22, 24, 72, 83, 105, 113, 114, 118, 153, 157, 159, 163, 191, 206, 211, 217]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 355 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 239/361 places, 288/428 transitions.
Applied a total of 0 rules in 23 ms. Remains 239 /239 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 458 ms. Remains : 239/361 places, 288/428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 288/288 transitions.
Applied a total of 0 rules in 6 ms. Remains 239 /239 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2026-05-25 20:55:16] [INFO ] Flow matrix only has 273 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13880470805151756546.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1391806968069425390.kers'
[2026-05-25 20:55:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13880470805151756546.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1391806968069425390.kers]
Normalized transition count is 272 out of 273 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 272 rows 235 cols 920 entries
Finished phase 1 with 159 SingleSign rule and 13 generalized
[2026-05-25 20:55:16] [INFO ] Computed 67 invariants in 1 ms
Computed 67 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1391806968069425390.kers
Total runtime 2 ms.
[2026-05-25 20:55:16] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-25 20:55:16] [INFO ] Flow matrix only has 273 transitions (discarded 15 similar events)
[2026-05-25 20:55:16] [INFO ] Invariant cache hit.
[2026-05-25 20:55:16] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 20:55:16] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2026-05-25 20:55:16] [INFO ] Flow matrix only has 273 transitions (discarded 15 similar events)
[2026-05-25 20:55:16] [INFO ] Invariant cache hit.
[2026-05-25 20:55:16] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 59/65 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (OVERLAPS) 1/239 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 272/511 variables, 239/306 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 10/316 constraints. Problems are: Problem set: 0 solved, 287 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 1/512 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 12 (OVERLAPS) 0/512 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 512/512 variables, and 317 constraints, problems are : Problem set: 0 solved, 287 unsolved in 18111 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 239/239 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 59/65 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (OVERLAPS) 1/239 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 272/511 variables, 239/306 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 10/316 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 287/603 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 11 (OVERLAPS) 1/512 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/512 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 512/512 variables, and 604 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 239/239 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48234ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 48246ms
Finished structural reductions in LTL mode , in 1 iterations and 48613 ms. Remains : 239/239 places, 288/288 transitions.
Support contains 93 out of 239 places after structural reductions.
[2026-05-25 20:56:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 20:56:04] [INFO ] Flatten gal took : 50 ms
FORMULA NoC3x3-PT-2A-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 20:56:04] [INFO ] Flatten gal took : 21 ms
[2026-05-25 20:56:04] [INFO ] Input system was already deterministic with 288 transitions.
Support contains 69 out of 239 places (down from 93) after GAL structural reductions.
RANDOM walk for 26140 steps (7 resets) in 1157 ms. (22 steps per ms) remains 0/49 properties
[2026-05-25 20:56:05] [INFO ] Flatten gal took : 16 ms
[2026-05-25 20:56:05] [INFO ] Flatten gal took : 17 ms
[2026-05-25 20:56:05] [INFO ] Input system was already deterministic with 288 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 719 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 288/288 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 236 transition count 288
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 44 place count 195 transition count 240
Ensure Unique test removed 6 places
Iterating global reduction 1 with 47 rules applied. Total rules applied 91 place count 189 transition count 240
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 110 place count 189 transition count 221
Applied a total of 110 rules in 8 ms. Remains 189 /239 variables (removed 50) and now considering 221/288 (removed 67) transitions.
[2026-05-25 20:56:05] [INFO ] Flow matrix only has 213 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10864783352522963987.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8512713817071950570.kers'
[2026-05-25 20:56:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10864783352522963987.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8512713817071950570.kers]
Normalized transition count is 212 out of 213 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 212 rows 188 cols 692 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-25 20:56:05] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8512713817071950570.kers
Total runtime 1 ms.
[2026-05-25 20:56:05] [INFO ] Implicit Places using invariants in 93 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/239 places, 221/288 transitions.
Applied a total of 0 rules in 4 ms. Remains 188 /188 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 188/239 places, 221/288 transitions.
[2026-05-25 20:56:05] [INFO ] Flatten gal took : 12 ms
[2026-05-25 20:56:05] [INFO ] Flatten gal took : 12 ms
[2026-05-25 20:56:05] [INFO ] Input system was already deterministic with 221 transitions.
[2026-05-25 20:56:05] [INFO ] Flatten gal took : 10 ms
[2026-05-25 20:56:05] [INFO ] Flatten gal took : 10 ms
[2026-05-25 20:56:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality10503037196470349364.gal : 5 ms
[2026-05-25 20:56:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality11901810515935278764.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10503037196470349364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11901810515935278764.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.11841e+22,0.55206,24276,2,1741,5,107456,6,0,966,103088,0


Converting to forward existential form...Done !
original formula: EX(AX((((AX(((p167==0)&&(p210==1))) + (p250==0)) + ((p145==1)||(((p6==0)&&(p280==1))&&(p320==0)))) * (EF((p81==1)) + AF((p219==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!((((!(EX(!(((p167==0)&&(p210==1))))) + (p250==0)) + ((p145==1)||(((p6==0)&&(p280==1))&&(p320=...221
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.3616,43112,1,0,17,256333,28,7,4831,105596,16
FORMULA NoC3x3-PT-2A-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 288/288 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 236 transition count 288
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 43 place count 196 transition count 241
Ensure Unique test removed 6 places
Iterating global reduction 1 with 46 rules applied. Total rules applied 89 place count 190 transition count 241
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 109 place count 190 transition count 221
Applied a total of 109 rules in 8 ms. Remains 190 /239 variables (removed 49) and now considering 221/288 (removed 67) transitions.
[2026-05-25 20:56:07] [INFO ] Flow matrix only has 213 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13135036412362389180.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11112401626845238217.kers'
[2026-05-25 20:56:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13135036412362389180.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11112401626845238217.kers]
Normalized transition count is 212 out of 213 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 212 rows 189 cols 694 entries
Finished phase 1 with 132 SingleSign rule and 0 generalized
[2026-05-25 20:56:07] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11112401626845238217.kers
Total runtime 2 ms.
[2026-05-25 20:56:07] [INFO ] Implicit Places using invariants in 92 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/239 places, 221/288 transitions.
Applied a total of 0 rules in 3 ms. Remains 189 /189 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 189/239 places, 221/288 transitions.
[2026-05-25 20:56:07] [INFO ] Flatten gal took : 10 ms
[2026-05-25 20:56:07] [INFO ] Flatten gal took : 10 ms
[2026-05-25 20:56:07] [INFO ] Input system was already deterministic with 221 transitions.
[2026-05-25 20:56:07] [INFO ] Flatten gal took : 10 ms
[2026-05-25 20:56:07] [INFO ] Flatten gal took : 21 ms
[2026-05-25 20:56:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality7105952926553284913.gal : 5 ms
[2026-05-25 20:56:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality3844544810674590177.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/CTLCardinality7105952926553284913.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3844544810674590177.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.25252e+23,0.568735,25520,2,1721,5,113227,6,0,970,110367,0


Converting to forward existential form...Done !
original formula: A(!((AX(!(((p296==1)&&(p62==0)))) + (p222==0))) U (E(AX((AF(((p35==0)||(p45==1))) * (p43!=1))) U (EX(AX((p320==1))) * (p16==0))) * EG(((p...176
=> equivalent forward existential formula: [((Init * !(EG(!((E(!(EX(!((!(EG(!(((p35==0)||(p45==1))))) * (p43!=1))))) U (EX(!(EX(!((p320==1))))) * (p16==0))...527
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,2.96608,109472,1,0,42,634998,40,26,4856,537370,35
FORMULA NoC3x3-PT-2A-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 288/288 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 236 transition count 288
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 37 place count 202 transition count 249
Ensure Unique test removed 4 places
Iterating global reduction 1 with 38 rules applied. Total rules applied 75 place count 198 transition count 249
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 94 place count 198 transition count 230
Applied a total of 94 rules in 6 ms. Remains 198 /239 variables (removed 41) and now considering 230/288 (removed 58) transitions.
[2026-05-25 20:56:10] [INFO ] Flow matrix only has 220 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16825209287406743041.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18225158371513581471.kers'
[2026-05-25 20:56:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16825209287406743041.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18225158371513581471.kers]
Normalized transition count is 219 out of 220 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 219 rows 197 cols 728 entries
Finished phase 1 with 134 SingleSign rule and 4 generalized
[2026-05-25 20:56:10] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18225158371513581471.kers
Total runtime 2 ms.
[2026-05-25 20:56:10] [INFO ] Implicit Places using invariants in 78 ms returned [45, 163]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 196/239 places, 230/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 196/239 places, 230/288 transitions.
[2026-05-25 20:56:10] [INFO ] Flatten gal took : 9 ms
[2026-05-25 20:56:10] [INFO ] Flatten gal took : 9 ms
[2026-05-25 20:56:10] [INFO ] Input system was already deterministic with 230 transitions.
[2026-05-25 20:56:10] [INFO ] Flatten gal took : 10 ms
[2026-05-25 20:56:10] [INFO ] Flatten gal took : 9 ms
[2026-05-25 20:56:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality6558332085649706920.gal : 3 ms
[2026-05-25 20:56:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality8113747562948459965.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/CTLCardinality6558332085649706920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8113747562948459965.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,4.54401e+23,0.863926,38796,2,1952,5,173380,6,0,1007,182270,0


Converting to forward existential form...Done !
original formula: A(AF(((p89==0) * EX(EG(((p312==0)||(p124==1)))))) U A((((p289!=1) + (EG((p53==1)) * !(AF((p160==1))))) + (EG((p272==1)) * ((p287==0)||(p2...262
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((EG((EX(((p24==0)||(p143==1))) + !(EG(!(((p213==0)||(p336==1))))))) * E(TRUE U EX(((p99=...1498
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,4.2302,136560,1,0,80,853747,68,66,5204,590966,82
FORMULA NoC3x3-PT-2A-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 288/288 transitions.
Graph (complete) has 719 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 236 transition count 220
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 152 place count 168 transition count 205
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 180 place count 140 transition count 170
Ensure Unique test removed 5 places
Iterating global reduction 2 with 33 rules applied. Total rules applied 213 place count 135 transition count 170
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 2 with 11 rules applied. Total rules applied 224 place count 135 transition count 159
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 229 place count 130 transition count 159
Applied a total of 229 rules in 30 ms. Remains 130 /239 variables (removed 109) and now considering 159/288 (removed 129) transitions.
[2026-05-25 20:56:14] [INFO ] Flow matrix only has 151 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3170246135955375631.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8522482831110494411.kers'
[2026-05-25 20:56:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3170246135955375631.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8522482831110494411.kers]
Normalized transition count is 150 out of 151 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 150 rows 121 cols 518 entries
Finished phase 1 with 69 SingleSign rule and 2 generalized
[2026-05-25 20:56:14] [INFO ] Computed 59 invariants in 0 ms
Computed 59 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8522482831110494411.kers
Total runtime 1 ms.
[2026-05-25 20:56:14] [INFO ] Implicit Places using invariants in 78 ms returned [35, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 128/239 places, 159/288 transitions.
Applied a total of 0 rules in 9 ms. Remains 128 /128 variables (removed 0) and now considering 159/159 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 118 ms. Remains : 128/239 places, 159/288 transitions.
[2026-05-25 20:56:14] [INFO ] Flatten gal took : 11 ms
[2026-05-25 20:56:14] [INFO ] Flatten gal took : 7 ms
[2026-05-25 20:56:14] [INFO ] Input system was already deterministic with 159 transitions.
[2026-05-25 20:56:14] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:56:14] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:56:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality241186117671893161.gal : 2 ms
[2026-05-25 20:56:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality6372060719643439672.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/CTLCardinality241186117671893161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6372060719643439672.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10931e+18,0.088615,7840,2,378,5,19669,6,0,648,20197,0


Converting to forward existential form...Done !
original formula: AG(AF(((p124==0) + EF(((p127==0)&&(p272==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p124==0) + E(TRUE U ((p127==0)&&(p272==1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.16648,8080,1,0,8,19669,21,1,3483,20197,9
FORMULA NoC3x3-PT-2A-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 288/288 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 236 transition count 288
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 47 place count 192 transition count 237
Ensure Unique test removed 6 places
Iterating global reduction 1 with 50 rules applied. Total rules applied 97 place count 186 transition count 237
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 119 place count 186 transition count 215
Applied a total of 119 rules in 6 ms. Remains 186 /239 variables (removed 53) and now considering 215/288 (removed 73) transitions.
[2026-05-25 20:56:14] [INFO ] Flow matrix only has 207 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5012695361560156327.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15863624583161834852.kers'
[2026-05-25 20:56:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5012695361560156327.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15863624583161834852.kers]
Normalized transition count is 206 out of 207 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 206 rows 185 cols 674 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-25 20:56:14] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15863624583161834852.kers
Total runtime 1 ms.
[2026-05-25 20:56:15] [INFO ] Implicit Places using invariants in 87 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/239 places, 215/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 185 /185 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 185/239 places, 215/288 transitions.
[2026-05-25 20:56:15] [INFO ] Flatten gal took : 6 ms
[2026-05-25 20:56:15] [INFO ] Flatten gal took : 6 ms
[2026-05-25 20:56:15] [INFO ] Input system was already deterministic with 215 transitions.
[2026-05-25 20:56:15] [INFO ] Flatten gal took : 6 ms
[2026-05-25 20:56:15] [INFO ] Flatten gal took : 7 ms
[2026-05-25 20:56:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality12884024537274845731.gal : 1 ms
[2026-05-25 20:56:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality10187940249953936570.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/CTLCardinality12884024537274845731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10187940249953936570.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.95469e+22,0.460904,23240,2,1689,5,102391,6,0,948,98523,0


Converting to forward existential form...Done !
original formula: (AX(FALSE) + EF((p288==1)))
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U (p288==1))))) * !(FALSE))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.827593,26908,1,0,8,155702,14,2,4392,98523,5
FORMULA NoC3x3-PT-2A-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 288/288 transitions.
Graph (complete) has 719 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 236 transition count 220
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 151 place count 168 transition count 206
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 179 place count 140 transition count 171
Ensure Unique test removed 5 places
Iterating global reduction 2 with 33 rules applied. Total rules applied 212 place count 135 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 2 with 11 rules applied. Total rules applied 223 place count 135 transition count 160
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 228 place count 130 transition count 160
Applied a total of 228 rules in 13 ms. Remains 130 /239 variables (removed 109) and now considering 160/288 (removed 128) transitions.
[2026-05-25 20:56:15] [INFO ] Flow matrix only has 152 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2915924053355947168.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11431757340707712527.kers'
[2026-05-25 20:56:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2915924053355947168.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11431757340707712527.kers]
Normalized transition count is 151 out of 152 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 151 rows 121 cols 516 entries
Finished phase 1 with 69 SingleSign rule and 2 generalized
[2026-05-25 20:56:15] [INFO ] Computed 59 invariants in 0 ms
Computed 59 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11431757340707712527.kers
Total runtime 1 ms.
[2026-05-25 20:56:16] [INFO ] Implicit Places using invariants in 74 ms returned [36, 61]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 75 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 128/239 places, 160/288 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 127 transition count 159
Applied a total of 2 rules in 7 ms. Remains 127 /128 variables (removed 1) and now considering 159/160 (removed 1) transitions.
[2026-05-25 20:56:16] [INFO ] Flow matrix only has 151 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7759517802209769100.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14681573639353054172.kers'
[2026-05-25 20:56:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7759517802209769100.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14681573639353054172.kers]
Normalized transition count is 150 out of 151 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 150 rows 119 cols 510 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-25 20:56:16] [INFO ] Computed 57 invariants in 0 ms
Computed 57 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14681573639353054172.kers
Total runtime 1 ms.
[2026-05-25 20:56:16] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 20:56:16] [INFO ] Flow matrix only has 151 transitions (discarded 8 similar events)
[2026-05-25 20:56:16] [INFO ] Invariant cache hit.
[2026-05-25 20:56:16] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-25 20:56:16] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 127/239 places, 159/288 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 303 ms. Remains : 127/239 places, 159/288 transitions.
[2026-05-25 20:56:16] [INFO ] Flatten gal took : 6 ms
[2026-05-25 20:56:16] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:56:16] [INFO ] Input system was already deterministic with 159 transitions.
[2026-05-25 20:56:16] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:56:16] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:56:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality5130824609519534206.gal : 1 ms
[2026-05-25 20:56:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality13230606031600551609.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/CTLCardinality5130824609519534206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13230606031600551609.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,8.49312e+17,0.080846,7568,2,365,5,18183,6,0,644,18580,0


Converting to forward existential form...Done !
original formula: EF(AG(!(A((p54==1) U ((p192==0)||(p256==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(!((E(!(((p192==0)||(p256==1))) U (!((p54==1)) * !(((p192==0)||(p256==1))))) +...202
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 155/4/4
(forward)formula 0,0,0.16583,8212,1,0,9,19727,28,1,3529,18580,12
FORMULA NoC3x3-PT-2A-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 288/288 transitions.
Graph (complete) has 719 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 234 transition count 220
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 99 rules applied. Total rules applied 168 place count 159 transition count 196
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 172 place count 156 transition count 195
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 201 place count 127 transition count 159
Ensure Unique test removed 6 places
Iterating global reduction 3 with 35 rules applied. Total rules applied 236 place count 121 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 13 rules applied. Total rules applied 249 place count 121 transition count 146
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 257 place count 114 transition count 145
Applied a total of 257 rules in 32 ms. Remains 114 /239 variables (removed 125) and now considering 145/288 (removed 143) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5201879362766816544.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8874090755025424338.kers'
[2026-05-25 20:56:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5201879362766816544.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8874090755025424338.kers]
Normalized transition count is 144 out of 145 initially.
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 0 ms.
// Phase 1: matrix 144 rows 84 cols 331 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-25 20:56:16] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8874090755025424338.kers
Total runtime 1 ms.
[2026-05-25 20:56:16] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 20:56:16] [INFO ] Invariant cache hit.
[2026-05-25 20:56:16] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 20:56:16] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2026-05-25 20:56:16] [INFO ] Redundant transitions in 56 ms returned [23, 30, 31, 44, 45, 56, 57, 58, 59, 60, 67, 68, 71, 82, 98, 102, 105, 106, 107, 113, 114, 115, 117, 121, 124, 125, 126, 127, 130, 133, 134, 135, 136, 142, 143, 144]
Found 36 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 36 transitions
Redundant transitions reduction (with SMT) removed 36 transitions.
Running 84 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7426916928338594769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12675627783949534305.kers'
[2026-05-25 20:56:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7426916928338594769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12675627783949534305.kers]
Normalized transition count is 108 out of 109 initially.
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 0 ms.
// Phase 1: matrix 108 rows 84 cols 241 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-25 20:56:16] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12675627783949534305.kers
Total runtime 1 ms.
[2026-05-25 20:56:16] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 14/114 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 108/222 variables, 114/162 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 84 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/222 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/223 variables, and 171 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1629 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 114/114 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 14/114 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 108/222 variables, 114/162 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 84/255 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/223 variables, and 255 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2157 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 114/114 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3796ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3798ms
Starting structural reductions in SI_CTL mode, iteration 1 : 114/239 places, 109/288 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 114 transition count 95
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 86 transition count 95
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 86 transition count 89
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 43 edges and 74 vertex of which 16 / 74 are part of one of the 8 SCC in 1 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 19 rules applied. Total rules applied 67 place count 66 transition count 83
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 75 place count 66 transition count 75
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 99 place count 50 transition count 67
Graph (trivial) has 35 edges and 50 vertex of which 16 / 50 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 42 transition count 67
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 108 place count 42 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 124 place count 42 transition count 43
Applied a total of 124 rules in 17 ms. Remains 42 /114 variables (removed 72) and now considering 43/109 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5377402616254667461.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14860787100661429573.kers'
[2026-05-25 20:56:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5377402616254667461.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14860787100661429573.kers]
Normalized transition count is 42 out of 43 initially.
Culling duplicate invariants (modulo rational): removing 18 columns.
Culled 18 columns in 0 ms.
// Phase 1: matrix 42 rows 24 cols 73 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-25 20:56:20] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14860787100661429573.kers
Total runtime 0 ms.
[2026-05-25 20:56:20] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 20:56:20] [INFO ] Invariant cache hit.
[2026-05-25 20:56:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 20:56:20] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 42/239 places, 43/288 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 4142 ms. Remains : 42/239 places, 43/288 transitions.
[2026-05-25 20:56:20] [INFO ] Flatten gal took : 2 ms
[2026-05-25 20:56:20] [INFO ] Flatten gal took : 1 ms
[2026-05-25 20:56:20] [INFO ] Input system was already deterministic with 43 transitions.
[2026-05-25 20:56:20] [INFO ] Flatten gal took : 1 ms
[2026-05-25 20:56:20] [INFO ] Flatten gal took : 9 ms
[2026-05-25 20:56:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality2725365395381583751.gal : 1 ms
[2026-05-25 20:56:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality6500370392655405371.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/CTLCardinality2725365395381583751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6500370392655405371.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.3593e+06,0.007376,4112,2,65,5,616,5,0,212,572,0


Converting to forward existential form...Done !
original formula: AF((p46==1))
=> equivalent forward existential formula: [FwdG(Init,!((p46==1)))] = FALSE
Hit Full ! (commute/partial/dont) 40/0/3
(forward)formula 0,0,0.014136,4404,1,0,7,2246,19,1,1016,1085,8
FORMULA NoC3x3-PT-2A-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 288/288 transitions.
Graph (complete) has 719 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 234 transition count 217
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 172 place count 156 transition count 195
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 200 place count 128 transition count 161
Ensure Unique test removed 6 places
Iterating global reduction 2 with 34 rules applied. Total rules applied 234 place count 122 transition count 161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 13 rules applied. Total rules applied 247 place count 122 transition count 148
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 255 place count 115 transition count 147
Applied a total of 255 rules in 16 ms. Remains 115 /239 variables (removed 124) and now considering 147/288 (removed 141) transitions.
[2026-05-25 20:56:20] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14009205238641784660.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18199874935184884516.kers'
[2026-05-25 20:56:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14009205238641784660.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18199874935184884516.kers]
Normalized transition count is 145 out of 146 initially.
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 0 ms.
// Phase 1: matrix 145 rows 85 cols 334 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-25 20:56:20] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18199874935184884516.kers
Total runtime 1 ms.
[2026-05-25 20:56:20] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 20:56:20] [INFO ] Flow matrix only has 146 transitions (discarded 1 similar events)
[2026-05-25 20:56:20] [INFO ] Invariant cache hit.
[2026-05-25 20:56:20] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 20:56:20] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2026-05-25 20:56:20] [INFO ] Redundant transitions in 58 ms returned [23, 30, 31, 44, 45, 56, 57, 58, 59, 60, 67, 68, 71, 82, 97, 98, 100, 104, 107, 108, 109, 117, 118, 119, 121, 125, 128, 129, 130, 131, 134, 137, 138, 139, 140, 146]
Found 36 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 36 transitions
Redundant transitions reduction (with SMT) removed 36 transitions.
Running 86 sub problems to find dead transitions.
[2026-05-25 20:56:20] [INFO ] Flow matrix only has 110 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11254264225521084063.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9940194820275145184.kers'
[2026-05-25 20:56:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11254264225521084063.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9940194820275145184.kers]
Normalized transition count is 109 out of 110 initially.
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 0 ms.
// Phase 1: matrix 109 rows 85 cols 244 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-25 20:56:20] [INFO ] Computed 48 invariants in 1 ms
Computed 48 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9940194820275145184.kers
Total runtime 2 ms.
[2026-05-25 20:56:20] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 14/115 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 109/224 variables, 115/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 9/172 constraints. Problems are: Problem set: 0 solved, 86 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/224 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/225 variables, and 172 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1645 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 14/115 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 109/224 variables, 115/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 9/172 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 86/258 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/224 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/225 variables, and 258 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2324 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 115/115 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3991ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 3992ms
Starting structural reductions in SI_CTL mode, iteration 1 : 115/239 places, 111/288 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 115 transition count 97
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 87 transition count 97
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 87 transition count 91
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 44 edges and 75 vertex of which 16 / 75 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 19 rules applied. Total rules applied 67 place count 67 transition count 85
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 75 place count 67 transition count 77
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 102 place count 49 transition count 68
Graph (trivial) has 36 edges and 49 vertex of which 18 / 49 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 40 transition count 68
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 112 place count 40 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 129 place count 40 transition count 42
Applied a total of 129 rules in 9 ms. Remains 40 /115 variables (removed 75) and now considering 42/111 (removed 69) transitions.
[2026-05-25 20:56:24] [INFO ] Flow matrix only has 41 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4011456207034656866.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5989326142248145385.kers'
[2026-05-25 20:56:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4011456207034656866.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5989326142248145385.kers]
Normalized transition count is 40 out of 41 initially.
Culling duplicate invariants (modulo rational): removing 17 columns.
Culled 17 columns in 0 ms.
// Phase 1: matrix 40 rows 23 cols 69 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-25 20:56:24] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5989326142248145385.kers
Total runtime 0 ms.
[2026-05-25 20:56:24] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 20:56:24] [INFO ] Flow matrix only has 41 transitions (discarded 1 similar events)
[2026-05-25 20:56:24] [INFO ] Invariant cache hit.
[2026-05-25 20:56:24] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 40/239 places, 42/288 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 4349 ms. Remains : 40/239 places, 42/288 transitions.
[2026-05-25 20:56:24] [INFO ] Flatten gal took : 2 ms
[2026-05-25 20:56:24] [INFO ] Flatten gal took : 1 ms
[2026-05-25 20:56:24] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-25 20:56:24] [INFO ] Flatten gal took : 1 ms
[2026-05-25 20:56:24] [INFO ] Flatten gal took : 1 ms
[2026-05-25 20:56:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality825711635908083614.gal : 1 ms
[2026-05-25 20:56:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality4656027781820612283.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/CTLCardinality825711635908083614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4656027781820612283.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17965e+06,0.007011,4096,2,62,5,544,5,0,203,460,0


Converting to forward existential form...Done !
original formula: AG(EF((p94==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p94==0))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.011038,4392,1,0,6,1659,12,0,892,460,5
FORMULA NoC3x3-PT-2A-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 288/288 transitions.
Graph (complete) has 719 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 234 transition count 222
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 154 place count 164 transition count 205
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 180 place count 138 transition count 173
Ensure Unique test removed 5 places
Iterating global reduction 2 with 31 rules applied. Total rules applied 211 place count 133 transition count 173
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 2 with 11 rules applied. Total rules applied 222 place count 133 transition count 162
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 229 place count 127 transition count 161
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 232 place count 127 transition count 158
Applied a total of 232 rules in 15 ms. Remains 127 /239 variables (removed 112) and now considering 158/288 (removed 130) transitions.
[2026-05-25 20:56:25] [INFO ] Flow matrix only has 157 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2475439240177198518.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5810047476401025416.kers'
[2026-05-25 20:56:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2475439240177198518.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5810047476401025416.kers]
Normalized transition count is 156 out of 157 initially.
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 156 rows 99 cols 383 entries
Finished phase 1 with 73 SingleSign rule and 2 generalized
[2026-05-25 20:56:25] [INFO ] Computed 52 invariants in 0 ms
Computed 52 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5810047476401025416.kers
Total runtime 1 ms.
[2026-05-25 20:56:25] [INFO ] Implicit Places using invariants in 115 ms returned [117]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 126/239 places, 158/288 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 125 transition count 157
Applied a total of 2 rules in 6 ms. Remains 125 /126 variables (removed 1) and now considering 157/158 (removed 1) transitions.
[2026-05-25 20:56:25] [INFO ] Flow matrix only has 156 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-442887483931571641.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3051270848581579277.kers'
[2026-05-25 20:56:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-442887483931571641.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3051270848581579277.kers]
Normalized transition count is 155 out of 156 initially.
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 0 ms.
// Phase 1: matrix 155 rows 97 cols 377 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-25 20:56:25] [INFO ] Computed 51 invariants in 0 ms
Computed 51 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3051270848581579277.kers
Total runtime 1 ms.
[2026-05-25 20:56:25] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 20:56:25] [INFO ] Flow matrix only has 156 transitions (discarded 1 similar events)
[2026-05-25 20:56:25] [INFO ] Invariant cache hit.
[2026-05-25 20:56:25] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 20:56:25] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 125/239 places, 157/288 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 324 ms. Remains : 125/239 places, 157/288 transitions.
[2026-05-25 20:56:25] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:56:25] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:56:25] [INFO ] Input system was already deterministic with 157 transitions.
[2026-05-25 20:56:25] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:56:25] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:56:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality13195242435711795858.gal : 1 ms
[2026-05-25 20:56:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality17830956533190079641.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/CTLCardinality13195242435711795858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17830956533190079641.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.11992e+18,0.082962,6084,2,312,5,10198,5,0,658,10412,0


Converting to forward existential form...Done !
original formula: (EG((AG(AF((p347==0))) * A(EF(((p208==0)||(p351==1))) U (AF(((p12==0)||(p4==1))) + (p102==0))))) + AG(((p157==0)&&(p114==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG((!(E(TRUE U !(!(EG(!((p347==0))))))) * !((E(!((!(EG(!(((p12==0)||(p4==1))))) + (p102==0))) U...346
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.185886,9920,1,0,16,34135,42,7,3446,20908,18
FORMULA NoC3x3-PT-2A-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 288/288 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 236 transition count 288
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 42 place count 197 transition count 243
Ensure Unique test removed 4 places
Iterating global reduction 1 with 43 rules applied. Total rules applied 85 place count 193 transition count 243
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 104 place count 193 transition count 224
Applied a total of 104 rules in 7 ms. Remains 193 /239 variables (removed 46) and now considering 224/288 (removed 64) transitions.
[2026-05-25 20:56:25] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17359735117407658648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7400258510808822910.kers'
[2026-05-25 20:56:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17359735117407658648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7400258510808822910.kers]
Normalized transition count is 214 out of 215 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 214 rows 192 cols 708 entries
Finished phase 1 with 129 SingleSign rule and 4 generalized
[2026-05-25 20:56:25] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7400258510808822910.kers
Total runtime 1 ms.
[2026-05-25 20:56:25] [INFO ] Implicit Places using invariants in 86 ms returned [45, 162]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 97 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 191/239 places, 224/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 191 /191 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 191/239 places, 224/288 transitions.
[2026-05-25 20:56:25] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:56:25] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:56:25] [INFO ] Input system was already deterministic with 224 transitions.
[2026-05-25 20:56:25] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:56:25] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:56:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality14526764794434063502.gal : 1 ms
[2026-05-25 20:56:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality9721529518602161969.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/CTLCardinality14526764794434063502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9721529518602161969.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.28523e+23,0.574255,25496,2,1922,5,112573,6,0,981,108180,0


Converting to forward existential form...Done !
original formula: E((EX((p220==0)) + (p84==1)) U EG(EF((((p26==1) + AX(((p198==0)||(p247==1)))) * ((p143!=0)||((p310==1)&&(p346==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,(EX((p220==0)) + (p84==1))),E(TRUE U (((p26==1) + !(EX(!(((p198==0)||(p247==1)))))) * ((p143!=0)...193
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-25 20:56:55] [INFO ] Flatten gal took : 7 ms
[2026-05-25 20:56:55] [INFO ] Applying decomposition
[2026-05-25 20:56:55] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14841086478490178928.txt' '-o' '/tmp/graph14841086478490178928.bin' '-w' '/tmp/graph14841086478490178928.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14841086478490178928.bin' '-l' '-1' '-v' '-w' '/tmp/graph14841086478490178928.weights' '-q' '0' '-e' '0.001'
[2026-05-25 20:56:55] [INFO ] Decomposing Gal with order
[2026-05-25 20:56:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 20:56:55] [INFO ] Removed a total of 51 redundant transitions.
[2026-05-25 20:56:55] [INFO ] Flatten gal took : 58 ms
[2026-05-25 20:56:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2026-05-25 20:56:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality13935098409448040971.gal : 4 ms
[2026-05-25 20:56:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality9317707127583736513.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/CTLCardinality13935098409448040971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9317707127583736513.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28523e+23,0.200176,12928,444,106,17097,1242,635,33344,125,5027,0


Converting to forward existential form...Done !
original formula: E((EX((i5.i1.u24.p220==0)) + (i2.u12.p84==1)) U EG(EF((((i1.i0.u7.p26==1) + AX(((i4.i0.u17.p198==0)||(i5.i0.u23.p247==1)))) * ((i4.i0.u17...210
=> equivalent forward existential formula: [FwdG(FwdU(Init,(EX((i5.i1.u24.p220==0)) + (i2.u12.p84==1))),E(TRUE U (((i1.i0.u7.p26==1) + !(EX(!(((i4.i0.u17.p...266
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 288/288 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 236 transition count 288
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 46 place count 193 transition count 238
Ensure Unique test removed 6 places
Iterating global reduction 1 with 49 rules applied. Total rules applied 95 place count 187 transition count 238
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 116 place count 187 transition count 217
Applied a total of 116 rules in 8 ms. Remains 187 /239 variables (removed 52) and now considering 217/288 (removed 71) transitions.
[2026-05-25 20:57:26] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16803299314286239265.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6682974070987272292.kers'
[2026-05-25 20:57:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16803299314286239265.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6682974070987272292.kers]
Normalized transition count is 208 out of 209 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 208 rows 186 cols 680 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-25 20:57:26] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6682974070987272292.kers
Total runtime 3 ms.
[2026-05-25 20:57:26] [INFO ] Implicit Places using invariants in 85 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/239 places, 217/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 186 /186 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 186/239 places, 217/288 transitions.
[2026-05-25 20:57:26] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:57:26] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:57:26] [INFO ] Input system was already deterministic with 217 transitions.
[2026-05-25 20:57:26] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:57:26] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:57:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality10056991149993405342.gal : 1 ms
[2026-05-25 20:57:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality8924570528136839835.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/CTLCardinality10056991149993405342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8924570528136839835.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,6.49564e+22,0.52422,24360,2,1736,5,107198,6,0,954,103110,0


Converting to forward existential form...Done !
original formula: EX(EX(AX(AG(((p171==0)&&(p122==1))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(EX(!(!(E(TRUE U !(((p171==0)&&(p122==1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.01174,30652,1,0,6,184160,15,0,4421,103110,5
FORMULA NoC3x3-PT-2A-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 288/288 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 236 transition count 288
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 46 place count 193 transition count 239
Ensure Unique test removed 6 places
Iterating global reduction 1 with 49 rules applied. Total rules applied 95 place count 187 transition count 239
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 117 place count 187 transition count 217
Applied a total of 117 rules in 10 ms. Remains 187 /239 variables (removed 52) and now considering 217/288 (removed 71) transitions.
[2026-05-25 20:57:27] [INFO ] Flow matrix only has 208 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5165019835755878987.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12957351672288228363.kers'
[2026-05-25 20:57:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5165019835755878987.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12957351672288228363.kers]
Normalized transition count is 207 out of 208 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 207 rows 186 cols 678 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-25 20:57:27] [INFO ] Computed 58 invariants in 2 ms
Computed 58 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12957351672288228363.kers
Total runtime 3 ms.
[2026-05-25 20:57:27] [INFO ] Implicit Places using invariants in 80 ms returned [45]
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 : 186/239 places, 217/288 transitions.
Applied a total of 0 rules in 1 ms. Remains 186 /186 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 186/239 places, 217/288 transitions.
[2026-05-25 20:57:27] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:57:27] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:57:27] [INFO ] Input system was already deterministic with 217 transitions.
[2026-05-25 20:57:27] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:57:27] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:57:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality565757157977673577.gal : 1 ms
[2026-05-25 20:57:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality11715801472216250105.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/CTLCardinality565757157977673577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11715801472216250105.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,7.42752e+22,0.530183,23680,2,1698,5,104563,6,0,954,100737,0


Converting to forward existential form...Done !
original formula: AX(EG(AX(EF(((p108==0)&&(p38==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EX(!(E(TRUE U ((p108==0)&&(p38==1)))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,1.35135,40888,1,0,13,248008,21,4,4905,100737,11
FORMULA NoC3x3-PT-2A-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 288/288 transitions.
Graph (complete) has 719 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 234 transition count 219
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 96 rules applied. Total rules applied 166 place count 159 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 167 place count 158 transition count 198
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 196 place count 129 transition count 162
Ensure Unique test removed 6 places
Iterating global reduction 3 with 35 rules applied. Total rules applied 231 place count 123 transition count 162
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 13 rules applied. Total rules applied 244 place count 123 transition count 149
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 252 place count 116 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 253 place count 116 transition count 147
Applied a total of 253 rules in 19 ms. Remains 116 /239 variables (removed 123) and now considering 147/288 (removed 141) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2818748618450530743.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1991510583400144896.kers'
[2026-05-25 20:57:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2818748618450530743.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1991510583400144896.kers]
Normalized transition count is 146 out of 147 initially.
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 0 ms.
// Phase 1: matrix 146 rows 86 cols 339 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-25 20:57:28] [INFO ] Computed 49 invariants in 0 ms
Computed 49 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1991510583400144896.kers
Total runtime 0 ms.
[2026-05-25 20:57:28] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 20:57:28] [INFO ] Invariant cache hit.
[2026-05-25 20:57:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 20:57:28] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2026-05-25 20:57:28] [INFO ] Redundant transitions in 90 ms returned [23, 30, 31, 58, 59, 60, 61, 62, 69, 70, 73, 84, 99, 100, 102, 106, 109, 110, 116, 117, 118, 120, 124, 133, 136, 137, 138, 139, 145, 146]
Found 30 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 30 transitions
Redundant transitions reduction (with SMT) removed 30 transitions.
Running 91 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13236079900884188544.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18279269915830232086.kers'
[2026-05-25 20:57:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13236079900884188544.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18279269915830232086.kers]
Normalized transition count is 116 out of 117 initially.
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 0 ms.
// Phase 1: matrix 116 rows 86 cols 261 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-25 20:57:28] [INFO ] Computed 49 invariants in 1 ms
Computed 49 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18279269915830232086.kers
Total runtime 1 ms.
[2026-05-25 20:57:28] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 12/116 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 116/232 variables, 116/165 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 9/174 constraints. Problems are: Problem set: 0 solved, 91 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/233 variables, and 174 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 12/116 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 116/232 variables, 116/165 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 9/174 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 91/265 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/232 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/233 variables, and 265 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2487 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 116/116 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4242ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4243ms
Starting structural reductions in SI_CTL mode, iteration 1 : 116/239 places, 117/288 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 116 transition count 106
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 33 rules applied. Total rules applied 33 place count 94 transition count 106
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 0 with 2 rules applied. Total rules applied 35 place count 94 transition count 104
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 48 edges and 90 vertex of which 18 / 90 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 42 place count 81 transition count 102
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 56 place count 79 transition count 90
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 86 place count 59 transition count 80
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 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 91 place count 56 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 38 edges and 56 vertex of which 16 / 56 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 94 place count 48 transition count 76
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 102 place count 48 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 122 place count 48 transition count 48
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 123 place count 47 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 123 place count 47 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 126 place count 45 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 126 place count 45 transition count 46
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 128 place count 44 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 131 place count 42 transition count 45
Graph (trivial) has 12 edges and 42 vertex of which 2 / 42 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 6 with 1 rules applied. Total rules applied 132 place count 41 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 133 place count 41 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 135 place count 41 transition count 42
Applied a total of 135 rules in 16 ms. Remains 41 /116 variables (removed 75) and now considering 42/117 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14726017848973773375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5232779771830545229.kers'
[2026-05-25 20:57:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14726017848973773375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5232779771830545229.kers]
Normalized transition count is 41 out of 42 initially.
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 41 rows 22 cols 67 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-25 20:57:33] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5232779771830545229.kers
Total runtime 3 ms.
[2026-05-25 20:57:33] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 20:57:33] [INFO ] Invariant cache hit.
[2026-05-25 20:57:33] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 41/239 places, 42/288 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 4603 ms. Remains : 41/239 places, 42/288 transitions.
[2026-05-25 20:57:33] [INFO ] Flatten gal took : 1 ms
[2026-05-25 20:57:33] [INFO ] Flatten gal took : 2 ms
[2026-05-25 20:57:33] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-25 20:57:33] [INFO ] Flatten gal took : 1 ms
[2026-05-25 20:57:33] [INFO ] Flatten gal took : 1 ms
[2026-05-25 20:57:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality1908030538822487688.gal : 1 ms
[2026-05-25 20:57:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality16287354471715099596.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/CTLCardinality1908030538822487688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16287354471715099596.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.57286e+06,0.006664,4100,2,63,5,541,5,0,207,465,0


Converting to forward existential form...Done !
original formula: A(AF((p121==0)) U (p256==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p256==1))))) * !(E(!((p256==1)) U (!(!(EG(!((p121==0))))) * !((p256==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 39/0/3
(forward)formula 0,0,0.013439,4552,1,0,9,1922,27,4,984,713,11
FORMULA NoC3x3-PT-2A-CTLCardinality-2024-13 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 : 239/239 places, 288/288 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 236 transition count 288
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 46 place count 193 transition count 238
Ensure Unique test removed 6 places
Iterating global reduction 1 with 49 rules applied. Total rules applied 95 place count 187 transition count 238
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 117 place count 187 transition count 216
Applied a total of 117 rules in 5 ms. Remains 187 /239 variables (removed 52) and now considering 216/288 (removed 72) transitions.
[2026-05-25 20:57:33] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17993234037935585740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1925392080080079949.kers'
[2026-05-25 20:57:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17993234037935585740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1925392080080079949.kers]
Normalized transition count is 207 out of 208 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 207 rows 186 cols 678 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-25 20:57:33] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1925392080080079949.kers
Total runtime 2 ms.
[2026-05-25 20:57:33] [INFO ] Implicit Places using invariants in 73 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/239 places, 216/288 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 186/239 places, 216/288 transitions.
[2026-05-25 20:57:33] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:57:33] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:57:33] [INFO ] Input system was already deterministic with 216 transitions.
[2026-05-25 20:57:33] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:57:33] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:57:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality8525879641615101018.gal : 1 ms
[2026-05-25 20:57:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality7432147723981662342.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/CTLCardinality8525879641615101018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7432147723981662342.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,7.67688e+22,0.48615,23660,2,1698,5,104488,6,0,953,100946,0


Converting to forward existential form...Done !
original formula: E((p212==1) U AX(AX((EF((p227==1)) * ((p3==0)||(p85==1))))))
=> equivalent forward existential formula: [(FwdU(Init,(p212==1)) * !(EX(!(!(EX(!((E(TRUE U (p227==1)) * ((p3==0)||(p85==1))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 211/0/5
(forward)formula 0,1,1.11667,36376,1,0,12,225471,22,4,4428,100946,11
FORMULA NoC3x3-PT-2A-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 288/288 transitions.
Graph (complete) has 719 edges and 239 vertex of which 238 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 236 transition count 224
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 143 place count 172 transition count 210
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 168 place count 147 transition count 179
Ensure Unique test removed 5 places
Iterating global reduction 2 with 30 rules applied. Total rules applied 198 place count 142 transition count 179
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 2 with 11 rules applied. Total rules applied 209 place count 142 transition count 168
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 213 place count 138 transition count 168
Applied a total of 213 rules in 13 ms. Remains 138 /239 variables (removed 101) and now considering 168/288 (removed 120) transitions.
[2026-05-25 20:57:34] [INFO ] Flow matrix only has 159 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11943472901909797898.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10240830435316531177.kers'
[2026-05-25 20:57:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11943472901909797898.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10240830435316531177.kers]
Normalized transition count is 158 out of 159 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 158 rows 130 cols 541 entries
Finished phase 1 with 77 SingleSign rule and 2 generalized
[2026-05-25 20:57:34] [INFO ] Computed 59 invariants in 0 ms
Computed 59 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10240830435316531177.kers
Total runtime 1 ms.
[2026-05-25 20:57:34] [INFO ] Implicit Places using invariants in 88 ms returned [36, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 136/239 places, 168/288 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 136 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 135 transition count 167
Applied a total of 2 rules in 4 ms. Remains 135 /136 variables (removed 1) and now considering 167/168 (removed 1) transitions.
[2026-05-25 20:57:34] [INFO ] Flow matrix only has 158 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16160087038346901069.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2653119200928517900.kers'
[2026-05-25 20:57:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16160087038346901069.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2653119200928517900.kers]
Normalized transition count is 157 out of 158 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 157 rows 128 cols 535 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-25 20:57:34] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2653119200928517900.kers
Total runtime 2 ms.
[2026-05-25 20:57:34] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 20:57:34] [INFO ] Flow matrix only has 158 transitions (discarded 9 similar events)
[2026-05-25 20:57:34] [INFO ] Invariant cache hit.
[2026-05-25 20:57:34] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 20:57:34] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 135/239 places, 167/288 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 311 ms. Remains : 135/239 places, 167/288 transitions.
[2026-05-25 20:57:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:57:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:57:34] [INFO ] Input system was already deterministic with 167 transitions.
[2026-05-25 20:57:34] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:57:34] [INFO ] Flatten gal took : 3 ms
[2026-05-25 20:57:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality6173042475666920898.gal : 1 ms
[2026-05-25 20:57:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality17541288815875419262.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/CTLCardinality6173042475666920898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17541288815875419262.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,8.49312e+18,0.099732,8608,2,418,5,24392,6,0,686,24014,0


Converting to forward existential form...Done !
original formula: EG(E(!(A((p129==1) U ((p36==0)||(p312==1)))) U !((AG((p245==0)) + (((p345==0)||(p274==1))&&(p224==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(!(!((E(!(((p36==0)||(p312==1))) U (!((p129==1)) * !(((p36==0)||(p312==1))))) + EG(!(((p36==0)||(p31...249
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 162/5/5
Detected timeout of ITS tools.
[2026-05-25 20:58:05] [INFO ] Flatten gal took : 4 ms
[2026-05-25 20:58:05] [INFO ] Applying decomposition
[2026-05-25 20:58:05] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15272110905133249029.txt' '-o' '/tmp/graph15272110905133249029.bin' '-w' '/tmp/graph15272110905133249029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15272110905133249029.bin' '-l' '-1' '-v' '-w' '/tmp/graph15272110905133249029.weights' '-q' '0' '-e' '0.001'
[2026-05-25 20:58:05] [INFO ] Decomposing Gal with order
[2026-05-25 20:58:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 20:58:05] [INFO ] Removed a total of 63 redundant transitions.
[2026-05-25 20:58:05] [INFO ] Flatten gal took : 29 ms
[2026-05-25 20:58:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 4 ms.
[2026-05-25 20:58:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality11306542690181770654.gal : 2 ms
[2026-05-25 20:58:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality3737016118495572858.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/CTLCardinality11306542690181770654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3737016118495572858.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.49312e+18,0.066612,5648,128,34,3003,392,439,3649,73,1086,0


Converting to forward existential form...Done !
original formula: EG(E(!(A((i6.u25.p129==1) U ((i2.u8.p36==0)||(i10.u40.p312==1)))) U !((AG((i8.u32.p245==0)) + (((i12.i0.u47.p345==0)||(i9.u36.p274==1))&&...176
=> equivalent forward existential formula: [FwdG(Init,E(!(!((E(!(((i2.u8.p36==0)||(i10.u40.p312==1))) U (!((i6.u25.p129==1)) * !(((i2.u8.p36==0)||(i10.u40....330
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
[2026-05-25 20:58:35] [INFO ] Flatten gal took : 7 ms
[2026-05-25 20:58:35] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:58:35] [INFO ] Applying decomposition
[2026-05-25 20:58:35] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph351933778475568236.txt' '-o' '/tmp/graph351933778475568236.bin' '-w' '/tmp/graph351933778475568236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph351933778475568236.bin' '-l' '-1' '-v' '-w' '/tmp/graph351933778475568236.weights' '-q' '0' '-e' '0.001'
[2026-05-25 20:58:35] [INFO ] Decomposing Gal with order
[2026-05-25 20:58:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 20:58:35] [INFO ] Removed a total of 86 redundant transitions.
[2026-05-25 20:58:35] [INFO ] Flatten gal took : 24 ms
[2026-05-25 20:58:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 10 ms.
[2026-05-25 20:58:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality846105510342621711.gal : 2 ms
[2026-05-25 20:58:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality6799883165432861810.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/CTLCardinality846105510342621711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6799883165432861810.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.65098e+25,0.82067,36452,988,330,70664,3480,835,122963,233,16121,0


Converting to forward existential form...Done !
original formula: E((EX((i2.u26.p220==0)) + (i2.u11.p84==1)) U EG(EF((((i1.i1.u8.p26==1) + AX(((i4.i1.u18.p198==0)||(i5.u25.p247==1)))) * ((i4.i1.u18.p143!...201
=> equivalent forward existential formula: [FwdG(FwdU(Init,(EX((i2.u26.p220==0)) + (i2.u11.p84==1))),E(TRUE U (((i1.i1.u8.p26==1) + !(EX(!(((i4.i1.u18.p198...257
Reverse transition relation is NOT exact ! Due to transitions i0.i1.u1.t173, i0.i1.u1.t179, i1.t165, i1.i0.u6.t27, i1.i0.u6.t192, i1.i0.u9.t146, i1.i1.u4.t...528
Detected timeout of ITS tools.
[2026-05-25 21:19:41] [INFO ] Applying decomposition
[2026-05-25 21:19:41] [INFO ] Flatten gal took : 6 ms
[2026-05-25 21:19:41] [INFO ] Decomposing Gal with order
[2026-05-25 21:19:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 21:19:41] [INFO ] Removed a total of 127 redundant transitions.
[2026-05-25 21:19:41] [INFO ] Flatten gal took : 22 ms
[2026-05-25 21:19:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 149 labels/synchronizations in 7 ms.
[2026-05-25 21:19:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality4820316501112858977.gal : 2 ms
[2026-05-25 21:19:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality7626426184237030806.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/CTLCardinality4820316501112858977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7626426184237030806.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.65098e+25,1.48974,59860,1011,78,126074,350,669,175519,98,1099,0


Converting to forward existential form...Done !
original formula: E((EX((u40.p220==0)) + (u20.p84==1)) U EG(EF((((u7.p26==1) + AX(((u37.p198==0)||(u45.p247==1)))) * ((u30.p143!=0)||((u57.p310==1)&&(u62.p...168
=> equivalent forward existential formula: [FwdG(FwdU(Init,(EX((u40.p220==0)) + (u20.p84==1))),E(TRUE U (((u7.p26==1) + !(EX(!(((u37.p198==0)||(u45.p247==1...224
Reverse transition relation is NOT exact ! Due to transitions t104, t107, t146, t165, t188, t212, t217, t222, t224, t246, t271, u5.t173, u5.t179, u11.t28, ...338
Detected timeout of ITS tools.
[2026-05-25 21:40:48] [INFO ] Flatten gal took : 10 ms
[2026-05-25 21:40:48] [INFO ] Input system was already deterministic with 288 transitions.
[2026-05-25 21:40:48] [INFO ] Transformed 239 places.
[2026-05-25 21:40:48] [INFO ] Transformed 288 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 21:40:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality8073826288244371851.gal : 2 ms
[2026-05-25 21:40:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality13248484229468028116.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/CTLCardinality8073826288244371851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13248484229468028116.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.65098e+25,313.43,5405728,2,279557,5,2.81273e+07,6,0,1232,2.68083e+07,0


Converting to forward existential form...Done !
original formula: E((EX((p220==0)) + (p84==1)) U EG(EF((((p26==1) + AX(((p198==0)||(p247==1)))) * ((p143!=0)||((p310==1)&&(p346==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,(EX((p220==0)) + (p84==1))),E(TRUE U (((p26==1) + !(EX(!(((p198==0)||(p247==1)))))) * ((p143!=0)...193
Reverse transition relation is NOT exact ! Due to transitions t7, t13, t16, t17, t20, t27, t28, t99, t104, t107, t131, t146, t165, t173, t179, t188, t190, ...309

BK_TIME_CONFINEMENT_REACHED

--------------------
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="NoC3x3-PT-2A"
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 NoC3x3-PT-2A, 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 r194-tall-177969914000273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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