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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.6K Mar 6 13:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 6 13:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 6 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 6 13:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Mar 6 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 6 13:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 6 13:26 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 132K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779522255828

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 07:44:16] [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:44:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:44:17] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2026-05-23 07:44:17] [INFO ] Transformed 544 places.
[2026-05-23 07:44:17] [INFO ] Transformed 615 transitions.
[2026-05-23 07:44:17] [INFO ] Found NUPN structural information;
[2026-05-23 07:44:17] [INFO ] Parsed PT model containing 544 places and 615 transitions and 1338 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 157 places in 8 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-10-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 438/438 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 376 transition count 436
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 65 place count 324 transition count 382
Iterating global reduction 1 with 52 rules applied. Total rules applied 117 place count 324 transition count 382
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 154 place count 287 transition count 345
Iterating global reduction 1 with 37 rules applied. Total rules applied 191 place count 287 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 193 place count 287 transition count 343
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 207 place count 273 transition count 329
Iterating global reduction 2 with 14 rules applied. Total rules applied 221 place count 273 transition count 329
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 226 place count 268 transition count 324
Iterating global reduction 2 with 5 rules applied. Total rules applied 231 place count 268 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 268 transition count 323
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 234 place count 266 transition count 321
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 266 transition count 321
Applied a total of 236 rules in 109 ms. Remains 266 /387 variables (removed 121) and now considering 321/438 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4812812305004968470.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6969566496428434810.kers'
[2026-05-23 07:44:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4812812305004968470.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6969566496428434810.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 321 rows 266 cols 717 entries
Finished phase 1 with 262 SingleSign rule and 0 generalized
[2026-05-23 07:44:17] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6969566496428434810.kers
Total runtime 2 ms.
[2026-05-23 07:44:17] [INFO ] Implicit Places using invariants in 257 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 286 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/387 places, 321/438 transitions.
Applied a total of 0 rules in 6 ms. Remains 265 /265 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 414 ms. Remains : 265/387 places, 321/438 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 321/321 transitions.
Applied a total of 0 rules in 6 ms. Remains 265 /265 variables (removed 0) and now considering 321/321 (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-12403655197835078986.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15620137526580597283.kers'
[2026-05-23 07:44:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12403655197835078986.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15620137526580597283.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 321 rows 265 cols 715 entries
Finished phase 1 with 262 SingleSign rule and 0 generalized
[2026-05-23 07:44:17] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15620137526580597283.kers
Total runtime 1 ms.
[2026-05-23 07:44:17] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-23 07:44:17] [INFO ] Invariant cache hit.
[2026-05-23 07:44:17] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2026-05-23 07:44:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/585 variables, 264/267 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 1/586 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/586 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 586/586 variables, and 270 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (OVERLAPS) 321/585 variables, 264/269 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 288/557 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 1/586 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 32/590 constraints. Problems are: Problem set: 0 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 586/586 variables, and 590 constraints, problems are : Problem set: 0 solved, 320 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Finished structural reductions in LTL mode , in 1 iterations and 60434 ms. Remains : 265/265 places, 321/321 transitions.
Support contains 55 out of 265 places after structural reductions.
[2026-05-23 07:45:18] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-23 07:45:18] [INFO ] Flatten gal took : 41 ms
[2026-05-23 07:45:18] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CO4-PT-10-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-10-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 07:45:18] [INFO ] Flatten gal took : 17 ms
[2026-05-23 07:45:18] [INFO ] Input system was already deterministic with 321 transitions.
Support contains 18 out of 265 places (down from 55) after GAL structural reductions.
FORMULA CO4-PT-10-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (50 resets) in 1073 ms. (37 steps per ms) remains 14/15 properties
BEST_FIRST walk for 40000 steps (64 resets) in 220 ms. (180 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (48 resets) in 674 ms. (59 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (82 resets) in 356 ms. (112 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40000 steps (56 resets) in 278 ms. (143 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (33 resets) in 200 ms. (199 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (75 resets) in 131 ms. (303 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (148 resets) in 216 ms. (184 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (34 resets) in 218 ms. (182 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (61 resets) in 164 ms. (242 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (78 resets) in 216 ms. (184 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (38 resets) in 192 ms. (207 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (50 resets) in 114 ms. (347 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (102 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (57 resets) in 112 ms. (353 steps per ms) remains 13/13 properties
[2026-05-23 07:45:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 34/49 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 124/173 variables, 36/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 18/191 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 3/194 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 189/383 variables, 102/157 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 135/518 variables, 71/228 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/518 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 48/566 variables, 28/256 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 16/582 variables, 9/265 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/582 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 4/586 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/586 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 0/586 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 586/586 variables, and 268 constraints, problems are : Problem set: 0 solved, 13 unsolved in 938 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 34/49 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 124/173 variables, 36/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 18/191 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 3/194 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 189/383 variables, 102/170 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 135/518 variables, 71/241 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/518 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 48/566 variables, 28/269 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/566 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 16/582 variables, 9/278 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/582 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 4/586 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/586 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 0/586 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 586/586 variables, and 281 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2054 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2997ms problems are : Problem set: 0 solved, 13 unsolved
Finished Parikh walk after 352 steps, including 9 resets, run visited all 1 properties in 1 ms. (steps per millisecond=352 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 1111 ms.
[2026-05-23 07:45:24] [INFO ] Flatten gal took : 12 ms
[2026-05-23 07:45:24] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:45:24] [INFO ] Input system was already deterministic with 321 transitions.
Computed a total of 19 stabilizing places and 21 stable transitions
Graph (complete) has 396 edges and 265 vertex of which 258 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 321/321 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 264 transition count 320
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 239 transition count 295
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 239 transition count 295
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 69 place count 222 transition count 278
Iterating global reduction 1 with 17 rules applied. Total rules applied 86 place count 222 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 222 transition count 277
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 95 place count 214 transition count 269
Iterating global reduction 2 with 8 rules applied. Total rules applied 103 place count 214 transition count 269
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 107 place count 210 transition count 265
Iterating global reduction 2 with 4 rules applied. Total rules applied 111 place count 210 transition count 265
Applied a total of 111 rules in 20 ms. Remains 210 /265 variables (removed 55) and now considering 265/321 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17983171090623661303.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14822586677337607036.kers'
[2026-05-23 07:45:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17983171090623661303.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14822586677337607036.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 265 rows 210 cols 596 entries
Finished phase 1 with 207 SingleSign rule and 0 generalized
[2026-05-23 07:45:24] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14822586677337607036.kers
Total runtime 1 ms.
[2026-05-23 07:45:24] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-23 07:45:24] [INFO ] Invariant cache hit.
[2026-05-23 07:45:24] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2026-05-23 07:45:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 265/475 variables, 210/213 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 0/475 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 215 constraints, problems are : Problem set: 0 solved, 264 unsolved in 16471 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 265/475 variables, 210/215 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 264/479 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/475 variables, and 480 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46515ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 46516ms
Starting structural reductions in LTL mode, iteration 1 : 210/265 places, 265/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46705 ms. Remains : 210/265 places, 265/321 transitions.
[2026-05-23 07:46:10] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:46:10] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:46:10] [INFO ] Input system was already deterministic with 265 transitions.
[2026-05-23 07:46:10] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:46:10] [INFO ] Flatten gal took : 21 ms
[2026-05-23 07:46:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality17407099634687962652.gal : 4 ms
[2026-05-23 07:46:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality9417444619260015363.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/CTLCardinality17407099634687962652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9417444619260015363.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,455904,0.107095,7908,2,1336,5,14116,6,0,1103,14999,0


Converting to forward existential form...Done !
original formula: (AF((p454==1)) * (EX(EX(TRUE)) + (EX(AG((p294==1))) * (AG((p495!=1)) + EF((p478==0))))))
=> equivalent forward existential formula: ([FwdG(Init,!((p454==1)))] = FALSE * ([((Init * !(EX(EX(TRUE)))) * !(EX(!(E(TRUE U !((p294==1)))))))] = FALSE * ...246
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t21, t29, t38, t39, t41, t42, t43, t44, t45, t48, t50, t52, t55...316
Hit Full ! (commute/partial/dont) 263/0/2
(forward)formula 0,0,1.08219,42924,1,0,375,129680,566,234,6504,149060,576
FORMULA CO4-PT-10-CTLCardinality-2024-00 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 : 265/265 places, 321/321 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 264 transition count 320
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 30 place count 236 transition count 292
Iterating global reduction 1 with 28 rules applied. Total rules applied 58 place count 236 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 236 transition count 291
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 77 place count 218 transition count 273
Iterating global reduction 2 with 18 rules applied. Total rules applied 95 place count 218 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 218 transition count 271
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 106 place count 209 transition count 262
Iterating global reduction 3 with 9 rules applied. Total rules applied 115 place count 209 transition count 262
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 120 place count 204 transition count 257
Iterating global reduction 3 with 5 rules applied. Total rules applied 125 place count 204 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 204 transition count 256
Applied a total of 126 rules in 25 ms. Remains 204 /265 variables (removed 61) and now considering 256/321 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7486325148388844999.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-888331101364561264.kers'
[2026-05-23 07:46:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7486325148388844999.kers, --Pflows, --basisKERS=/tmp/petrispot-output-888331101364561264.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 256 rows 204 cols 574 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-05-23 07:46:12] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-888331101364561264.kers
Total runtime 1 ms.
[2026-05-23 07:46:12] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-23 07:46:12] [INFO ] Invariant cache hit.
[2026-05-23 07:46:12] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-23 07:46:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 256/460 variables, 204/207 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 0/460 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 209 constraints, problems are : Problem set: 0 solved, 255 unsolved in 15120 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/460 variables, 204/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 255/464 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 465 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45153ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 45155ms
Starting structural reductions in LTL mode, iteration 1 : 204/265 places, 256/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45493 ms. Remains : 204/265 places, 256/321 transitions.
[2026-05-23 07:46:57] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:46:57] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:46:57] [INFO ] Input system was already deterministic with 256 transitions.
[2026-05-23 07:46:57] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:46:57] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:46:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality3782316425057503727.gal : 5 ms
[2026-05-23 07:46:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality7693598872942490361.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/CTLCardinality3782316425057503727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7693598872942490361.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,377704,0.091548,7816,2,1304,5,13498,6,0,1070,14450,0


Converting to forward existential form...Done !
original formula: AF((AX(FALSE) * (((p316==0)||(p421==1)) + (EX(((p5==0)||(p374==1))) + (p336==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(FALSE))) * (((p316==0)||(p421==1)) + (EX(((p5==0)||(p374==1))) + (p336==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t12, t13, t14, t15, t21, t29, t38, t40, t41, t42, t43, t44, t46, t49, t93, t148, t1...295
(forward)formula 0,0,2.22713,90460,1,0,579,269788,536,389,5698,595882,710
FORMULA CO4-PT-10-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 321/321 transitions.
Graph (trivial) has 274 edges and 265 vertex of which 3 / 265 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 394 edges and 263 vertex of which 256 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 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 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 126 rules applied. Total rules applied 128 place count 255 transition count 185
Reduce places removed 125 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 1 with 127 rules applied. Total rules applied 255 place count 130 transition count 183
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 257 place count 129 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 258 place count 128 transition count 182
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 258 place count 128 transition count 169
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 284 place count 115 transition count 169
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 292 place count 107 transition count 161
Iterating global reduction 4 with 8 rules applied. Total rules applied 300 place count 107 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 301 place count 107 transition count 160
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 301 place count 107 transition count 156
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 309 place count 103 transition count 156
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 312 place count 100 transition count 153
Iterating global reduction 5 with 3 rules applied. Total rules applied 315 place count 100 transition count 153
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 5 with 34 rules applied. Total rules applied 349 place count 83 transition count 135
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 5 with 3 rules applied. Total rules applied 352 place count 83 transition count 132
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 354 place count 82 transition count 131
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 357 place count 79 transition count 128
Iterating global reduction 7 with 3 rules applied. Total rules applied 360 place count 79 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 369 place count 79 transition count 119
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 7 with 4 rules applied. Total rules applied 373 place count 79 transition count 115
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 377 place count 75 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 377 place count 75 transition count 114
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 379 place count 74 transition count 114
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 381 place count 73 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 383 place count 71 transition count 111
Applied a total of 383 rules in 55 ms. Remains 71 /265 variables (removed 194) and now considering 111/321 (removed 210) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9112335361700957846.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14032641149509452329.kers'
[2026-05-23 07:46:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9112335361700957846.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14032641149509452329.kers]
Normalized transition count is 110 out of 111 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 71 cols 264 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-23 07:46:59] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14032641149509452329.kers
Total runtime 0 ms.
[2026-05-23 07:46:59] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-23 07:46:59] [INFO ] Invariant cache hit.
[2026-05-23 07:46:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:46:59] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2026-05-23 07:46:59] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2026-05-23 07:46:59] [INFO ] Invariant cache hit.
[2026-05-23 07:46:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 75 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2946 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 101/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 176 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3759 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6717ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 6717ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/265 places, 111/321 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6869 ms. Remains : 71/265 places, 111/321 transitions.
[2026-05-23 07:47:06] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:47:06] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:47:06] [INFO ] Input system was already deterministic with 111 transitions.
[2026-05-23 07:47:06] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:47:06] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:47:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality4835654676478275630.gal : 1 ms
[2026-05-23 07:47:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality15399926081206034295.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/CTLCardinality4835654676478275630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15399926081206034295.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,8911,0.018573,4564,2,216,5,1976,6,0,387,1758,0


Converting to forward existential form...Done !
original formula: AG(AF((p291==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p291==0)))] = FALSE
Hit Full ! (commute/partial/dont) 109/0/2
(forward)formula 0,0,0.0494,5916,1,0,9,9923,20,2,1856,5010,8
FORMULA CO4-PT-10-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 321/321 transitions.
Graph (trivial) has 272 edges and 265 vertex of which 3 / 265 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 394 edges and 263 vertex of which 256 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 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 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 126 rules applied. Total rules applied 128 place count 255 transition count 185
Reduce places removed 125 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 1 with 127 rules applied. Total rules applied 255 place count 130 transition count 183
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 257 place count 129 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 258 place count 128 transition count 182
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 258 place count 128 transition count 170
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 282 place count 116 transition count 170
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 290 place count 108 transition count 162
Iterating global reduction 4 with 8 rules applied. Total rules applied 298 place count 108 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 299 place count 108 transition count 161
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 299 place count 108 transition count 157
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 307 place count 104 transition count 157
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 310 place count 101 transition count 154
Iterating global reduction 5 with 3 rules applied. Total rules applied 313 place count 101 transition count 154
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 349 place count 83 transition count 135
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 5 with 3 rules applied. Total rules applied 352 place count 83 transition count 132
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 354 place count 82 transition count 131
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 357 place count 79 transition count 128
Iterating global reduction 7 with 3 rules applied. Total rules applied 360 place count 79 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 369 place count 79 transition count 119
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 7 with 4 rules applied. Total rules applied 373 place count 79 transition count 115
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 377 place count 75 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 377 place count 75 transition count 114
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 379 place count 74 transition count 114
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 381 place count 73 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 383 place count 71 transition count 111
Applied a total of 383 rules in 56 ms. Remains 71 /265 variables (removed 194) and now considering 111/321 (removed 210) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2665809791781219189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5014972423684518151.kers'
[2026-05-23 07:47:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2665809791781219189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5014972423684518151.kers]
Normalized transition count is 110 out of 111 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 71 cols 264 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-23 07:47:06] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5014972423684518151.kers
Total runtime 1 ms.
[2026-05-23 07:47:06] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-23 07:47:06] [INFO ] Invariant cache hit.
[2026-05-23 07:47:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:47:06] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2026-05-23 07:47:06] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_CTL mode, iteration 1 : 71/265 places, 111/321 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 158 ms. Remains : 71/265 places, 111/321 transitions.
[2026-05-23 07:47:06] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:47:06] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:47:06] [INFO ] Input system was already deterministic with 111 transitions.
[2026-05-23 07:47:06] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:47:06] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:47:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9922372909561601599.gal : 1 ms
[2026-05-23 07:47:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1565463957536919975.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9922372909561601599.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1565463957536919975.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 25212 steps (3453 resets) in 139 ms. (180 steps per ms) remains 0/1 properties
FORMULA CO4-PT-10-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 321/321 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 264 transition count 320
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 30 place count 236 transition count 292
Iterating global reduction 1 with 28 rules applied. Total rules applied 58 place count 236 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 236 transition count 291
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 77 place count 218 transition count 273
Iterating global reduction 2 with 18 rules applied. Total rules applied 95 place count 218 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 218 transition count 271
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 106 place count 209 transition count 262
Iterating global reduction 3 with 9 rules applied. Total rules applied 115 place count 209 transition count 262
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 205 transition count 258
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 205 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 205 transition count 257
Applied a total of 124 rules in 11 ms. Remains 205 /265 variables (removed 60) and now considering 257/321 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14190542147692473559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13936034517932862671.kers'
[2026-05-23 07:47:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14190542147692473559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13936034517932862671.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 257 rows 205 cols 578 entries
Finished phase 1 with 202 SingleSign rule and 0 generalized
[2026-05-23 07:47:07] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13936034517932862671.kers
Total runtime 1 ms.
[2026-05-23 07:47:07] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-23 07:47:07] [INFO ] Invariant cache hit.
[2026-05-23 07:47:07] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2026-05-23 07:47:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 257/462 variables, 205/208 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/462 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 210 constraints, problems are : Problem set: 0 solved, 256 unsolved in 15250 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 257/462 variables, 205/210 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 256/466 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 467 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45291ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 45292ms
Starting structural reductions in LTL mode, iteration 1 : 205/265 places, 257/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45447 ms. Remains : 205/265 places, 257/321 transitions.
[2026-05-23 07:47:52] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:47:52] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:47:52] [INFO ] Input system was already deterministic with 257 transitions.
[2026-05-23 07:47:52] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:47:52] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:47:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality12612374615794763542.gal : 1 ms
[2026-05-23 07:47:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality9086858137578931148.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/CTLCardinality12612374615794763542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9086858137578931148.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,381472,0.093067,7824,2,1321,5,13616,6,0,1075,14547,0


Converting to forward existential form...Done !
original formula: AX(AF((p517==1)))
=> equivalent forward existential formula: [FwdG(EY(Init),!((p517==1)))] = FALSE
Hit Full ! (commute/partial/dont) 255/0/2
(forward)formula 0,0,0.526515,23492,1,0,29,84708,20,4,4731,38558,26
FORMULA CO4-PT-10-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 321/321 transitions.
Graph (trivial) has 273 edges and 265 vertex of which 3 / 265 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 394 edges and 263 vertex of which 256 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 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 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 126 rules applied. Total rules applied 128 place count 255 transition count 185
Reduce places removed 125 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 1 with 127 rules applied. Total rules applied 255 place count 130 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 129 transition count 183
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 256 place count 129 transition count 170
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 282 place count 116 transition count 170
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 290 place count 108 transition count 162
Iterating global reduction 3 with 8 rules applied. Total rules applied 298 place count 108 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 299 place count 108 transition count 161
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 299 place count 108 transition count 157
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 307 place count 104 transition count 157
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 310 place count 101 transition count 154
Iterating global reduction 4 with 3 rules applied. Total rules applied 313 place count 101 transition count 154
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 349 place count 83 transition count 135
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 4 with 3 rules applied. Total rules applied 352 place count 83 transition count 132
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 354 place count 82 transition count 131
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 357 place count 79 transition count 128
Iterating global reduction 6 with 3 rules applied. Total rules applied 360 place count 79 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 369 place count 79 transition count 119
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 4 rules applied. Total rules applied 373 place count 79 transition count 115
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 377 place count 75 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 377 place count 75 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 379 place count 74 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 381 place count 73 transition count 113
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 382 place count 73 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 384 place count 71 transition count 111
Applied a total of 384 rules in 37 ms. Remains 71 /265 variables (removed 194) and now considering 111/321 (removed 210) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13278892771773086830.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4511298155029228269.kers'
[2026-05-23 07:47:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13278892771773086830.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4511298155029228269.kers]
Normalized transition count is 110 out of 111 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 71 cols 266 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-23 07:47:53] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4511298155029228269.kers
Total runtime 0 ms.
[2026-05-23 07:47:53] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 07:47:53] [INFO ] Invariant cache hit.
[2026-05-23 07:47:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:47:53] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2026-05-23 07:47:53] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2026-05-23 07:47:53] [INFO ] Invariant cache hit.
[2026-05-23 07:47:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 75 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3069 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 101/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 176 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4001 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7078ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 7079ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/265 places, 111/321 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7220 ms. Remains : 71/265 places, 111/321 transitions.
[2026-05-23 07:48:00] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:48:00] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:48:00] [INFO ] Input system was already deterministic with 111 transitions.
[2026-05-23 07:48:00] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:48:00] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:48:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5973690909145775887.gal : 1 ms
[2026-05-23 07:48:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7970925752524085745.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5973690909145775887.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7970925752524085745.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7970925752524085745.prop.
RANDOM walk for 40000 steps (5501 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 15
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :15 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 33
Reachability property CO4-PT-10-CTLCardinality-2024-06 is true.
FORMULA CO4-PT-10-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,60,0.015174,4692,2,188,10,1184,6,0,388,477,0
Total reachable state count : 60

Verifying 1 reachability properties.
Reachability property CO4-PT-10-CTLCardinality-2024-06 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CO4-PT-10-CTLCardinality-2024-06,1,0.015712,4836,2,72,10,1184,7,0,391,477,0
BEST_FIRST walk for 40004 steps (1015 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2561 steps, run visited all 1 properties in 14 ms. (steps per millisecond=182 )
Probabilistic random walk after 2561 steps, saw 799 distinct states, run finished after 17 ms. (steps per millisecond=150 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 321/321 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 264 transition count 320
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 30 place count 236 transition count 292
Iterating global reduction 1 with 28 rules applied. Total rules applied 58 place count 236 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 236 transition count 291
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 77 place count 218 transition count 273
Iterating global reduction 2 with 18 rules applied. Total rules applied 95 place count 218 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 218 transition count 271
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 106 place count 209 transition count 262
Iterating global reduction 3 with 9 rules applied. Total rules applied 115 place count 209 transition count 262
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 120 place count 204 transition count 257
Iterating global reduction 3 with 5 rules applied. Total rules applied 125 place count 204 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 204 transition count 256
Applied a total of 126 rules in 11 ms. Remains 204 /265 variables (removed 61) and now considering 256/321 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18097073272364522303.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15932612756632453202.kers'
[2026-05-23 07:48:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18097073272364522303.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15932612756632453202.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 256 rows 204 cols 574 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-05-23 07:48:00] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15932612756632453202.kers
Total runtime 1 ms.
[2026-05-23 07:48:00] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-23 07:48:00] [INFO ] Invariant cache hit.
[2026-05-23 07:48:00] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-23 07:48:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (OVERLAPS) 256/460 variables, 204/207 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 0/460 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 209 constraints, problems are : Problem set: 0 solved, 255 unsolved in 15457 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 256/460 variables, 204/209 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 255/464 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 465 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45491ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 45491ms
Starting structural reductions in LTL mode, iteration 1 : 204/265 places, 256/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45658 ms. Remains : 204/265 places, 256/321 transitions.
[2026-05-23 07:48:46] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:48:46] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:48:46] [INFO ] Input system was already deterministic with 256 transitions.
[2026-05-23 07:48:46] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:48:46] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:48:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality17452798358981154057.gal : 2 ms
[2026-05-23 07:48:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality11944147917143281524.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/CTLCardinality17452798358981154057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11944147917143281524.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,377704,0.094394,7820,2,1304,5,13498,6,0,1070,14450,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.1046,7820,1,0,6,13498,7,1,1261,14450,1
FORMULA CO4-PT-10-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 321/321 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 264 transition count 320
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 240 transition count 296
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 240 transition count 296
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 240 transition count 295
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 66 place count 225 transition count 280
Iterating global reduction 2 with 15 rules applied. Total rules applied 81 place count 225 transition count 280
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 225 transition count 278
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 89 place count 219 transition count 272
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 219 transition count 272
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 216 transition count 269
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 216 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 216 transition count 268
Applied a total of 102 rules in 19 ms. Remains 216 /265 variables (removed 49) and now considering 268/321 (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-317656448952816019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12732382332913079633.kers'
[2026-05-23 07:48:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-317656448952816019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12732382332913079633.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 216 cols 598 entries
Finished phase 1 with 213 SingleSign rule and 0 generalized
[2026-05-23 07:48:46] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12732382332913079633.kers
Total runtime 3 ms.
[2026-05-23 07:48:46] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 07:48:46] [INFO ] Invariant cache hit.
[2026-05-23 07:48:46] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2026-05-23 07:48:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (OVERLAPS) 268/484 variables, 216/219 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (OVERLAPS) 0/484 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 267 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 221 constraints, problems are : Problem set: 0 solved, 267 unsolved in 16752 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/484 variables, 216/221 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 267/488 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/484 variables, and 489 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46780ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 46780ms
Starting structural reductions in LTL mode, iteration 1 : 216/265 places, 268/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46976 ms. Remains : 216/265 places, 268/321 transitions.
[2026-05-23 07:49:33] [INFO ] Flatten gal took : 16 ms
[2026-05-23 07:49:33] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:49:33] [INFO ] Input system was already deterministic with 268 transitions.
[2026-05-23 07:49:33] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:49:33] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:49:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality8317005458930862815.gal : 1 ms
[2026-05-23 07:49:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality14030921757427149405.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/CTLCardinality8317005458930862815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14030921757427149405.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,406576,0.108197,8528,2,1374,5,15048,6,0,1130,18223,0


Converting to forward existential form...Done !
original formula: E(A(EX(EG((p118==0))) U EG(EX(((p157==0)||(p154==1))))) U EG(!((EG(EX((p204==1))) * (p122!=1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,!((E(!(EG(EX(((p157==0)||(p154==1))))) U (!(EX(EG((p118==0)))) * !(EG(EX(((p157==0)||(p154==1)))...248
Reverse transition relation is NOT exact ! Due to transitions t13, t14, t15, t16, t17, t18, t24, t32, t41, t43, t44, t45, t46, t47, t49, t52, t96, t151, t1...295
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,17.9111,574592,1,0,1709,2.61625e+06,581,1074,6305,4.30401e+06,2026
FORMULA CO4-PT-10-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 321/321 transitions.
Graph (trivial) has 273 edges and 265 vertex of which 3 / 265 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 394 edges and 263 vertex of which 256 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 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 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 126 rules applied. Total rules applied 128 place count 255 transition count 185
Reduce places removed 125 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 1 with 127 rules applied. Total rules applied 255 place count 130 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 129 transition count 183
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 256 place count 129 transition count 170
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 282 place count 116 transition count 170
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 290 place count 108 transition count 162
Iterating global reduction 3 with 8 rules applied. Total rules applied 298 place count 108 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 299 place count 108 transition count 161
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 299 place count 108 transition count 157
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 307 place count 104 transition count 157
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 310 place count 101 transition count 154
Iterating global reduction 4 with 3 rules applied. Total rules applied 313 place count 101 transition count 154
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 349 place count 83 transition count 135
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 4 with 3 rules applied. Total rules applied 352 place count 83 transition count 132
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 354 place count 82 transition count 131
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 357 place count 79 transition count 128
Iterating global reduction 6 with 3 rules applied. Total rules applied 360 place count 79 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 369 place count 79 transition count 119
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 4 rules applied. Total rules applied 373 place count 79 transition count 115
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 377 place count 75 transition count 115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 377 place count 75 transition count 114
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 379 place count 74 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 381 place count 73 transition count 113
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 382 place count 73 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 384 place count 71 transition count 111
Applied a total of 384 rules in 37 ms. Remains 71 /265 variables (removed 194) and now considering 111/321 (removed 210) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14006246549397689383.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14812068867720038017.kers'
[2026-05-23 07:49:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14006246549397689383.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14812068867720038017.kers]
Normalized transition count is 110 out of 111 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 71 cols 266 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-23 07:49:51] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14812068867720038017.kers
Total runtime 1 ms.
[2026-05-23 07:49:51] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-23 07:49:51] [INFO ] Invariant cache hit.
[2026-05-23 07:49:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:49:51] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2026-05-23 07:49:51] [INFO ] Redundant transitions in 2 ms returned []
Running 101 sub problems to find dead transitions.
[2026-05-23 07:49:51] [INFO ] Invariant cache hit.
[2026-05-23 07:49:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 75 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2992 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (OVERLAPS) 110/181 variables, 71/74 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 101/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 176 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3984 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6984ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 6984ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/265 places, 111/321 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7147 ms. Remains : 71/265 places, 111/321 transitions.
[2026-05-23 07:49:58] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:49:58] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:49:58] [INFO ] Input system was already deterministic with 111 transitions.
[2026-05-23 07:49:58] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:49:58] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:49:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality2293040739388827101.gal : 1 ms
[2026-05-23 07:49:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality15186789968926717612.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/CTLCardinality2293040739388827101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15186789968926717612.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,8911,0.01808,4552,2,202,5,1868,6,0,387,1670,0


Converting to forward existential form...Done !
original formula: EF(EG((p189==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p189==0))] != FALSE
Hit Full ! (commute/partial/dont) 109/0/2
(forward)formula 0,1,0.047576,5848,1,0,8,9092,19,3,1862,4729,8
FORMULA CO4-PT-10-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 07:49:58] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:49:58] [INFO ] Flatten gal took : 5 ms
Total runtime 341551 ms.

BK_STOP 1779522598575

--------------------
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-10"
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-10, 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-177946967700353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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