Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.4K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 6 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 6 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 08:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 08:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779599303872

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 05:08:26] [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-24 05:08:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:08:27] [INFO ] Load time of PNML (sax parser for PT used): 587 ms
[2026-05-24 05:08:27] [INFO ] Transformed 4763 places.
[2026-05-24 05:08:27] [INFO ] Transformed 2478 transitions.
[2026-05-24 05:08:27] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 847 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 74 ms.
Deduced a syphon composed of 3580 places in 33 ms
Reduce places removed 3580 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 242 place count 1138 transition count 2281
Discarding 386 places :
Symmetric choice reduction at 1 with 386 rule applications. Total rules 628 place count 752 transition count 1253
Iterating global reduction 1 with 386 rules applied. Total rules applied 1014 place count 752 transition count 1253
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1023 place count 752 transition count 1244
Discarding 312 places :
Symmetric choice reduction at 2 with 312 rule applications. Total rules 1335 place count 440 transition count 932
Iterating global reduction 2 with 312 rules applied. Total rules applied 1647 place count 440 transition count 932
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1657 place count 440 transition count 922
Discarding 231 places :
Symmetric choice reduction at 3 with 231 rule applications. Total rules 1888 place count 209 transition count 601
Iterating global reduction 3 with 231 rules applied. Total rules applied 2119 place count 209 transition count 601
Ensure Unique test removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
Iterating post reduction 3 with 236 rules applied. Total rules applied 2355 place count 209 transition count 365
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 2375 place count 189 transition count 327
Iterating global reduction 4 with 20 rules applied. Total rules applied 2395 place count 189 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2399 place count 189 transition count 323
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2414 place count 174 transition count 308
Iterating global reduction 5 with 15 rules applied. Total rules applied 2429 place count 174 transition count 308
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2430 place count 174 transition count 307
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2443 place count 161 transition count 294
Iterating global reduction 6 with 13 rules applied. Total rules applied 2456 place count 161 transition count 294
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2469 place count 161 transition count 281
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2473 place count 157 transition count 267
Iterating global reduction 7 with 4 rules applied. Total rules applied 2477 place count 157 transition count 267
Applied a total of 2477 rules in 393 ms. Remains 157 /1183 variables (removed 1026) and now considering 267/2478 (removed 2211) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8583787709739610788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9206199910729650817.kers'
[2026-05-24 05:08:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8583787709739610788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9206199910729650817.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 267 rows 157 cols 830 entries
Finished phase 1 with 153 SingleSign rule and 2 generalized
[2026-05-24 05:08:27] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9206199910729650817.kers
Total runtime 5 ms.
[2026-05-24 05:08:28] [INFO ] Implicit Places using invariants in 887 ms returned []
[2026-05-24 05:08:28] [INFO ] Invariant cache hit.
[2026-05-24 05:08:29] [INFO ] State equation strengthened by 109 read => feed constraints.
[2026-05-24 05:08:30] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 2972 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2026-05-24 05:08:30] [INFO ] Invariant cache hit.
[2026-05-24 05:08:30] [INFO ] State equation strengthened by 109 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 267/423 variables, 156/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 109/267 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 1/424 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 268 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (OVERLAPS) 267/423 variables, 156/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 109/267 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 257/524 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/424 variables, and 524 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 156/157 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 257/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60878ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 60907ms
Starting structural reductions in LTL mode, iteration 1 : 157/1183 places, 267/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64342 ms. Remains : 157/1183 places, 267/2478 transitions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 267/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2026-05-24 05:09:31] [INFO ] Invariant cache hit.
[2026-05-24 05:09:31] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-24 05:09:31] [INFO ] Invariant cache hit.
[2026-05-24 05:09:32] [INFO ] State equation strengthened by 109 read => feed constraints.
[2026-05-24 05:09:33] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1829 ms. Remains : 157/157 places, 267/267 transitions.
Support contains 15 out of 157 places after structural reductions.
[2026-05-24 05:09:33] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-05-24 05:09:33] [INFO ] Flatten gal took : 71 ms
[2026-05-24 05:09:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 05:09:33] [INFO ] Flatten gal took : 35 ms
[2026-05-24 05:09:34] [INFO ] Input system was already deterministic with 267 transitions.
Support contains 11 out of 157 places (down from 15) after GAL structural reductions.
RANDOM walk for 40000 steps (9184 resets) in 3480 ms. (11 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (3855 resets) in 682 ms. (58 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3783 resets) in 203 ms. (196 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3689 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3881 resets) in 183 ms. (217 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3809 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3774 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3813 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3777 resets) in 202 ms. (197 steps per ms) remains 8/8 properties
[2026-05-24 05:09:35] [INFO ] Invariant cache hit.
[2026-05-24 05:09:35] [INFO ] State equation strengthened by 109 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
At refinement iteration 1 (OVERLAPS) 58/68 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 34/102 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 173/275 variables, 102/104 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 15/119 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/119 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
At refinement iteration 8 (OVERLAPS) 139/414 variables, 50/169 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 89/258 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/258 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 10/424 variables, 5/263 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 5/268 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 0/268 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/424 variables, 0/268 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 268 constraints, problems are : Problem set: 4 solved, 4 unsolved in 1462 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/66 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 34/100 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 5/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 171/271 variables, 100/107 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 13/120 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/122 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/122 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 142/413 variables, 51/173 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 91/264 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 2/266 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/266 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 11/424 variables, 6/272 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 5/277 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 0/277 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/424 variables, 0/277 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 277 constraints, problems are : Problem set: 4 solved, 4 unsolved in 3279 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4762ms problems are : Problem set: 4 solved, 4 unsolved
Parikh walk visited 0 properties in 952 ms.
Support contains 6 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 267/267 transitions.
Graph (complete) has 556 edges and 157 vertex of which 155 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 155 transition count 261
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 16 place count 146 transition count 233
Iterating global reduction 1 with 9 rules applied. Total rules applied 25 place count 146 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 29 place count 146 transition count 229
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 34 place count 141 transition count 223
Iterating global reduction 2 with 5 rules applied. Total rules applied 39 place count 141 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 141 transition count 221
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 45 place count 137 transition count 210
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 137 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 53 place count 137 transition count 206
Applied a total of 53 rules in 56 ms. Remains 137 /157 variables (removed 20) and now considering 206/267 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 137/157 places, 206/267 transitions.
RANDOM walk for 40000 steps (9215 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3886 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3901 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3872 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3773 resets) in 155 ms. (256 steps per ms) remains 4/4 properties
Probably explored full state space saw : 276435 states, properties seen :3
Probabilistic random walk after 703284 steps, saw 276435 distinct states, run finished after 1499 ms. (steps per millisecond=469 ) properties seen :3
Explored full state space saw : 278251 states, properties seen :0
Exhaustive walk after 707091 steps, saw 278251 distinct states, run finished after 1224 ms. (steps per millisecond=577 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 4 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 05:09:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 05:09:44] [INFO ] Flatten gal took : 23 ms
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 05:09:44] [INFO ] Flatten gal took : 21 ms
[2026-05-24 05:09:44] [INFO ] Input system was already deterministic with 267 transitions.
Support contains 1 out of 157 places (down from 2) after GAL structural reductions.
Computed a total of 5 stabilizing places and 23 stable transitions
Graph (complete) has 596 edges and 157 vertex of which 155 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 267/267 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 156 transition count 266
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 142 transition count 233
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 142 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 36 place count 142 transition count 227
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 45 place count 133 transition count 214
Iterating global reduction 2 with 9 rules applied. Total rules applied 54 place count 133 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 58 place count 133 transition count 210
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 65 place count 126 transition count 178
Iterating global reduction 3 with 7 rules applied. Total rules applied 72 place count 126 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 76 place count 126 transition count 174
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 125 transition count 173
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 125 transition count 173
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 124 transition count 172
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 124 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 124 transition count 171
Applied a total of 81 rules in 14 ms. Remains 124 /157 variables (removed 33) and now considering 171/267 (removed 96) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3829152489173710927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8703640124572837427.kers'
[2026-05-24 05:09:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3829152489173710927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8703640124572837427.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 124 cols 568 entries
Finished phase 1 with 120 SingleSign rule and 2 generalized
[2026-05-24 05:09:44] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8703640124572837427.kers
Total runtime 3 ms.
[2026-05-24 05:09:44] [INFO ] Implicit Places using invariants in 222 ms returned []
[2026-05-24 05:09:44] [INFO ] Invariant cache hit.
[2026-05-24 05:09:45] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-24 05:09:45] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2026-05-24 05:09:45] [INFO ] Invariant cache hit.
[2026-05-24 05:09:45] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/295 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 52/178 constraints. Problems are: Problem set: 0 solved, 170 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 295/295 variables, and 180 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/295 variables, 124/128 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 52/180 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 170/350 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 295/295 variables, and 350 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 60228ms
Starting structural reductions in LTL mode, iteration 1 : 124/157 places, 171/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61485 ms. Remains : 124/157 places, 171/267 transitions.
[2026-05-24 05:10:46] [INFO ] Flatten gal took : 12 ms
[2026-05-24 05:10:46] [INFO ] Flatten gal took : 12 ms
[2026-05-24 05:10:46] [INFO ] Input system was already deterministic with 171 transitions.
[2026-05-24 05:10:46] [INFO ] Flatten gal took : 12 ms
[2026-05-24 05:10:46] [INFO ] Flatten gal took : 12 ms
[2026-05-24 05:10:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality17278312564362667652.gal : 6 ms
[2026-05-24 05:10:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality5378352611138001010.ctl : 8 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/CTLCardinality17278312564362667652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5378352611138001010.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,186662,3.14044,83744,2,11027,5,218165,6,0,667,265361,0


Converting to forward existential form...Done !
original formula: (AX(FALSE) + EX(TRUE))
=> equivalent forward existential formula: [(EY((Init * !(EX(TRUE)))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t110, t119, t120...557
(forward)formula 0,1,6.44163,137832,1,0,296,451180,357,120,4610,265361,348
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 267/267 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 156 transition count 266
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 142 transition count 233
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 142 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 36 place count 142 transition count 227
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 45 place count 133 transition count 214
Iterating global reduction 2 with 9 rules applied. Total rules applied 54 place count 133 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 58 place count 133 transition count 210
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 65 place count 126 transition count 178
Iterating global reduction 3 with 7 rules applied. Total rules applied 72 place count 126 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 76 place count 126 transition count 174
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 125 transition count 173
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 125 transition count 173
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 124 transition count 172
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 124 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 124 transition count 171
Applied a total of 81 rules in 11 ms. Remains 124 /157 variables (removed 33) and now considering 171/267 (removed 96) transitions.
[2026-05-24 05:10:52] [INFO ] Invariant cache hit.
[2026-05-24 05:10:53] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-24 05:10:53] [INFO ] Invariant cache hit.
[2026-05-24 05:10:53] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-24 05:10:54] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 1616 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 124/157 places, 171/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1628 ms. Remains : 124/157 places, 171/267 transitions.
[2026-05-24 05:10:54] [INFO ] Flatten gal took : 14 ms
[2026-05-24 05:10:54] [INFO ] Flatten gal took : 14 ms
[2026-05-24 05:10:54] [INFO ] Input system was already deterministic with 171 transitions.
[2026-05-24 05:10:54] [INFO ] Flatten gal took : 12 ms
[2026-05-24 05:10:54] [INFO ] Flatten gal took : 13 ms
[2026-05-24 05:10:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality12705082549433471910.gal : 5 ms
[2026-05-24 05:10:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality9696686459397569879.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12705082549433471910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9696686459397569879.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,186662,3.64674,84040,2,11027,5,218165,6,0,667,265361,0


Converting to forward existential form...Done !
original formula: AG(AF(EX(TRUE)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t110, t119, t120...557
(forward)formula 0,0,7.97125,145848,1,0,304,472135,363,121,4684,267021,362
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 267/267 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 156 transition count 266
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 142 transition count 233
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 142 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 36 place count 142 transition count 227
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 45 place count 133 transition count 214
Iterating global reduction 2 with 9 rules applied. Total rules applied 54 place count 133 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 58 place count 133 transition count 210
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 65 place count 126 transition count 178
Iterating global reduction 3 with 7 rules applied. Total rules applied 72 place count 126 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 76 place count 126 transition count 174
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 125 transition count 173
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 125 transition count 173
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 124 transition count 172
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 124 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 124 transition count 171
Applied a total of 81 rules in 9 ms. Remains 124 /157 variables (removed 33) and now considering 171/267 (removed 96) transitions.
[2026-05-24 05:11:02] [INFO ] Invariant cache hit.
[2026-05-24 05:11:02] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-24 05:11:02] [INFO ] Invariant cache hit.
[2026-05-24 05:11:02] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-24 05:11:03] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 124/157 places, 171/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1251 ms. Remains : 124/157 places, 171/267 transitions.
[2026-05-24 05:11:03] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:11:03] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:11:03] [INFO ] Input system was already deterministic with 171 transitions.
[2026-05-24 05:11:03] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:11:03] [INFO ] Flatten gal took : 9 ms
[2026-05-24 05:11:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality15194861727825177702.gal : 2 ms
[2026-05-24 05:11:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality13412246800163016832.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/CTLCardinality15194861727825177702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13412246800163016832.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,186662,2.99587,84164,2,11027,5,218165,6,0,667,265361,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,3.00511,84164,1,0,6,218165,7,1,903,265361,1
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 267/267 transitions.
Graph (complete) has 596 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 266
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 143 transition count 238
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 143 transition count 238
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 34 place count 143 transition count 232
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 42 place count 135 transition count 220
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 135 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 135 transition count 216
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 60 place count 129 transition count 185
Iterating global reduction 3 with 6 rules applied. Total rules applied 66 place count 129 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 129 transition count 183
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 128 transition count 182
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 128 transition count 182
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 127 transition count 181
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 127 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 127 transition count 180
Applied a total of 73 rules in 39 ms. Remains 127 /157 variables (removed 30) and now considering 180/267 (removed 87) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1805195167124278996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7228635621442725538.kers'
[2026-05-24 05:11:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1805195167124278996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7228635621442725538.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 127 cols 602 entries
Finished phase 1 with 123 SingleSign rule and 2 generalized
[2026-05-24 05:11:06] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7228635621442725538.kers
Total runtime 1 ms.
[2026-05-24 05:11:07] [INFO ] Implicit Places using invariants in 156 ms returned []
[2026-05-24 05:11:07] [INFO ] Invariant cache hit.
[2026-05-24 05:11:07] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-24 05:11:07] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2026-05-24 05:11:07] [INFO ] Redundant transitions in 7 ms returned []
Running 179 sub problems to find dead transitions.
[2026-05-24 05:11:07] [INFO ] Invariant cache hit.
[2026-05-24 05:11:07] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/307 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 53/182 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/307 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 182 constraints, problems are : Problem set: 0 solved, 179 unsolved in 13489 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/307 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 53/182 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 179/361 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/307 variables, and 361 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43593ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 43595ms
Starting structural reductions in SI_CTL mode, iteration 1 : 127/157 places, 180/267 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44317 ms. Remains : 127/157 places, 180/267 transitions.
[2026-05-24 05:11:51] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:11:51] [INFO ] Flatten gal took : 9 ms
[2026-05-24 05:11:51] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 05:11:51] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:11:51] [INFO ] Flatten gal took : 8 ms
[2026-05-24 05:11:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality10109616038899551103.gal : 3 ms
[2026-05-24 05:11:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality10366653409913147044.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/CTLCardinality10109616038899551103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10366653409913147044.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,239884,4.3443,110096,2,12055,5,297418,6,0,688,379642,0


Converting to forward existential form...Done !
original formula: EF(AG(AF((l4313<=0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!((l4313<=0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t13, t14, t68, t69, t73, t74, t75, t83, t85, t86, t87, t89, t90, t102, t104, t113...605
(forward)formula 0,1,16.1608,335452,1,0,456,1.56782e+06,388,187,4908,872295,548
FORMULA DBSingleClientW-PT-d2m05-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-24 05:12:07] [INFO ] Flatten gal took : 11 ms
[2026-05-24 05:12:07] [INFO ] Flatten gal took : 11 ms
Total runtime 221448 ms.

BK_STOP 1779599527745

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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