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.r082-smll-177946993600145.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 DBSingleClientW-PT-d1m05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600145
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 6.4K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 432K 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 DBSingleClientW-PT-d1m05-CTLCardinality-2024-00
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-01
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-02
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-03
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-04
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-05
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-06
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-07
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-08
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-09
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-10
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-11
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-12
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-13
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-14
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779565274115

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 19:41: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 19:41:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 19:41:17] [INFO ] Load time of PNML (sax parser for PT used): 337 ms
[2026-05-23 19:41:17] [INFO ] Transformed 1440 places.
[2026-05-23 19:41:17] [INFO ] Transformed 672 transitions.
[2026-05-23 19:41:17] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 574 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 30 ms.
Deduced a syphon composed of 1093 places in 13 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 190 place count 237 transition count 349
Iterating global reduction 1 with 89 rules applied. Total rules applied 279 place count 237 transition count 349
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 287 place count 237 transition count 341
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 353 place count 171 transition count 275
Iterating global reduction 2 with 66 rules applied. Total rules applied 419 place count 171 transition count 275
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 422 place count 171 transition count 272
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 456 place count 137 transition count 227
Iterating global reduction 3 with 34 rules applied. Total rules applied 490 place count 137 transition count 227
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 510 place count 137 transition count 207
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 517 place count 130 transition count 192
Iterating global reduction 4 with 7 rules applied. Total rules applied 524 place count 130 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 526 place count 130 transition count 190
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 528 place count 128 transition count 188
Iterating global reduction 5 with 2 rules applied. Total rules applied 530 place count 128 transition count 188
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 532 place count 126 transition count 186
Iterating global reduction 5 with 2 rules applied. Total rules applied 534 place count 126 transition count 186
Applied a total of 534 rules in 191 ms. Remains 126 /347 variables (removed 221) and now considering 186/672 (removed 486) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7128999794801145729.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11862872707526426573.kers'
[2026-05-23 19:41:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7128999794801145729.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11862872707526426573.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 126 cols 605 entries
Finished phase 1 with 121 SingleSign rule and 3 generalized
[2026-05-23 19:41:17] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11862872707526426573.kers
Total runtime 3 ms.
[2026-05-23 19:41:18] [INFO ] Implicit Places using invariants in 672 ms returned []
[2026-05-23 19:41:18] [INFO ] Invariant cache hit.
[2026-05-23 19:41:18] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-23 19:41:19] [INFO ] Implicit Places using invariants and state equation in 1295 ms returned []
Implicit Place search using SMT with State Equation took 2041 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-23 19:41:19] [INFO ] Invariant cache hit.
[2026-05-23 19:41:19] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/312 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 63/191 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 12/203 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/312 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 312/312 variables, and 207 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 186/312 variables, 126/144 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 63/207 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 185/392 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 392 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60784ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 60811ms
Starting structural reductions in LTL mode, iteration 1 : 126/347 places, 186/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63112 ms. Remains : 126/347 places, 186/672 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 186/186 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-05-23 19:42:20] [INFO ] Invariant cache hit.
[2026-05-23 19:42:20] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-23 19:42:20] [INFO ] Invariant cache hit.
[2026-05-23 19:42:20] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-23 19:42:21] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1096 ms. Remains : 126/126 places, 186/186 transitions.
Support contains 15 out of 126 places after structural reductions.
[2026-05-23 19:42:22] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2026-05-23 19:42:22] [INFO ] Flatten gal took : 89 ms
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 19:42:22] [INFO ] Flatten gal took : 43 ms
[2026-05-23 19:42:22] [INFO ] Input system was already deterministic with 186 transitions.
Support contains 7 out of 126 places (down from 15) after GAL structural reductions.
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (9195 resets) in 2541 ms. (15 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3859 resets) in 499 ms. (80 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3864 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3942 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (3896 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3903 resets) in 185 ms. (215 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3919 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 697831 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :3 out of 6
Probabilistic random walk after 697831 steps, saw 258609 distinct states, run finished after 3007 ms. (steps per millisecond=232 ) properties seen :3
[2026-05-23 19:42:26] [INFO ] Invariant cache hit.
[2026-05-23 19:42:26] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 48/51 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/90 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 143/233 variables, 90/92 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 20/112 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/112 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 312/312 variables, and 148 constraints, problems are : Problem set: 3 solved, 0 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 5 simplifications.
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 19:42:26] [INFO ] Flatten gal took : 14 ms
[2026-05-23 19:42:26] [INFO ] Flatten gal took : 15 ms
[2026-05-23 19:42:26] [INFO ] Input system was already deterministic with 186 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 444 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 113 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 113 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 113 transition count 161
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 104 transition count 146
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 104 transition count 146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 104 transition count 143
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 56 place count 97 transition count 132
Iterating global reduction 2 with 7 rules applied. Total rules applied 63 place count 97 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 97 transition count 129
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 71 place count 92 transition count 123
Iterating global reduction 3 with 5 rules applied. Total rules applied 76 place count 92 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 79 place count 92 transition count 120
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 82 place count 89 transition count 117
Iterating global reduction 4 with 3 rules applied. Total rules applied 85 place count 89 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 87 place count 89 transition count 115
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 89 place count 87 transition count 112
Iterating global reduction 5 with 2 rules applied. Total rules applied 91 place count 87 transition count 112
Applied a total of 91 rules in 18 ms. Remains 87 /126 variables (removed 39) and now considering 112/186 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8626086675999046926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1353335869367232261.kers'
[2026-05-23 19:42:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8626086675999046926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1353335869367232261.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 87 cols 360 entries
Finished phase 1 with 83 SingleSign rule and 2 generalized
[2026-05-23 19:42:26] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1353335869367232261.kers
Total runtime 2 ms.
[2026-05-23 19:42:26] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-23 19:42:26] [INFO ] Invariant cache hit.
[2026-05-23 19:42:26] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-23 19:42:27] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2026-05-23 19:42:27] [INFO ] Invariant cache hit.
[2026-05-23 19:42:27] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 128 constraints, problems are : Problem set: 0 solved, 111 unsolved in 5736 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 111/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 239 constraints, problems are : Problem set: 0 solved, 111 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35851ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 35854ms
Starting structural reductions in LTL mode, iteration 1 : 87/126 places, 112/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36280 ms. Remains : 87/126 places, 112/186 transitions.
[2026-05-23 19:43:03] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:43:03] [INFO ] Flatten gal took : 9 ms
[2026-05-23 19:43:03] [INFO ] Input system was already deterministic with 112 transitions.
[2026-05-23 19:43:03] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:43:03] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:43:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality9944686845848836873.gal : 5 ms
[2026-05-23 19:43:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality11299402694043127415.ctl : 4 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/CTLCardinality9944686845848836873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11299402694043127415.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,68042,0.922672,27572,2,6369,5,80857,6,0,460,72416,0


Converting to forward existential form...Done !
original formula: EX(AX((l533<=0)))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!((l533<=0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t40, t42, t49, t55, t56, t57, t73, t80, t81, t82, t83, t84, t85, t86, t...390
(forward)formula 0,1,2.56389,64564,1,0,207,231559,241,83,3169,108283,232
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 112 transition count 162
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 112 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 112 transition count 160
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 102 transition count 144
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 102 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 102 transition count 141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 61 place count 94 transition count 128
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 94 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 73 place count 94 transition count 124
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 78 place count 89 transition count 118
Iterating global reduction 3 with 5 rules applied. Total rules applied 83 place count 89 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 86 place count 89 transition count 115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 89 place count 86 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 92 place count 86 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 94 place count 86 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 96 place count 84 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 98 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 99 place count 83 transition count 101
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 83 transition count 101
Applied a total of 100 rules in 24 ms. Remains 83 /126 variables (removed 43) and now considering 101/186 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9726178248270594392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3099857855326511010.kers'
[2026-05-23 19:43:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9726178248270594392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3099857855326511010.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 101 rows 83 cols 333 entries
Finished phase 1 with 79 SingleSign rule and 2 generalized
[2026-05-23 19:43:05] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3099857855326511010.kers
Total runtime 1 ms.
[2026-05-23 19:43:05] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-23 19:43:05] [INFO ] Invariant cache hit.
[2026-05-23 19:43:05] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-23 19:43:06] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2026-05-23 19:43:06] [INFO ] Invariant cache hit.
[2026-05-23 19:43:06] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 116 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4518 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 100/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 216 constraints, problems are : Problem set: 0 solved, 100 unsolved in 20628 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25202ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 25204ms
Starting structural reductions in LTL mode, iteration 1 : 83/126 places, 101/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25668 ms. Remains : 83/126 places, 101/186 transitions.
[2026-05-23 19:43:31] [INFO ] Flatten gal took : 12 ms
[2026-05-23 19:43:31] [INFO ] Flatten gal took : 12 ms
[2026-05-23 19:43:31] [INFO ] Input system was already deterministic with 101 transitions.
[2026-05-23 19:43:31] [INFO ] Flatten gal took : 12 ms
[2026-05-23 19:43:31] [INFO ] Flatten gal took : 12 ms
[2026-05-23 19:43:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality4893029002841071979.gal : 5 ms
[2026-05-23 19:43:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality8418425864393966396.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/CTLCardinality4893029002841071979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8418425864393966396.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,59273,0.766261,21792,2,5340,5,61757,6,0,433,58395,0


Converting to forward existential form...Done !
original formula: AF(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,!(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t63, t70, t71, t72, t73, t74, t75, t76, t77, t78, t...364
(forward)formula 0,1,2.07806,48044,1,0,199,184461,223,79,2971,119525,218
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 112 transition count 162
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 112 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 112 transition count 160
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 102 transition count 144
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 102 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 102 transition count 141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 61 place count 94 transition count 128
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 94 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 73 place count 94 transition count 124
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 78 place count 89 transition count 118
Iterating global reduction 3 with 5 rules applied. Total rules applied 83 place count 89 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 86 place count 89 transition count 115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 89 place count 86 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 92 place count 86 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 94 place count 86 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 96 place count 84 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 98 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 99 place count 83 transition count 101
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 83 transition count 101
Applied a total of 100 rules in 20 ms. Remains 83 /126 variables (removed 43) and now considering 101/186 (removed 85) transitions.
[2026-05-23 19:43:33] [INFO ] Invariant cache hit.
[2026-05-23 19:43:33] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-23 19:43:33] [INFO ] Invariant cache hit.
[2026-05-23 19:43:33] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-23 19:43:33] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 83/126 places, 101/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 348 ms. Remains : 83/126 places, 101/186 transitions.
[2026-05-23 19:43:33] [INFO ] Flatten gal took : 14 ms
[2026-05-23 19:43:33] [INFO ] Flatten gal took : 8 ms
[2026-05-23 19:43:33] [INFO ] Input system was already deterministic with 101 transitions.
[2026-05-23 19:43:33] [INFO ] Flatten gal took : 12 ms
[2026-05-23 19:43:33] [INFO ] Flatten gal took : 10 ms
[2026-05-23 19:43:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality7332536890422346067.gal : 7 ms
[2026-05-23 19:43:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality4198927658960355507.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/CTLCardinality7332536890422346067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4198927658960355507.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,59273,0.698673,21908,2,5340,5,61757,6,0,433,58395,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.702008,21908,1,0,6,61757,7,1,580,58395,1
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 186/186 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 114 transition count 167
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 114 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 114 transition count 165
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 34 place count 106 transition count 153
Iterating global reduction 1 with 8 rules applied. Total rules applied 42 place count 106 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 45 place count 106 transition count 150
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 51 place count 100 transition count 139
Iterating global reduction 2 with 6 rules applied. Total rules applied 57 place count 100 transition count 139
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 100 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 64 place count 96 transition count 131
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 96 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 96 transition count 128
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 73 place count 94 transition count 126
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 94 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 77 place count 94 transition count 124
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 78 place count 93 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 79 place count 93 transition count 123
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 80 place count 92 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 81 place count 92 transition count 117
Applied a total of 81 rules in 48 ms. Remains 92 /126 variables (removed 34) and now considering 117/186 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2136501099926973627.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13088992305016499766.kers'
[2026-05-23 19:43:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2136501099926973627.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13088992305016499766.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 117 rows 92 cols 388 entries
Finished phase 1 with 88 SingleSign rule and 2 generalized
[2026-05-23 19:43:34] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13088992305016499766.kers
Total runtime 1 ms.
[2026-05-23 19:43:34] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-23 19:43:34] [INFO ] Invariant cache hit.
[2026-05-23 19:43:34] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-23 19:43:35] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2026-05-23 19:43:35] [INFO ] Redundant transitions in 3 ms returned []
Running 116 sub problems to find dead transitions.
[2026-05-23 19:43:35] [INFO ] Invariant cache hit.
[2026-05-23 19:43:35] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/209 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 35/129 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 132 constraints, problems are : Problem set: 0 solved, 116 unsolved in 14249 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/209 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 35/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 116/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 248 constraints, problems are : Problem set: 0 solved, 116 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44312ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 44313ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/126 places, 117/186 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44782 ms. Remains : 92/126 places, 117/186 transitions.
[2026-05-23 19:44:19] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:44:19] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:44:19] [INFO ] Input system was already deterministic with 117 transitions.
[2026-05-23 19:44:19] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:44:19] [INFO ] Flatten gal took : 7 ms
[2026-05-23 19:44:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality5954951588397316326.gal : 2 ms
[2026-05-23 19:44:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality12189968660978724384.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/CTLCardinality5954951588397316326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12189968660978724384.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,88219,1.02757,33124,2,7992,5,100565,6,0,485,99852,0


Converting to forward existential form...Done !
original formula: AF(EG(((p57>0)&&(l1306<4))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((p57>0)&&(l1306<4)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t33, t34, t44, t50, t51, t52, t54, t63, t72, t79, t80, t81, t82, t83, t...435
(forward)formula 0,0,5.40586,132244,1,0,395,500762,260,213,3409,547880,385
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 112 transition count 162
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 112 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 112 transition count 160
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 40 place count 102 transition count 144
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 102 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 102 transition count 141
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 61 place count 94 transition count 128
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 94 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 73 place count 94 transition count 124
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 78 place count 89 transition count 118
Iterating global reduction 3 with 5 rules applied. Total rules applied 83 place count 89 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 86 place count 89 transition count 115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 89 place count 86 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 92 place count 86 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 94 place count 86 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 96 place count 84 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 98 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 99 place count 83 transition count 101
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 83 transition count 101
Applied a total of 100 rules in 9 ms. Remains 83 /126 variables (removed 43) and now considering 101/186 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5107068153746599577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7731098508467020326.kers'
[2026-05-23 19:44:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5107068153746599577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7731098508467020326.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 101 rows 83 cols 333 entries
Finished phase 1 with 79 SingleSign rule and 2 generalized
[2026-05-23 19:44:25] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7731098508467020326.kers
Total runtime 1 ms.
[2026-05-23 19:44:25] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-23 19:44:25] [INFO ] Invariant cache hit.
[2026-05-23 19:44:25] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-23 19:44:25] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2026-05-23 19:44:25] [INFO ] Invariant cache hit.
[2026-05-23 19:44:25] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 116 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5352 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 100/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 216 constraints, problems are : Problem set: 0 solved, 100 unsolved in 22226 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27625ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 27626ms
Starting structural reductions in LTL mode, iteration 1 : 83/126 places, 101/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27969 ms. Remains : 83/126 places, 101/186 transitions.
[2026-05-23 19:44:52] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:44:52] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:44:52] [INFO ] Input system was already deterministic with 101 transitions.
[2026-05-23 19:44:52] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:44:53] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:44:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality7811434251989834205.gal : 2 ms
[2026-05-23 19:44:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality13427298287425674370.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/CTLCardinality7811434251989834205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13427298287425674370.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,59273,0.719732,21980,2,5340,5,61757,6,0,433,58395,0


Converting to forward existential form...Done !
original formula: (EX(TRUE) * AX(AX(FALSE)))
=> equivalent forward existential formula: ([(Init * !(EX(TRUE)))] = FALSE * [(EY(EY(Init)) * !(FALSE))] = FALSE)
(forward)formula 0,0,0.725318,21980,1,0,7,61757,7,1,589,58395,2
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-11 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 : 126/126 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 113 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 113 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 113 transition count 162
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 37 place count 103 transition count 146
Iterating global reduction 1 with 10 rules applied. Total rules applied 47 place count 103 transition count 146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 103 transition count 143
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 57 place count 96 transition count 132
Iterating global reduction 2 with 7 rules applied. Total rules applied 64 place count 96 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 68 place count 96 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 92 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 92 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 92 transition count 122
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 81 place count 89 transition count 119
Iterating global reduction 4 with 3 rules applied. Total rules applied 84 place count 89 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 86 place count 89 transition count 117
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 88 place count 87 transition count 114
Iterating global reduction 5 with 2 rules applied. Total rules applied 90 place count 87 transition count 114
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 91 place count 86 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 86 transition count 108
Applied a total of 92 rules in 13 ms. Remains 86 /126 variables (removed 40) and now considering 108/186 (removed 78) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-289342975068623451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13464806003092170637.kers'
[2026-05-23 19:44:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-289342975068623451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13464806003092170637.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 108 rows 86 cols 354 entries
Finished phase 1 with 82 SingleSign rule and 2 generalized
[2026-05-23 19:44:53] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13464806003092170637.kers
Total runtime 2 ms.
[2026-05-23 19:44:53] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-23 19:44:53] [INFO ] Invariant cache hit.
[2026-05-23 19:44:54] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-23 19:44:54] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2026-05-23 19:44:54] [INFO ] Invariant cache hit.
[2026-05-23 19:44:54] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/194 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 129 constraints, problems are : Problem set: 0 solved, 107 unsolved in 13387 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/194 variables, 86/95 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 34/129 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 107/236 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 236 constraints, problems are : Problem set: 0 solved, 107 unsolved in 20321 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33751ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 33752ms
Starting structural reductions in LTL mode, iteration 1 : 86/126 places, 108/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34342 ms. Remains : 86/126 places, 108/186 transitions.
[2026-05-23 19:45:28] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:45:28] [INFO ] Flatten gal took : 5 ms
[2026-05-23 19:45:28] [INFO ] Input system was already deterministic with 108 transitions.
[2026-05-23 19:45:28] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:45:28] [INFO ] Flatten gal took : 6 ms
[2026-05-23 19:45:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality10954241671015201090.gal : 1 ms
[2026-05-23 19:45:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality8238739559848333348.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/CTLCardinality10954241671015201090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8238739559848333348.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,62041,0.776996,21544,2,4828,5,61046,6,0,452,47871,0


Converting to forward existential form...Done !
original formula: AX((p105<=0))
=> equivalent forward existential formula: [(EY(Init) * !((p105<=0)))] = FALSE
(forward)formula 0,1,0.780818,21544,1,0,9,61046,9,2,608,47871,2
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-23 19:45:28] [INFO ] Flatten gal took : 9 ms
[2026-05-23 19:45:28] [INFO ] Flatten gal took : 8 ms
Total runtime 252316 ms.

BK_STOP 1779565529013

--------------------
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="DBSingleClientW-PT-d1m05"
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 DBSingleClientW-PT-d1m05, 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 r082-smll-177946993600145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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