Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063300001.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-d0m04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063300001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 8.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K 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 119K 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-d0m04-CTLCardinality-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLCardinality-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLCardinality-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLCardinality-2023-15
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLCardinality-2025-00
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLCardinality-2025-01
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLCardinality-2025-02
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLCardinality-2025-03
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLCardinality-2025-04
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLCardinality-2025-05
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLCardinality-2025-06
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLCardinality-2025-07
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLCardinality-2025-08
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLCardinality-2025-09
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLCardinality-2025-10
FORMULA_NAME DBSingleClientW-PT-d0m04-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748550942874

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-d0m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-29 20:35:46] [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-29 20:35:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:35:46] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2025-05-29 20:35:46] [INFO ] Transformed 553 places.
[2025-05-29 20:35:46] [INFO ] Transformed 150 transitions.
[2025-05-29 20:35:46] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 414 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 38 ms.
Deduced a syphon composed of 444 places in 4 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 40 place count 80 transition count 100
Iterating global reduction 1 with 22 rules applied. Total rules applied 62 place count 80 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 80 transition count 99
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 71 place count 72 transition count 91
Iterating global reduction 2 with 8 rules applied. Total rules applied 79 place count 72 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 72 transition count 89
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 70 transition count 85
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 70 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 69 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 68 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 68 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 68 transition count 81
Applied a total of 91 rules in 91 ms. Remains 68 /109 variables (removed 41) and now considering 81/150 (removed 69) transitions.
// Phase 1: matrix 81 rows 68 cols
[2025-05-29 20:35:46] [INFO ] Computed 2 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:35:47] [INFO ] Implicit Places using invariants in 500 ms returned []
[2025-05-29 20:35:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:35:47] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-05-29 20:35:47] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2025-05-29 20:35:47] [INFO ] Invariant cache hit.
[2025-05-29 20:35:48] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/149 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 27/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:35:52] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:35:52] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 13 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/149 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:35:53] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:35:53] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:35:53] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:35:55] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 4 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/149 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/149 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 103 constraints, problems are : Problem set: 0 solved, 80 unsolved in 10130 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/149 variables, 68/76 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 27/103 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 80/183 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/149 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 183 constraints, problems are : Problem set: 0 solved, 80 unsolved in 10637 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21065ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 21088ms
Starting structural reductions in LTL mode, iteration 1 : 68/109 places, 81/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22289 ms. Remains : 68/109 places, 81/150 transitions.
Support contains 7 out of 68 places after structural reductions.
[2025-05-29 20:36:09] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2025-05-29 20:36:09] [INFO ] Flatten gal took : 45 ms
[2025-05-29 20:36:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 20:36:09] [INFO ] Flatten gal took : 20 ms
[2025-05-29 20:36:09] [INFO ] Input system was already deterministic with 81 transitions.
Support contains 2 out of 68 places (down from 7) after GAL structural reductions.
RANDOM walk for 40000 steps (9225 resets) in 1295 ms. (30 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (3977 resets) in 456 ms. (87 steps per ms) remains 1/1 properties
[2025-05-29 20:36:10] [INFO ] Invariant cache hit.
[2025-05-29 20:36:10] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/18 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/80 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/99 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/115 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/115 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:36:10] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/115 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/115 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 32/147 variables, 28/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/147 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/147 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 2/149 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/149 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/149 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/149 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/18 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/80 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 19/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 19/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 16/115 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/115 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/115 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/115 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 32/147 variables, 28/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/147 variables, 17/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/147 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/149 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/149 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/149 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/149 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 383ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 81/81 transitions.
Graph (complete) has 200 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 80
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 64 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 62 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 61 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 61 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 59 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 59 transition count 67
Applied a total of 21 rules in 38 ms. Remains 59 /68 variables (removed 9) and now considering 67/81 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 59/68 places, 67/81 transitions.
RANDOM walk for 40000 steps (9139 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (4157 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Probably explored full state space saw : 3672 states, properties seen :0
Probabilistic random walk after 8754 steps, saw 3672 distinct states, run finished after 47 ms. (steps per millisecond=186 ) properties seen :0
Explored full state space saw : 3694 states, properties seen :0
Exhaustive walk after 8792 steps, saw 3694 distinct states, run finished after 38 ms. (steps per millisecond=231 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 20:36:10] [INFO ] Flatten gal took : 15 ms
[2025-05-29 20:36:10] [INFO ] Flatten gal took : 17 ms
[2025-05-29 20:36:10] [INFO ] Input system was already deterministic with 81 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 220 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 81/81 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 64 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 64 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 61 transition count 71
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 58 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 58 transition count 64
Applied a total of 23 rules in 25 ms. Remains 58 /68 variables (removed 10) and now considering 64/81 (removed 17) transitions.
// Phase 1: matrix 64 rows 58 cols
[2025-05-29 20:36:10] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:36:10] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-29 20:36:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:36:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 20:36:11] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2025-05-29 20:36:11] [INFO ] Invariant cache hit.
[2025-05-29 20:36:11] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:36:12] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:36:12] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:36:13] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:36:13] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:36:13] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:36:14] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 6 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/122 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 86 constraints, problems are : Problem set: 0 solved, 63 unsolved in 5159 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/122 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 63/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 149 constraints, problems are : Problem set: 0 solved, 63 unsolved in 6924 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12164ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 12166ms
Starting structural reductions in LTL mode, iteration 1 : 58/68 places, 64/81 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12552 ms. Remains : 58/68 places, 64/81 transitions.
[2025-05-29 20:36:23] [INFO ] Flatten gal took : 8 ms
[2025-05-29 20:36:23] [INFO ] Flatten gal took : 7 ms
[2025-05-29 20:36:23] [INFO ] Input system was already deterministic with 64 transitions.
[2025-05-29 20:36:23] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:36:23] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:36:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality3666533386074477814.gal : 3 ms
[2025-05-29 20:36:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality946323387858058567.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/CTLCardinality3666533386074477814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality946323387858058567.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,3440,0.089423,6092,2,1503,5,8918,6,0,296,6384,0


Converting to forward existential form...Done !
original formula: AX(AX(FALSE))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(FALSE))] = FALSE
(forward)formula 0,0,0.091269,6092,1,0,7,8918,7,1,411,6384,2
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2025-01 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 : 68/68 places, 81/81 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 64 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 64 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 61 transition count 71
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 58 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 58 transition count 64
Applied a total of 23 rules in 12 ms. Remains 58 /68 variables (removed 10) and now considering 64/81 (removed 17) transitions.
[2025-05-29 20:36:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:36:23] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-05-29 20:36:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:36:23] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 20:36:23] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2025-05-29 20:36:23] [INFO ] Invariant cache hit.
[2025-05-29 20:36:23] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:36:25] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:36:25] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:36:25] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:36:25] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:36:25] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:36:27] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 4 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/122 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 86 constraints, problems are : Problem set: 0 solved, 63 unsolved in 4835 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/122 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 63/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 149 constraints, problems are : Problem set: 0 solved, 63 unsolved in 6252 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11135ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 11135ms
Starting structural reductions in LTL mode, iteration 1 : 58/68 places, 64/81 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11420 ms. Remains : 58/68 places, 64/81 transitions.
[2025-05-29 20:36:34] [INFO ] Flatten gal took : 9 ms
[2025-05-29 20:36:34] [INFO ] Flatten gal took : 9 ms
[2025-05-29 20:36:34] [INFO ] Input system was already deterministic with 64 transitions.
[2025-05-29 20:36:34] [INFO ] Flatten gal took : 9 ms
[2025-05-29 20:36:34] [INFO ] Flatten gal took : 10 ms
[2025-05-29 20:36:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality526659427734287508.gal : 4 ms
[2025-05-29 20:36:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality11855096671266659875.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/CTLCardinality526659427734287508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11855096671266659875.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3440,0.11212,6176,2,1503,5,8918,6,0,296,6384,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.114262,6176,1,0,6,8918,7,1,403,6384,1
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 81/81 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 65 transition count 76
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 65 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 62 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 61 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 61 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 61 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 60 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 59 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 59 transition count 65
Applied a total of 21 rules in 14 ms. Remains 59 /68 variables (removed 9) and now considering 65/81 (removed 16) transitions.
// Phase 1: matrix 65 rows 59 cols
[2025-05-29 20:36:35] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:36:35] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-05-29 20:36:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:36:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 20:36:35] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-05-29 20:36:35] [INFO ] Invariant cache hit.
[2025-05-29 20:36:35] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/124 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 81 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2556 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/124 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 64/145 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 145 constraints, problems are : Problem set: 0 solved, 64 unsolved in 6593 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9191ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 9193ms
Starting structural reductions in LTL mode, iteration 1 : 59/68 places, 65/81 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9573 ms. Remains : 59/68 places, 65/81 transitions.
[2025-05-29 20:36:44] [INFO ] Flatten gal took : 8 ms
[2025-05-29 20:36:44] [INFO ] Flatten gal took : 6 ms
[2025-05-29 20:36:44] [INFO ] Input system was already deterministic with 65 transitions.
[2025-05-29 20:36:44] [INFO ] Flatten gal took : 7 ms
[2025-05-29 20:36:44] [INFO ] Flatten gal took : 7 ms
[2025-05-29 20:36:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality13997119055488573361.gal : 2 ms
[2025-05-29 20:36:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality6344003790852025342.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/CTLCardinality13997119055488573361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6344003790852025342.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,3440,0.098788,6340,2,1433,5,9578,6,0,301,6551,0


Converting to forward existential form...Done !
original formula: EG(AX(AF(EX((p12>0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(EG(!(EX((p12>0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t5...291
Using saturation style SCC detection
(forward)formula 0,0,0.760951,22424,1,0,209,92614,158,103,2063,71903,229
FORMULA DBSingleClientW-PT-d0m04-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-05-29 20:36:45] [INFO ] Flatten gal took : 7 ms
[2025-05-29 20:36:45] [INFO ] Flatten gal took : 7 ms
Total runtime 60097 ms.

BK_STOP 1748551005630

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

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