Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967700337.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is CO4-PT-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.6K Mar 6 13:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 6 13:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 13:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 6 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 6 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 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 138K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779521712092

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 07:35:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 07:35:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:35:13] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2026-05-23 07:35:13] [INFO ] Transformed 467 places.
[2026-05-23 07:35:13] [INFO ] Transformed 600 transitions.
[2026-05-23 07:35:13] [INFO ] Found NUPN structural information;
[2026-05-23 07:35:13] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 108 places in 6 ms
Reduce places removed 108 places and 155 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-08-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 445/445 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 349 transition count 444
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 81 place count 279 transition count 372
Iterating global reduction 1 with 70 rules applied. Total rules applied 151 place count 279 transition count 372
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 154 place count 279 transition count 369
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 185 place count 248 transition count 320
Iterating global reduction 2 with 31 rules applied. Total rules applied 216 place count 248 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 218 place count 248 transition count 318
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 221 place count 245 transition count 313
Iterating global reduction 3 with 3 rules applied. Total rules applied 224 place count 245 transition count 313
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 225 place count 244 transition count 312
Iterating global reduction 3 with 1 rules applied. Total rules applied 226 place count 244 transition count 312
Applied a total of 226 rules in 87 ms. Remains 244 /359 variables (removed 115) and now considering 312/445 (removed 133) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14322237806012739813.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15526168415351642884.kers'
[2026-05-23 07:35:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14322237806012739813.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15526168415351642884.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 244 cols 747 entries
Finished phase 1 with 238 SingleSign rule and 0 generalized
[2026-05-23 07:35:13] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15526168415351642884.kers
Total runtime 2 ms.
[2026-05-23 07:35:13] [INFO ] Implicit Places using invariants in 267 ms returned [5, 160]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 298 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/359 places, 312/445 transitions.
Applied a total of 0 rules in 4 ms. Remains 242 /242 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 405 ms. Remains : 242/359 places, 312/445 transitions.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 312/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 242 /242 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17500902259637959742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11924461451523334301.kers'
[2026-05-23 07:35:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17500902259637959742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11924461451523334301.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 312 rows 242 cols 731 entries
Finished phase 1 with 238 SingleSign rule and 0 generalized
[2026-05-23 07:35:13] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11924461451523334301.kers
Total runtime 1 ms.
[2026-05-23 07:35:14] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-23 07:35:14] [INFO ] Invariant cache hit.
[2026-05-23 07:35:14] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2026-05-23 07:35:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 312/551 variables, 239/246 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 3/554 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (OVERLAPS) 0/554 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 250 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 312/551 variables, 239/247 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 300/547 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/554 variables, and 548 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 239/242 constraints, PredecessorRefiner: 300/311 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Finished structural reductions in LTL mode , in 1 iterations and 60401 ms. Remains : 242/242 places, 312/312 transitions.
Support contains 60 out of 242 places after structural reductions.
[2026-05-23 07:36:14] [INFO ] Flatten gal took : 41 ms
[2026-05-23 07:36:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CO4-PT-08-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 07:36:14] [INFO ] Flatten gal took : 17 ms
[2026-05-23 07:36:14] [INFO ] Input system was already deterministic with 312 transitions.
Support contains 50 out of 242 places (down from 60) after GAL structural reductions.
RANDOM walk for 40000 steps (371 resets) in 1842 ms. (21 steps per ms) remains 25/34 properties
BEST_FIRST walk for 4002 steps (25 resets) in 59 ms. (66 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (31 resets) in 66 ms. (59 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (30 resets) in 46 ms. (85 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (32 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (28 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (27 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (32 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (29 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (26 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (31 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (31 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (30 resets) in 12 ms. (307 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (33 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (30 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (30 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (26 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (31 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (25 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (31 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (32 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
[2026-05-23 07:36:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 83/121 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 218/339 variables, 74/112 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 11/350 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 4/118 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 10/360 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 161/521 variables, 102/222 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 31/552 variables, 22/244 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/552 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 2/554 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/554 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 0/554 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 246 constraints, problems are : Problem set: 0 solved, 24 unsolved in 1582 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 83/121 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 218/339 variables, 74/115 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 21/136 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 11/350 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 10/360 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 161/521 variables, 102/246 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/521 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 31/552 variables, 22/268 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 16 (OVERLAPS) 2/554 variables, 2/270 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/554 variables, 0/270 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 18 (OVERLAPS) 0/554 variables, 0/270 constraints. Problems are: Problem set: 1 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 270 constraints, problems are : Problem set: 1 solved, 23 unsolved in 4292 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5880ms problems are : Problem set: 1 solved, 23 unsolved
Parikh walk visited 21 properties in 3300 ms.
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 312/312 transitions.
Graph (trivial) has 256 edges and 242 vertex of which 2 / 242 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 419 edges and 241 vertex of which 221 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 111 rules applied. Total rules applied 113 place count 221 transition count 184
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 99 rules applied. Total rules applied 212 place count 125 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 213 place count 124 transition count 181
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 213 place count 124 transition count 170
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 235 place count 113 transition count 170
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 246 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 237 place count 112 transition count 169
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 239 place count 112 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 240 place count 111 transition count 167
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 249 place count 102 transition count 155
Iterating global reduction 6 with 9 rules applied. Total rules applied 258 place count 102 transition count 155
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 262 place count 102 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 262 place count 102 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 264 place count 101 transition count 150
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 265 place count 100 transition count 149
Iterating global reduction 7 with 1 rules applied. Total rules applied 266 place count 100 transition count 149
Performed 40 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 346 place count 60 transition count 98
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 353 place count 60 transition count 91
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 356 place count 57 transition count 88
Iterating global reduction 8 with 3 rules applied. Total rules applied 359 place count 57 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 360 place count 57 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 366 place count 54 transition count 84
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 369 place count 54 transition count 81
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 370 place count 53 transition count 80
Iterating global reduction 10 with 1 rules applied. Total rules applied 371 place count 53 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 372 place count 53 transition count 79
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 398 place count 40 transition count 82
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 417 place count 40 transition count 63
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 427 place count 30 transition count 53
Iterating global reduction 12 with 10 rules applied. Total rules applied 437 place count 30 transition count 53
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 445 place count 30 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 447 place count 29 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 450 place count 29 transition count 46
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 451 place count 28 transition count 45
Iterating global reduction 13 with 1 rules applied. Total rules applied 452 place count 28 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 454 place count 28 transition count 43
Free-agglomeration rule applied 7 times.
Iterating global reduction 14 with 7 rules applied. Total rules applied 461 place count 28 transition count 36
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 470 place count 21 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 471 place count 20 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 473 place count 18 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 473 place count 18 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 475 place count 17 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 479 place count 15 transition count 30
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 485 place count 15 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 489 place count 13 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 493 place count 13 transition count 20
Applied a total of 493 rules in 55 ms. Remains 13 /242 variables (removed 229) and now considering 20/312 (removed 292) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 13/242 places, 20/312 transitions.
RANDOM walk for 78 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2026-05-23 07:36:24] [INFO ] Flatten gal took : 12 ms
[2026-05-23 07:36:24] [INFO ] Flatten gal took : 12 ms
[2026-05-23 07:36:24] [INFO ] Input system was already deterministic with 312 transitions.
Computed a total of 16 stabilizing places and 22 stable transitions
Graph (complete) has 421 edges and 242 vertex of which 235 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 242/242 places, 312/312 transitions.
Graph (trivial) has 252 edges and 242 vertex of which 2 / 242 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 420 edges and 241 vertex of which 238 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 96 rules applied. Total rules applied 98 place count 237 transition count 213
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 98 rules applied. Total rules applied 196 place count 142 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 197 place count 141 transition count 210
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 197 place count 141 transition count 198
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 221 place count 129 transition count 198
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 229 place count 121 transition count 188
Iterating global reduction 3 with 8 rules applied. Total rules applied 237 place count 121 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 121 transition count 187
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 238 place count 121 transition count 184
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 244 place count 118 transition count 184
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 247 place count 115 transition count 181
Iterating global reduction 4 with 3 rules applied. Total rules applied 250 place count 115 transition count 181
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 284 place count 98 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 288 place count 98 transition count 158
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 289 place count 97 transition count 157
Iterating global reduction 5 with 1 rules applied. Total rules applied 290 place count 97 transition count 157
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 294 place count 95 transition count 155
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 300 place count 95 transition count 149
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 6 rules applied. Total rules applied 306 place count 93 transition count 145
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 7 with 5 rules applied. Total rules applied 311 place count 91 transition count 142
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 313 place count 90 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 315 place count 89 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 320 place count 89 transition count 135
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 9 with 1 rules applied. Total rules applied 321 place count 89 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 322 place count 88 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 324 place count 87 transition count 133
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 326 place count 85 transition count 131
Applied a total of 326 rules in 47 ms. Remains 85 /242 variables (removed 157) and now considering 131/312 (removed 181) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9380968645393508789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8590026520186932726.kers'
[2026-05-23 07:36:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9380968645393508789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8590026520186932726.kers]
Normalized transition count is 130 out of 131 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 85 cols 290 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-23 07:36:24] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8590026520186932726.kers
Total runtime 1 ms.
[2026-05-23 07:36:24] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-23 07:36:24] [INFO ] Invariant cache hit.
[2026-05-23 07:36:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:36:24] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2026-05-23 07:36:24] [INFO ] Redundant transitions in 2 ms returned []
Running 116 sub problems to find dead transitions.
[2026-05-23 07:36:24] [INFO ] Invariant cache hit.
[2026-05-23 07:36:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 130/214 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 1/215 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 1/216 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/216 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 90 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4896 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 130/214 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 115/203 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 1/215 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 1/216 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/216 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 206 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6886 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11801ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 11801ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/242 places, 131/312 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11972 ms. Remains : 85/242 places, 131/312 transitions.
[2026-05-23 07:36:36] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:36:36] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:36:36] [INFO ] Input system was already deterministic with 131 transitions.
[2026-05-23 07:36:36] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:36:36] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:36:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality4888122529186731927.gal : 2 ms
[2026-05-23 07:36:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality12208527248403471335.ctl : 5 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/CTLCardinality4888122529186731927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12208527248403471335.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,121105,0.035671,4608,2,295,5,2553,6,0,460,2194,0


Converting to forward existential form...Done !
original formula: AF((AG((p179==0)) * AF(((p145==1)||(p329==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((p179==0)))) * !(EG(!(((p145==1)||(p329==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t37, t39, t49, t55, Intersection with reachable at each step enabled. (destroyed/re...190
(forward)formula 0,0,0.843853,35996,1,0,498,170545,295,287,2846,212510,718
FORMULA CO4-PT-08-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 312/312 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 239 transition count 311
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 28 place count 215 transition count 285
Iterating global reduction 1 with 24 rules applied. Total rules applied 52 place count 215 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 215 transition count 282
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 66 place count 204 transition count 271
Iterating global reduction 2 with 11 rules applied. Total rules applied 77 place count 204 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 200 transition count 265
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 200 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 200 transition count 263
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 198 transition count 261
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 198 transition count 261
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 197 transition count 260
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 197 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 197 transition count 259
Applied a total of 94 rules in 19 ms. Remains 197 /242 variables (removed 45) and now considering 259/312 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15054242021983912694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2084983361470591856.kers'
[2026-05-23 07:36:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15054242021983912694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2084983361470591856.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 259 rows 197 cols 612 entries
Finished phase 1 with 193 SingleSign rule and 0 generalized
[2026-05-23 07:36:37] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2084983361470591856.kers
Total runtime 1 ms.
[2026-05-23 07:36:37] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-23 07:36:37] [INFO ] Invariant cache hit.
[2026-05-23 07:36:37] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2026-05-23 07:36:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/456 variables, 197/203 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 204 constraints, problems are : Problem set: 0 solved, 258 unsolved in 18284 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/456 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 258/462 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 463 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48330ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 48331ms
Starting structural reductions in LTL mode, iteration 1 : 197/242 places, 259/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48529 ms. Remains : 197/242 places, 259/312 transitions.
[2026-05-23 07:37:26] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:37:26] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:37:26] [INFO ] Input system was already deterministic with 259 transitions.
[2026-05-23 07:37:26] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:37:26] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:37:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality6125133970102649265.gal : 2 ms
[2026-05-23 07:37:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality9867832058007241922.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/CTLCardinality6125133970102649265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9867832058007241922.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.03512e+07,0.092417,7548,2,1527,5,12482,6,0,1043,13510,0


Converting to forward existential form...Done !
original formula: AG(EF(AX((p453==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((p453==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, t67,...382
(forward)formula 0,0,1.72965,67744,1,0,393,290530,540,237,6103,293836,560
FORMULA CO4-PT-08-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 312/312 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 239 transition count 311
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 26 place count 217 transition count 287
Iterating global reduction 1 with 22 rules applied. Total rules applied 48 place count 217 transition count 287
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 217 transition count 284
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 61 place count 207 transition count 274
Iterating global reduction 2 with 10 rules applied. Total rules applied 71 place count 207 transition count 274
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 203 transition count 268
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 203 transition count 268
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 203 transition count 266
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 201 transition count 264
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 201 transition count 264
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 200 transition count 263
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 200 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 200 transition count 262
Applied a total of 88 rules in 16 ms. Remains 200 /242 variables (removed 42) and now considering 262/312 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11312083469285620389.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1194386625285356872.kers'
[2026-05-23 07:37:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11312083469285620389.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1194386625285356872.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 262 rows 200 cols 620 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-23 07:37:28] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1194386625285356872.kers
Total runtime 2 ms.
[2026-05-23 07:37:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-23 07:37:28] [INFO ] Invariant cache hit.
[2026-05-23 07:37:28] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2026-05-23 07:37:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/462 variables, 200/206 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/462 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 207 constraints, problems are : Problem set: 0 solved, 261 unsolved in 19350 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 262/462 variables, 200/207 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 261/468 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 469 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49386ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 49387ms
Starting structural reductions in LTL mode, iteration 1 : 200/242 places, 262/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49589 ms. Remains : 200/242 places, 262/312 transitions.
[2026-05-23 07:38:17] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:38:17] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:38:17] [INFO ] Input system was already deterministic with 262 transitions.
[2026-05-23 07:38:17] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:38:17] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:38:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality18151518183946392718.gal : 1 ms
[2026-05-23 07:38:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality18022017244194962284.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/CTLCardinality18151518183946392718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18022017244194962284.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06008e+07,0.09366,7640,2,1550,5,12856,6,0,1058,13644,0


Converting to forward existential form...Done !
original formula: AG((EX(AF((p204==1))) * ((AX(((p228==0)||(p359==1))) + AG((p220!=0))) + (p152==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(EG(!((p204==1)))))))] = FALSE * [(FwdU(((FwdU(Init,TRUE) * !((p152==1))) * !(!(EX(!(...214
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, t67,...382
(forward)formula 0,0,1.43059,53388,1,0,373,186522,546,228,6217,210114,535
FORMULA CO4-PT-08-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 242/242 places, 312/312 transitions.
Graph (trivial) has 251 edges and 242 vertex of which 2 / 242 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 420 edges and 241 vertex of which 234 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 233 transition count 213
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 94 rules applied. Total rules applied 188 place count 142 transition count 210
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 191 place count 141 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 193 place count 139 transition count 208
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 193 place count 139 transition count 196
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 217 place count 127 transition count 196
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 226 place count 118 transition count 184
Iterating global reduction 4 with 9 rules applied. Total rules applied 235 place count 118 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 237 place count 118 transition count 182
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 237 place count 118 transition count 179
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 243 place count 115 transition count 179
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 246 place count 112 transition count 176
Iterating global reduction 5 with 3 rules applied. Total rules applied 249 place count 112 transition count 176
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 283 place count 95 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 286 place count 95 transition count 154
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 287 place count 94 transition count 153
Iterating global reduction 6 with 1 rules applied. Total rules applied 288 place count 94 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 292 place count 92 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 6 rules applied. Total rules applied 298 place count 92 transition count 145
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 6 rules applied. Total rules applied 304 place count 90 transition count 141
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 8 with 5 rules applied. Total rules applied 309 place count 88 transition count 138
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 311 place count 87 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 315 place count 85 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 319 place count 85 transition count 131
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 10 with 1 rules applied. Total rules applied 320 place count 85 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 321 place count 84 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 323 place count 83 transition count 129
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 325 place count 81 transition count 127
Applied a total of 325 rules in 43 ms. Remains 81 /242 variables (removed 161) and now considering 127/312 (removed 185) transitions.
[2026-05-23 07:38:19] [INFO ] Flow matrix only has 126 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-13705109099906478790.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12703333362120587667.kers'
[2026-05-23 07:38:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13705109099906478790.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12703333362120587667.kers]
Normalized transition count is 125 out of 126 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 81 cols 277 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-23 07:38:19] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12703333362120587667.kers
Total runtime 0 ms.
[2026-05-23 07:38:19] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 07:38:19] [INFO ] Flow matrix only has 126 transitions (discarded 1 similar events)
[2026-05-23 07:38:19] [INFO ] Invariant cache hit.
[2026-05-23 07:38:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:38:19] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2026-05-23 07:38:19] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2026-05-23 07:38:19] [INFO ] Flow matrix only has 126 transitions (discarded 1 similar events)
[2026-05-23 07:38:19] [INFO ] Invariant cache hit.
[2026-05-23 07:38:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 1/207 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 0/207 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 86 constraints, problems are : Problem set: 0 solved, 111 unsolved in 3601 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 125/206 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 111/196 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 1/207 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/207 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 197 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4489 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8099ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 8099ms
Starting structural reductions in SI_CTL mode, iteration 1 : 81/242 places, 127/312 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8271 ms. Remains : 81/242 places, 127/312 transitions.
[2026-05-23 07:38:27] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:38:27] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:38:27] [INFO ] Input system was already deterministic with 127 transitions.
[2026-05-23 07:38:27] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:38:27] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:38:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality10552101054178526346.gal : 1 ms
[2026-05-23 07:38:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality6322069655199860756.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/CTLCardinality10552101054178526346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6322069655199860756.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,95425,0.021526,4584,2,279,5,2169,6,0,442,1695,0


Converting to forward existential form...Done !
original formula: AG(!(A(AF((p432==0)) U (EG((p282==1)) * (p103==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((EG((p282==1)) * (p103==1)))))) * !(E(!((EG((p282==1)) * (p103==1))) U (!(!(EG(!((p4...211
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t11, t35, t44, t50, t67, Intersection with reachable at each step enabled. (destroy...195
(forward)formula 0,1,0.488838,25160,1,0,566,119504,288,343,2725,125943,897
FORMULA CO4-PT-08-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 312/312 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 239 transition count 311
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 28 place count 215 transition count 285
Iterating global reduction 1 with 24 rules applied. Total rules applied 52 place count 215 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 215 transition count 282
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 66 place count 204 transition count 271
Iterating global reduction 2 with 11 rules applied. Total rules applied 77 place count 204 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 200 transition count 265
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 200 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 200 transition count 263
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 198 transition count 261
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 198 transition count 261
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 197 transition count 260
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 197 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 197 transition count 259
Applied a total of 94 rules in 27 ms. Remains 197 /242 variables (removed 45) and now considering 259/312 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16869275982495508371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4914354897698471957.kers'
[2026-05-23 07:38:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16869275982495508371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4914354897698471957.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 259 rows 197 cols 612 entries
Finished phase 1 with 193 SingleSign rule and 0 generalized
[2026-05-23 07:38:27] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4914354897698471957.kers
Total runtime 1 ms.
[2026-05-23 07:38:27] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-23 07:38:27] [INFO ] Invariant cache hit.
[2026-05-23 07:38:28] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2026-05-23 07:38:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/456 variables, 197/203 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 204 constraints, problems are : Problem set: 0 solved, 258 unsolved in 18335 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (OVERLAPS) 259/456 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 258/462 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 463 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48396ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 48397ms
Starting structural reductions in LTL mode, iteration 1 : 197/242 places, 259/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48612 ms. Remains : 197/242 places, 259/312 transitions.
[2026-05-23 07:39:16] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:39:16] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:39:16] [INFO ] Input system was already deterministic with 259 transitions.
[2026-05-23 07:39:16] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:39:16] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:39:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality12263387680592294812.gal : 1 ms
[2026-05-23 07:39:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality15096166542301768810.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/CTLCardinality12263387680592294812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15096166542301768810.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03512e+07,0.093844,7540,2,1527,5,12482,6,0,1043,13510,0


Converting to forward existential form...Done !
original formula: AG(AX(AF((p211==0))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!((p211==0)))] = FALSE
Hit Full ! (commute/partial/dont) 257/0/2
(forward)formula 0,0,0.74537,33172,1,0,36,141836,20,4,4873,76931,36
FORMULA CO4-PT-08-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 312/312 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 239 transition count 311
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 28 place count 215 transition count 285
Iterating global reduction 1 with 24 rules applied. Total rules applied 52 place count 215 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 215 transition count 282
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 66 place count 204 transition count 271
Iterating global reduction 2 with 11 rules applied. Total rules applied 77 place count 204 transition count 271
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 200 transition count 265
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 200 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 200 transition count 263
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 198 transition count 261
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 198 transition count 261
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 197 transition count 260
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 197 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 197 transition count 259
Applied a total of 94 rules in 12 ms. Remains 197 /242 variables (removed 45) and now considering 259/312 (removed 53) transitions.
[2026-05-23 07:39:17] [INFO ] Invariant cache hit.
[2026-05-23 07:39:17] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-23 07:39:17] [INFO ] Invariant cache hit.
[2026-05-23 07:39:17] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 197/242 places, 259/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 197/242 places, 259/312 transitions.
[2026-05-23 07:39:17] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:39:17] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:39:17] [INFO ] Input system was already deterministic with 259 transitions.
[2026-05-23 07:39:17] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:39:17] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:39:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality12015337798208869409.gal : 1 ms
[2026-05-23 07:39:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality1845436750505591709.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/CTLCardinality12015337798208869409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1845436750505591709.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.03512e+07,0.0911,7568,2,1527,5,12482,6,0,1043,13510,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, t67,...382
(forward)formula 0,0,4.39732,146120,1,0,626,524422,539,396,5944,949620,729
FORMULA CO4-PT-08-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 312/312 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 239 transition count 311
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 20 place count 223 transition count 293
Iterating global reduction 1 with 16 rules applied. Total rules applied 36 place count 223 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 223 transition count 292
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 42 place count 218 transition count 287
Iterating global reduction 2 with 5 rules applied. Total rules applied 47 place count 218 transition count 287
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 216 transition count 285
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 216 transition count 285
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 216 transition count 283
Applied a total of 53 rules in 6 ms. Remains 216 /242 variables (removed 26) and now considering 283/312 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9561627839134407406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12815742522147575442.kers'
[2026-05-23 07:39:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9561627839134407406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12815742522147575442.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 283 rows 216 cols 663 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-23 07:39:21] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12815742522147575442.kers
Total runtime 4 ms.
[2026-05-23 07:39:22] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-23 07:39:22] [INFO ] Invariant cache hit.
[2026-05-23 07:39:22] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-23 07:39:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 283/499 variables, 216/222 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 0/499 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/499 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 0/499 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 224 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 283/499 variables, 216/224 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 282/506 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/499 variables, and 508 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60046ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60047ms
Starting structural reductions in LTL mode, iteration 1 : 216/242 places, 283/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60239 ms. Remains : 216/242 places, 283/312 transitions.
[2026-05-23 07:40:22] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:40:22] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:40:22] [INFO ] Input system was already deterministic with 283 transitions.
[2026-05-23 07:40:22] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:40:22] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:40:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality9930666879920714850.gal : 1 ms
[2026-05-23 07:40:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality11258124212059052985.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/CTLCardinality9930666879920714850.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11258124212059052985.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.63601e+07,0.113855,8284,2,1709,5,14197,6,0,1143,17435,0


Converting to forward existential form...Done !
original formula: ((EG(((p234==0) + E((p161==1) U ((p417==0)||(p281==1))))) * ((EG(!(A((p157==0) U AX((p436==1))))) + AF(((p345==1)||(p385==1)))) + (AF((((...330
=> equivalent forward existential formula: (([(Init * !(EG(((p234==0) + E((p161==1) U ((p417==0)||(p281==1)))))))] = FALSE * ([FwdG((Init * !((EG(!(!((E(!(...979
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t19, t28, t36, t37, t38, t39, t40, t42, t43, t49, t50, t54, ...435
Detected timeout of ITS tools.
[2026-05-23 07:40:52] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:40:52] [INFO ] Applying decomposition
[2026-05-23 07:40:52] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14272712191802720288.txt' '-o' '/tmp/graph14272712191802720288.bin' '-w' '/tmp/graph14272712191802720288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14272712191802720288.bin' '-l' '-1' '-v' '-w' '/tmp/graph14272712191802720288.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:40:52] [INFO ] Decomposing Gal with order
[2026-05-23 07:40:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:40:52] [INFO ] Removed a total of 102 redundant transitions.
[2026-05-23 07:40:52] [INFO ] Flatten gal took : 60 ms
[2026-05-23 07:40:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 10 ms.
[2026-05-23 07:40:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality13708983596020243967.gal : 4 ms
[2026-05-23 07:40:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality17693293282613525671.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/CTLCardinality13708983596020243967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17693293282613525671.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.63601e+07,0.074937,7036,346,61,4878,748,645,8149,81,2558,0


Converting to forward existential form...Done !
original formula: ((EG(((i7.i0.u39.p234==0) + E((i9.i1.u22.p161==1) U ((i12.i0.u72.p417==0)||(i8.i0.u51.p281==1))))) * ((EG(!(A((i9.i1.u22.p157==0) U AX((i...512
=> equivalent forward existential formula: (([(Init * !(EG(((i7.i0.u39.p234==0) + E((i9.i1.u22.p161==1) U ((i12.i0.u72.p417==0)||(i8.i0.u51.p281==1)))))))]...1367
Reverse transition relation is NOT exact ! Due to transitions t12, t93, t106, t117, t126, t229, t235, t251, t255, t258, t281, i0.t4, i0.i1.u56.t91, i0.i1.u...761
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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
Fast SCC detection found an SCC at level 13
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
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,8.30965,279360,1,0,526063,886,4176,929360,396,2703,496302
FORMULA CO4-PT-08-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 242/242 places, 312/312 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 239 transition count 311
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 26 place count 217 transition count 287
Iterating global reduction 1 with 22 rules applied. Total rules applied 48 place count 217 transition count 287
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 217 transition count 284
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 62 place count 206 transition count 273
Iterating global reduction 2 with 11 rules applied. Total rules applied 73 place count 206 transition count 273
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 77 place count 202 transition count 267
Iterating global reduction 2 with 4 rules applied. Total rules applied 81 place count 202 transition count 267
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 202 transition count 265
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 200 transition count 263
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 200 transition count 263
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 199 transition count 262
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 199 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 90 place count 199 transition count 261
Applied a total of 90 rules in 14 ms. Remains 199 /242 variables (removed 43) and now considering 261/312 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2564739478635304112.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3995784794599569815.kers'
[2026-05-23 07:41:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2564739478635304112.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3995784794599569815.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 199 cols 616 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-23 07:41:00] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3995784794599569815.kers
Total runtime 5 ms.
[2026-05-23 07:41:00] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-23 07:41:00] [INFO ] Invariant cache hit.
[2026-05-23 07:41:01] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-23 07:41:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/460 variables, 199/205 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/460 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 206 constraints, problems are : Problem set: 0 solved, 260 unsolved in 18884 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/460 variables, 199/206 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 260/466 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 467 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48912ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 48912ms
Starting structural reductions in LTL mode, iteration 1 : 199/242 places, 261/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49136 ms. Remains : 199/242 places, 261/312 transitions.
[2026-05-23 07:41:50] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:41:50] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:41:50] [INFO ] Input system was already deterministic with 261 transitions.
[2026-05-23 07:41:50] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:41:50] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:41:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality8878120398650477987.gal : 1 ms
[2026-05-23 07:41:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality16959699835488667828.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/CTLCardinality8878120398650477987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16959699835488667828.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.08436e+07,0.121066,7660,2,1526,5,12774,6,0,1053,13840,0


Converting to forward existential form...Done !
original formula: (EF(AG((p203!=1))) * (AG(((p345!=0)&&(p136!=1))) + (EX(TRUE) * AF((p437==1)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(TRUE U !((p203!=1)))))))] = FALSE * ([((Init * !(!(E(TRUE U !(((p345!=0)&&(p136!=1)))))...265
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t65, t66, t68,...382
Hit Full ! (commute/partial/dont) 259/0/2
(forward)formula 0,0,1.80334,60988,1,0,398,224385,555,227,6516,257287,565
FORMULA CO4-PT-08-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 242/242 places, 312/312 transitions.
Graph (trivial) has 252 edges and 242 vertex of which 2 / 242 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 420 edges and 241 vertex of which 234 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 91 rules applied. Total rules applied 93 place count 233 transition count 214
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 93 rules applied. Total rules applied 186 place count 143 transition count 211
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 188 place count 142 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 189 place count 141 transition count 210
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 189 place count 141 transition count 198
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 213 place count 129 transition count 198
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 222 place count 120 transition count 186
Iterating global reduction 4 with 9 rules applied. Total rules applied 231 place count 120 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 233 place count 120 transition count 184
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 233 place count 120 transition count 181
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 239 place count 117 transition count 181
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 242 place count 114 transition count 178
Iterating global reduction 5 with 3 rules applied. Total rules applied 245 place count 114 transition count 178
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 279 place count 97 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 282 place count 97 transition count 156
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 283 place count 96 transition count 155
Iterating global reduction 6 with 1 rules applied. Total rules applied 284 place count 96 transition count 155
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 288 place count 94 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 5 rules applied. Total rules applied 293 place count 94 transition count 148
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 6 rules applied. Total rules applied 299 place count 92 transition count 144
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 8 with 5 rules applied. Total rules applied 304 place count 90 transition count 141
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 306 place count 89 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 308 place count 88 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 313 place count 88 transition count 134
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 10 with 1 rules applied. Total rules applied 314 place count 88 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 315 place count 87 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 317 place count 86 transition count 132
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 318 place count 86 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 320 place count 84 transition count 130
Applied a total of 320 rules in 37 ms. Remains 84 /242 variables (removed 158) and now considering 130/312 (removed 182) transitions.
[2026-05-23 07:41:51] [INFO ] Flow matrix only has 129 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-2382856753670384795.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15799870876423568141.kers'
[2026-05-23 07:41:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2382856753670384795.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15799870876423568141.kers]
Normalized transition count is 128 out of 129 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 128 rows 84 cols 286 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-23 07:41:51] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15799870876423568141.kers
Total runtime 1 ms.
[2026-05-23 07:41:52] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-23 07:41:52] [INFO ] Flow matrix only has 129 transitions (discarded 1 similar events)
[2026-05-23 07:41:52] [INFO ] Invariant cache hit.
[2026-05-23 07:41:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:41:52] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2026-05-23 07:41:52] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2026-05-23 07:41:52] [INFO ] Flow matrix only has 129 transitions (discarded 1 similar events)
[2026-05-23 07:41:52] [INFO ] Invariant cache hit.
[2026-05-23 07:41:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 128/212 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 1/213 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 0/213 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 89 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3941 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 128/212 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 115/203 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 1/213 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 204 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4842 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8801ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 8801ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/242 places, 130/312 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8947 ms. Remains : 84/242 places, 130/312 transitions.
[2026-05-23 07:42:00] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:42:00] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:42:00] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-23 07:42:00] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:42:00] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:42:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality17581734031793395398.gal : 1 ms
[2026-05-23 07:42:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13626621834275713773.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/CTLCardinality17581734031793395398.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13626621834275713773.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,109969,0.041422,4632,2,291,5,2364,6,0,458,1818,0


Converting to forward existential form...Done !
original formula: EG(AG(E((p154==0) U ((p231==0)||(p390==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E((p154==0) U ((p231==0)||(p390==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t37, t48, t54, t69, Intersection with reachable at each step enabled. (destroyed/re...190
(forward)formula 0,1,0.167972,9952,1,0,182,28200,286,98,2816,25332,281
FORMULA CO4-PT-08-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 242/242 places, 312/312 transitions.
Graph (trivial) has 254 edges and 242 vertex of which 2 / 242 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 420 edges and 241 vertex of which 235 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 96 rules applied. Total rules applied 98 place count 234 transition count 209
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 98 rules applied. Total rules applied 196 place count 139 transition count 206
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 198 place count 138 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 199 place count 137 transition count 205
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 199 place count 137 transition count 194
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 221 place count 126 transition count 194
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 230 place count 117 transition count 182
Iterating global reduction 4 with 9 rules applied. Total rules applied 239 place count 117 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 241 place count 117 transition count 180
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 241 place count 117 transition count 177
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 247 place count 114 transition count 177
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 250 place count 111 transition count 174
Iterating global reduction 5 with 3 rules applied. Total rules applied 253 place count 111 transition count 174
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 287 place count 94 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 290 place count 94 transition count 152
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 291 place count 93 transition count 151
Iterating global reduction 6 with 1 rules applied. Total rules applied 292 place count 93 transition count 151
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 296 place count 91 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 6 rules applied. Total rules applied 302 place count 91 transition count 143
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 6 rules applied. Total rules applied 308 place count 89 transition count 139
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 8 with 5 rules applied. Total rules applied 313 place count 87 transition count 136
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 315 place count 86 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 319 place count 84 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 323 place count 84 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 325 place count 83 transition count 128
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 326 place count 83 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 328 place count 81 transition count 126
Applied a total of 328 rules in 106 ms. Remains 81 /242 variables (removed 161) and now considering 126/312 (removed 186) transitions.
[2026-05-23 07:42:01] [INFO ] Flow matrix only has 125 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-6311177388461427220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16602283397594087407.kers'
[2026-05-23 07:42:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6311177388461427220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16602283397594087407.kers]
Normalized transition count is 124 out of 125 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 124 rows 81 cols 277 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-23 07:42:01] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16602283397594087407.kers
Total runtime 0 ms.
[2026-05-23 07:42:01] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-23 07:42:01] [INFO ] Flow matrix only has 125 transitions (discarded 1 similar events)
[2026-05-23 07:42:01] [INFO ] Invariant cache hit.
[2026-05-23 07:42:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:42:01] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2026-05-23 07:42:01] [INFO ] Redundant transitions in 3 ms returned []
Running 111 sub problems to find dead transitions.
[2026-05-23 07:42:01] [INFO ] Flow matrix only has 125 transitions (discarded 1 similar events)
[2026-05-23 07:42:01] [INFO ] Invariant cache hit.
[2026-05-23 07:42:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/84 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 1/205 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 86 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4543 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 124/204 variables, 80/84 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 110/194 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 1/205 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 1/206 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/206 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 197 constraints, problems are : Problem set: 0 solved, 111 unsolved in 5915 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10485ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 10494ms
Starting structural reductions in SI_CTL mode, iteration 1 : 81/242 places, 126/312 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10823 ms. Remains : 81/242 places, 126/312 transitions.
[2026-05-23 07:42:11] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:42:11] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:42:11] [INFO ] Input system was already deterministic with 126 transitions.
[2026-05-23 07:42:11] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:42:11] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:42:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality2249360646352209942.gal : 1 ms
[2026-05-23 07:42:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality14201660391204212340.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/CTLCardinality2249360646352209942.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14201660391204212340.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,86185,0.043516,4592,2,286,5,2245,6,0,440,1737,0


Converting to forward existential form...Done !
original formula: EG(AF(((p242==0)||(p86==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((p242==0)||(p86==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t37, t46, t67, Intersection with reachable at each step enabled. (destroyed/reverse...185
(forward)formula 0,1,0.264936,14068,1,0,238,48525,278,151,2590,58406,355
FORMULA CO4-PT-08-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 242/242 places, 312/312 transitions.
Graph (trivial) has 245 edges and 242 vertex of which 2 / 242 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 420 edges and 241 vertex of which 234 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 88 rules applied. Total rules applied 90 place count 233 transition count 217
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 90 rules applied. Total rules applied 180 place count 146 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 181 place count 145 transition count 214
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 181 place count 145 transition count 202
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 205 place count 133 transition count 202
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 211 place count 127 transition count 194
Iterating global reduction 3 with 6 rules applied. Total rules applied 217 place count 127 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 218 place count 127 transition count 193
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 218 place count 127 transition count 190
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 224 place count 124 transition count 190
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 227 place count 121 transition count 187
Iterating global reduction 4 with 3 rules applied. Total rules applied 230 place count 121 transition count 187
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 264 place count 104 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 268 place count 104 transition count 165
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 269 place count 103 transition count 164
Iterating global reduction 5 with 1 rules applied. Total rules applied 270 place count 103 transition count 164
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 274 place count 101 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 280 place count 101 transition count 156
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 6 with 5 rules applied. Total rules applied 285 place count 99 transition count 153
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 with 3 rules applied. Total rules applied 288 place count 98 transition count 151
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 291 place count 97 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 292 place count 96 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 296 place count 96 transition count 145
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 10 with 1 rules applied. Total rules applied 297 place count 96 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 298 place count 95 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 300 place count 94 transition count 143
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 303 place count 94 transition count 143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 305 place count 92 transition count 141
Applied a total of 305 rules in 50 ms. Remains 92 /242 variables (removed 150) and now considering 141/312 (removed 171) transitions.
[2026-05-23 07:42:12] [INFO ] Flow matrix only has 140 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-17510323539298318421.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-923667519197165249.kers'
[2026-05-23 07:42:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17510323539298318421.kers, --Pflows, --basisKERS=/tmp/petrispot-output-923667519197165249.kers]
Normalized transition count is 139 out of 140 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 92 cols 312 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-23 07:42:12] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-923667519197165249.kers
Total runtime 18 ms.
[2026-05-23 07:42:12] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-23 07:42:12] [INFO ] Flow matrix only has 140 transitions (discarded 1 similar events)
[2026-05-23 07:42:12] [INFO ] Invariant cache hit.
[2026-05-23 07:42:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:42:12] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2026-05-23 07:42:12] [INFO ] Redundant transitions in 1 ms returned []
Running 126 sub problems to find dead transitions.
[2026-05-23 07:42:12] [INFO ] Flow matrix only has 140 transitions (discarded 1 similar events)
[2026-05-23 07:42:12] [INFO ] Invariant cache hit.
[2026-05-23 07:42:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 139/231 variables, 92/96 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 1/232 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/232 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 97 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4697 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 92/92 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 139/231 variables, 92/96 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 126/222 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 1/232 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/232 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 223 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5949 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 92/92 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10687ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 10692ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/242 places, 141/312 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10959 ms. Remains : 92/242 places, 141/312 transitions.
[2026-05-23 07:42:23] [INFO ] Flatten gal took : 1 ms
[2026-05-23 07:42:23] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:42:23] [INFO ] Input system was already deterministic with 141 transitions.
[2026-05-23 07:42:23] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:42:23] [INFO ] Flatten gal took : 1 ms
[2026-05-23 07:42:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality5082805979813404845.gal : 1 ms
[2026-05-23 07:42:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality1801228432697332107.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/CTLCardinality5082805979813404845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1801228432697332107.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,177073,0.023306,4752,2,315,5,2767,6,0,501,2218,0


Converting to forward existential form...Done !
original formula: A(((p144==0)||(p317==1)) U (!(A(((p95==0)||(p272==1)) U ((p404==1)||(p348==1)))) * EG(AG(((p263==0)||(p84==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!((!(!((E(!(((p404==1)||(p348==1))) U (!(((p95==0)||(p272==1))) * !(((p404==1)||(p348==1))))) + E...636
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t40, t50, t57, t74, Intersection with reachable at each step enabled. (destroyed/re...190
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.1466,120616,1,0,1172,673679,326,739,3235,832046,1440
FORMULA CO4-PT-08-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 07:42:26] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:42:26] [INFO ] Flatten gal took : 6 ms
Total runtime 433186 ms.

BK_STOP 1779522146491

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is CO4-PT-08, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tall-177946967700337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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