About the Execution of ITS-Tools for DBSingleClientW-PT-d1m05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 624.371 | 492987.00 | 556465.00 | 1360.00 | FFFFFFTTTFTFFFFF | 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-177946993600148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DBSingleClientW-PT-d1m05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600148
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 6.4K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 08:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 432K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779565762187
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-d1m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 19:49:24] [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:49:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 19:49:25] [INFO ] Load time of PNML (sax parser for PT used): 296 ms
[2026-05-23 19:49:25] [INFO ] Transformed 1440 places.
[2026-05-23 19:49:25] [INFO ] Transformed 672 transitions.
[2026-05-23 19:49:25] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 483 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1093 places in 12 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 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 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 183 place count 244 transition count 422
Iterating global reduction 1 with 82 rules applied. Total rules applied 265 place count 244 transition count 422
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 289 place count 244 transition count 398
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 351 place count 182 transition count 336
Iterating global reduction 2 with 62 rules applied. Total rules applied 413 place count 182 transition count 336
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 416 place count 182 transition count 333
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 441 place count 157 transition count 299
Iterating global reduction 3 with 25 rules applied. Total rules applied 466 place count 157 transition count 299
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 490 place count 157 transition count 275
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 493 place count 154 transition count 270
Iterating global reduction 4 with 3 rules applied. Total rules applied 496 place count 154 transition count 270
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 497 place count 153 transition count 269
Iterating global reduction 4 with 1 rules applied. Total rules applied 498 place count 153 transition count 269
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 499 place count 152 transition count 268
Iterating global reduction 4 with 1 rules applied. Total rules applied 500 place count 152 transition count 268
Applied a total of 500 rules in 134 ms. Remains 152 /347 variables (removed 195) and now considering 268/672 (removed 404) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14524550416526263526.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5540307675533409620.kers'
[2026-05-23 19:49:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14524550416526263526.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5540307675533409620.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 152 cols 800 entries
Finished phase 1 with 144 SingleSign rule and 6 generalized
[2026-05-23 19:49:25] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5540307675533409620.kers
Total runtime 3 ms.
[2026-05-23 19:49:26] [INFO ] Implicit Places using invariants in 508 ms returned []
[2026-05-23 19:49:26] [INFO ] Invariant cache hit.
[2026-05-23 19:49:26] [INFO ] State equation strengthened by 126 read => feed constraints.
[2026-05-23 19:49:27] [INFO ] Implicit Places using invariants and state equation in 1217 ms returned []
Implicit Place search using SMT with State Equation took 1782 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2026-05-23 19:49:27] [INFO ] Invariant cache hit.
[2026-05-23 19:49:27] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (OVERLAPS) 268/420 variables, 152/154 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 126/280 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 7/287 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/420 variables, and 287 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 267 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 5 (OVERLAPS) 268/420 variables, 152/161 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 126/287 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 267/554 constraints. Problems are: Problem set: 0 solved, 267 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 554 constraints, problems are : Problem set: 0 solved, 267 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60934ms problems are : Problem set: 0 solved, 267 unsolved
Search for dead transitions found 0 dead transitions in 60963ms
Starting structural reductions in LTL mode, iteration 1 : 152/347 places, 268/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62932 ms. Remains : 152/347 places, 268/672 transitions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 268/268 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2026-05-23 19:50:28] [INFO ] Invariant cache hit.
[2026-05-23 19:50:28] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-23 19:50:28] [INFO ] Invariant cache hit.
[2026-05-23 19:50:28] [INFO ] State equation strengthened by 126 read => feed constraints.
[2026-05-23 19:50:29] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1008 ms. Remains : 152/152 places, 268/268 transitions.
Support contains 32 out of 152 places after structural reductions.
[2026-05-23 19:50:29] [INFO ] Flatten gal took : 64 ms
[2026-05-23 19:50:29] [INFO ] Flatten gal took : 33 ms
[2026-05-23 19:50:29] [INFO ] Input system was already deterministic with 268 transitions.
RANDOM walk for 40000 steps (9184 resets) in 3492 ms. (11 steps per ms) remains 21/27 properties
BEST_FIRST walk for 4004 steps (204 resets) in 78 ms. (50 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (375 resets) in 51 ms. (76 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (203 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (182 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (164 resets) in 41 ms. (95 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (375 resets) in 73 ms. (54 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (196 resets) in 48 ms. (81 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (166 resets) in 45 ms. (87 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (187 resets) in 41 ms. (95 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (198 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (212 resets) in 46 ms. (85 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (185 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (406 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (201 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (188 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (387 resets) in 48 ms. (81 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (378 resets) in 42 ms. (93 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (185 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (174 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (178 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (202 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
[2026-05-23 19:50:31] [INFO ] Invariant cache hit.
[2026-05-23 19:50:31] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 48/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 40/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 223/336 variables, 113/121 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 81/202 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 84/420 variables, 39/241 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 45/286 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 0/420 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 286 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 48/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 40/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 223/336 variables, 113/121 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 81/202 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 84/420 variables, 39/243 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 45/288 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/420 variables, 20/308 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 308 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10077ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 268/268 transitions.
Graph (complete) has 519 edges and 152 vertex of which 151 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 151 transition count 264
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 147 transition count 256
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 147 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 147 transition count 254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 144 transition count 251
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 144 transition count 251
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 144 transition count 249
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 142 transition count 246
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 142 transition count 246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 142 transition count 244
Applied a total of 29 rules in 66 ms. Remains 142 /152 variables (removed 10) and now considering 244/268 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 142/152 places, 244/268 transitions.
RANDOM walk for 40000 steps (9206 resets) in 685 ms. (58 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (188 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (414 resets) in 47 ms. (83 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (187 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (174 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (206 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (404 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (203 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (181 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (189 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (196 resets) in 59 ms. (66 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (163 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (192 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (403 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (178 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (188 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (410 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (382 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (206 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (199 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (193 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
Finished probabilistic random walk after 32097 steps, run visited all 20 properties in 290 ms. (steps per millisecond=110 )
Probabilistic random walk after 32097 steps, saw 14583 distinct states, run finished after 296 ms. (steps per millisecond=108 ) properties seen :20
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 23 stable transitions
Graph (complete) has 569 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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)||p1))||G(p2))))) U p1))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 268/268 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 133 transition count 203
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 133 transition count 203
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 133 transition count 201
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 55 place count 118 transition count 184
Iterating global reduction 1 with 15 rules applied. Total rules applied 70 place count 118 transition count 184
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 118 transition count 177
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 88 place count 107 transition count 157
Iterating global reduction 2 with 11 rules applied. Total rules applied 99 place count 107 transition count 157
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 107 transition count 153
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 110 place count 100 transition count 141
Iterating global reduction 3 with 7 rules applied. Total rules applied 117 place count 100 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 121 place count 100 transition count 137
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 126 place count 95 transition count 131
Iterating global reduction 4 with 5 rules applied. Total rules applied 131 place count 95 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 132 place count 95 transition count 130
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 134 place count 93 transition count 128
Iterating global reduction 5 with 2 rules applied. Total rules applied 136 place count 93 transition count 128
Applied a total of 136 rules in 28 ms. Remains 93 /152 variables (removed 59) and now considering 128/268 (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-11526422830289648786.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18248806281777993989.kers'
[2026-05-23 19:50:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11526422830289648786.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18248806281777993989.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 128 rows 93 cols 416 entries
Finished phase 1 with 89 SingleSign rule and 2 generalized
[2026-05-23 19:50:42] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18248806281777993989.kers
Total runtime 2 ms.
[2026-05-23 19:50:43] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-23 19:50:43] [INFO ] Invariant cache hit.
[2026-05-23 19:50:43] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-23 19:50:43] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2026-05-23 19:50:43] [INFO ] Invariant cache hit.
[2026-05-23 19:50:43] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/221 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 43/138 constraints. Problems are: Problem set: 0 solved, 127 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/221 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 138 constraints, problems are : Problem set: 0 solved, 127 unsolved in 6013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/221 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 43/138 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 127/265 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/221 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 265 constraints, problems are : Problem set: 0 solved, 127 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36183ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 36185ms
Starting structural reductions in LTL mode, iteration 1 : 93/152 places, 128/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36850 ms. Remains : 93/152 places, 128/268 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)||p1))||G(p2))))) U p1))'
Stuttering acceptance computed with spot in 791 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-01 finished in 37823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F((!p0&&X(p1))) U (G(!p2)||(!p2&&F(!p3)))) U p0)))'
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 268/268 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 134 transition count 205
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 134 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 134 transition count 202
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 121 transition count 188
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 121 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 121 transition count 185
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 78 place count 111 transition count 167
Iterating global reduction 2 with 10 rules applied. Total rules applied 88 place count 111 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 95 place count 111 transition count 160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 106 transition count 152
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 106 transition count 152
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 110 place count 101 transition count 146
Iterating global reduction 3 with 5 rules applied. Total rules applied 115 place count 101 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 101 transition count 145
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 99 transition count 143
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 99 transition count 143
Applied a total of 120 rules in 21 ms. Remains 99 /152 variables (removed 53) and now considering 143/268 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10720817031442628631.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2888934122733229861.kers'
[2026-05-23 19:51:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10720817031442628631.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2888934122733229861.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 99 cols 446 entries
Finished phase 1 with 95 SingleSign rule and 2 generalized
[2026-05-23 19:51:20] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2888934122733229861.kers
Total runtime 2 ms.
[2026-05-23 19:51:20] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-23 19:51:20] [INFO ] Invariant cache hit.
[2026-05-23 19:51:20] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-23 19:51:21] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2026-05-23 19:51:21] [INFO ] Invariant cache hit.
[2026-05-23 19:51:21] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/242 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 56/157 constraints. Problems are: Problem set: 0 solved, 142 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 157 constraints, problems are : Problem set: 0 solved, 142 unsolved in 7806 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/242 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 56/157 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 142/299 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 299 constraints, problems are : Problem set: 0 solved, 142 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37922ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 37924ms
Starting structural reductions in LTL mode, iteration 1 : 99/152 places, 143/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38527 ms. Remains : 99/152 places, 143/268 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F((!p0&&X(p1))) U (G(!p2)||(!p2&&F(!p3)))) U p0)))'
Stuttering acceptance computed with spot in 326 ms :[(NOT p0), (NOT p0), p2, (AND p2 p3), (NOT p1), (OR (NOT p1) p0), (AND (NOT p1) p3), (OR (AND (NOT p1) p3) (AND p0 p3))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-03 finished in 38964 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 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 268/268 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 132 transition count 201
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 132 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 43 place count 132 transition count 198
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 58 place count 117 transition count 181
Iterating global reduction 1 with 15 rules applied. Total rules applied 73 place count 117 transition count 181
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 80 place count 117 transition count 174
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 91 place count 106 transition count 155
Iterating global reduction 2 with 11 rules applied. Total rules applied 102 place count 106 transition count 155
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 107 place count 106 transition count 150
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 113 place count 100 transition count 139
Iterating global reduction 3 with 6 rules applied. Total rules applied 119 place count 100 transition count 139
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 125 place count 100 transition count 133
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 129 place count 96 transition count 128
Iterating global reduction 4 with 4 rules applied. Total rules applied 133 place count 96 transition count 128
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 135 place count 94 transition count 126
Iterating global reduction 4 with 2 rules applied. Total rules applied 137 place count 94 transition count 126
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 93 transition count 120
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 93 transition count 120
Applied a total of 139 rules in 35 ms. Remains 93 /152 variables (removed 59) and now considering 120/268 (removed 148) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11061403459692513303.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11642815261769050293.kers'
[2026-05-23 19:51:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11061403459692513303.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11642815261769050293.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:51:59] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11642815261769050293.kers
Total runtime 2 ms.
[2026-05-23 19:51:59] [INFO ] Implicit Places using invariants in 229 ms returned []
[2026-05-23 19:51:59] [INFO ] Invariant cache hit.
[2026-05-23 19:51:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-23 19:52:00] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2026-05-23 19:52:00] [INFO ] Redundant transitions in 5 ms returned []
Running 119 sub problems to find dead transitions.
[2026-05-23 19:52:00] [INFO ] Invariant cache hit.
[2026-05-23 19:52:00] [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, 2/136 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 138 constraints, problems are : Problem set: 0 solved, 119 unsolved in 13195 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: 4/4 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, 2/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/213 variables, 93/99 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 39/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 119/257 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 257 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30011 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: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43296ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 43296ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/152 places, 120/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44098 ms. Remains : 93/152 places, 120/268 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 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-04 finished in 44304 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&&X(p0))||X(G(p0)))) U (G((G(!p0)||(X(p0) U ((!p1&&X(p0))||X(G(p0))))))||((X(!p2)||G(!p3))&&(G(!p0)||(X(p0) U ((!p1&&X(p0))||X(G(p0)))))))))'
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 268/268 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 133 transition count 206
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 133 transition count 206
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 133 transition count 203
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 119 transition count 187
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 119 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 76 place count 119 transition count 180
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 86 place count 109 transition count 162
Iterating global reduction 2 with 10 rules applied. Total rules applied 96 place count 109 transition count 162
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 109 transition count 157
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 107 place count 103 transition count 149
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 103 transition count 149
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 119 place count 103 transition count 143
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 123 place count 99 transition count 138
Iterating global reduction 4 with 4 rules applied. Total rules applied 127 place count 99 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 129 place count 99 transition count 136
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 130 place count 98 transition count 135
Iterating global reduction 5 with 1 rules applied. Total rules applied 131 place count 98 transition count 135
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 97 transition count 129
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 97 transition count 129
Applied a total of 133 rules in 19 ms. Remains 97 /152 variables (removed 55) and now considering 129/268 (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-12608166328161114828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1089739309687414499.kers'
[2026-05-23 19:52:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12608166328161114828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1089739309687414499.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 129 rows 97 cols 416 entries
Finished phase 1 with 93 SingleSign rule and 2 generalized
[2026-05-23 19:52:43] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1089739309687414499.kers
Total runtime 1 ms.
[2026-05-23 19:52:44] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-23 19:52:44] [INFO ] Invariant cache hit.
[2026-05-23 19:52:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-23 19:52:44] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2026-05-23 19:52:44] [INFO ] Invariant cache hit.
[2026-05-23 19:52:44] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/226 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 45/144 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/226 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 150 constraints, problems are : Problem set: 0 solved, 128 unsolved in 11698 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 45/45 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/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/226 variables, 97/105 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 45/150 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 128/278 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/226 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 278 constraints, problems are : Problem set: 0 solved, 128 unsolved in 27346 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39115ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 39116ms
Starting structural reductions in LTL mode, iteration 1 : 97/152 places, 129/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39887 ms. Remains : 97/152 places, 129/268 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 (X(G(p0))||(!p1&&X(p0)))) U (G((G(!p0)||(X(p0) U ((!p1&&X(p0))||X(G(p0))))))||((X(!p2)||G(!p3))&&(G(!p0)||(X(p0) U ((!p1&&X(p0))||X(G(p0)))))))))'
Stuttering acceptance computed with spot in 656 ms :[false, false, false, false, (NOT p0), false, (NOT p0), p0, true, false, false, (AND p3 (NOT p0)), (AND (NOT p0) p3), (AND p0 p3), p3]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-05
Product exploration explored 100000 steps with 31376 reset in 588 ms.
Entered a terminal (fully accepting) state of product in 92020 steps with 29048 reset in 307 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-05 finished in 41568 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(X((!(F(p0) U p1)||!(!p1 U X(p1))))))'
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 268/268 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 131 transition count 194
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 131 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 131 transition count 191
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 61 place count 115 transition count 173
Iterating global reduction 1 with 16 rules applied. Total rules applied 77 place count 115 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 84 place count 115 transition count 166
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 96 place count 103 transition count 146
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 103 transition count 146
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 115 place count 103 transition count 139
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 122 place count 96 transition count 127
Iterating global reduction 3 with 7 rules applied. Total rules applied 129 place count 96 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 96 transition count 125
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 136 place count 91 transition count 119
Iterating global reduction 4 with 5 rules applied. Total rules applied 141 place count 91 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 144 place count 91 transition count 116
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 145 place count 90 transition count 115
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 90 transition count 115
Applied a total of 146 rules in 8 ms. Remains 90 /152 variables (removed 62) and now considering 115/268 (removed 153) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11151268826658892679.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7521524442872008223.kers'
[2026-05-23 19:53:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11151268826658892679.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7521524442872008223.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 115 rows 90 cols 372 entries
Finished phase 1 with 86 SingleSign rule and 2 generalized
[2026-05-23 19:53:25] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7521524442872008223.kers
Total runtime 1 ms.
[2026-05-23 19:53:25] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-23 19:53:25] [INFO ] Invariant cache hit.
[2026-05-23 19:53:25] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-23 19:53:25] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2026-05-23 19:53:25] [INFO ] Invariant cache hit.
[2026-05-23 19:53:25] [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, 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, 39/131 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 114 unsolved in 10967 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: 114/114 constraints, Known Traps: 1/1 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, 1/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/205 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 39/132 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 114/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 246 constraints, problems are : Problem set: 0 solved, 114 unsolved in 22385 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: 114/114 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33432ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 33433ms
Starting structural reductions in LTL mode, iteration 1 : 90/152 places, 115/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33919 ms. Remains : 90/152 places, 115/268 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(X((!(F(p0) U p1)||!(!p1 U X(p1))))))'
Stuttering acceptance computed with spot in 181 ms :[p1, p1, (AND p1 p0), (AND p1 p0), p1]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-07
Product exploration explored 100000 steps with 23305 reset in 270 ms.
Product exploration explored 100000 steps with 23411 reset in 314 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 305 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 13 stable transitions
Knowledge based reduction with 11 factoid took 62 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9139 resets) in 465 ms. (85 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (1944 resets) in 204 ms. (195 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 136 ms. (291 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
[2026-05-23 19:54:00] [INFO ] Invariant cache hit.
[2026-05-23 19:54:00] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 86/148 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 53/201 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 27/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/205 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/205 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 131 constraints, problems are : Problem set: 0 solved, 3 unsolved in 196 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: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 86/148 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 53/201 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 27/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/205 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/205 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 134 constraints, problems are : Problem set: 0 solved, 3 unsolved in 802 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: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1007ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 282 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Graph (complete) has 281 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 113
Applied a total of 3 rules in 8 ms. Remains 89 /90 variables (removed 1) and now considering 113/115 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 89/90 places, 113/115 transitions.
RANDOM walk for 40000 steps (9176 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1971 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1880 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1907 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 70057 steps, run visited all 3 properties in 197 ms. (steps per millisecond=355 )
Probabilistic random walk after 70057 steps, saw 30527 distinct states, run finished after 198 ms. (steps per millisecond=353 ) properties seen :3
Knowledge based reduction with 11 factoid took 124 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Knowledge-based reduction took 2422 ms.
Stuttering acceptance computed with spot in 196 ms :[p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 115/115 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2026-05-23 19:54:02] [INFO ] Invariant cache hit.
[2026-05-23 19:54:02] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-23 19:54:02] [INFO ] Invariant cache hit.
[2026-05-23 19:54:02] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-23 19:54:03] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 90/90 places, 115/115 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 305 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 13 stable transitions
Knowledge based reduction with 11 factoid took 79 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9137 resets) in 223 ms. (178 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (1919 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1922 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1913 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
[2026-05-23 19:54:03] [INFO ] Invariant cache hit.
[2026-05-23 19:54:03] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 86/148 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 53/201 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 27/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/205 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/205 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 131 constraints, problems are : Problem set: 0 solved, 3 unsolved in 308 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: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 86/148 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 10/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 53/201 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 27/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/205 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/205 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 134 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1230 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: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1549ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 405 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 115/115 transitions.
Graph (complete) has 281 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 113
Applied a total of 3 rules in 8 ms. Remains 89 /90 variables (removed 1) and now considering 113/115 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 89/90 places, 113/115 transitions.
RANDOM walk for 40000 steps (9146 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2028 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1890 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1911 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 70057 steps, run visited all 3 properties in 238 ms. (steps per millisecond=294 )
Probabilistic random walk after 70057 steps, saw 30527 distinct states, run finished after 238 ms. (steps per millisecond=294 ) properties seen :3
Knowledge based reduction with 11 factoid took 151 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Knowledge-based reduction took 3065 ms.
Stuttering acceptance computed with spot in 253 ms :[p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 254 ms :[p1, p1, p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 23227 reset in 329 ms.
Product exploration explored 100000 steps with 23289 reset in 346 ms.
Spot run failed in 109 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin493761882128587329
[2026-05-23 19:54:07] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin493761882128587329
Running compilation step : cd /tmp/ltsmin493761882128587329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 492 ms.
Running link step : cd /tmp/ltsmin493761882128587329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin493761882128587329;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased730189755745158020.hoa' '--buchi-type=spotba'
LTSmin run took 67 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-07 finished in 42901 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 U p2))&&X(X(F(p3)))))'
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 268/268 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 133 transition count 211
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 133 transition count 211
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 133 transition count 205
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 117 transition count 187
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 117 transition count 187
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 84 place count 117 transition count 179
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 97 place count 104 transition count 156
Iterating global reduction 2 with 13 rules applied. Total rules applied 110 place count 104 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 117 place count 104 transition count 149
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 125 place count 96 transition count 136
Iterating global reduction 3 with 8 rules applied. Total rules applied 133 place count 96 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 135 place count 96 transition count 134
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 141 place count 90 transition count 127
Iterating global reduction 4 with 6 rules applied. Total rules applied 147 place count 90 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 150 place count 90 transition count 124
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 152 place count 88 transition count 122
Iterating global reduction 5 with 2 rules applied. Total rules applied 154 place count 88 transition count 122
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 155 place count 87 transition count 116
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 87 transition count 116
Applied a total of 156 rules in 9 ms. Remains 87 /152 variables (removed 65) and now considering 116/268 (removed 152) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13619287625035651228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8002012121988937380.kers'
[2026-05-23 19:54:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13619287625035651228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8002012121988937380.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 87 cols 365 entries
Finished phase 1 with 83 SingleSign rule and 2 generalized
[2026-05-23 19:54:08] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8002012121988937380.kers
Total runtime 1 ms.
[2026-05-23 19:54:08] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-23 19:54:08] [INFO ] Invariant cache hit.
[2026-05-23 19:54:08] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-23 19:54:08] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2026-05-23 19:54:08] [INFO ] Invariant cache hit.
[2026-05-23 19:54:08] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/203 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 133 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4697 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 44/44 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/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/203 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 44/133 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 115/248 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 248 constraints, problems are : Problem set: 0 solved, 115 unsolved in 18946 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23727ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 23727ms
Starting structural reductions in LTL mode, iteration 1 : 87/152 places, 116/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24128 ms. Remains : 87/152 places, 116/268 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 U p2))&&X(X(F(p3)))))'
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p2), (NOT p3), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-09
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-09 finished in 24369 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||G(!p1))) U X(X(G(p2)))))'
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 268/268 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 132 transition count 198
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 132 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 132 transition count 195
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 57 place count 118 transition count 180
Iterating global reduction 1 with 14 rules applied. Total rules applied 71 place count 118 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 77 place count 118 transition count 174
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 88 place count 107 transition count 156
Iterating global reduction 2 with 11 rules applied. Total rules applied 99 place count 107 transition count 156
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 105 place count 107 transition count 150
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 111 place count 101 transition count 139
Iterating global reduction 3 with 6 rules applied. Total rules applied 117 place count 101 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 121 place count 101 transition count 135
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 125 place count 97 transition count 130
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 97 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 131 place count 97 transition count 128
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 96 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 96 transition count 127
Applied a total of 133 rules in 8 ms. Remains 96 /152 variables (removed 56) and now considering 127/268 (removed 141) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17770564041725713633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10745762617131466251.kers'
[2026-05-23 19:54:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17770564041725713633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10745762617131466251.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 127 rows 96 cols 412 entries
Finished phase 1 with 92 SingleSign rule and 2 generalized
[2026-05-23 19:54:32] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10745762617131466251.kers
Total runtime 1 ms.
[2026-05-23 19:54:32] [INFO ] Implicit Places using invariants in 119 ms returned []
[2026-05-23 19:54:32] [INFO ] Invariant cache hit.
[2026-05-23 19:54:32] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-23 19:54:33] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2026-05-23 19:54:33] [INFO ] Invariant cache hit.
[2026-05-23 19:54:33] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/223 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 43/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 141 constraints, problems are : Problem set: 0 solved, 126 unsolved in 6942 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 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/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/223 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 43/141 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 126/267 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/223 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 267 constraints, problems are : Problem set: 0 solved, 126 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36995ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 36996ms
Starting structural reductions in LTL mode, iteration 1 : 96/152 places, 127/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37413 ms. Remains : 96/152 places, 127/268 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||G(!p1))) U X(X(G(p2)))))'
Stuttering acceptance computed with spot in 155 ms :[(AND p0 (NOT p2) p1), (NOT p2), (AND p0 (NOT p2) p1), (AND p0 p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-11 finished in 37606 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)&&X(G(p1)))) U p0) U X(p2)))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 268/268 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 133 transition count 201
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 133 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 133 transition count 200
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 55 place count 117 transition count 182
Iterating global reduction 1 with 16 rules applied. Total rules applied 71 place count 117 transition count 182
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 76 place count 117 transition count 177
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 88 place count 105 transition count 156
Iterating global reduction 2 with 12 rules applied. Total rules applied 100 place count 105 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 107 place count 105 transition count 149
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 114 place count 98 transition count 138
Iterating global reduction 3 with 7 rules applied. Total rules applied 121 place count 98 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 98 transition count 137
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 128 place count 92 transition count 130
Iterating global reduction 4 with 6 rules applied. Total rules applied 134 place count 92 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 137 place count 92 transition count 127
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 139 place count 90 transition count 125
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 90 transition count 125
Applied a total of 141 rules in 8 ms. Remains 90 /152 variables (removed 62) and now considering 125/268 (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-6631952433607947684.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17747929308024820249.kers'
[2026-05-23 19:55:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6631952433607947684.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17747929308024820249.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 90 cols 394 entries
Finished phase 1 with 86 SingleSign rule and 2 generalized
[2026-05-23 19:55:10] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17747929308024820249.kers
Total runtime 1 ms.
[2026-05-23 19:55:10] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-23 19:55:10] [INFO ] Invariant cache hit.
[2026-05-23 19:55:10] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-05-23 19:55:10] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2026-05-23 19:55:10] [INFO ] Invariant cache hit.
[2026-05-23 19:55:10] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/215 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 47/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 3/147 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 11 (OVERLAPS) 0/215 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 147 constraints, problems are : Problem set: 0 solved, 124 unsolved in 13318 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 125/215 variables, 90/100 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 47/147 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 124/271 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 271 constraints, problems are : Problem set: 0 solved, 124 unsolved in 21432 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34813ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 34814ms
Starting structural reductions in LTL mode, iteration 1 : 90/152 places, 125/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35294 ms. Remains : 90/152 places, 125/268 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)&&X(G(p1)))) U p0) U X(p2)))'
Stuttering acceptance computed with spot in 306 ms :[(NOT p2), (NOT p2), (NOT p2), true, (OR (NOT p1) p0), p0, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-12
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-12 finished in 35655 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(p1)) U X((!p1&&X((!p1 U (!p0||G(!p1)))))))))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 268/268 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 132 transition count 197
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 132 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 132 transition count 194
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 58 place count 117 transition count 177
Iterating global reduction 1 with 15 rules applied. Total rules applied 73 place count 117 transition count 177
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 79 place count 117 transition count 171
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 90 place count 106 transition count 151
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 106 transition count 151
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 108 place count 106 transition count 144
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 115 place count 99 transition count 132
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 99 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 124 place count 99 transition count 130
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 129 place count 94 transition count 125
Iterating global reduction 4 with 5 rules applied. Total rules applied 134 place count 94 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 137 place count 94 transition count 122
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 139 place count 92 transition count 120
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 92 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 91 transition count 114
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 91 transition count 114
Applied a total of 143 rules in 17 ms. Remains 91 /152 variables (removed 61) and now considering 114/268 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1580733944404269650.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13739777603063297519.kers'
[2026-05-23 19:55:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1580733944404269650.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13739777603063297519.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 91 cols 371 entries
Finished phase 1 with 87 SingleSign rule and 2 generalized
[2026-05-23 19:55:45] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13739777603063297519.kers
Total runtime 1 ms.
[2026-05-23 19:55:46] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-23 19:55:46] [INFO ] Invariant cache hit.
[2026-05-23 19:55:46] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-23 19:55:46] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2026-05-23 19:55:46] [INFO ] Invariant cache hit.
[2026-05-23 19:55:46] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/205 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 37/130 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 4/134 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 134 constraints, problems are : Problem set: 0 solved, 113 unsolved in 11329 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/205 variables, 91/97 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 37/134 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 113/247 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 247 constraints, problems are : Problem set: 0 solved, 113 unsolved in 22280 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33680ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 33681ms
Starting structural reductions in LTL mode, iteration 1 : 91/152 places, 114/268 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34482 ms. Remains : 91/152 places, 114/268 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(p1)) U X((!p1&&X((!p1 U (!p0||G(!p1)))))))))'
Stuttering acceptance computed with spot in 257 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0), (AND p0 p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-13
Product exploration explored 100000 steps with 35710 reset in 307 ms.
Product exploration explored 100000 steps with 35626 reset in 509 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 304 edges and 91 vertex of which 90 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 9 factoid took 89 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9159 resets) in 324 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (2008 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3885 resets) in 147 ms. (270 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3949 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1923 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1919 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
Probably explored full state space saw : 71879 states, properties seen :4
Probabilistic random walk after 179914 steps, saw 71879 distinct states, run finished after 611 ms. (steps per millisecond=294 ) properties seen :4
Explored full state space saw : 72205 states, properties seen :0
Exhaustive walk after 180702 steps, saw 72205 distinct states, run finished after 246 ms. (steps per millisecond=734 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 106 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[p1, (AND p1 (NOT p0)), p1, (NOT p0)]
Knowledge-based reduction took 1533 ms.
Stuttering acceptance computed with spot in 180 ms :[p1, (AND p1 (NOT p0)), p1, (NOT p0)]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2026-05-23 19:56:23] [INFO ] Invariant cache hit.
[2026-05-23 19:56:23] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-23 19:56:23] [INFO ] Invariant cache hit.
[2026-05-23 19:56:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-23 19:56:24] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 779 ms. Remains : 91/91 places, 114/114 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 304 edges and 91 vertex of which 90 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
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9220 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3921 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1924 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 29143 steps, run visited all 2 properties in 83 ms. (steps per millisecond=351 )
Probabilistic random walk after 29143 steps, saw 13089 distinct states, run finished after 83 ms. (steps per millisecond=351 ) properties seen :2
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[p1, (AND p1 (NOT p0)), p1, (NOT p0)]
Knowledge-based reduction took 569 ms.
Stuttering acceptance computed with spot in 204 ms :[p1, (AND p1 (NOT p0)), p1, (NOT p0)]
Stuttering acceptance computed with spot in 203 ms :[p1, (AND p1 (NOT p0)), p1, (NOT p0)]
Product exploration explored 100000 steps with 41648 reset in 328 ms.
Product exploration explored 100000 steps with 41621 reset in 288 ms.
Spot run failed in 58 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin14654560127693949015
[2026-05-23 19:56:25] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14654560127693949015
Running compilation step : cd /tmp/ltsmin14654560127693949015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 332 ms.
Running link step : cd /tmp/ltsmin14654560127693949015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14654560127693949015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased8942860989031896232.hoa' '--buchi-type=spotba'
LTSmin run took 75 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-13 finished in 40258 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 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 268/268 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 131 transition count 198
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 131 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 131 transition count 195
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 61 place count 115 transition count 177
Iterating global reduction 1 with 16 rules applied. Total rules applied 77 place count 115 transition count 177
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 84 place count 115 transition count 170
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 96 place count 103 transition count 148
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 103 transition count 148
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 115 place count 103 transition count 141
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 122 place count 96 transition count 132
Iterating global reduction 3 with 7 rules applied. Total rules applied 129 place count 96 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 131 place count 96 transition count 130
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 136 place count 91 transition count 124
Iterating global reduction 4 with 5 rules applied. Total rules applied 141 place count 91 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 144 place count 91 transition count 121
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 145 place count 90 transition count 120
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 90 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 147 place count 89 transition count 114
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 89 transition count 114
Applied a total of 148 rules in 22 ms. Remains 89 /152 variables (removed 63) and now considering 114/268 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14587277973109041620.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12306117890054165503.kers'
[2026-05-23 19:56:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14587277973109041620.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12306117890054165503.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 89 cols 370 entries
Finished phase 1 with 85 SingleSign rule and 2 generalized
[2026-05-23 19:56:26] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12306117890054165503.kers
Total runtime 1 ms.
[2026-05-23 19:56:26] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-23 19:56:26] [INFO ] Invariant cache hit.
[2026-05-23 19:56:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-23 19:56:26] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2026-05-23 19:56:26] [INFO ] Redundant transitions in 4 ms returned []
Running 113 sub problems to find dead transitions.
[2026-05-23 19:56:26] [INFO ] Invariant cache hit.
[2026-05-23 19:56:26] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 38/129 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/203 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 136 constraints, problems are : Problem set: 0 solved, 113 unsolved in 15201 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/203 variables, 89/98 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 38/136 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 113/249 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 249 constraints, problems are : Problem set: 0 solved, 113 unsolved in 19574 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34840ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 34841ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/152 places, 114/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35277 ms. Remains : 89/152 places, 114/268 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 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-14 finished in 35376 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 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 268/268 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 131 transition count 198
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 131 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 131 transition count 195
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 61 place count 115 transition count 177
Iterating global reduction 1 with 16 rules applied. Total rules applied 77 place count 115 transition count 177
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 82 place count 115 transition count 172
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 103 transition count 151
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 103 transition count 151
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 113 place count 103 transition count 144
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 120 place count 96 transition count 133
Iterating global reduction 3 with 7 rules applied. Total rules applied 127 place count 96 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 96 transition count 132
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 134 place count 90 transition count 125
Iterating global reduction 4 with 6 rules applied. Total rules applied 140 place count 90 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 143 place count 90 transition count 122
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 145 place count 88 transition count 120
Iterating global reduction 5 with 2 rules applied. Total rules applied 147 place count 88 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 87 transition count 114
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 87 transition count 114
Applied a total of 149 rules in 39 ms. Remains 87 /152 variables (removed 65) and now considering 114/268 (removed 154) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-119575549628873433.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17931138234712957130.kers'
[2026-05-23 19:57:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-119575549628873433.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17931138234712957130.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 87 cols 367 entries
Finished phase 1 with 82 SingleSign rule and 3 generalized
[2026-05-23 19:57:01] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17931138234712957130.kers
Total runtime 2 ms.
[2026-05-23 19:57:01] [INFO ] Implicit Places using invariants in 166 ms returned []
[2026-05-23 19:57:01] [INFO ] Invariant cache hit.
[2026-05-23 19:57:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-23 19:57:02] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2026-05-23 19:57:02] [INFO ] Redundant transitions in 5 ms returned []
Running 113 sub problems to find dead transitions.
[2026-05-23 19:57:02] [INFO ] Invariant cache hit.
[2026-05-23 19:57:02] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/201 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/201 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 131 constraints, problems are : Problem set: 0 solved, 113 unsolved in 11315 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/201 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 39/131 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 113/244 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 244 constraints, problems are : Problem set: 0 solved, 113 unsolved in 18356 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29719ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 29721ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/152 places, 114/268 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30372 ms. Remains : 87/152 places, 114/268 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 42 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-15
Product exploration explored 100000 steps with 22945 reset in 183 ms.
Product exploration explored 100000 steps with 22878 reset in 179 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 298 edges and 87 vertex of which 86 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 3 factoid took 55 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9177 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1950 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4386 steps, run visited all 1 properties in 17 ms. (steps per millisecond=258 )
Probabilistic random walk after 4386 steps, saw 2020 distinct states, run finished after 17 ms. (steps per millisecond=258 ) properties seen :1
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Knowledge-based reduction took 221 ms.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 114/114 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2026-05-23 19:57:32] [INFO ] Invariant cache hit.
[2026-05-23 19:57:32] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-23 19:57:32] [INFO ] Invariant cache hit.
[2026-05-23 19:57:32] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-23 19:57:33] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2026-05-23 19:57:33] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 574 ms. Remains : 87/87 places, 114/114 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 298 edges and 87 vertex of which 86 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 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9168 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1889 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4386 steps, run visited all 1 properties in 27 ms. (steps per millisecond=162 )
Probabilistic random walk after 4386 steps, saw 2020 distinct states, run finished after 27 ms. (steps per millisecond=162 ) properties seen :1
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Knowledge-based reduction took 296 ms.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22901 reset in 283 ms.
Product exploration explored 100000 steps with 23022 reset in 306 ms.
Built C files in :
/tmp/ltsmin9574238834750785556
[2026-05-23 19:57:34] [INFO ] Computing symmetric may disable matrix : 114 transitions.
[2026-05-23 19:57:34] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 19:57:34] [INFO ] Computing symmetric may enable matrix : 114 transitions.
[2026-05-23 19:57:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 19:57:34] [INFO ] Computing Do-Not-Accords matrix : 114 transitions.
[2026-05-23 19:57:34] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 19:57:34] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9574238834750785556
Running compilation step : cd /tmp/ltsmin9574238834750785556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 378 ms.
Running link step : cd /tmp/ltsmin9574238834750785556;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9574238834750785556;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2397924127656236428.hoa' '--buchi-type=spotba'
LTSmin run took 118 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-15 finished in 33239 ms.
All properties solved by simple procedures.
Total runtime 490066 ms.
BK_STOP 1779566255174
--------------------
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-d1m05"
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-d1m05, 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-177946993600148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m05.tgz
mv DBSingleClientW-PT-d1m05 execution
cd execution
if [ "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 ;