About the Execution of ITS-Tools for DBSingleClientW-PT-d1m04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 523.628 | 557413.00 | 617694.00 | 1732.70 | FFTFTTFFFFTFFFFF | 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-177946993600140.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-d1m04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600140
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 8.4K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 6 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Mar 6 18:22 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-d1m04-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779564850985
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 19:34:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 19:34:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 19:34:14] [INFO ] Load time of PNML (sax parser for PT used): 335 ms
[2026-05-23 19:34:14] [INFO ] Transformed 1440 places.
[2026-05-23 19:34:14] [INFO ] Transformed 672 transitions.
[2026-05-23 19:34:14] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 563 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1093 places in 12 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 182 place count 245 transition count 413
Iterating global reduction 1 with 81 rules applied. Total rules applied 263 place count 245 transition count 413
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 279 place count 245 transition count 397
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 341 place count 183 transition count 335
Iterating global reduction 2 with 62 rules applied. Total rules applied 403 place count 183 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 404 place count 183 transition count 334
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 431 place count 156 transition count 296
Iterating global reduction 3 with 27 rules applied. Total rules applied 458 place count 156 transition count 296
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 486 place count 156 transition count 268
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 490 place count 152 transition count 262
Iterating global reduction 4 with 4 rules applied. Total rules applied 494 place count 152 transition count 262
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 496 place count 150 transition count 260
Iterating global reduction 4 with 2 rules applied. Total rules applied 498 place count 150 transition count 260
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 500 place count 148 transition count 258
Iterating global reduction 4 with 2 rules applied. Total rules applied 502 place count 148 transition count 258
Applied a total of 502 rules in 197 ms. Remains 148 /347 variables (removed 199) and now considering 258/672 (removed 414) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5907799968798865409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12163381596688986364.kers'
[2026-05-23 19:34:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5907799968798865409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12163381596688986364.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 258 rows 148 cols 775 entries
Finished phase 1 with 144 SingleSign rule and 2 generalized
[2026-05-23 19:34:14] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12163381596688986364.kers
Total runtime 4 ms.
[2026-05-23 19:34:15] [INFO ] Implicit Places using invariants in 673 ms returned []
[2026-05-23 19:34:15] [INFO ] Invariant cache hit.
[2026-05-23 19:34:15] [INFO ] State equation strengthened by 118 read => feed constraints.
[2026-05-23 19:34:16] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 1953 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2026-05-23 19:34:16] [INFO ] Invariant cache hit.
[2026-05-23 19:34:16] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/406 variables, 148/150 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 118/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/406 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 268 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/406 variables, 148/150 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 118/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 257/525 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 525 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60892ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 60923ms
Starting structural reductions in LTL mode, iteration 1 : 148/347 places, 258/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63157 ms. Remains : 148/347 places, 258/672 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 258/258 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2026-05-23 19:35:17] [INFO ] Invariant cache hit.
[2026-05-23 19:35:17] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-23 19:35:17] [INFO ] Invariant cache hit.
[2026-05-23 19:35:18] [INFO ] State equation strengthened by 118 read => feed constraints.
[2026-05-23 19:35:18] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1025 ms. Remains : 148/148 places, 258/258 transitions.
Support contains 34 out of 148 places after structural reductions.
[2026-05-23 19:35:19] [INFO ] Flatten gal took : 97 ms
[2026-05-23 19:35:19] [INFO ] Flatten gal took : 48 ms
[2026-05-23 19:35:19] [INFO ] Input system was already deterministic with 258 transitions.
Reduction of identical properties reduced properties to check from 34 to 30
RANDOM walk for 40000 steps (9157 resets) in 4302 ms. (9 steps per ms) remains 24/30 properties
BEST_FIRST walk for 4002 steps (203 resets) in 66 ms. (59 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (181 resets) in 57 ms. (69 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (413 resets) in 64 ms. (61 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (184 resets) in 51 ms. (76 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (198 resets) in 44 ms. (88 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (172 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (189 resets) in 53 ms. (74 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (193 resets) in 42 ms. (93 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (199 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (395 resets) in 32 ms. (121 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4001 steps (173 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (401 resets) in 50 ms. (78 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (177 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (393 resets) in 41 ms. (95 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (202 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (180 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (186 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (185 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (366 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (204 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (423 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (187 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (403 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (401 resets) in 43 ms. (90 steps per ms) remains 23/23 properties
[2026-05-23 19:35:21] [INFO ] Invariant cache hit.
[2026-05-23 19:35:21] [INFO ] State equation strengthened by 118 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 48/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 36/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 221/332 variables, 111/115 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 81/196 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 74/406 variables, 37/233 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 37/270 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/406 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 270 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 48/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 36/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 221/332 variables, 111/119 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 81/200 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 74/406 variables, 37/238 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 37/275 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 22/297 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 297 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 118/118 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10085ms problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 258/258 transitions.
Graph (complete) has 503 edges and 148 vertex of which 147 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 147 transition count 254
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 8 place count 144 transition count 248
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 144 transition count 248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 142 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 142 transition count 246
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 142 transition count 245
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 140 transition count 242
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 140 transition count 242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 140 transition count 240
Applied a total of 22 rules in 89 ms. Remains 140 /148 variables (removed 8) and now considering 240/258 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 140/148 places, 240/258 transitions.
RANDOM walk for 40000 steps (9152 resets) in 1162 ms. (34 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (176 resets) in 61 ms. (64 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (200 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (204 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (163 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (171 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (200 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (171 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (190 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (385 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (188 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (416 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (187 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (413 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (172 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (174 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (198 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (178 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (388 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (181 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (424 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (173 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (378 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (390 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
Finished probabilistic random walk after 64059 steps, run visited all 23 properties in 302 ms. (steps per millisecond=212 )
Probabilistic random walk after 64059 steps, saw 25587 distinct states, run finished after 308 ms. (steps per millisecond=207 ) properties seen :23
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 6 stabilizing places and 25 stable transitions
Graph (complete) has 551 edges and 148 vertex of which 147 are kept as prefixes of interest. Removing 1 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)))'
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 258/258 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 128 transition count 198
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 128 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 128 transition count 196
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 112 transition count 171
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 112 transition count 171
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 84 place count 112 transition count 161
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 97 place count 99 transition count 138
Iterating global reduction 2 with 13 rules applied. Total rules applied 110 place count 99 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 114 place count 99 transition count 134
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 122 place count 91 transition count 121
Iterating global reduction 3 with 8 rules applied. Total rules applied 130 place count 91 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 133 place count 91 transition count 118
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 138 place count 86 transition count 113
Iterating global reduction 4 with 5 rules applied. Total rules applied 143 place count 86 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 146 place count 86 transition count 110
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 148 place count 84 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 150 place count 84 transition count 107
Applied a total of 150 rules in 50 ms. Remains 84 /148 variables (removed 64) and now considering 107/258 (removed 151) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7558848043571337556.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9560147386359382526.kers'
[2026-05-23 19:35:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7558848043571337556.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9560147386359382526.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 107 rows 84 cols 344 entries
Finished phase 1 with 80 SingleSign rule and 2 generalized
[2026-05-23 19:35:32] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9560147386359382526.kers
Total runtime 3 ms.
[2026-05-23 19:35:32] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-23 19:35:32] [INFO ] Invariant cache hit.
[2026-05-23 19:35:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-23 19:35:33] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2026-05-23 19:35:33] [INFO ] Redundant transitions in 4 ms returned []
Running 106 sub problems to find dead transitions.
[2026-05-23 19:35:33] [INFO ] Invariant cache hit.
[2026-05-23 19:35:33] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 123 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 106/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 229 constraints, problems are : Problem set: 0 solved, 106 unsolved in 20268 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25522ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 25523ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/148 places, 107/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26033 ms. Remains : 84/148 places, 107/258 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)))'
Stuttering acceptance computed with spot in 376 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-00
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 4 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-00 finished in 26542 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(((G(p0) U X((F(!p2)&&p1)))&&F(G(p3)))))'
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 258/258 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 129 transition count 201
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 129 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 129 transition count 198
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 56 place count 114 transition count 174
Iterating global reduction 1 with 15 rules applied. Total rules applied 71 place count 114 transition count 174
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 81 place count 114 transition count 164
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 93 place count 102 transition count 143
Iterating global reduction 2 with 12 rules applied. Total rules applied 105 place count 102 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 109 place count 102 transition count 139
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 116 place count 95 transition count 127
Iterating global reduction 3 with 7 rules applied. Total rules applied 123 place count 95 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 126 place count 95 transition count 124
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 130 place count 91 transition count 120
Iterating global reduction 4 with 4 rules applied. Total rules applied 134 place count 91 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 135 place count 91 transition count 119
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 137 place count 89 transition count 116
Iterating global reduction 5 with 2 rules applied. Total rules applied 139 place count 89 transition count 116
Applied a total of 139 rules in 23 ms. Remains 89 /148 variables (removed 59) and now considering 116/258 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1212216379338941379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8523582544279020180.kers'
[2026-05-23 19:35:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1212216379338941379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8523582544279020180.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 89 cols 371 entries
Finished phase 1 with 85 SingleSign rule and 2 generalized
[2026-05-23 19:35:59] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8523582544279020180.kers
Total runtime 2 ms.
[2026-05-23 19:35:59] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-23 19:35:59] [INFO ] Invariant cache hit.
[2026-05-23 19:35:59] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-23 19:35:59] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2026-05-23 19:35:59] [INFO ] Invariant cache hit.
[2026-05-23 19:35:59] [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, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 137 constraints, problems are : Problem set: 0 solved, 115 unsolved in 11139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/205 variables, 89/96 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 41/137 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 115/252 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 252 constraints, problems are : Problem set: 0 solved, 115 unsolved in 24430 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35628ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 35631ms
Starting structural reductions in LTL mode, iteration 1 : 89/148 places, 116/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36063 ms. Remains : 89/148 places, 116/258 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(((G(p0) U X((F(!p2)&&p1)))&&F(G(p3)))))'
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p1) (NOT p3) p2), (OR (NOT p3) (NOT p1) p2), (OR (NOT p1) p2), (NOT p3), (OR (NOT p1) p2), true, p2, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-01 finished in 36516 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(G((p0||X(X(X((F(p2)&&p1))))))))'
Support contains 3 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 258/258 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 129 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 129 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 129 transition count 197
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 54 place count 115 transition count 174
Iterating global reduction 1 with 14 rules applied. Total rules applied 68 place count 115 transition count 174
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 77 place count 115 transition count 165
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 88 place count 104 transition count 145
Iterating global reduction 2 with 11 rules applied. Total rules applied 99 place count 104 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 104 transition count 143
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 108 place count 97 transition count 131
Iterating global reduction 3 with 7 rules applied. Total rules applied 115 place count 97 transition count 131
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 120 place count 97 transition count 126
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 124 place count 93 transition count 122
Iterating global reduction 4 with 4 rules applied. Total rules applied 128 place count 93 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 129 place count 93 transition count 121
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 131 place count 91 transition count 118
Iterating global reduction 5 with 2 rules applied. Total rules applied 133 place count 91 transition count 118
Applied a total of 133 rules in 25 ms. Remains 91 /148 variables (removed 57) and now considering 118/258 (removed 140) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15229341498532669155.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2962077874309132878.kers'
[2026-05-23 19:36:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15229341498532669155.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2962077874309132878.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 118 rows 91 cols 393 entries
Finished phase 1 with 87 SingleSign rule and 2 generalized
[2026-05-23 19:36:35] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2962077874309132878.kers
Total runtime 1 ms.
[2026-05-23 19:36:36] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-23 19:36:36] [INFO ] Invariant cache hit.
[2026-05-23 19:36:36] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-23 19:36:36] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2026-05-23 19:36:36] [INFO ] Invariant cache hit.
[2026-05-23 19:36:36] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/209 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 35/128 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/209 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 128 constraints, problems are : Problem set: 0 solved, 117 unsolved in 7111 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 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/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/209 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 35/128 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 117/245 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 245 constraints, problems are : Problem set: 0 solved, 117 unsolved in 21387 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28589ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 28591ms
Starting structural reductions in LTL mode, iteration 1 : 91/148 places, 118/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29186 ms. Remains : 91/148 places, 118/258 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(G((X(X(X((F(p1)&&p0))))||p2))))'
Stuttering acceptance computed with spot in 479 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-03
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-03 finished in 29725 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(p0)||X(X(F(p1)))))'
Support contains 3 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 258/258 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 129 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 129 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 129 transition count 197
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 54 place count 115 transition count 174
Iterating global reduction 1 with 14 rules applied. Total rules applied 68 place count 115 transition count 174
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 77 place count 115 transition count 165
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 88 place count 104 transition count 146
Iterating global reduction 2 with 11 rules applied. Total rules applied 99 place count 104 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 104 transition count 144
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 107 place count 98 transition count 133
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 98 transition count 133
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 120 place count 98 transition count 126
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 123 place count 95 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 126 place count 95 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 128 place count 93 transition count 120
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 93 transition count 120
Applied a total of 130 rules in 14 ms. Remains 93 /148 variables (removed 55) and now considering 120/258 (removed 138) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4381972316157150886.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5491325471041481688.kers'
[2026-05-23 19:37:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4381972316157150886.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5491325471041481688.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 120 rows 93 cols 393 entries
Finished phase 1 with 89 SingleSign rule and 2 generalized
[2026-05-23 19:37:05] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5491325471041481688.kers
Total runtime 3 ms.
[2026-05-23 19:37:05] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-23 19:37:05] [INFO ] Invariant cache hit.
[2026-05-23 19:37:05] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-23 19:37:06] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2026-05-23 19:37:06] [INFO ] Invariant cache hit.
[2026-05-23 19:37:06] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/213 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 39/134 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 134 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7379 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/213 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 39/134 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 119/253 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/213 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 253 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37430ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 37430ms
Starting structural reductions in LTL mode, iteration 1 : 93/148 places, 120/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38070 ms. Remains : 93/148 places, 120/258 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(p0)||X(X(F(p1)))))'
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 409 ms.
Product exploration explored 100000 steps with 33333 reset in 319 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 317 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 19 ms. Proved property starting from automaton with 5 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 30 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-04 finished in 39044 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((!p0 U (p1||G(!p0)))))'
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 258/258 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 128 transition count 196
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 128 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 128 transition count 194
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 114 transition count 173
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 114 transition count 173
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 77 place count 114 transition count 166
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 88 place count 103 transition count 146
Iterating global reduction 2 with 11 rules applied. Total rules applied 99 place count 103 transition count 146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 103 place count 103 transition count 142
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 109 place count 97 transition count 132
Iterating global reduction 3 with 6 rules applied. Total rules applied 115 place count 97 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 117 place count 97 transition count 130
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 121 place count 93 transition count 126
Iterating global reduction 4 with 4 rules applied. Total rules applied 125 place count 93 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 128 place count 93 transition count 123
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 129 place count 92 transition count 122
Iterating global reduction 5 with 1 rules applied. Total rules applied 130 place count 92 transition count 122
Applied a total of 130 rules in 11 ms. Remains 92 /148 variables (removed 56) and now considering 122/258 (removed 136) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7133015589966231738.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9322595991541245745.kers'
[2026-05-23 19:37:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7133015589966231738.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9322595991541245745.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 92 cols 392 entries
Finished phase 1 with 88 SingleSign rule and 2 generalized
[2026-05-23 19:37:44] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9322595991541245745.kers
Total runtime 2 ms.
[2026-05-23 19:37:44] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-23 19:37:44] [INFO ] Invariant cache hit.
[2026-05-23 19:37:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 19:37:45] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2026-05-23 19:37:45] [INFO ] Invariant cache hit.
[2026-05-23 19:37:45] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/214 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 42/136 constraints. Problems are: Problem set: 0 solved, 121 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 136 constraints, problems are : Problem set: 0 solved, 121 unsolved in 8663 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/214 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 42/136 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 121/257 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 257 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38712ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 38716ms
Starting structural reductions in LTL mode, iteration 1 : 92/148 places, 122/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39253 ms. Remains : 92/148 places, 122/258 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((!p0 U (G(!p0)||p1))))'
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 251 ms.
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 314 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 12 ms. Proved property starting from automaton with 3 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 15 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-05 finished in 39891 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' '!(((p0||((p1||X(X(!p2))) U p3)) U X(p4)))'
Support contains 7 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 258/258 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 132 transition count 214
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 132 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 132 transition count 211
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 49 place count 118 transition count 189
Iterating global reduction 1 with 14 rules applied. Total rules applied 63 place count 118 transition count 189
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 72 place count 118 transition count 180
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 83 place count 107 transition count 164
Iterating global reduction 2 with 11 rules applied. Total rules applied 94 place count 107 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 98 place count 107 transition count 160
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 105 place count 100 transition count 149
Iterating global reduction 3 with 7 rules applied. Total rules applied 112 place count 100 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 114 place count 100 transition count 147
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 119 place count 95 transition count 142
Iterating global reduction 4 with 5 rules applied. Total rules applied 124 place count 95 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 127 place count 95 transition count 139
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 129 place count 93 transition count 136
Iterating global reduction 5 with 2 rules applied. Total rules applied 131 place count 93 transition count 136
Applied a total of 131 rules in 11 ms. Remains 93 /148 variables (removed 55) and now considering 136/258 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17912638258777571177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17441607752722870759.kers'
[2026-05-23 19:38:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17912638258777571177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17441607752722870759.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 136 rows 93 cols 410 entries
Finished phase 1 with 89 SingleSign rule and 2 generalized
[2026-05-23 19:38:24] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17441607752722870759.kers
Total runtime 2 ms.
[2026-05-23 19:38:24] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-23 19:38:24] [INFO ] Invariant cache hit.
[2026-05-23 19:38:24] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-23 19:38:25] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2026-05-23 19:38:25] [INFO ] Invariant cache hit.
[2026-05-23 19:38:25] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 136/229 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 60/155 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/229 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 161 constraints, problems are : Problem set: 0 solved, 135 unsolved in 16380 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 136/229 variables, 93/101 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 60/161 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 135/296 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/229 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 296 constraints, problems are : Problem set: 0 solved, 135 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46471ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 46475ms
Starting structural reductions in LTL mode, iteration 1 : 93/148 places, 136/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47181 ms. Remains : 93/148 places, 136/258 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' '!(((((p0||X(X(!p1))) U p2)||p3) U X(p4)))'
Stuttering acceptance computed with spot in 291 ms :[(NOT p4), (AND (NOT p4) p1), (AND (NOT p2) (NOT p4)), (NOT p4), p1, true, p1, (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-06
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-06 finished in 47521 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((((p1 U X(p2))&&p0) U X(X(p3)))))'
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 258/258 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 129 transition count 197
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 129 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 129 transition count 195
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 53 place count 116 transition count 175
Iterating global reduction 1 with 13 rules applied. Total rules applied 66 place count 116 transition count 175
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 72 place count 116 transition count 169
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 83 place count 105 transition count 153
Iterating global reduction 2 with 11 rules applied. Total rules applied 94 place count 105 transition count 153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 98 place count 105 transition count 149
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 104 place count 99 transition count 139
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 99 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 99 transition count 137
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 116 place count 95 transition count 133
Iterating global reduction 4 with 4 rules applied. Total rules applied 120 place count 95 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 95 transition count 132
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 123 place count 93 transition count 129
Iterating global reduction 5 with 2 rules applied. Total rules applied 125 place count 93 transition count 129
Applied a total of 125 rules in 18 ms. Remains 93 /148 variables (removed 55) and now considering 129/258 (removed 129) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11552601825430419111.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14071147332278746710.kers'
[2026-05-23 19:39:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11552601825430419111.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14071147332278746710.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 129 rows 93 cols 408 entries
Finished phase 1 with 89 SingleSign rule and 2 generalized
[2026-05-23 19:39:12] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14071147332278746710.kers
Total runtime 1 ms.
[2026-05-23 19:39:12] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-23 19:39:12] [INFO ] Invariant cache hit.
[2026-05-23 19:39:12] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-23 19:39:12] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2026-05-23 19:39:12] [INFO ] Invariant cache hit.
[2026-05-23 19:39:12] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/222 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 48/143 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/222 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (OVERLAPS) 0/222 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 149 constraints, problems are : Problem set: 0 solved, 128 unsolved in 15153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/222 variables, 93/101 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 48/149 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 128/277 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 277 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45206ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 45206ms
Starting structural reductions in LTL mode, iteration 1 : 93/148 places, 129/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45703 ms. Remains : 93/148 places, 129/258 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((((p1 U X(p2))&&p0) U X(X(p3)))))'
Stuttering acceptance computed with spot in 602 ms :[(NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), true, (NOT p3), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-07 finished in 46355 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(G(p0)))'
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 258/258 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 127 transition count 191
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 127 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 127 transition count 189
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 111 transition count 164
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 111 transition count 164
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 85 place count 111 transition count 155
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 98 place count 98 transition count 132
Iterating global reduction 2 with 13 rules applied. Total rules applied 111 place count 98 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 115 place count 98 transition count 128
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 123 place count 90 transition count 115
Iterating global reduction 3 with 8 rules applied. Total rules applied 131 place count 90 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 134 place count 90 transition count 112
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 138 place count 86 transition count 108
Iterating global reduction 4 with 4 rules applied. Total rules applied 142 place count 86 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 144 place count 86 transition count 106
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 146 place count 84 transition count 103
Iterating global reduction 5 with 2 rules applied. Total rules applied 148 place count 84 transition count 103
Applied a total of 148 rules in 41 ms. Remains 84 /148 variables (removed 64) and now considering 103/258 (removed 155) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7002739404605636251.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15199263041172474585.kers'
[2026-05-23 19:39:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7002739404605636251.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15199263041172474585.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 103 rows 84 cols 341 entries
Finished phase 1 with 80 SingleSign rule and 2 generalized
[2026-05-23 19:39:58] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15199263041172474585.kers
Total runtime 3 ms.
[2026-05-23 19:39:58] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-23 19:39:58] [INFO ] Invariant cache hit.
[2026-05-23 19:39:58] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-23 19:39:58] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2026-05-23 19:39:58] [INFO ] Redundant transitions in 4 ms returned []
Running 102 sub problems to find dead transitions.
[2026-05-23 19:39:58] [INFO ] Invariant cache hit.
[2026-05-23 19:39:58] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/187 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 31/117 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/187 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 123 constraints, problems are : Problem set: 0 solved, 102 unsolved in 10657 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 103/187 variables, 84/92 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 31/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 102/225 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/187 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 225 constraints, problems are : Problem set: 0 solved, 102 unsolved in 21176 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31879ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 31880ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/148 places, 103/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32478 ms. Remains : 84/148 places, 103/258 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(G(p0)))'
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-08
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-08 finished in 32549 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)&&F(G(p1)))))'
Support contains 3 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 258/258 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 128 transition count 198
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 128 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 128 transition count 196
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 112 transition count 171
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 112 transition count 171
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 84 place count 112 transition count 161
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 97 place count 99 transition count 138
Iterating global reduction 2 with 13 rules applied. Total rules applied 110 place count 99 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 114 place count 99 transition count 134
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 122 place count 91 transition count 121
Iterating global reduction 3 with 8 rules applied. Total rules applied 130 place count 91 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 133 place count 91 transition count 118
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 138 place count 86 transition count 113
Iterating global reduction 4 with 5 rules applied. Total rules applied 143 place count 86 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 146 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 147 place count 85 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 85 transition count 109
Applied a total of 148 rules in 21 ms. Remains 85 /148 variables (removed 63) and now considering 109/258 (removed 149) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5109230154254592029.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2798636880154712287.kers'
[2026-05-23 19:40:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5109230154254592029.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2798636880154712287.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 85 cols 347 entries
Finished phase 1 with 81 SingleSign rule and 2 generalized
[2026-05-23 19:40:30] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2798636880154712287.kers
Total runtime 1 ms.
[2026-05-23 19:40:31] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-23 19:40:31] [INFO ] Invariant cache hit.
[2026-05-23 19:40:31] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-23 19:40:31] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2026-05-23 19:40:31] [INFO ] Redundant transitions in 5 ms returned []
Running 108 sub problems to find dead transitions.
[2026-05-23 19:40:31] [INFO ] Invariant cache hit.
[2026-05-23 19:40:31] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/194 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 39/126 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 134 constraints, problems are : Problem set: 0 solved, 108 unsolved in 11556 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 8/8 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/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/194 variables, 85/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 39/134 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 108/242 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 242 constraints, problems are : Problem set: 0 solved, 108 unsolved in 19840 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31446ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 31446ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/148 places, 109/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31917 ms. Remains : 85/148 places, 109/258 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-09
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-09 finished in 32041 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(X(((X(X(G(p0)))&&F(p1)) U !p2))))'
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 258/258 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 129 transition count 197
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 129 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 129 transition count 195
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 54 place count 115 transition count 173
Iterating global reduction 1 with 14 rules applied. Total rules applied 68 place count 115 transition count 173
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 76 place count 115 transition count 165
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 87 place count 104 transition count 145
Iterating global reduction 2 with 11 rules applied. Total rules applied 98 place count 104 transition count 145
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 102 place count 104 transition count 141
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 107 place count 99 transition count 135
Iterating global reduction 3 with 5 rules applied. Total rules applied 112 place count 99 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 114 place count 99 transition count 133
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 117 place count 96 transition count 130
Iterating global reduction 4 with 3 rules applied. Total rules applied 120 place count 96 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 96 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 122 place count 95 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 123 place count 95 transition count 127
Applied a total of 123 rules in 8 ms. Remains 95 /148 variables (removed 53) and now considering 127/258 (removed 131) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8153077832790588426.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4816765319715933787.kers'
[2026-05-23 19:41:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8153077832790588426.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4816765319715933787.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 95 cols 411 entries
Finished phase 1 with 91 SingleSign rule and 2 generalized
[2026-05-23 19:41:02] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4816765319715933787.kers
Total runtime 1 ms.
[2026-05-23 19:41:03] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-23 19:41:03] [INFO ] Invariant cache hit.
[2026-05-23 19:41:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-23 19:41:03] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2026-05-23 19:41:03] [INFO ] Invariant cache hit.
[2026-05-23 19:41:03] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/222 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 43/140 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 141 constraints, problems are : Problem set: 0 solved, 126 unsolved in 11945 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 127/222 variables, 95/98 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 43/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 126/267 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 267 constraints, problems are : Problem set: 0 solved, 126 unsolved in 25058 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37081ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 37082ms
Starting structural reductions in LTL mode, iteration 1 : 95/148 places, 127/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37667 ms. Remains : 95/148 places, 127/258 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(X(((X(X(G(p0)))&&F(p1)) U !p2))))'
Stuttering acceptance computed with spot in 235 ms :[p2, p2, p2, (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 182 ms.
Product exploration explored 100000 steps with 33333 reset in 274 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 327 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 18 ms. Proved property starting from automaton with 7 states, 10 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-10 finished in 38418 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(p1)&&p0) U X((p2||X(G(!p2))))))'
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 258/258 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 129 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 129 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 129 transition count 197
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 55 place count 114 transition count 175
Iterating global reduction 1 with 15 rules applied. Total rules applied 70 place count 114 transition count 175
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 80 place count 114 transition count 165
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 92 place count 102 transition count 143
Iterating global reduction 2 with 12 rules applied. Total rules applied 104 place count 102 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 108 place count 102 transition count 139
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 115 place count 95 transition count 127
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 95 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 125 place count 95 transition count 124
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 129 place count 91 transition count 120
Iterating global reduction 4 with 4 rules applied. Total rules applied 133 place count 91 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 136 place count 91 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 137 place count 90 transition count 116
Iterating global reduction 5 with 1 rules applied. Total rules applied 138 place count 90 transition count 116
Applied a total of 138 rules in 11 ms. Remains 90 /148 variables (removed 58) and now considering 116/258 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2414429196332267009.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18169214410331200302.kers'
[2026-05-23 19:41:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2414429196332267009.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18169214410331200302.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 90 cols 373 entries
Finished phase 1 with 86 SingleSign rule and 2 generalized
[2026-05-23 19:41:41] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18169214410331200302.kers
Total runtime 1 ms.
[2026-05-23 19:41:41] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-23 19:41:41] [INFO ] Invariant cache hit.
[2026-05-23 19:41:41] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 19:41:42] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2026-05-23 19:41:42] [INFO ] Invariant cache hit.
[2026-05-23 19:41:42] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/206 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 132 constraints, problems are : Problem set: 0 solved, 115 unsolved in 7488 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/206 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 115/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 247 constraints, problems are : Problem set: 0 solved, 115 unsolved in 27360 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34911ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 34912ms
Starting structural reductions in LTL mode, iteration 1 : 90/148 places, 116/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35612 ms. Remains : 90/148 places, 116/258 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(p1)&&p0) U X((X(G(!p2))||p2))))'
Stuttering acceptance computed with spot in 301 ms :[false, false, false, p2, true, (AND p2 (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-13
Product exploration explored 100000 steps with 23044 reset in 383 ms.
Product exploration explored 100000 steps with 23011 reset in 424 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 304 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge based reduction with 17 factoid took 96 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 9 states, 24 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (9188 resets) in 1300 ms. (30 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (3880 resets) in 261 ms. (152 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (3913 resets) in 262 ms. (152 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1935 resets) in 269 ms. (148 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1912 resets) in 218 ms. (182 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1917 resets) in 203 ms. (196 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1877 resets) in 649 ms. (61 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1882 resets) in 189 ms. (210 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1898 resets) in 97 ms. (408 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (4038 resets) in 104 ms. (380 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1874 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1906 resets) in 125 ms. (317 steps per ms) remains 11/11 properties
Probably explored full state space saw : 10312 states, properties seen :6
Probabilistic random walk after 24936 steps, saw 10312 distinct states, run finished after 251 ms. (steps per millisecond=99 ) properties seen :6
Explored full state space saw : 10360 states, properties seen :0
Exhaustive walk after 25046 steps, saw 10360 distinct states, run finished after 225 ms. (steps per millisecond=111 ) properties seen :0
Found 5 invariant AP formulas.
Negative knowledge disproves property using: (G (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 22 factoid took 69 ms. Proved property starting from automaton with 9 states, 24 edges and 3 AP (stutter insensitive
Knowledge-based reduction took 1853 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-13 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-13 finished in 38619 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 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 258/258 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 128 transition count 196
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 128 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 128 transition count 194
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 57 place count 113 transition count 170
Iterating global reduction 1 with 15 rules applied. Total rules applied 72 place count 113 transition count 170
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 81 place count 113 transition count 161
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 92 place count 102 transition count 140
Iterating global reduction 2 with 11 rules applied. Total rules applied 103 place count 102 transition count 140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 107 place count 102 transition count 136
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 114 place count 95 transition count 127
Iterating global reduction 3 with 7 rules applied. Total rules applied 121 place count 95 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 124 place count 95 transition count 124
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 128 place count 91 transition count 120
Iterating global reduction 4 with 4 rules applied. Total rules applied 132 place count 91 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 135 place count 91 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 90 transition count 115
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 90 transition count 115
Applied a total of 137 rules in 27 ms. Remains 90 /148 variables (removed 58) and now considering 115/258 (removed 143) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1789484757334268065.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3831236377195916779.kers'
[2026-05-23 19:42:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1789484757334268065.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3831236377195916779.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 115 rows 90 cols 374 entries
Finished phase 1 with 86 SingleSign rule and 2 generalized
[2026-05-23 19:42:20] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3831236377195916779.kers
Total runtime 1 ms.
[2026-05-23 19:42:20] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-23 19:42:20] [INFO ] Invariant cache hit.
[2026-05-23 19:42:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 19:42:20] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2026-05-23 19:42:20] [INFO ] Redundant transitions in 3 ms returned []
Running 114 sub problems to find dead transitions.
[2026-05-23 19:42:20] [INFO ] Invariant cache hit.
[2026-05-23 19:42:20] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/205 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 130 constraints, problems are : Problem set: 0 solved, 114 unsolved in 6758 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 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/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/205 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 114/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 244 constraints, problems are : Problem set: 0 solved, 114 unsolved in 21148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27955ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 27969ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/148 places, 115/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28493 ms. Remains : 90/148 places, 115/258 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 34 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-14
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-14 finished in 28556 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 U p1)&&X(!p1))))'
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 258/258 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 129 transition count 193
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 129 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 129 transition count 191
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 54 place count 115 transition count 172
Iterating global reduction 1 with 14 rules applied. Total rules applied 68 place count 115 transition count 172
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 76 place count 115 transition count 164
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 87 place count 104 transition count 148
Iterating global reduction 2 with 11 rules applied. Total rules applied 98 place count 104 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 102 place count 104 transition count 144
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 109 place count 97 transition count 132
Iterating global reduction 3 with 7 rules applied. Total rules applied 116 place count 97 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 97 transition count 130
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 123 place count 92 transition count 125
Iterating global reduction 4 with 5 rules applied. Total rules applied 128 place count 92 transition count 125
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 131 place count 92 transition count 122
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 133 place count 90 transition count 119
Iterating global reduction 5 with 2 rules applied. Total rules applied 135 place count 90 transition count 119
Applied a total of 135 rules in 9 ms. Remains 90 /148 variables (removed 58) and now considering 119/258 (removed 139) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5841117955491095945.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6947078816360889313.kers'
[2026-05-23 19:42:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5841117955491095945.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6947078816360889313.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 119 rows 90 cols 388 entries
Finished phase 1 with 86 SingleSign rule and 2 generalized
[2026-05-23 19:42:48] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6947078816360889313.kers
Total runtime 1 ms.
[2026-05-23 19:42:48] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-23 19:42:48] [INFO ] Invariant cache hit.
[2026-05-23 19:42:48] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-23 19:42:48] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2026-05-23 19:42:48] [INFO ] Invariant cache hit.
[2026-05-23 19:42:48] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/209 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 39/131 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/209 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 0/209 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 140 constraints, problems are : Problem set: 0 solved, 118 unsolved in 15182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (OVERLAPS) 119/209 variables, 90/101 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 118/258 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 0/209 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 258 constraints, problems are : Problem set: 0 solved, 118 unsolved in 24068 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39295ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 39296ms
Starting structural reductions in LTL mode, iteration 1 : 90/148 places, 119/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39685 ms. Remains : 90/148 places, 119/258 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 U p1)&&X(!p1))))'
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p1), p1]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-15 finished in 39824 ms.
All properties solved by simple procedures.
Total runtime 554820 ms.
BK_STOP 1779565408398
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-d1m04"
export BK_EXAMINATION="LTLFireability"
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-d1m04, examination is LTLFireability"
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-177946993600140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m04.tgz
mv DBSingleClientW-PT-d1m04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;