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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 4.9K Mar 6 13:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 6 13:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 6 13:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Mar 6 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 6 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 6 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 152K 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-09-CTLCardinality-2024-00
FORMULA_NAME CO4-PT-09-CTLCardinality-2024-01
FORMULA_NAME CO4-PT-09-CTLCardinality-2024-02
FORMULA_NAME CO4-PT-09-CTLCardinality-2024-03
FORMULA_NAME CO4-PT-09-CTLCardinality-2024-04
FORMULA_NAME CO4-PT-09-CTLCardinality-2024-05
FORMULA_NAME CO4-PT-09-CTLCardinality-2024-06
FORMULA_NAME CO4-PT-09-CTLCardinality-2024-07
FORMULA_NAME CO4-PT-09-CTLCardinality-2024-08
FORMULA_NAME CO4-PT-09-CTLCardinality-2024-09
FORMULA_NAME CO4-PT-09-CTLCardinality-2024-10
FORMULA_NAME CO4-PT-09-CTLCardinality-2024-11
FORMULA_NAME CO4-PT-09-CTLCardinality-2024-12
FORMULA_NAME CO4-PT-09-CTLCardinality-2024-13
FORMULA_NAME CO4-PT-09-CTLCardinality-2024-14
FORMULA_NAME CO4-PT-09-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779521988146

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 07:39:49] [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:39:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 07:39:49] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2026-05-23 07:39:49] [INFO ] Transformed 467 places.
[2026-05-23 07:39:49] [INFO ] Transformed 634 transitions.
[2026-05-23 07:39:49] [INFO ] Found NUPN structural information;
[2026-05-23 07:39:49] [INFO ] Parsed PT model containing 467 places and 634 transitions and 1868 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Deduced a syphon composed of 108 places in 6 ms
Reduce places removed 108 places and 163 transitions.
FORMULA CO4-PT-09-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 471/471 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 350 transition count 470
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 77 place count 283 transition count 402
Iterating global reduction 1 with 67 rules applied. Total rules applied 144 place count 283 transition count 402
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 147 place count 283 transition count 399
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 178 place count 252 transition count 347
Iterating global reduction 2 with 31 rules applied. Total rules applied 209 place count 252 transition count 347
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 212 place count 249 transition count 343
Iterating global reduction 2 with 3 rules applied. Total rules applied 215 place count 249 transition count 343
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 216 place count 248 transition count 342
Iterating global reduction 2 with 1 rules applied. Total rules applied 217 place count 248 transition count 342
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 218 place count 247 transition count 341
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 place count 247 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 220 place count 247 transition count 340
Applied a total of 220 rules in 83 ms. Remains 247 /359 variables (removed 112) and now considering 340/471 (removed 131) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4559065926750396266.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16100003393454508513.kers'
[2026-05-23 07:39:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4559065926750396266.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16100003393454508513.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 340 rows 247 cols 947 entries
Finished phase 1 with 241 SingleSign rule and 0 generalized
[2026-05-23 07:39:49] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16100003393454508513.kers
Total runtime 2 ms.
[2026-05-23 07:39:49] [INFO ] Implicit Places using invariants in 256 ms returned [5, 152]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 299 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/359 places, 340/471 transitions.
Applied a total of 0 rules in 4 ms. Remains 245 /245 variables (removed 0) and now considering 340/340 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 398 ms. Remains : 245/359 places, 340/471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 340/340 transitions.
Applied a total of 0 rules in 4 ms. Remains 245 /245 variables (removed 0) and now considering 340/340 (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-8448604720246895023.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17330924013048490058.kers'
[2026-05-23 07:39:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8448604720246895023.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17330924013048490058.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 340 rows 245 cols 929 entries
Finished phase 1 with 241 SingleSign rule and 0 generalized
[2026-05-23 07:39:49] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17330924013048490058.kers
Total runtime 2 ms.
[2026-05-23 07:39:50] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-23 07:39:50] [INFO ] Invariant cache hit.
[2026-05-23 07:39:50] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-05-23 07:39:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (OVERLAPS) 340/581 variables, 241/251 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (OVERLAPS) 4/585 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/585 variables, and 256 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (OVERLAPS) 340/581 variables, 241/252 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 306/558 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (OVERLAPS) 4/585 variables, 4/562 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/585 variables, and 595 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60222ms
Finished structural reductions in LTL mode , in 1 iterations and 60522 ms. Remains : 245/245 places, 340/340 transitions.
Support contains 49 out of 245 places after structural reductions.
[2026-05-23 07:40:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-23 07:40:50] [INFO ] Flatten gal took : 49 ms
[2026-05-23 07:40:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA CO4-PT-09-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-09-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 07:40:50] [INFO ] Flatten gal took : 19 ms
[2026-05-23 07:40:50] [INFO ] Input system was already deterministic with 340 transitions.
Support contains 28 out of 245 places (down from 49) after GAL structural reductions.
RANDOM walk for 40000 steps (397 resets) in 1355 ms. (29 steps per ms) remains 12/18 properties
BEST_FIRST walk for 40002 steps (215 resets) in 375 ms. (106 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40000 steps (185 resets) in 385 ms. (103 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (210 resets) in 303 ms. (131 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40000 steps (210 resets) in 310 ms. (128 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (241 resets) in 126 ms. (314 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (294 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (271 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (160 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (107 resets) in 174 ms. (228 steps per ms) remains 8/8 properties
[2026-05-23 07:40:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 18/42 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 112/154 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 218/372 variables, 78/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 160/532 variables, 90/214 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 40/572 variables, 27/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 9/581 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/581 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 3/584 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/584 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 1/585 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/585 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/585 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 585/585 variables, and 249 constraints, problems are : Problem set: 0 solved, 8 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 18/42 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 112/154 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 218/372 variables, 78/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 160/532 variables, 90/222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 40/572 variables, 27/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/572 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 14 (OVERLAPS) 9/581 variables, 5/254 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/581 variables, 1/255 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 3/584 variables, 2/257 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/584 variables, 0/257 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 1/585 variables, 1/258 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/585 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/585 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 585/585 variables, and 258 constraints, problems are : Problem set: 1 solved, 7 unsolved in 2188 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2876ms problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 4216 steps, including 98 resets, run visited all 1 properties in 8 ms. (steps per millisecond=527 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 157 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2026-05-23 07:40:55] [INFO ] Flatten gal took : 14 ms
[2026-05-23 07:40:55] [INFO ] Flatten gal took : 14 ms
[2026-05-23 07:40:55] [INFO ] Input system was already deterministic with 340 transitions.
Computed a total of 18 stabilizing places and 24 stable transitions
Graph (complete) has 521 edges and 245 vertex of which 236 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 340/340 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 241 transition count 339
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 25 place count 221 transition count 317
Iterating global reduction 1 with 20 rules applied. Total rules applied 45 place count 221 transition count 317
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 221 transition count 313
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 59 place count 211 transition count 301
Iterating global reduction 2 with 10 rules applied. Total rules applied 69 place count 211 transition count 301
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 74 place count 206 transition count 293
Iterating global reduction 2 with 5 rules applied. Total rules applied 79 place count 206 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 206 transition count 292
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 83 place count 203 transition count 289
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 203 transition count 289
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 201 transition count 287
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 201 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 92 place count 201 transition count 285
Applied a total of 92 rules in 21 ms. Remains 201 /245 variables (removed 44) and now considering 285/340 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10580861246760763106.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5972314607998612794.kers'
[2026-05-23 07:40:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10580861246760763106.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5972314607998612794.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 285 rows 201 cols 798 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-23 07:40:55] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5972314607998612794.kers
Total runtime 1 ms.
[2026-05-23 07:40:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-23 07:40:55] [INFO ] Invariant cache hit.
[2026-05-23 07:40:55] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2026-05-23 07:40:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/486 variables, 201/208 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (OVERLAPS) 0/486 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 208 constraints, problems are : Problem set: 0 solved, 284 unsolved in 19405 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/486 variables, 201/208 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 284/492 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 284 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 493 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 49476ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 49477ms
Starting structural reductions in LTL mode, iteration 1 : 201/245 places, 285/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49678 ms. Remains : 201/245 places, 285/340 transitions.
[2026-05-23 07:41:44] [INFO ] Flatten gal took : 13 ms
[2026-05-23 07:41:44] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:41:44] [INFO ] Input system was already deterministic with 285 transitions.
[2026-05-23 07:41:44] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:41:44] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:41:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality1926428429805833252.gal : 4 ms
[2026-05-23 07:41:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality9875320181527721653.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1926428429805833252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9875320181527721653.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12983e+07,0.242801,13884,2,2571,5,31652,6,0,1085,37816,0


Converting to forward existential form...Done !
original formula: EX(AX(EG(!(A(((p105==0)||(p336==1)) U (p95==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EG(!(!((E(!((p95==1)) U (!(((p105==0)||(p336==1))) * !((p95==1)))) + EG(!((p95==1)))))))))))...165
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, t67,...335
Detected timeout of ITS tools.
[2026-05-23 07:42:14] [INFO ] Flatten gal took : 10 ms
[2026-05-23 07:42:14] [INFO ] Applying decomposition
[2026-05-23 07:42:14] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18416285057090489702.txt' '-o' '/tmp/graph18416285057090489702.bin' '-w' '/tmp/graph18416285057090489702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18416285057090489702.bin' '-l' '-1' '-v' '-w' '/tmp/graph18416285057090489702.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:42:15] [INFO ] Decomposing Gal with order
[2026-05-23 07:42:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:42:15] [INFO ] Removed a total of 184 redundant transitions.
[2026-05-23 07:42:15] [INFO ] Flatten gal took : 61 ms
[2026-05-23 07:42:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 8 ms.
[2026-05-23 07:42:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality8612034974748028147.gal : 6 ms
[2026-05-23 07:42:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality6335191041708938868.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/CTLCardinality8612034974748028147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6335191041708938868.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12983e+07,0.097643,7804,474,51,6532,528,612,12137,76,1671,0


Converting to forward existential form...Done !
original formula: EX(AX(EG(!(A(((i11.u9.p105==0)||(i12.i0.u49.p336==1)) U (i1.u4.p95==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EG(!(!((E(!((i1.u4.p95==1)) U (!(((i11.u9.p105==0)||(i12.i0.u49.p336==1))) * !((i1.u4.p95==1...201
Reverse transition relation is NOT exact ! Due to transitions t12, t77, t136, t146, t179, t207, t239, t263, i0.t4, i0.u67.t8, i0.u67.t9, i0.u68.t5, i0.u68....532
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,10.5712,375192,1,0,607825,824,3944,1.68142e+06,411,2639,673707
FORMULA CO4-PT-09-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 245/245 places, 340/340 transitions.
Graph (trivial) has 261 edges and 245 vertex of which 2 / 245 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 520 edges and 244 vertex of which 235 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 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 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 234 transition count 238
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 189 place count 141 transition count 238
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 189 place count 141 transition count 224
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 217 place count 127 transition count 224
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 226 place count 118 transition count 211
Iterating global reduction 2 with 9 rules applied. Total rules applied 235 place count 118 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 238 place count 118 transition count 208
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 238 place count 118 transition count 205
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 244 place count 115 transition count 205
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 248 place count 111 transition count 199
Iterating global reduction 3 with 4 rules applied. Total rules applied 252 place count 111 transition count 199
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 286 place count 94 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 292 place count 94 transition count 174
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 294 place count 92 transition count 170
Iterating global reduction 4 with 2 rules applied. Total rules applied 296 place count 92 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 300 place count 90 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 306 place count 90 transition count 162
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 312 place count 88 transition count 158
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 317 place count 86 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 319 place count 85 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 323 place count 83 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 328 place count 83 transition count 147
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 329 place count 83 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 330 place count 82 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 332 place count 81 transition count 145
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 334 place count 79 transition count 143
Applied a total of 334 rules in 70 ms. Remains 79 /245 variables (removed 166) and now considering 143/340 (removed 197) transitions.
[2026-05-23 07:42:25] [INFO ] Flow matrix only has 123 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-719595003482155041.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11946727276857851288.kers'
[2026-05-23 07:42:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-719595003482155041.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11946727276857851288.kers]
Normalized transition count is 122 out of 123 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 79 cols 270 entries
Finished phase 1 with 75 SingleSign rule and 0 generalized
[2026-05-23 07:42:25] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11946727276857851288.kers
Total runtime 5 ms.
[2026-05-23 07:42:25] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-23 07:42:25] [INFO ] Flow matrix only has 123 transitions (discarded 20 similar events)
[2026-05-23 07:42:25] [INFO ] Invariant cache hit.
[2026-05-23 07:42:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:42:26] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2026-05-23 07:42:26] [INFO ] Redundant transitions in 4 ms returned []
Running 128 sub problems to find dead transitions.
[2026-05-23 07:42:26] [INFO ] Flow matrix only has 123 transitions (discarded 20 similar events)
[2026-05-23 07:42:26] [INFO ] Invariant cache hit.
[2026-05-23 07:42:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 1/202 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/202 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 84 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4328 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 122/201 variables, 79/83 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 128/211 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 1/202 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 212 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5254 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9593ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 9594ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/245 places, 143/340 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9906 ms. Remains : 79/245 places, 143/340 transitions.
[2026-05-23 07:42:35] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:42:35] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:42:35] [INFO ] Input system was already deterministic with 143 transitions.
[2026-05-23 07:42:35] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:42:35] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:42:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality16023884756953699510.gal : 1 ms
[2026-05-23 07:42:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality6048580591939055983.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/CTLCardinality16023884756953699510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6048580591939055983.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,83161,0.028985,5000,2,422,5,3403,6,0,451,2545,0


Converting to forward existential form...Done !
original formula: AF(EG((p251!=0)))
=> equivalent forward existential formula: [FwdG(Init,!(EG((p251!=0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t15, t38, t46, t51, t66, Intersection with reachable at each step enabled. (destroyed/re...190
(forward)formula 0,0,0.351091,19764,1,0,338,70149,311,205,2794,88374,474
FORMULA CO4-PT-09-CTLCardinality-2024-01 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 : 245/245 places, 340/340 transitions.
Graph (trivial) has 254 edges and 245 vertex of which 2 / 245 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 520 edges and 244 vertex of which 235 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 92 rules applied. Total rules applied 94 place count 234 transition count 240
Reduce places removed 91 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 93 rules applied. Total rules applied 187 place count 143 transition count 238
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 189 place count 141 transition count 238
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 189 place count 141 transition count 225
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 215 place count 128 transition count 225
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 223 place count 120 transition count 213
Iterating global reduction 3 with 8 rules applied. Total rules applied 231 place count 120 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 234 place count 120 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 234 place count 120 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 238 place count 118 transition count 208
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 242 place count 114 transition count 202
Iterating global reduction 4 with 4 rules applied. Total rules applied 246 place count 114 transition count 202
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 278 place count 98 transition count 184
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 284 place count 98 transition count 178
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 286 place count 96 transition count 174
Iterating global reduction 5 with 2 rules applied. Total rules applied 288 place count 96 transition count 174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 292 place count 94 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 298 place count 94 transition count 166
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 6 rules applied. Total rules applied 304 place count 92 transition count 162
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 5 rules applied. Total rules applied 309 place count 90 transition count 159
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 311 place count 89 transition count 158
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 315 place count 87 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 320 place count 87 transition count 151
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 321 place count 87 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 322 place count 86 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 324 place count 85 transition count 149
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 326 place count 83 transition count 147
Applied a total of 326 rules in 62 ms. Remains 83 /245 variables (removed 162) and now considering 147/340 (removed 193) transitions.
[2026-05-23 07:42:36] [INFO ] Flow matrix only has 127 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13541150885642962240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6924954831116858780.kers'
[2026-05-23 07:42:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13541150885642962240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6924954831116858780.kers]
Normalized transition count is 126 out of 127 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 126 rows 83 cols 279 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-23 07:42:36] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6924954831116858780.kers
Total runtime 6 ms.
[2026-05-23 07:42:36] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-23 07:42:36] [INFO ] Flow matrix only has 127 transitions (discarded 20 similar events)
[2026-05-23 07:42:36] [INFO ] Invariant cache hit.
[2026-05-23 07:42:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 07:42:36] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2026-05-23 07:42:36] [INFO ] Redundant transitions in 8 ms returned []
Running 134 sub problems to find dead transitions.
[2026-05-23 07:42:36] [INFO ] Flow matrix only has 127 transitions (discarded 20 similar events)
[2026-05-23 07:42:36] [INFO ] Invariant cache hit.
[2026-05-23 07:42:36] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 126/209 variables, 83/87 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 1/210 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 92 constraints, problems are : Problem set: 0 solved, 134 unsolved in 5866 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 126/209 variables, 83/89 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 134/225 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 1/210 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 0/210 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 226 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6305 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 83/83 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12181ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 12183ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/245 places, 147/340 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12387 ms. Remains : 83/245 places, 147/340 transitions.
[2026-05-23 07:42:48] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:42:48] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:42:48] [INFO ] Input system was already deterministic with 147 transitions.
[2026-05-23 07:42:48] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:42:48] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:42:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality1853060399517796669.gal : 1 ms
[2026-05-23 07:42:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality6917963312674291419.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/CTLCardinality1853060399517796669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6917963312674291419.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,115375,0.039755,5560,2,868,5,4715,6,0,470,3926,0


Converting to forward existential form...Done !
original formula: E(!(EG((AF(AG((p295==0))) * !(AF((p466==1)))))) U (p153==1))
=> equivalent forward existential formula: [(FwdU(Init,!(EG((!(EG(!(!(E(TRUE U !((p295==0))))))) * !(!(EG(!((p466==1))))))))) * (p153==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t11, t17, t18, t42, t51, t56, t68, t73, t86, t87, t88, t90, t91, t92, t93, t94, t...315
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.06253,44844,1,0,480,222260,337,257,3173,230751,590
FORMULA CO4-PT-09-CTLCardinality-2024-02 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 : 245/245 places, 340/340 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 241 transition count 339
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 26 place count 220 transition count 316
Iterating global reduction 1 with 21 rules applied. Total rules applied 47 place count 220 transition count 316
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 51 place count 220 transition count 312
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 63 place count 208 transition count 297
Iterating global reduction 2 with 12 rules applied. Total rules applied 75 place count 208 transition count 297
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 81 place count 202 transition count 288
Iterating global reduction 2 with 6 rules applied. Total rules applied 87 place count 202 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 202 transition count 287
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 199 transition count 284
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 199 transition count 284
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 197 transition count 282
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 197 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 197 transition count 280
Applied a total of 100 rules in 20 ms. Remains 197 /245 variables (removed 48) and now considering 280/340 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17587018759970686845.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12574096698675073892.kers'
[2026-05-23 07:42:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17587018759970686845.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12574096698675073892.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 197 cols 780 entries
Finished phase 1 with 193 SingleSign rule and 0 generalized
[2026-05-23 07:42:49] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12574096698675073892.kers
Total runtime 1 ms.
[2026-05-23 07:42:49] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-23 07:42:49] [INFO ] Invariant cache hit.
[2026-05-23 07:42:49] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2026-05-23 07:42:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/477 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 204 constraints, problems are : Problem set: 0 solved, 279 unsolved in 18273 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 280/477 variables, 197/204 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 279/483 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 484 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48324ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 48325ms
Starting structural reductions in LTL mode, iteration 1 : 197/245 places, 280/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48521 ms. Remains : 197/245 places, 280/340 transitions.
[2026-05-23 07:43:38] [INFO ] Flatten gal took : 12 ms
[2026-05-23 07:43:38] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:43:38] [INFO ] Input system was already deterministic with 280 transitions.
[2026-05-23 07:43:38] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:43:38] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:43:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality18165548952380815509.gal : 2 ms
[2026-05-23 07:43:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality6960188228105884238.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/CTLCardinality18165548952380815509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6960188228105884238.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09454e+07,0.237879,14052,2,2706,5,32932,6,0,1064,37155,0


Converting to forward existential form...Done !
original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t64, t65, t67,...341
(forward)formula 0,0,2.56355,88608,1,0,395,330745,575,236,6460,353850,566
FORMULA CO4-PT-09-CTLCardinality-2024-03 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 : 245/245 places, 340/340 transitions.
Graph (trivial) has 260 edges and 245 vertex of which 2 / 245 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 520 edges and 244 vertex of which 235 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 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 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 93 rules applied. Total rules applied 95 place count 234 transition count 239
Reduce places removed 92 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 93 rules applied. Total rules applied 188 place count 142 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 189 place count 141 transition count 238
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 189 place count 141 transition count 224
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 217 place count 127 transition count 224
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 226 place count 118 transition count 211
Iterating global reduction 3 with 9 rules applied. Total rules applied 235 place count 118 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 238 place count 118 transition count 208
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 238 place count 118 transition count 205
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 244 place count 115 transition count 205
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 248 place count 111 transition count 199
Iterating global reduction 4 with 4 rules applied. Total rules applied 252 place count 111 transition count 199
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 286 place count 94 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 292 place count 94 transition count 174
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 294 place count 92 transition count 170
Iterating global reduction 5 with 2 rules applied. Total rules applied 296 place count 92 transition count 170
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 300 place count 90 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 5 rules applied. Total rules applied 305 place count 90 transition count 163
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 6 rules applied. Total rules applied 311 place count 88 transition count 159
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 5 rules applied. Total rules applied 316 place count 86 transition count 156
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 318 place count 85 transition count 155
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 320 place count 84 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 325 place count 84 transition count 149
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 326 place count 84 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 327 place count 83 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 329 place count 82 transition count 147
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 331 place count 80 transition count 145
Applied a total of 331 rules in 48 ms. Remains 80 /245 variables (removed 165) and now considering 145/340 (removed 195) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11980291103496681791.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1932852450281598259.kers'
[2026-05-23 07:43:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11980291103496681791.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1932852450281598259.kers]
Normalized transition count is 144 out of 145 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 144 rows 80 cols 354 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-23 07:43:40] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1932852450281598259.kers
Total runtime 1 ms.
[2026-05-23 07:43:40] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-23 07:43:40] [INFO ] Invariant cache hit.
[2026-05-23 07:43:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:43:41] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2026-05-23 07:43:41] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2026-05-23 07:43:41] [INFO ] Invariant cache hit.
[2026-05-23 07:43:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 144/224 variables, 80/84 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 1/225 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 0/225 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 85 constraints, problems are : Problem set: 0 solved, 130 unsolved in 4461 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 144/224 variables, 80/84 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 130/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 1/225 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 215 constraints, problems are : Problem set: 0 solved, 130 unsolved in 8166 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12638ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 12638ms
Starting structural reductions in SI_CTL mode, iteration 1 : 80/245 places, 145/340 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12804 ms. Remains : 80/245 places, 145/340 transitions.
[2026-05-23 07:43:53] [INFO ] Flatten gal took : 9 ms
[2026-05-23 07:43:53] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:43:53] [INFO ] Input system was already deterministic with 145 transitions.
[2026-05-23 07:43:53] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:43:53] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:43:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality16759125187211254250.gal : 1 ms
[2026-05-23 07:43:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality10134213204295739512.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/CTLCardinality16759125187211254250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10134213204295739512.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,102385,0.045202,5528,2,501,5,5047,6,0,457,4173,0


Converting to forward existential form...Done !
original formula: EG((p325==0))
=> equivalent forward existential formula: [FwdG(Init,(p325==0))] != FALSE
Hit Full ! (commute/partial/dont) 143/0/2
(forward)formula 0,1,0.149645,9748,1,0,8,29292,19,4,2426,14889,8
FORMULA CO4-PT-09-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 340/340 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 241 transition count 339
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 25 place count 221 transition count 317
Iterating global reduction 1 with 20 rules applied. Total rules applied 45 place count 221 transition count 317
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 221 transition count 313
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 60 place count 210 transition count 300
Iterating global reduction 2 with 11 rules applied. Total rules applied 71 place count 210 transition count 300
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 205 transition count 292
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 205 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 205 transition count 291
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 85 place count 202 transition count 288
Iterating global reduction 3 with 3 rules applied. Total rules applied 88 place count 202 transition count 288
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 200 transition count 286
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 200 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 94 place count 200 transition count 284
Applied a total of 94 rules in 17 ms. Remains 200 /245 variables (removed 45) and now considering 284/340 (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-1930112932531854845.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5537194614021582580.kers'
[2026-05-23 07:43:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1930112932531854845.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5537194614021582580.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 284 rows 200 cols 788 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-23 07:43:53] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5537194614021582580.kers
Total runtime 1 ms.
[2026-05-23 07:43:53] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-23 07:43:53] [INFO ] Invariant cache hit.
[2026-05-23 07:43:54] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2026-05-23 07:43:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/484 variables, 200/207 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 0/484 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 207 constraints, problems are : Problem set: 0 solved, 283 unsolved in 18356 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/484 variables, 200/207 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 283/490 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/484 variables, and 491 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48399ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 48399ms
Starting structural reductions in LTL mode, iteration 1 : 200/245 places, 284/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48576 ms. Remains : 200/245 places, 284/340 transitions.
[2026-05-23 07:44:42] [INFO ] Flatten gal took : 8 ms
[2026-05-23 07:44:42] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:44:42] [INFO ] Input system was already deterministic with 284 transitions.
[2026-05-23 07:44:42] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:44:42] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:44:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality16469504359120744452.gal : 1 ms
[2026-05-23 07:44:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality17970493848259986708.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/CTLCardinality16469504359120744452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17970493848259986708.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(EG(EX(((p205==0)||(p411==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(EX(((p205==0)||(p411==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t19, t28, t34, t36, t37, t38, t40, t41, t45, t46, t54, t63, t68,...351
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,28.2873,917704,1,0,714,5.9426e+06,596,412,7134,6.07014e+06,890
FORMULA CO4-PT-09-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 340/340 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 241 transition count 339
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 24 place count 222 transition count 318
Iterating global reduction 1 with 19 rules applied. Total rules applied 43 place count 222 transition count 318
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 222 transition count 315
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 55 place count 213 transition count 304
Iterating global reduction 2 with 9 rules applied. Total rules applied 64 place count 213 transition count 304
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 209 transition count 298
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 209 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 209 transition count 297
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 75 place count 207 transition count 295
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 207 transition count 295
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 205 transition count 293
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 205 transition count 293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 83 place count 205 transition count 291
Applied a total of 83 rules in 12 ms. Remains 205 /245 variables (removed 40) and now considering 291/340 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1006688099766339273.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7991564127488835665.kers'
[2026-05-23 07:45:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1006688099766339273.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7991564127488835665.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 291 rows 205 cols 810 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-05-23 07:45:10] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7991564127488835665.kers
Total runtime 2 ms.
[2026-05-23 07:45:11] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 07:45:11] [INFO ] Invariant cache hit.
[2026-05-23 07:45:11] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2026-05-23 07:45:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 291/496 variables, 205/212 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (OVERLAPS) 0/496 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 212 constraints, problems are : Problem set: 0 solved, 290 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 291/496 variables, 205/212 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 290/502 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 503 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50072ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 50073ms
Starting structural reductions in LTL mode, iteration 1 : 205/245 places, 291/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50271 ms. Remains : 205/245 places, 291/340 transitions.
[2026-05-23 07:46:01] [INFO ] Flatten gal took : 7 ms
[2026-05-23 07:46:01] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:46:01] [INFO ] Input system was already deterministic with 291 transitions.
[2026-05-23 07:46:01] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:46:01] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:46:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality15528104493944382748.gal : 2 ms
[2026-05-23 07:46:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality4138735576258752272.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/CTLCardinality15528104493944382748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4138735576258752272.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37406e+07,0.25067,14624,2,2748,5,32767,6,0,1107,37975,0


Converting to forward existential form...Done !
original formula: AG(AX(!(A((p95==1) U !((((p334==0)||(p341==1))||(p108==1)))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * !(EG(!(!((((p334==0)||(p341==1))||(p108==1))))))) * !(E(!(!((((p334==0)||(p341==1))||(p...237
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t36, t37, t41, t42, t50, t59, t66, t68, t69,...350
Detected timeout of ITS tools.
[2026-05-23 07:46:31] [INFO ] Flatten gal took : 11 ms
[2026-05-23 07:46:31] [INFO ] Applying decomposition
[2026-05-23 07:46:31] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16626874774978302624.txt' '-o' '/tmp/graph16626874774978302624.bin' '-w' '/tmp/graph16626874774978302624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16626874774978302624.bin' '-l' '-1' '-v' '-w' '/tmp/graph16626874774978302624.weights' '-q' '0' '-e' '0.001'
[2026-05-23 07:46:31] [INFO ] Decomposing Gal with order
[2026-05-23 07:46:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 07:46:31] [INFO ] Removed a total of 190 redundant transitions.
[2026-05-23 07:46:31] [INFO ] Flatten gal took : 19 ms
[2026-05-23 07:46:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 5 ms.
[2026-05-23 07:46:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality3704741652485482959.gal : 3 ms
[2026-05-23 07:46:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality15472126895012469590.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/CTLCardinality3704741652485482959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15472126895012469590.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.37406e+07,0.086065,7796,462,51,6554,640,645,12004,80,1981,0


Converting to forward existential form...Done !
original formula: AG(AX(!(A((i2.u6.p95==1) U !((((i10.i1.u49.p334==0)||(i10.i0.u50.p341==1))||(i3.u10.p108==1)))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * !(EG(!(!((((i10.i1.u49.p334==0)||(i10.i0.u50.p341==1))||(i3.u10.p108==1))))))) * !(E(!(...330
Reverse transition relation is NOT exact ! Due to transitions t12, t85, t154, t214, t246, t270, i1.t4, i1.u68.t8, i1.u68.t9, i1.u69.t5, i1.u69.t6, i1.u69.t...591
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,6.17879,238220,1,0,365749,776,4054,1.2081e+06,385,2411,434520
FORMULA CO4-PT-09-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 245/245 places, 340/340 transitions.
Graph (trivial) has 247 edges and 245 vertex of which 2 / 245 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 520 edges and 244 vertex of which 235 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 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 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 87 rules applied. Total rules applied 89 place count 234 transition count 245
Reduce places removed 86 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 90 rules applied. Total rules applied 179 place count 148 transition count 241
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 183 place count 144 transition count 241
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 183 place count 144 transition count 227
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 211 place count 130 transition count 227
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 221 place count 120 transition count 215
Iterating global reduction 3 with 10 rules applied. Total rules applied 231 place count 120 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 237 place count 120 transition count 209
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 242 place count 118 transition count 206
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 245 place count 117 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 246 place count 116 transition count 204
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 246 place count 116 transition count 201
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 252 place count 113 transition count 201
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 257 place count 108 transition count 193
Iterating global reduction 7 with 5 rules applied. Total rules applied 262 place count 108 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 263 place count 108 transition count 192
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 293 place count 93 transition count 176
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 7 rules applied. Total rules applied 300 place count 93 transition count 169
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 302 place count 92 transition count 168
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 304 place count 90 transition count 164
Iterating global reduction 10 with 2 rules applied. Total rules applied 306 place count 90 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 308 place count 89 transition count 163
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 10 with 3 rules applied. Total rules applied 311 place count 89 transition count 160
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 3 rules applied. Total rules applied 314 place count 88 transition count 158
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 316 place count 87 transition count 157
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 13 with 2 rules applied. Total rules applied 318 place count 86 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 323 place count 86 transition count 151
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 13 with 1 rules applied. Total rules applied 324 place count 86 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 325 place count 85 transition count 150
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 15 with 2 rules applied. Total rules applied 327 place count 84 transition count 149
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 329 place count 82 transition count 147
Applied a total of 329 rules in 36 ms. Remains 82 /245 variables (removed 163) and now considering 147/340 (removed 193) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3453290481615242583.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12853108751872008182.kers'
[2026-05-23 07:46:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3453290481615242583.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12853108751872008182.kers]
Normalized transition count is 146 out of 147 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 82 cols 358 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-23 07:46:37] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12853108751872008182.kers
Total runtime 0 ms.
[2026-05-23 07:46:37] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-23 07:46:37] [INFO ] Invariant cache hit.
[2026-05-23 07:46:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 07:46:37] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2026-05-23 07:46:37] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2026-05-23 07:46:37] [INFO ] Invariant cache hit.
[2026-05-23 07:46:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 146/227 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 1/228 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 1/229 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 87 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5862 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 82/82 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 146/227 variables, 81/85 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 81/166 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (OVERLAPS) 1/228 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 55/222 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 1/229 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/229 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 223 constraints, problems are : Problem set: 0 solved, 136 unsolved in 8480 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 82/82 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14353ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 14354ms
Starting structural reductions in SI_CTL mode, iteration 1 : 82/245 places, 147/340 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14497 ms. Remains : 82/245 places, 147/340 transitions.
[2026-05-23 07:46:52] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:46:52] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:46:52] [INFO ] Input system was already deterministic with 147 transitions.
[2026-05-23 07:46:52] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:46:52] [INFO ] Flatten gal took : 2 ms
[2026-05-23 07:46:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality8869875661769058621.gal : 1 ms
[2026-05-23 07:46:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality1809913254901598291.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/CTLCardinality8869875661769058621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1809913254901598291.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,123121,0.031521,5112,2,398,5,4050,6,0,467,3222,0


Converting to forward existential form...Done !
original formula: (AF((p382==1)) + AF((p329==1)))
=> equivalent forward existential formula: [FwdG((Init * !(!(EG(!((p382==1)))))),!((p329==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t11, t36, t44, t49, t68, Intersection with reachable at each step enabled. (destroyed/re...190
Hit Full ! (commute/partial/dont) 145/0/2
(forward)formula 0,0,0.549236,27956,1,0,323,128743,325,171,3223,133039,458
FORMULA CO4-PT-09-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 340/340 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 242 transition count 339
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 20 place count 226 transition count 322
Iterating global reduction 1 with 16 rules applied. Total rules applied 36 place count 226 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 226 transition count 321
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 46 place count 217 transition count 310
Iterating global reduction 2 with 9 rules applied. Total rules applied 55 place count 217 transition count 310
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 214 transition count 306
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 214 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 214 transition count 305
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 213 transition count 304
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 213 transition count 304
Applied a total of 64 rules in 16 ms. Remains 213 /245 variables (removed 32) and now considering 304/340 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3851645530903333759.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7135991332212765919.kers'
[2026-05-23 07:46:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3851645530903333759.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7135991332212765919.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 304 rows 213 cols 842 entries
Finished phase 1 with 209 SingleSign rule and 0 generalized
[2026-05-23 07:46:52] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7135991332212765919.kers
Total runtime 1 ms.
[2026-05-23 07:46:52] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-23 07:46:52] [INFO ] Invariant cache hit.
[2026-05-23 07:46:52] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 303 sub problems to find dead transitions.
[2026-05-23 07:46:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 304/516 variables, 212/219 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (OVERLAPS) 1/517 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 0/517 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 220 constraints, problems are : Problem set: 0 solved, 303 unsolved in 26994 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 304/516 variables, 212/219 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 302/521 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/517 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/517 variables, and 523 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57044ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 57045ms
Starting structural reductions in LTL mode, iteration 1 : 213/245 places, 304/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57228 ms. Remains : 213/245 places, 304/340 transitions.
[2026-05-23 07:47:49] [INFO ] Flatten gal took : 6 ms
[2026-05-23 07:47:49] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:47:49] [INFO ] Input system was already deterministic with 304 transitions.
[2026-05-23 07:47:50] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:47:50] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:47:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality187883715016693617.gal : 2 ms
[2026-05-23 07:47:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality10390225987079875220.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/CTLCardinality187883715016693617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10390225987079875220.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.10926e+07,0.24704,14692,2,2557,5,34867,6,0,1149,39685,0


Converting to forward existential form...Done !
original formula: (E(A(!(EX(EF((p391==0)))) U EX(AX((p94==1)))) U AX((p258==0))) * AF((((p459==0)&&(p320==1))||((p176==1)&&(p246==0)))))
=> equivalent forward existential formula: ([(Init * !(E(!((E(!(EX(!(EX(!((p94==1)))))) U (!(!(EX(E(TRUE U (p391==0))))) * !(EX(!(EX(!((p94==1)))))))) + EG...294
Hit Full ! (commute/partial/dont) 295/4/9
(forward)formula 0,0,2.19105,84104,1,0,37,372659,20,4,5741,290670,35
FORMULA CO4-PT-09-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 340/340 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 241 transition count 339
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 25 place count 221 transition count 317
Iterating global reduction 1 with 20 rules applied. Total rules applied 45 place count 221 transition count 317
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 221 transition count 313
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 60 place count 210 transition count 299
Iterating global reduction 2 with 11 rules applied. Total rules applied 71 place count 210 transition count 299
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 77 place count 204 transition count 290
Iterating global reduction 2 with 6 rules applied. Total rules applied 83 place count 204 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 204 transition count 289
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 201 transition count 286
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 201 transition count 286
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 199 transition count 284
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 199 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 199 transition count 282
Applied a total of 96 rules in 10 ms. Remains 199 /245 variables (removed 46) and now considering 282/340 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2915780957847927021.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8811280861133417767.kers'
[2026-05-23 07:47:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2915780957847927021.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8811280861133417767.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 282 rows 199 cols 787 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-23 07:47:52] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8811280861133417767.kers
Total runtime 1 ms.
[2026-05-23 07:47:52] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-23 07:47:52] [INFO ] Invariant cache hit.
[2026-05-23 07:47:52] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2026-05-23 07:47:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/481 variables, 199/208 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/481 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 208 constraints, problems are : Problem set: 0 solved, 281 unsolved in 18906 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 282/481 variables, 199/208 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 281/489 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 490 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 48951ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 48951ms
Starting structural reductions in LTL mode, iteration 1 : 199/245 places, 282/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49159 ms. Remains : 199/245 places, 282/340 transitions.
[2026-05-23 07:48:41] [INFO ] Flatten gal took : 5 ms
[2026-05-23 07:48:41] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:48:41] [INFO ] Input system was already deterministic with 282 transitions.
[2026-05-23 07:48:41] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:48:41] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:48:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality15664949118578665475.gal : 2 ms
[2026-05-23 07:48:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality1324914238746126156.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/CTLCardinality15664949118578665475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1324914238746126156.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13984e+07,0.234457,13872,2,2898,5,32899,6,0,1074,38229,0


Converting to forward existential form...Done !
original formula: AF(EX((p447==0)))
=> equivalent forward existential formula: [FwdG(Init,!(EX((p447==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t12, t18, t20, t29, t34, t35, t37, t38, t42, t43, t51, t60, t65, ...362
(forward)formula 0,1,3.24071,110692,1,0,432,427184,586,239,6745,492467,600
FORMULA CO4-PT-09-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 340/340 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 241 transition count 339
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 25 place count 221 transition count 317
Iterating global reduction 1 with 20 rules applied. Total rules applied 45 place count 221 transition count 317
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 49 place count 221 transition count 313
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 60 place count 210 transition count 299
Iterating global reduction 2 with 11 rules applied. Total rules applied 71 place count 210 transition count 299
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 77 place count 204 transition count 290
Iterating global reduction 2 with 6 rules applied. Total rules applied 83 place count 204 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 204 transition count 289
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 87 place count 201 transition count 286
Iterating global reduction 3 with 3 rules applied. Total rules applied 90 place count 201 transition count 286
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 199 transition count 284
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 199 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 199 transition count 282
Applied a total of 96 rules in 23 ms. Remains 199 /245 variables (removed 46) and now considering 282/340 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11173983981313833470.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2296738024695845404.kers'
[2026-05-23 07:48:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11173983981313833470.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2296738024695845404.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 282 rows 199 cols 784 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-23 07:48:44] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2296738024695845404.kers
Total runtime 2 ms.
[2026-05-23 07:48:44] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 07:48:44] [INFO ] Invariant cache hit.
[2026-05-23 07:48:44] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2026-05-23 07:48:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 282/481 variables, 199/206 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 0/481 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 206 constraints, problems are : Problem set: 0 solved, 281 unsolved in 17889 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 282/481 variables, 199/206 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 281/487 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 488 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 47927ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 47928ms
Starting structural reductions in LTL mode, iteration 1 : 199/245 places, 282/340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48124 ms. Remains : 199/245 places, 282/340 transitions.
[2026-05-23 07:49:32] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:49:32] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:49:32] [INFO ] Input system was already deterministic with 282 transitions.
[2026-05-23 07:49:32] [INFO ] Flatten gal took : 3 ms
[2026-05-23 07:49:32] [INFO ] Flatten gal took : 4 ms
[2026-05-23 07:49:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality4812540725401865223.gal : 2 ms
[2026-05-23 07:49:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality112931704707007487.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/CTLCardinality4812540725401865223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality112931704707007487.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18045e+07,0.223124,13740,2,2694,5,32608,6,0,1074,36847,0


Converting to forward existential form...Done !
original formula: AG(EX(((p348==0)||(p405==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((p348==0)||(p405==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t8, t9, t12, t19, t28, t33, t34, t38, t39, t43, t44, t52, t61, t66, t67, t69,...341
(forward)formula 0,0,2.4889,91048,1,0,399,343178,580,238,6568,361487,571
FORMULA CO4-PT-09-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

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

BK_STOP 1779522575455

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

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