About the Execution of ITS-Tools for DBSingleClientW-PT-d1m05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 454.688 | 208584.00 | 246502.00 | 587.50 | FTTFFFTFTFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r082-smll-177946993600147.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DBSingleClientW-PT-d1m05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600147
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 6.4K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 432K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779565540252
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202604301425
[2026-05-23 19:45:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 19:45:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 19:45:43] [INFO ] Load time of PNML (sax parser for PT used): 338 ms
[2026-05-23 19:45:43] [INFO ] Transformed 1440 places.
[2026-05-23 19:45:43] [INFO ] Transformed 672 transitions.
[2026-05-23 19:45:43] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 582 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1093 places in 13 ms
Reduce places removed 1093 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 327 transition count 594
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 191 place count 234 transition count 342
Iterating global reduction 1 with 93 rules applied. Total rules applied 284 place count 234 transition count 342
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 292 place count 234 transition count 334
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 362 place count 164 transition count 264
Iterating global reduction 2 with 70 rules applied. Total rules applied 432 place count 164 transition count 264
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 438 place count 164 transition count 258
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 475 place count 127 transition count 201
Iterating global reduction 3 with 37 rules applied. Total rules applied 512 place count 127 transition count 201
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 532 place count 127 transition count 181
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 541 place count 118 transition count 167
Iterating global reduction 4 with 9 rules applied. Total rules applied 550 place count 118 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 554 place count 118 transition count 163
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 560 place count 112 transition count 157
Iterating global reduction 5 with 6 rules applied. Total rules applied 566 place count 112 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 568 place count 112 transition count 155
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 573 place count 107 transition count 150
Iterating global reduction 6 with 5 rules applied. Total rules applied 578 place count 107 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 580 place count 107 transition count 148
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 581 place count 106 transition count 146
Iterating global reduction 7 with 1 rules applied. Total rules applied 582 place count 106 transition count 146
Applied a total of 582 rules in 177 ms. Remains 106 /347 variables (removed 241) and now considering 146/672 (removed 526) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8423166905532983392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10691639382674838020.kers'
[2026-05-23 19:45:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8423166905532983392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10691639382674838020.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 106 cols 471 entries
Finished phase 1 with 102 SingleSign rule and 2 generalized
[2026-05-23 19:45:43] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10691639382674838020.kers
Total runtime 2 ms.
[2026-05-23 19:45:44] [INFO ] Implicit Places using invariants in 463 ms returned []
[2026-05-23 19:45:44] [INFO ] Invariant cache hit.
[2026-05-23 19:45:44] [INFO ] State equation strengthened by 51 read => feed constraints.
[2026-05-23 19:45:44] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2026-05-23 19:45:44] [INFO ] Invariant cache hit.
[2026-05-23 19:45:44] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/251 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 51/158 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 7/166 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 7/173 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 173 constraints, problems are : Problem set: 0 solved, 145 unsolved in 24768 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 146/251 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 51/172 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 137/309 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 1/252 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 8/318 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 252/252 variables, and 318 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55345ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 55368ms
Starting structural reductions in LTL mode, iteration 1 : 106/347 places, 146/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56785 ms. Remains : 106/347 places, 146/672 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 146/146 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2026-05-23 19:46:40] [INFO ] Invariant cache hit.
[2026-05-23 19:46:40] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-23 19:46:40] [INFO ] Invariant cache hit.
[2026-05-23 19:46:40] [INFO ] State equation strengthened by 51 read => feed constraints.
[2026-05-23 19:46:40] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 520 ms. Remains : 106/106 places, 146/146 transitions.
Support contains 8 out of 106 places after structural reductions.
[2026-05-23 19:46:41] [INFO ] Flatten gal took : 55 ms
[2026-05-23 19:46:41] [INFO ] Flatten gal took : 28 ms
[2026-05-23 19:46:41] [INFO ] Input system was already deterministic with 146 transitions.
RANDOM walk for 40000 steps (9098 resets) in 2240 ms. (17 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40001 steps (3911 resets) in 981 ms. (40 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40001 steps (3968 resets) in 667 ms. (59 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40001 steps (3833 resets) in 202 ms. (197 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3906 resets) in 199 ms. (200 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3954 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3981 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3916 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
[2026-05-23 19:46:42] [INFO ] Invariant cache hit.
[2026-05-23 19:46:42] [INFO ] State equation strengthened by 51 read => feed constraints.
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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 39/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 30/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 111/186 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 8 (OVERLAPS) 66/252 variables, 31/124 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 35/159 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 159 constraints, problems are : Problem set: 1 solved, 4 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/44 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 31/75 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 111/186 variables, 75/77 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 16/93 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 2/95 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 66/252 variables, 31/126 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 35/161 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 2/163 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/252 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 163 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1152 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1621ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 769 ms.
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 146/146 transitions.
Graph (complete) has 336 edges and 106 vertex of which 105 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 144
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 103 transition count 142
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 103 transition count 142
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 101 transition count 137
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 101 transition count 137
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 99 transition count 135
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 99 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 99 transition count 134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 97 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 97 transition count 131
Applied a total of 20 rules in 39 ms. Remains 97 /106 variables (removed 9) and now considering 131/146 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 97/106 places, 131/146 transitions.
RANDOM walk for 40000 steps (9205 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3980 resets) in 117 ms. (339 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3988 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3921 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3864 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 16373 steps, run visited all 4 properties in 193 ms. (steps per millisecond=84 )
Probabilistic random walk after 16373 steps, saw 7628 distinct states, run finished after 201 ms. (steps per millisecond=81 ) properties seen :4
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 365 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1 U (p2||G(p1)))))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 146/146 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 101 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 101 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 101 transition count 138
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 97 transition count 131
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 97 transition count 131
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 93 transition count 125
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 93 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 93 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 91 transition count 120
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 90 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 90 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 90 transition count 118
Applied a total of 37 rules in 45 ms. Remains 90 /106 variables (removed 16) and now considering 118/146 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1598979416966038209.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10959309699364688599.kers'
[2026-05-23 19:46:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1598979416966038209.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10959309699364688599.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 118 rows 90 cols 379 entries
Finished phase 1 with 86 SingleSign rule and 2 generalized
[2026-05-23 19:46:45] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10959309699364688599.kers
Total runtime 4 ms.
[2026-05-23 19:46:45] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-23 19:46:46] [INFO ] Invariant cache hit.
[2026-05-23 19:46:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-23 19:46:46] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2026-05-23 19:46:46] [INFO ] Redundant transitions in 6 ms returned []
Running 117 sub problems to find dead transitions.
[2026-05-23 19:46:46] [INFO ] Invariant cache hit.
[2026-05-23 19:46:46] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/207 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 1/208 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 13 (OVERLAPS) 0/208 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 144 constraints, problems are : Problem set: 0 solved, 117 unsolved in 15366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 118/207 variables, 89/102 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 41/143 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 110/253 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 1/208 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 7/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 208/208 variables, and 261 constraints, problems are : Problem set: 0 solved, 117 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45536ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 45539ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/106 places, 118/146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46326 ms. Remains : 90/106 places, 118/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1 U (p2||G(p1)))))))'
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLCardinality-00
Product exploration explored 100000 steps with 23006 reset in 502 ms.
Stuttering criterion allowed to conclude after 16205 steps with 3705 reset in 55 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLCardinality-00 finished in 47364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 146/146 transitions.
Graph (complete) has 365 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 145
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 100 transition count 138
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 100 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 100 transition count 137
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 17 place count 96 transition count 130
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 96 transition count 130
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 25 place count 92 transition count 124
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 92 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 92 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 36 place count 88 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 88 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 87 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 87 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 87 transition count 109
Applied a total of 43 rules in 32 ms. Remains 87 /106 variables (removed 19) and now considering 109/146 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17274867228619485914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16649817941451798201.kers'
[2026-05-23 19:47:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17274867228619485914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16649817941451798201.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 87 cols 363 entries
Finished phase 1 with 83 SingleSign rule and 2 generalized
[2026-05-23 19:47:33] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16649817941451798201.kers
Total runtime 2 ms.
[2026-05-23 19:47:33] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-23 19:47:33] [INFO ] Invariant cache hit.
[2026-05-23 19:47:33] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-23 19:47:33] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2026-05-23 19:47:33] [INFO ] Redundant transitions in 4 ms returned []
Running 108 sub problems to find dead transitions.
[2026-05-23 19:47:33] [INFO ] Invariant cache hit.
[2026-05-23 19:47:33] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/196 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 121 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6194 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/196 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 108/229 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 229 constraints, problems are : Problem set: 0 solved, 108 unsolved in 18910 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25173ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 25175ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/106 places, 109/146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25764 ms. Remains : 87/106 places, 109/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLCardinality-05
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLCardinality-05 finished in 25833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 146/146 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 145
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 100 transition count 139
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 100 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 100 transition count 138
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 17 place count 96 transition count 128
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 96 transition count 128
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 25 place count 92 transition count 123
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 92 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 92 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 35 place count 88 transition count 111
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 88 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 88 transition count 110
Applied a total of 40 rules in 11 ms. Remains 88 /106 variables (removed 18) and now considering 110/146 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17522643834492968418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13959847502134697910.kers'
[2026-05-23 19:47:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17522643834492968418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13959847502134697910.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 88 cols 361 entries
Finished phase 1 with 84 SingleSign rule and 2 generalized
[2026-05-23 19:47:58] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13959847502134697910.kers
Total runtime 1 ms.
[2026-05-23 19:47:59] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-23 19:47:59] [INFO ] Invariant cache hit.
[2026-05-23 19:47:59] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-23 19:47:59] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2026-05-23 19:47:59] [INFO ] Invariant cache hit.
[2026-05-23 19:47:59] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5375 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 28072 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33514ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 33515ms
Starting structural reductions in LTL mode, iteration 1 : 88/106 places, 110/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34081 ms. Remains : 88/106 places, 110/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLCardinality-09
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLCardinality-09 finished in 34179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 146/146 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 145
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 101 transition count 140
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 101 transition count 140
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 97 transition count 130
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 97 transition count 130
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 93 transition count 125
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 93 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 93 transition count 123
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 89 transition count 118
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 89 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 88 transition count 116
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 88 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 88 transition count 115
Applied a total of 40 rules in 8 ms. Remains 88 /106 variables (removed 18) and now considering 115/146 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10958223384292389614.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16435123522467437065.kers'
[2026-05-23 19:48:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10958223384292389614.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16435123522467437065.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 115 rows 88 cols 370 entries
Finished phase 1 with 84 SingleSign rule and 2 generalized
[2026-05-23 19:48:33] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16435123522467437065.kers
Total runtime 1 ms.
[2026-05-23 19:48:33] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-23 19:48:33] [INFO ] Invariant cache hit.
[2026-05-23 19:48:33] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 19:48:33] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2026-05-23 19:48:33] [INFO ] Invariant cache hit.
[2026-05-23 19:48:33] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/203 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 40/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 7/137 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 139 constraints, problems are : Problem set: 0 solved, 114 unsolved in 11400 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/203 variables, 88/99 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 40/139 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 114/253 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 253 constraints, problems are : Problem set: 0 solved, 114 unsolved in 23597 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35077ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 35078ms
Starting structural reductions in LTL mode, iteration 1 : 88/106 places, 115/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35515 ms. Remains : 88/106 places, 115/146 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLCardinality-13
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLCardinality-13 finished in 35676 ms.
All properties solved by simple procedures.
Total runtime 206299 ms.
BK_STOP 1779565748836
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d1m05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r082-smll-177946993600147"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;
