Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063500065.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is DBSingleClientW-PT-d1m05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063500065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 432K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748568683081

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-30 01:31:25] [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]
[2025-05-30 01:31:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:31:26] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2025-05-30 01:31:26] [INFO ] Transformed 1440 places.
[2025-05-30 01:31:26] [INFO ] Transformed 672 transitions.
[2025-05-30 01:31:26] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 546 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 32 ms.
Deduced a syphon composed of 1093 places in 14 ms
Reduce places removed 1093 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 186 place count 241 transition count 371
Iterating global reduction 1 with 85 rules applied. Total rules applied 271 place count 241 transition count 371
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 277 place count 241 transition count 365
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 339 place count 179 transition count 303
Iterating global reduction 2 with 62 rules applied. Total rules applied 401 place count 179 transition count 303
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 405 place count 179 transition count 299
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 440 place count 144 transition count 249
Iterating global reduction 3 with 35 rules applied. Total rules applied 475 place count 144 transition count 249
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 504 place count 144 transition count 220
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 510 place count 138 transition count 207
Iterating global reduction 4 with 6 rules applied. Total rules applied 516 place count 138 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 518 place count 138 transition count 205
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 522 place count 134 transition count 201
Iterating global reduction 5 with 4 rules applied. Total rules applied 526 place count 134 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 528 place count 134 transition count 199
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 531 place count 131 transition count 196
Iterating global reduction 6 with 3 rules applied. Total rules applied 534 place count 131 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 535 place count 131 transition count 195
Applied a total of 535 rules in 159 ms. Remains 131 /347 variables (removed 216) and now considering 195/672 (removed 477) transitions.
// Phase 1: matrix 195 rows 131 cols
[2025-05-30 01:31:26] [INFO ] Computed 2 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:31:27] [INFO ] Implicit Places using invariants in 598 ms returned []
[2025-05-30 01:31:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:31:27] [INFO ] State equation strengthened by 78 read => feed constraints.
[2025-05-30 01:31:29] [INFO ] Implicit Places using invariants and state equation in 2030 ms returned []
Implicit Place search using SMT with State Equation took 2697 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2025-05-30 01:31:29] [INFO ] Invariant cache hit.
[2025-05-30 01:31:29] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/326 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 78/211 constraints. Problems are: Problem set: 0 solved, 194 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 211 constraints, problems are : Problem set: 0 solved, 194 unsolved in 22508 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/326 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 78/211 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 194/405 constraints. Problems are: Problem set: 0 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 405 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53159ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 53180ms
Starting structural reductions in LTL mode, iteration 1 : 131/347 places, 195/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56070 ms. Remains : 131/347 places, 195/672 transitions.
Support contains 20 out of 131 places after structural reductions.
[2025-05-30 01:32:22] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2025-05-30 01:32:22] [INFO ] Flatten gal took : 66 ms
[2025-05-30 01:32:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 01:32:22] [INFO ] Flatten gal took : 31 ms
[2025-05-30 01:32:22] [INFO ] Input system was already deterministic with 195 transitions.
Support contains 7 out of 131 places (down from 20) after GAL structural reductions.
RANDOM walk for 40000 steps (9151 resets) in 3210 ms. (12 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40001 steps (4048 resets) in 338 ms. (117 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (4006 resets) in 262 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3960 resets) in 253 ms. (157 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3978 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (3999 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (3953 resets) in 233 ms. (170 steps per ms) remains 6/6 properties
[2025-05-30 01:32:24] [INFO ] Invariant cache hit.
[2025-05-30 01:32:24] [INFO ] State equation strengthened by 78 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 48/54 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 36/90 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 139/229 variables, 90/92 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 22/114 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/114 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
At refinement iteration 8 (OVERLAPS) 89/318 variables, 37/151 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 52/203 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/203 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/326 variables, 4/207 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 4/211 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/211 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/211 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 211 constraints, problems are : Problem set: 4 solved, 2 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/84 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/90 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 139/229 variables, 90/92 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 22/114 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 1/115 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/115 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 89/318 variables, 37/152 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 52/204 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 1/205 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/205 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/326 variables, 4/209 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 4/213 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/326 variables, 0/213 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/326 variables, 0/213 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 213 constraints, problems are : Problem set: 4 solved, 2 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 940ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 195/195 transitions.
Graph (complete) has 421 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 130 transition count 191
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 17 place count 118 transition count 168
Iterating global reduction 1 with 12 rules applied. Total rules applied 29 place count 118 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 118 transition count 167
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 41 place count 107 transition count 152
Iterating global reduction 2 with 11 rules applied. Total rules applied 52 place count 107 transition count 152
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 56 place count 107 transition count 148
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 62 place count 101 transition count 134
Iterating global reduction 3 with 6 rules applied. Total rules applied 68 place count 101 transition count 134
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 74 place count 95 transition count 128
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 95 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 95 transition count 126
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 86 place count 91 transition count 122
Iterating global reduction 4 with 4 rules applied. Total rules applied 90 place count 91 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 91 transition count 120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 95 place count 88 transition count 117
Iterating global reduction 5 with 3 rules applied. Total rules applied 98 place count 88 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 99 place count 87 transition count 115
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 87 transition count 115
Applied a total of 100 rules in 50 ms. Remains 87 /131 variables (removed 44) and now considering 115/195 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 87/131 places, 115/195 transitions.
RANDOM walk for 40000 steps (9131 resets) in 257 ms. (155 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3969 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3916 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 14624 steps, run visited all 2 properties in 103 ms. (steps per millisecond=141 )
Probabilistic random walk after 14624 steps, saw 6922 distinct states, run finished after 109 ms. (steps per millisecond=134 ) properties seen :2
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2025-05-30 01:32:25] [INFO ] Flatten gal took : 17 ms
[2025-05-30 01:32:25] [INFO ] Flatten gal took : 19 ms
[2025-05-30 01:32:25] [INFO ] Input system was already deterministic with 195 transitions.
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 19 stable transitions
Graph (complete) has 462 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 195/195 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 117 transition count 164
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 117 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 117 transition count 163
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 41 place count 105 transition count 147
Iterating global reduction 1 with 12 rules applied. Total rules applied 53 place count 105 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 57 place count 105 transition count 143
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 98 transition count 128
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 98 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 98 transition count 127
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 78 place count 92 transition count 120
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 92 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 92 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 90 place count 88 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 94 place count 88 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 96 place count 88 transition count 112
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 99 place count 85 transition count 109
Iterating global reduction 5 with 3 rules applied. Total rules applied 102 place count 85 transition count 109
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 104 place count 83 transition count 101
Iterating global reduction 5 with 2 rules applied. Total rules applied 106 place count 83 transition count 101
Applied a total of 106 rules in 19 ms. Remains 83 /131 variables (removed 48) and now considering 101/195 (removed 94) transitions.
// Phase 1: matrix 101 rows 83 cols
[2025-05-30 01:32:25] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:32:25] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-05-30 01:32:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:32:25] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-30 01:32:26] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-05-30 01:32:26] [INFO ] Invariant cache hit.
[2025-05-30 01:32:26] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 116 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4823 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 100/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 216 constraints, problems are : Problem set: 0 solved, 100 unsolved in 21827 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26757ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 26767ms
Starting structural reductions in LTL mode, iteration 1 : 83/131 places, 101/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27265 ms. Remains : 83/131 places, 101/195 transitions.
[2025-05-30 01:32:53] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:32:53] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:32:53] [INFO ] Input system was already deterministic with 101 transitions.
[2025-05-30 01:32:53] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:32:53] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:32:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality17427647473743690108.gal : 4 ms
[2025-05-30 01:32:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality16077690585161837898.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17427647473743690108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16077690585161837898.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,59273,0.847466,21748,2,5340,5,61757,6,0,433,58395,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.85048,21748,1,0,6,61757,7,1,580,58395,1
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 195/195 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 117 transition count 164
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 117 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 117 transition count 163
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 41 place count 105 transition count 147
Iterating global reduction 1 with 12 rules applied. Total rules applied 53 place count 105 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 57 place count 105 transition count 143
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 98 transition count 128
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 98 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 98 transition count 127
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 78 place count 92 transition count 120
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 92 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 92 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 90 place count 88 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 94 place count 88 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 96 place count 88 transition count 112
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 99 place count 85 transition count 109
Iterating global reduction 5 with 3 rules applied. Total rules applied 102 place count 85 transition count 109
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 104 place count 83 transition count 101
Iterating global reduction 5 with 2 rules applied. Total rules applied 106 place count 83 transition count 101
Applied a total of 106 rules in 20 ms. Remains 83 /131 variables (removed 48) and now considering 101/195 (removed 94) transitions.
[2025-05-30 01:32:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:32:54] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-05-30 01:32:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:32:54] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-30 01:32:54] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-05-30 01:32:54] [INFO ] Invariant cache hit.
[2025-05-30 01:32:54] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 116 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5635 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 100/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 216 constraints, problems are : Problem set: 0 solved, 100 unsolved in 22760 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28482ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 28484ms
Starting structural reductions in LTL mode, iteration 1 : 83/131 places, 101/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28866 ms. Remains : 83/131 places, 101/195 transitions.
[2025-05-30 01:33:22] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:33:22] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:33:22] [INFO ] Input system was already deterministic with 101 transitions.
[2025-05-30 01:33:22] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:33:22] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:33:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality6551008918669971802.gal : 2 ms
[2025-05-30 01:33:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality15863309568538870862.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6551008918669971802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15863309568538870862.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,59273,0.805636,21664,2,5340,5,61757,6,0,433,58395,0


Converting to forward existential form...Done !
original formula: AF(EG(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!(FALSE))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t63, t70, t71, t72, t73, t74, t75, t76, t77, t78, t...364
Using saturation style SCC detection
(forward)formula 0,0,3.8132,92756,1,0,378,385801,229,204,3039,373122,348
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 131/131 places, 195/195 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 118 transition count 169
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 118 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 118 transition count 168
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 106 transition count 152
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 106 transition count 152
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 106 transition count 148
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 99 transition count 133
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 99 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 99 transition count 132
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 76 place count 93 transition count 125
Iterating global reduction 3 with 6 rules applied. Total rules applied 82 place count 93 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 84 place count 93 transition count 123
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 88 place count 89 transition count 119
Iterating global reduction 4 with 4 rules applied. Total rules applied 92 place count 89 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 94 place count 89 transition count 117
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 97 place count 86 transition count 114
Iterating global reduction 5 with 3 rules applied. Total rules applied 100 place count 86 transition count 114
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 102 place count 84 transition count 106
Iterating global reduction 5 with 2 rules applied. Total rules applied 104 place count 84 transition count 106
Applied a total of 104 rules in 68 ms. Remains 84 /131 variables (removed 47) and now considering 106/195 (removed 89) transitions.
// Phase 1: matrix 106 rows 84 cols
[2025-05-30 01:33:26] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:33:27] [INFO ] Implicit Places using invariants in 129 ms returned []
[2025-05-30 01:33:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:33:27] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-30 01:33:27] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:33:27] [INFO ] Redundant transitions in 3 ms returned []
Running 105 sub problems to find dead transitions.
[2025-05-30 01:33:27] [INFO ] Invariant cache hit.
[2025-05-30 01:33:27] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/190 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 122 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6509 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/190 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 105/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 227 constraints, problems are : Problem set: 0 solved, 105 unsolved in 22223 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28797ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 28798ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/131 places, 106/195 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29423 ms. Remains : 84/131 places, 106/195 transitions.
[2025-05-30 01:33:56] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:33:56] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:33:56] [INFO ] Input system was already deterministic with 106 transitions.
[2025-05-30 01:33:56] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:33:56] [INFO ] Flatten gal took : 7 ms
[2025-05-30 01:33:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality3182307919308930785.gal : 3 ms
[2025-05-30 01:33:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality13386597214671042023.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3182307919308930785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13386597214671042023.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,68498,0.795879,19428,2,4884,5,53342,6,0,442,46615,0


Converting to forward existential form...Done !
original formula: AG(AF((l36>0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((l36>0)))] = FALSE
Hit Full ! (commute/partial/dont) 100/0/6
(forward)formula 0,0,2.24725,44792,1,0,28,175200,20,3,2360,103682,25
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 195/195 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 117 transition count 164
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 117 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 117 transition count 163
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 41 place count 105 transition count 147
Iterating global reduction 1 with 12 rules applied. Total rules applied 53 place count 105 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 57 place count 105 transition count 143
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 98 transition count 128
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 98 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 98 transition count 127
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 78 place count 92 transition count 120
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 92 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 92 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 90 place count 88 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 94 place count 88 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 96 place count 88 transition count 112
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 99 place count 85 transition count 109
Iterating global reduction 5 with 3 rules applied. Total rules applied 102 place count 85 transition count 109
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 104 place count 83 transition count 101
Iterating global reduction 5 with 2 rules applied. Total rules applied 106 place count 83 transition count 101
Applied a total of 106 rules in 13 ms. Remains 83 /131 variables (removed 48) and now considering 101/195 (removed 94) transitions.
// Phase 1: matrix 101 rows 83 cols
[2025-05-30 01:33:58] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:33:58] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-30 01:33:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:33:58] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-30 01:33:59] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-05-30 01:33:59] [INFO ] Invariant cache hit.
[2025-05-30 01:33:59] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 116 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 100/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 216 constraints, problems are : Problem set: 0 solved, 100 unsolved in 21188 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26270ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 26273ms
Starting structural reductions in LTL mode, iteration 1 : 83/131 places, 101/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26697 ms. Remains : 83/131 places, 101/195 transitions.
[2025-05-30 01:34:25] [INFO ] Flatten gal took : 7 ms
[2025-05-30 01:34:25] [INFO ] Flatten gal took : 6 ms
[2025-05-30 01:34:25] [INFO ] Input system was already deterministic with 101 transitions.
[2025-05-30 01:34:25] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:34:25] [INFO ] Flatten gal took : 6 ms
[2025-05-30 01:34:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality245414073141836435.gal : 1 ms
[2025-05-30 01:34:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality9542771729176000578.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality245414073141836435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9542771729176000578.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,59273,0.674948,21796,2,5340,5,61757,6,0,433,58395,0


Converting to forward existential form...Done !
original formula: EG((AF(EX(TRUE)) + AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!(EX(TRUE)))) + !(EX(!(FALSE)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t63, t70, t71, t72, t73, t74, t75, t76, t77, t78, t...364
Using saturation style SCC detection
(forward)formula 0,1,2.98698,72348,1,0,204,271281,227,86,3116,203467,229
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 195/195 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 118 transition count 170
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 118 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 118 transition count 169
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 39 place count 106 transition count 153
Iterating global reduction 1 with 12 rules applied. Total rules applied 51 place count 106 transition count 153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 106 transition count 149
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 99 transition count 134
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 99 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 99 transition count 133
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 76 place count 93 transition count 126
Iterating global reduction 3 with 6 rules applied. Total rules applied 82 place count 93 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 84 place count 93 transition count 124
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 88 place count 89 transition count 120
Iterating global reduction 4 with 4 rules applied. Total rules applied 92 place count 89 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 94 place count 89 transition count 118
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 97 place count 86 transition count 115
Iterating global reduction 5 with 3 rules applied. Total rules applied 100 place count 86 transition count 115
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 102 place count 84 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 104 place count 84 transition count 107
Applied a total of 104 rules in 8 ms. Remains 84 /131 variables (removed 47) and now considering 107/195 (removed 88) transitions.
// Phase 1: matrix 107 rows 84 cols
[2025-05-30 01:34:28] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:34:28] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-05-30 01:34:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:34:28] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-30 01:34:28] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-05-30 01:34:28] [INFO ] Invariant cache hit.
[2025-05-30 01:34:28] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 123 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 106/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 229 constraints, problems are : Problem set: 0 solved, 106 unsolved in 24181 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30391ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 30400ms
Starting structural reductions in LTL mode, iteration 1 : 84/131 places, 107/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30818 ms. Remains : 84/131 places, 107/195 transitions.
[2025-05-30 01:34:59] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:34:59] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:34:59] [INFO ] Input system was already deterministic with 107 transitions.
[2025-05-30 01:34:59] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:34:59] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:34:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality2738995865666421412.gal : 3 ms
[2025-05-30 01:34:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality10482276169579495125.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2738995865666421412.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10482276169579495125.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,60573,0.712976,19056,2,5424,5,51815,6,0,443,44532,0


Converting to forward existential form...Done !
original formula: AF(EG(AX((l608>0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(!((l608>0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t48, t49, t50, t51, t52, t53, t69, t76, t77, t78, t...400
Using saturation style SCC detection
(forward)formula 0,0,4.19854,96208,1,0,392,391241,243,208,3097,384440,365
FORMULA DBSingleClientW-PT-d1m05-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 01:35:03] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:35:03] [INFO ] Flatten gal took : 11 ms
Total runtime 217978 ms.

BK_STOP 1748568903596

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m05.tgz
mv DBSingleClientW-PT-d1m05 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;