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-177946993600180.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-d1m09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 7.4K Mar 6 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 6 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 6 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 6 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Mar 6 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 6 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 6 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Mar 6 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:49 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-d1m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779585240828

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-d1m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 01:14:03] [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-24 01:14:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 01:14:03] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2026-05-24 01:14:03] [INFO ] Transformed 1440 places.
[2026-05-24 01:14:03] [INFO ] Transformed 672 transitions.
[2026-05-24 01:14:03] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 486 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1093 places in 9 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 182 place count 245 transition count 418
Iterating global reduction 1 with 81 rules applied. Total rules applied 263 place count 245 transition count 418
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 275 place count 245 transition count 406
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 335 place count 185 transition count 346
Iterating global reduction 2 with 60 rules applied. Total rules applied 395 place count 185 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 185 transition count 345
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 423 place count 158 transition count 301
Iterating global reduction 3 with 27 rules applied. Total rules applied 450 place count 158 transition count 301
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 475 place count 158 transition count 276
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 482 place count 151 transition count 266
Iterating global reduction 4 with 7 rules applied. Total rules applied 489 place count 151 transition count 266
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 493 place count 147 transition count 262
Iterating global reduction 4 with 4 rules applied. Total rules applied 497 place count 147 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 500 place count 147 transition count 259
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 502 place count 145 transition count 257
Iterating global reduction 5 with 2 rules applied. Total rules applied 504 place count 145 transition count 257
Applied a total of 504 rules in 139 ms. Remains 145 /347 variables (removed 202) and now considering 257/672 (removed 415) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4040672732568690807.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15058781556735042660.kers'
[2026-05-24 01:14:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4040672732568690807.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15058781556735042660.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 257 rows 145 cols 745 entries
Finished phase 1 with 141 SingleSign rule and 2 generalized
[2026-05-24 01:14:04] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15058781556735042660.kers
Total runtime 3 ms.
[2026-05-24 01:14:04] [INFO ] Implicit Places using invariants in 475 ms returned []
[2026-05-24 01:14:04] [INFO ] Invariant cache hit.
[2026-05-24 01:14:04] [INFO ] State equation strengthened by 130 read => feed constraints.
[2026-05-24 01:14:05] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2026-05-24 01:14:05] [INFO ] Invariant cache hit.
[2026-05-24 01:14:05] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 257/402 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 130/277 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/402 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 277 constraints, problems are : Problem set: 0 solved, 256 unsolved in 23797 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 257/402 variables, 145/147 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 130/277 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 256/533 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/402 variables, and 533 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54531ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 54561ms
Starting structural reductions in LTL mode, iteration 1 : 145/347 places, 257/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56156 ms. Remains : 145/347 places, 257/672 transitions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 257/257 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2026-05-24 01:15:00] [INFO ] Invariant cache hit.
[2026-05-24 01:15:00] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-24 01:15:00] [INFO ] Invariant cache hit.
[2026-05-24 01:15:00] [INFO ] State equation strengthened by 130 read => feed constraints.
[2026-05-24 01:15:01] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 916 ms. Remains : 145/145 places, 257/257 transitions.
Support contains 37 out of 145 places after structural reductions.
[2026-05-24 01:15:01] [INFO ] Flatten gal took : 65 ms
[2026-05-24 01:15:01] [INFO ] Flatten gal took : 47 ms
[2026-05-24 01:15:01] [INFO ] Input system was already deterministic with 257 transitions.
RANDOM walk for 40000 steps (9107 resets) in 4630 ms. (8 steps per ms) remains 22/30 properties
BEST_FIRST walk for 4004 steps (191 resets) in 51 ms. (77 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (208 resets) in 57 ms. (69 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (192 resets) in 49 ms. (80 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (178 resets) in 76 ms. (52 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (186 resets) in 25 ms. (154 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (192 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (368 resets) in 49 ms. (80 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (173 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (185 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (220 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (199 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (192 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (391 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (376 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (383 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (177 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (390 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (192 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (376 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (181 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (199 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (366 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
[2026-05-24 01:15:03] [INFO ] Invariant cache hit.
[2026-05-24 01:15:03] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 44/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 33/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 217/323 variables, 106/115 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 90/205 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 79/402 variables, 39/244 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 40/284 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 0/402 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 284 constraints, problems are : Problem set: 0 solved, 22 unsolved in 3712 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 44/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 33/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 217/323 variables, 106/122 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 90/212 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 79/402 variables, 39/252 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 40/292 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 22/314 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/402 variables, and 314 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8759ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 145 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 145/145 places, 257/257 transitions.
Graph (complete) has 492 edges and 145 vertex of which 144 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 144 transition count 253
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 140 transition count 243
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 140 transition count 243
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 140 transition count 242
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 138 transition count 240
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 138 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 137 transition count 239
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 137 transition count 239
Applied a total of 20 rules in 61 ms. Remains 137 /145 variables (removed 8) and now considering 239/257 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 137/145 places, 239/257 transitions.
RANDOM walk for 40000 steps (9143 resets) in 572 ms. (69 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (176 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (185 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (176 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (187 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (185 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (193 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (381 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (171 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (186 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (187 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (198 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (184 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (379 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (400 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (387 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (174 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (346 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (171 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (384 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (198 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (182 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (419 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
Finished probabilistic random walk after 6480 steps, run visited all 22 properties in 153 ms. (steps per millisecond=42 )
Probabilistic random walk after 6480 steps, saw 2940 distinct states, run finished after 160 ms. (steps per millisecond=40 ) properties seen :22
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 26 stable transitions
Graph (complete) has 541 edges and 145 vertex of which 144 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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) U p1)&&X(F(p2)))))'
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 257/257 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 125 transition count 194
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 125 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 43 place count 125 transition count 191
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 57 place count 111 transition count 176
Iterating global reduction 1 with 14 rules applied. Total rules applied 71 place count 111 transition count 176
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 78 place count 111 transition count 169
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 102 transition count 156
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 102 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 100 place count 102 transition count 152
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 105 place count 97 transition count 141
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 97 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 97 transition count 140
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 114 place count 94 transition count 136
Iterating global reduction 4 with 3 rules applied. Total rules applied 117 place count 94 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 120 place count 94 transition count 133
Applied a total of 120 rules in 23 ms. Remains 94 /145 variables (removed 51) and now considering 133/257 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1579514616765793170.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-664351401739447361.kers'
[2026-05-24 01:15:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1579514616765793170.kers, --Pflows, --basisKERS=/tmp/petrispot-output-664351401739447361.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 133 rows 94 cols 415 entries
Finished phase 1 with 90 SingleSign rule and 2 generalized
[2026-05-24 01:15:13] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-664351401739447361.kers
Total runtime 2 ms.
[2026-05-24 01:15:13] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-24 01:15:13] [INFO ] Invariant cache hit.
[2026-05-24 01:15:13] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-24 01:15:14] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2026-05-24 01:15:14] [INFO ] Invariant cache hit.
[2026-05-24 01:15:14] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/227 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 52/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 148 constraints, problems are : Problem set: 0 solved, 132 unsolved in 6693 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/227 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 52/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 132/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 280 constraints, problems are : Problem set: 0 solved, 132 unsolved in 20974 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27787ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 27789ms
Starting structural reductions in LTL mode, iteration 1 : 94/145 places, 133/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28683 ms. Remains : 94/145 places, 133/257 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) U p1)&&X(F(p2)))))'
Stuttering acceptance computed with spot in 525 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-01 finished in 29358 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 X(p1))||G(!p0)) U (X(!p2) U ((!p2&&X(!p2))||X(G(!p2)))))))'
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 257/257 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 125 transition count 193
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 125 transition count 193
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 125 transition count 190
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 57 place count 111 transition count 175
Iterating global reduction 1 with 14 rules applied. Total rules applied 71 place count 111 transition count 175
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 80 place count 111 transition count 166
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 89 place count 102 transition count 153
Iterating global reduction 2 with 9 rules applied. Total rules applied 98 place count 102 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 102 transition count 150
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 97 transition count 138
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 97 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 115 place count 97 transition count 134
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 95 transition count 131
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 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 120 place count 95 transition count 130
Applied a total of 120 rules in 21 ms. Remains 95 /145 variables (removed 50) and now considering 130/257 (removed 127) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1067495253519216470.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-452031273798723815.kers'
[2026-05-24 01:15:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1067495253519216470.kers, --Pflows, --basisKERS=/tmp/petrispot-output-452031273798723815.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 95 cols 413 entries
Finished phase 1 with 91 SingleSign rule and 2 generalized
[2026-05-24 01:15:42] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-452031273798723815.kers
Total runtime 2 ms.
[2026-05-24 01:15:42] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-24 01:15:42] [INFO ] Invariant cache hit.
[2026-05-24 01:15:42] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 01:15:43] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-24 01:15:43] [INFO ] Invariant cache hit.
[2026-05-24 01:15:43] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/225 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 48/145 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 147 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 130/225 variables, 95/99 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 48/147 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 129/276 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 225/225 variables, and 276 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38164ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 38166ms
Starting structural reductions in LTL mode, iteration 1 : 95/145 places, 130/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38713 ms. Remains : 95/145 places, 130/257 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(p1))||G(!p0)) U (X(!p2) U (X(G(!p2))||(!p2&&X(!p2)))))))'
Stuttering acceptance computed with spot in 850 ms :[p2, p2, (AND p2 p0 (NOT p1)), (AND (NOT p1) p2), p2, (AND p2 p0 (NOT p1)), (AND p2 (NOT p0) (NOT p1)), true, p0, (NOT p1), (NOT p1), (AND p0 p2 p1), p2, (AND p0 p2 p1), p2, (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 598 ms.
Product exploration explored 100000 steps with 33333 reset in 275 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 328 edges and 95 vertex of which 94 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
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 14 factoid took 18 ms. Proved property starting from automaton with 17 states, 40 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 27 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-03 finished in 40580 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&&X((F(!p1)||G(!p0))))))'
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 257/257 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 124 transition count 183
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 124 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 124 transition count 181
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 59 place count 109 transition count 165
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 109 transition count 165
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 82 place count 109 transition count 157
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 91 place count 100 transition count 143
Iterating global reduction 2 with 9 rules applied. Total rules applied 100 place count 100 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 104 place count 100 transition count 139
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 95 transition count 132
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 95 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 116 place count 95 transition count 130
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 119 place count 92 transition count 126
Iterating global reduction 4 with 3 rules applied. Total rules applied 122 place count 92 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 125 place count 92 transition count 123
Applied a total of 125 rules in 12 ms. Remains 92 /145 variables (removed 53) and now considering 123/257 (removed 134) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16028790569415880585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1635877651027611409.kers'
[2026-05-24 01:16:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16028790569415880585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1635877651027611409.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 92 cols 391 entries
Finished phase 1 with 88 SingleSign rule and 2 generalized
[2026-05-24 01:16:23] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1635877651027611409.kers
Total runtime 1 ms.
[2026-05-24 01:16:23] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-24 01:16:23] [INFO ] Invariant cache hit.
[2026-05-24 01:16:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 01:16:23] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2026-05-24 01:16:23] [INFO ] Invariant cache hit.
[2026-05-24 01:16:23] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/215 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 45/139 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/215 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 139 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5995 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/215 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 45/139 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 122/261 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 261 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36100ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 36101ms
Starting structural reductions in LTL mode, iteration 1 : 92/145 places, 123/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36782 ms. Remains : 92/145 places, 123/257 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((F(p0)||G(p1)))&&p1)))'
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 181 ms.
Product exploration explored 100000 steps with 33333 reset in 190 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 317 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 18 ms. Proved property starting from automaton with 5 states, 7 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-04 finished in 37399 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||X((F(p1)||X(F(p2)))))))'
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 257/257 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 125 transition count 186
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 125 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 125 transition count 184
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 111 transition count 169
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 111 transition count 169
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 76 place count 111 transition count 163
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 85 place count 102 transition count 150
Iterating global reduction 2 with 9 rules applied. Total rules applied 94 place count 102 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 98 place count 102 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 98 transition count 138
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 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 107 place count 98 transition count 137
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 95 transition count 134
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 95 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 116 place count 95 transition count 131
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 117 place count 94 transition count 130
Iterating global reduction 5 with 1 rules applied. Total rules applied 118 place count 94 transition count 130
Applied a total of 118 rules in 9 ms. Remains 94 /145 variables (removed 51) and now considering 130/257 (removed 127) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16134762830043814925.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7809941809062663652.kers'
[2026-05-24 01:17:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16134762830043814925.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7809941809062663652.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 94 cols 409 entries
Finished phase 1 with 90 SingleSign rule and 2 generalized
[2026-05-24 01:17:00] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7809941809062663652.kers
Total runtime 2 ms.
[2026-05-24 01:17:00] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-24 01:17:00] [INFO ] Invariant cache hit.
[2026-05-24 01:17:00] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-24 01:17:01] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-24 01:17:01] [INFO ] Invariant cache hit.
[2026-05-24 01:17:01] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/224 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/224 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 145 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7307 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/224 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 49/145 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 129/274 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/224 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 274 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37362ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 37363ms
Starting structural reductions in LTL mode, iteration 1 : 94/145 places, 130/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37974 ms. Remains : 94/145 places, 130/257 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((F(p0)||X(F(p1))))||p2)))'
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 178 ms.
Product exploration explored 100000 steps with 33333 reset in 186 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 324 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 18 ms. Proved property starting from automaton with 4 states, 4 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-07 finished in 38609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))||G(p2)))))'
Support contains 5 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 257/257 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 124 transition count 182
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 124 transition count 182
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 124 transition count 179
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 60 place count 109 transition count 163
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 109 transition count 163
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 83 place count 109 transition count 155
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 92 place count 100 transition count 143
Iterating global reduction 2 with 9 rules applied. Total rules applied 101 place count 100 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 100 transition count 141
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 108 place count 95 transition count 131
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 95 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 117 place count 95 transition count 127
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 120 place count 92 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 123 place count 92 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 92 transition count 121
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 91 transition count 120
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 91 transition count 120
Applied a total of 127 rules in 8 ms. Remains 91 /145 variables (removed 54) and now considering 120/257 (removed 137) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15492564005526695550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14927545668721756126.kers'
[2026-05-24 01:17:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15492564005526695550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14927545668721756126.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 120 rows 91 cols 386 entries
Finished phase 1 with 87 SingleSign rule and 2 generalized
[2026-05-24 01:17:39] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14927545668721756126.kers
Total runtime 1 ms.
[2026-05-24 01:17:39] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-24 01:17:39] [INFO ] Invariant cache hit.
[2026-05-24 01:17:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-24 01:17:40] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2026-05-24 01:17:40] [INFO ] Invariant cache hit.
[2026-05-24 01:17:40] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/211 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 42/135 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/211 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/211 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/211 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/211 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/211 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 17 (OVERLAPS) 0/211 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 152 constraints, problems are : Problem set: 0 solved, 119 unsolved in 21806 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 17/17 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/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/211 variables, 91/110 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 42/152 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 119/271 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/211 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 271 constraints, problems are : Problem set: 0 solved, 119 unsolved in 18014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39858ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 39859ms
Starting structural reductions in LTL mode, iteration 1 : 91/145 places, 120/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40693 ms. Remains : 91/145 places, 120/257 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(p0))||G(p1)||p2))))'
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-08 finished in 41006 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)&&F((G(F(!p0))||(F(!p0)&&X(X(p1)))))))'
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 257/257 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 124 transition count 180
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 124 transition count 180
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 124 transition count 177
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 59 place count 110 transition count 163
Iterating global reduction 1 with 14 rules applied. Total rules applied 73 place count 110 transition count 163
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 110 transition count 156
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 100 transition count 141
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 100 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 104 place count 100 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 110 place count 94 transition count 121
Iterating global reduction 3 with 6 rules applied. Total rules applied 116 place count 94 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 94 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 121 place count 91 transition count 115
Iterating global reduction 4 with 3 rules applied. Total rules applied 124 place count 91 transition count 115
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 125 place count 90 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 126 place count 90 transition count 114
Applied a total of 126 rules in 7 ms. Remains 90 /145 variables (removed 55) and now considering 114/257 (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-12338175501158554340.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9813282265922818794.kers'
[2026-05-24 01:18:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12338175501158554340.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9813282265922818794.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 114 rows 90 cols 379 entries
Finished phase 1 with 86 SingleSign rule and 2 generalized
[2026-05-24 01:18:20] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9813282265922818794.kers
Total runtime 1 ms.
[2026-05-24 01:18:20] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-24 01:18:20] [INFO ] Invariant cache hit.
[2026-05-24 01:18:20] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-24 01:18:20] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2026-05-24 01:18:20] [INFO ] Invariant cache hit.
[2026-05-24 01:18:20] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/204 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 34/126 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 127 constraints, problems are : Problem set: 0 solved, 113 unsolved in 7668 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 1/1 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/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/204 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 34/127 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 113/240 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 240 constraints, problems are : Problem set: 0 solved, 113 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37726ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 37726ms
Starting structural reductions in LTL mode, iteration 1 : 90/145 places, 114/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38234 ms. Remains : 90/145 places, 114/257 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)&&F((G(F(!p0))||(F(!p0)&&X(X(p1)))))))'
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p0), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-09
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-09 finished in 38521 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)))||X(((F(p2) U p0)||G(F(!p0)))))))'
Support contains 6 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 257/257 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 123 transition count 182
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 123 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 123 transition count 179
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 108 transition count 163
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 108 transition count 163
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 108 transition count 156
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 98 transition count 141
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 98 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 108 place count 98 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 114 place count 92 transition count 122
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 92 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 92 transition count 121
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 125 place count 88 transition count 116
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 88 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 132 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 133 place count 87 transition count 112
Iterating global reduction 5 with 1 rules applied. Total rules applied 134 place count 87 transition count 112
Applied a total of 134 rules in 8 ms. Remains 87 /145 variables (removed 58) and now considering 112/257 (removed 145) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4055297843291335057.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9516447622485945814.kers'
[2026-05-24 01:18:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4055297843291335057.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9516447622485945814.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 87 cols 359 entries
Finished phase 1 with 83 SingleSign rule and 2 generalized
[2026-05-24 01:18:58] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9516447622485945814.kers
Total runtime 1 ms.
[2026-05-24 01:18:58] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-24 01:18:58] [INFO ] Invariant cache hit.
[2026-05-24 01:18:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-24 01:18:59] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2026-05-24 01:18:59] [INFO ] Invariant cache hit.
[2026-05-24 01:18:59] [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, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 130 constraints, problems are : Problem set: 0 solved, 111 unsolved in 11003 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: 111/111 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 112/199 variables, 87/91 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 39/130 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 111/241 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/199 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 241 constraints, problems are : Problem set: 0 solved, 111 unsolved in 23902 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: 111/111 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34939ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 34940ms
Starting structural reductions in LTL mode, iteration 1 : 87/145 places, 112/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35387 ms. Remains : 87/145 places, 112/257 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((X(((F(p0) U p1)||G(F(!p1))))||(F(!p1)&&F(G(p2))))))'
Stuttering acceptance computed with spot in 119 ms :[false, false, (AND p1 (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-10
Product exploration explored 100000 steps with 29820 reset in 380 ms.
Product exploration explored 100000 steps with 29863 reset in 313 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 297 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge based reduction with 9 factoid took 72 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (9160 resets) in 808 ms. (49 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3998 resets) in 321 ms. (124 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1858 resets) in 338 ms. (118 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1824 resets) in 185 ms. (215 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1905 resets) in 318 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4018 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1847 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1897747 steps, run timeout after 3001 ms. (steps per millisecond=632 ) properties seen :5 out of 6
Probabilistic random walk after 1897747 steps, saw 752669 distinct states, run finished after 3005 ms. (steps per millisecond=631 ) properties seen :5
[2026-05-24 01:19:38] [INFO ] Invariant cache hit.
[2026-05-24 01:19:38] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 36/199 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/87 constraints, ReadFeed: 0/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 18 ms. Proved property starting from automaton with 2 states, 4 edges and 3 AP (stutter insensitive
Knowledge-based reduction took 3885 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-10 finished in 40183 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 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 257/257 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 124 transition count 180
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 124 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 124 transition count 178
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 59 place count 109 transition count 162
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 109 transition count 162
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 82 place count 109 transition count 154
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 92 place count 99 transition count 140
Iterating global reduction 2 with 10 rules applied. Total rules applied 102 place count 99 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 99 transition count 137
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 110 place count 94 transition count 127
Iterating global reduction 3 with 5 rules applied. Total rules applied 115 place count 94 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 117 place count 94 transition count 125
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 120 place count 91 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 123 place count 91 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 124 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 125 place count 90 transition count 119
Iterating global reduction 5 with 1 rules applied. Total rules applied 126 place count 90 transition count 119
Applied a total of 126 rules in 26 ms. Remains 90 /145 variables (removed 55) and now considering 119/257 (removed 138) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14747886440737355099.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7864262719100493706.kers'
[2026-05-24 01:19:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14747886440737355099.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7864262719100493706.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 119 rows 90 cols 384 entries
Finished phase 1 with 86 SingleSign rule and 2 generalized
[2026-05-24 01:19:38] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7864262719100493706.kers
Total runtime 2 ms.
[2026-05-24 01:19:39] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-24 01:19:39] [INFO ] Invariant cache hit.
[2026-05-24 01:19:39] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-24 01:19:39] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2026-05-24 01:19:39] [INFO ] Redundant transitions in 6 ms returned []
Running 118 sub problems to find dead transitions.
[2026-05-24 01:19:39] [INFO ] Invariant cache hit.
[2026-05-24 01:19:39] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/209 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 41/133 constraints. Problems are: Problem set: 0 solved, 118 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/209 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 133 constraints, problems are : Problem set: 0 solved, 118 unsolved in 6454 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/209 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 41/133 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 118/251 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 251 constraints, problems are : Problem set: 0 solved, 118 unsolved in 24045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30591ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 30592ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/145 places, 119/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31133 ms. Remains : 90/145 places, 119/257 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 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-11
Product exploration explored 100000 steps with 22932 reset in 332 ms.
Product exploration explored 100000 steps with 22993 reset in 361 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 23160 steps (5268 resets) in 285 ms. (80 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 494 ms.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 119/119 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2026-05-24 01:20:11] [INFO ] Invariant cache hit.
[2026-05-24 01:20:11] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-24 01:20:11] [INFO ] Invariant cache hit.
[2026-05-24 01:20:11] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-24 01:20:12] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2026-05-24 01:20:12] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 462 ms. Remains : 90/90 places, 119/119 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 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 5 factoid took 57 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 29690 steps (6889 resets) in 109 ms. (269 steps per ms) remains 0/2 properties
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 332 ms.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 22976 reset in 344 ms.
Product exploration explored 100000 steps with 22907 reset in 350 ms.
Built C files in :
/tmp/ltsmin15053820957595507733
[2026-05-24 01:20:13] [INFO ] Computing symmetric may disable matrix : 119 transitions.
[2026-05-24 01:20:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 01:20:13] [INFO ] Computing symmetric may enable matrix : 119 transitions.
[2026-05-24 01:20:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 01:20:13] [INFO ] Computing Do-Not-Accords matrix : 119 transitions.
[2026-05-24 01:20:13] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 01:20:13] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15053820957595507733
Running compilation step : cd /tmp/ltsmin15053820957595507733;'/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 817 ms.
Running link step : cd /tmp/ltsmin15053820957595507733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin15053820957595507733;'/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/stateBased12875933361656254005.hoa' '--buchi-type=spotba'
LTSmin run took 212 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-11 finished in 35604 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 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 257/257 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 123 transition count 178
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 123 transition count 178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 123 transition count 176
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 62 place count 107 transition count 159
Iterating global reduction 1 with 16 rules applied. Total rules applied 78 place count 107 transition count 159
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 86 place count 107 transition count 151
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 97 place count 96 transition count 135
Iterating global reduction 2 with 11 rules applied. Total rules applied 108 place count 96 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 112 place count 96 transition count 131
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 118 place count 90 transition count 120
Iterating global reduction 3 with 6 rules applied. Total rules applied 124 place count 90 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 126 place count 90 transition count 118
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 130 place count 86 transition count 113
Iterating global reduction 4 with 4 rules applied. Total rules applied 134 place count 86 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 137 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 85 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 85 transition count 109
Applied a total of 139 rules in 36 ms. Remains 85 /145 variables (removed 60) and now considering 109/257 (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-18032199264242894305.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4060077778198039011.kers'
[2026-05-24 01:20:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18032199264242894305.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4060077778198039011.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 85 cols 350 entries
Finished phase 1 with 81 SingleSign rule and 2 generalized
[2026-05-24 01:20:14] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4060077778198039011.kers
Total runtime 1 ms.
[2026-05-24 01:20:14] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-24 01:20:14] [INFO ] Invariant cache hit.
[2026-05-24 01:20:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 01:20:14] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2026-05-24 01:20:14] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2026-05-24 01:20:14] [INFO ] Invariant cache hit.
[2026-05-24 01:20:14] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/194 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 38/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 129 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5942 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 109/194 variables, 85/91 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 38/129 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 108/237 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 237 constraints, problems are : Problem set: 0 solved, 108 unsolved in 20452 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26426ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 26427ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/145 places, 109/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26874 ms. Remains : 85/145 places, 109/257 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 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-12
Product exploration explored 100000 steps with 23001 reset in 151 ms.
Product exploration explored 100000 steps with 22967 reset in 167 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 289 edges and 85 vertex of which 84 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 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9150 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1911 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5125 steps, run visited all 1 properties in 12 ms. (steps per millisecond=427 )
Probabilistic random walk after 5125 steps, saw 2433 distinct states, run finished after 12 ms. (steps per millisecond=427 ) properties seen :1
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 265 ms.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2026-05-24 01:20:42] [INFO ] Invariant cache hit.
[2026-05-24 01:20:42] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-24 01:20:42] [INFO ] Invariant cache hit.
[2026-05-24 01:20:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 01:20:42] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2026-05-24 01:20:42] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 437 ms. Remains : 85/85 places, 109/109 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 289 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge based reduction with 3 factoid took 46 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9195 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1906 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5125 steps, run visited all 1 properties in 11 ms. (steps per millisecond=465 )
Probabilistic random walk after 5125 steps, saw 2433 distinct states, run finished after 11 ms. (steps per millisecond=465 ) properties seen :1
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 260 ms.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22803 reset in 151 ms.
Product exploration explored 100000 steps with 23031 reset in 170 ms.
Built C files in :
/tmp/ltsmin2330501293097345399
[2026-05-24 01:20:43] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2026-05-24 01:20:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 01:20:43] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2026-05-24 01:20:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 01:20:43] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2026-05-24 01:20:43] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 01:20:43] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2330501293097345399
Running compilation step : cd /tmp/ltsmin2330501293097345399;'/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 459 ms.
Running link step : cd /tmp/ltsmin2330501293097345399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin2330501293097345399;'/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/stateBased17215046987564564843.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2026-05-24 01:20:58] [INFO ] Invariant cache hit.
[2026-05-24 01:20:58] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-24 01:20:58] [INFO ] Invariant cache hit.
[2026-05-24 01:20:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-24 01:20:58] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2026-05-24 01:20:58] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 385 ms. Remains : 85/85 places, 109/109 transitions.
Built C files in :
/tmp/ltsmin6554942854288428080
[2026-05-24 01:20:58] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2026-05-24 01:20:58] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 01:20:58] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2026-05-24 01:20:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 01:20:58] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2026-05-24 01:20:58] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 01:20:58] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6554942854288428080
Running compilation step : cd /tmp/ltsmin6554942854288428080;'/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 416 ms.
Running link step : cd /tmp/ltsmin6554942854288428080;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6554942854288428080;'/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/stateBased18395105844282711765.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 01:21:13] [INFO ] Flatten gal took : 9 ms
[2026-05-24 01:21:13] [INFO ] Flatten gal took : 8 ms
[2026-05-24 01:21:13] [INFO ] Time to serialize gal into /tmp/LTL11524260689379599896.gal : 2 ms
[2026-05-24 01:21:13] [INFO ] Time to serialize properties into /tmp/LTL17313836912704349014.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11524260689379599896.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3876210706333644071.hoa' '-atoms' '/tmp/LTL17313836912704349014.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17313836912704349014.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3876210706333644071.hoa
Detected timeout of ITS tools.
[2026-05-24 01:21:29] [INFO ] Flatten gal took : 8 ms
[2026-05-24 01:21:29] [INFO ] Flatten gal took : 8 ms
[2026-05-24 01:21:29] [INFO ] Time to serialize gal into /tmp/LTL13851940474224140679.gal : 3 ms
[2026-05-24 01:21:29] [INFO ] Time to serialize properties into /tmp/LTL16578072969450527035.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13851940474224140679.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16578072969450527035.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l312<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l312<1))"
Detected timeout of ITS tools.
[2026-05-24 01:21:44] [INFO ] Flatten gal took : 13 ms
[2026-05-24 01:21:44] [INFO ] Applying decomposition
[2026-05-24 01:21:44] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12219363207439270424.txt' '-o' '/tmp/graph12219363207439270424.bin' '-w' '/tmp/graph12219363207439270424.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12219363207439270424.bin' '-l' '-1' '-v' '-w' '/tmp/graph12219363207439270424.weights' '-q' '0' '-e' '0.001'
[2026-05-24 01:21:44] [INFO ] Decomposing Gal with order
[2026-05-24 01:21:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 01:21:44] [INFO ] Removed a total of 119 redundant transitions.
[2026-05-24 01:21:44] [INFO ] Flatten gal took : 141 ms
[2026-05-24 01:21:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 30 ms.
[2026-05-24 01:21:44] [INFO ] Time to serialize gal into /tmp/LTL7814195512281516651.gal : 15 ms
[2026-05-24 01:21:44] [INFO ] Time to serialize properties into /tmp/LTL5094275120769161548.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7814195512281516651.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5094275120769161548.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u0.s1<1)||(i4.u9.l312<1))"))))
Formula 0 simplified : FG!"((i0.u0.s1<1)||(i4.u9.l312<1))"
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t50, t58, t68, t69, t70, t90, t204, t205, t208, t209, t210, t211, t216, t217, t218, ...401
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-12 finished in 105045 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 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 257/257 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 122 transition count 177
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 122 transition count 177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 122 transition count 174
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 65 place count 106 transition count 157
Iterating global reduction 1 with 16 rules applied. Total rules applied 81 place count 106 transition count 157
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 89 place count 106 transition count 149
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 100 place count 95 transition count 133
Iterating global reduction 2 with 11 rules applied. Total rules applied 111 place count 95 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 115 place count 95 transition count 129
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 121 place count 89 transition count 113
Iterating global reduction 3 with 6 rules applied. Total rules applied 127 place count 89 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 89 transition count 111
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 132 place count 86 transition count 107
Iterating global reduction 4 with 3 rules applied. Total rules applied 135 place count 86 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 137 place count 86 transition count 105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 85 transition count 104
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 85 transition count 104
Applied a total of 139 rules in 32 ms. Remains 85 /145 variables (removed 60) and now considering 104/257 (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-16310399629426544137.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8302606284050566819.kers'
[2026-05-24 01:21:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16310399629426544137.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8302606284050566819.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 104 rows 85 cols 343 entries
Finished phase 1 with 81 SingleSign rule and 2 generalized
[2026-05-24 01:21:59] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8302606284050566819.kers
Total runtime 1 ms.
[2026-05-24 01:21:59] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-24 01:21:59] [INFO ] Invariant cache hit.
[2026-05-24 01:21:59] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-24 01:22:00] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2026-05-24 01:22:00] [INFO ] Redundant transitions in 2 ms returned []
Running 103 sub problems to find dead transitions.
[2026-05-24 01:22:00] [INFO ] Invariant cache hit.
[2026-05-24 01:22:00] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4980 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 103/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 222 constraints, problems are : Problem set: 0 solved, 103 unsolved in 18404 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23453ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 23453ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/145 places, 104/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23959 ms. Remains : 85/145 places, 104/257 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 38 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-13 finished in 24026 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(X((X(p2)||F((!p1 U (p3||G(!p1))))))))))'
Support contains 6 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 257/257 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 124 transition count 183
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 124 transition count 183
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 124 transition count 180
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 59 place count 110 transition count 165
Iterating global reduction 1 with 14 rules applied. Total rules applied 73 place count 110 transition count 165
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 110 transition count 158
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 100 transition count 143
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 100 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 104 place count 100 transition count 139
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 110 place count 94 transition count 128
Iterating global reduction 3 with 6 rules applied. Total rules applied 116 place count 94 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 94 transition count 126
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 122 place count 90 transition count 121
Iterating global reduction 4 with 4 rules applied. Total rules applied 126 place count 90 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 128 place count 90 transition count 119
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 129 place count 89 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 130 place count 89 transition count 118
Applied a total of 130 rules in 6 ms. Remains 89 /145 variables (removed 56) and now considering 118/257 (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-2876228857928834300.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15028769865522147998.kers'
[2026-05-24 01:22:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2876228857928834300.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15028769865522147998.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 118 rows 89 cols 373 entries
Finished phase 1 with 85 SingleSign rule and 2 generalized
[2026-05-24 01:22:23] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15028769865522147998.kers
Total runtime 1 ms.
[2026-05-24 01:22:23] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-24 01:22:23] [INFO ] Invariant cache hit.
[2026-05-24 01:22:23] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-24 01:22:24] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2026-05-24 01:22:24] [INFO ] Invariant cache hit.
[2026-05-24 01:22:24] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/207 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 117 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 135 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5321 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/207 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 44/135 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 117/252 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 252 constraints, problems are : Problem set: 0 solved, 117 unsolved in 25281 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30662ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 30664ms
Starting structural reductions in LTL mode, iteration 1 : 89/145 places, 118/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31265 ms. Remains : 89/145 places, 118/257 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 p1)&&X(X((X(p2)||F((!p1 U (p3||G(!p1))))))))))'
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p3) (NOT p2) p1), (AND (NOT p3) (NOT p2) p1), (AND (NOT p3) (NOT p2) p1), (AND p1 (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-14 finished in 31663 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(F((p0&&X(X((!p1 U (p2||G(!p1))))))))))'
Support contains 6 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 257/257 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 126 transition count 194
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 126 transition count 194
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 126 transition count 189
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 56 place count 113 transition count 175
Iterating global reduction 1 with 13 rules applied. Total rules applied 69 place count 113 transition count 175
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 113 transition count 169
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 84 place count 104 transition count 156
Iterating global reduction 2 with 9 rules applied. Total rules applied 93 place count 104 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 97 place count 104 transition count 152
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 100 transition count 144
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 100 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 100 transition count 143
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 109 place count 97 transition count 139
Iterating global reduction 4 with 3 rules applied. Total rules applied 112 place count 97 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 97 transition count 138
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 114 place count 96 transition count 137
Iterating global reduction 5 with 1 rules applied. Total rules applied 115 place count 96 transition count 137
Applied a total of 115 rules in 11 ms. Remains 96 /145 variables (removed 49) and now considering 137/257 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5992422647513540764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12586951501701103929.kers'
[2026-05-24 01:22:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5992422647513540764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12586951501701103929.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 137 rows 96 cols 423 entries
Finished phase 1 with 92 SingleSign rule and 2 generalized
[2026-05-24 01:22:55] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12586951501701103929.kers
Total runtime 2 ms.
[2026-05-24 01:22:55] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-24 01:22:55] [INFO ] Invariant cache hit.
[2026-05-24 01:22:55] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-24 01:22:55] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2026-05-24 01:22:55] [INFO ] Invariant cache hit.
[2026-05-24 01:22:55] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/233 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 56/154 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/233 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 154 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6597 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/233 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 56/154 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 136/290 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 233/233 variables, and 290 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36696ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36697ms
Starting structural reductions in LTL mode, iteration 1 : 96/145 places, 137/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37247 ms. Remains : 96/145 places, 137/257 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(F((X(X((!p0 U (p1||G(!p0)))))&&p2)))))'
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (NOT p2) (AND p0 (NOT p1))), (OR (NOT p2) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-15
Product exploration explored 100000 steps with 26672 reset in 307 ms.
Product exploration explored 100000 steps with 26682 reset in 300 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 335 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (9113 resets) in 249 ms. (160 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (1933 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1986 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (3908 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1896 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1914 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1872 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1954 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 552082 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :5 out of 7
Probabilistic random walk after 552082 steps, saw 212490 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :5
[2026-05-24 01:23:36] [INFO ] Invariant cache hit.
[2026-05-24 01:23:36] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 40/233 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/96 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Knowledge-based reduction took 3813 ms.
Stuttering acceptance computed with spot in 281 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2026-05-24 01:23:37] [INFO ] Invariant cache hit.
[2026-05-24 01:23:37] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-24 01:23:37] [INFO ] Invariant cache hit.
[2026-05-24 01:23:37] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-24 01:23:38] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 745 ms. Remains : 96/96 places, 137/137 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 335 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (9145 resets) in 316 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3946 resets) in 213 ms. (186 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1932 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1838 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1927 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1929 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 29114 steps, run visited all 5 properties in 281 ms. (steps per millisecond=103 )
Probabilistic random walk after 29114 steps, saw 13539 distinct states, run finished after 282 ms. (steps per millisecond=103 ) properties seen :5
Knowledge based reduction with 1 factoid took 147 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Knowledge-based reduction took 1199 ms.
Stuttering acceptance computed with spot in 325 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 329 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 26675 reset in 310 ms.
Product exploration explored 100000 steps with 26609 reset in 326 ms.
Spot run failed in 149 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/ltsmin10486351343800078660
[2026-05-24 01:23:40] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10486351343800078660
Running compilation step : cd /tmp/ltsmin10486351343800078660;'/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 571 ms.
Running link step : cd /tmp/ltsmin10486351343800078660;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin10486351343800078660;'/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/stateBased16109580842530317081.hoa' '--buchi-type=spotba'
LTSmin run took 29 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-15 finished in 46362 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)))'
Spot run failed in 72 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-24 01:23:41] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin737419092356930014
[2026-05-24 01:23:41] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2026-05-24 01:23:41] [INFO ] Applying decomposition
[2026-05-24 01:23:41] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 01:23:41] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2026-05-24 01:23:41] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 01:23:41] [INFO ] Flatten gal took : 27 ms
[2026-05-24 01:23:41] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2026-05-24 01:23:41] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 01:23:41] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin737419092356930014
Running compilation step : cd /tmp/ltsmin737419092356930014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17217885268126950625.txt' '-o' '/tmp/graph17217885268126950625.bin' '-w' '/tmp/graph17217885268126950625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17217885268126950625.bin' '-l' '-1' '-v' '-w' '/tmp/graph17217885268126950625.weights' '-q' '0' '-e' '0.001'
[2026-05-24 01:23:41] [INFO ] Decomposing Gal with order
[2026-05-24 01:23:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 01:23:41] [INFO ] Removed a total of 223 redundant transitions.
[2026-05-24 01:23:42] [INFO ] Flatten gal took : 82 ms
[2026-05-24 01:23:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 273 labels/synchronizations in 23 ms.
[2026-05-24 01:23:42] [INFO ] Time to serialize gal into /tmp/LTLFireability17506342845712861332.gal : 9 ms
[2026-05-24 01:23:42] [INFO ] Time to serialize properties into /tmp/LTLFireability7198805345188456473.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17506342845712861332.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7198805345188456473.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.i0.u0.s1<1)||(i5.u5.l312<1))"))))
Formula 0 simplified : FG!"((i0.i0.u0.s1<1)||(i5.u5.l312<1))"
Compilation finished in 1168 ms.
Running link step : cd /tmp/ltsmin737419092356930014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin737419092356930014;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-24 01:46:55] [INFO ] Flatten gal took : 54 ms
[2026-05-24 01:46:55] [INFO ] Time to serialize gal into /tmp/LTLFireability5580853596174519266.gal : 8 ms
[2026-05-24 01:46:55] [INFO ] Time to serialize properties into /tmp/LTLFireability14705613129934236890.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5580853596174519266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14705613129934236890.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l312<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l312<1))"
Detected timeout of ITS tools.
[2026-05-24 02:10:15] [INFO ] Flatten gal took : 5398 ms
[2026-05-24 02:10:16] [INFO ] Input system was already deterministic with 257 transitions.
[2026-05-24 02:10:16] [INFO ] Transformed 145 places.
[2026-05-24 02:10:17] [INFO ] Transformed 257 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-24 02:10:17] [INFO ] Time to serialize gal into /tmp/LTLFireability9058203211156108526.gal : 18 ms
[2026-05-24 02:10:17] [INFO ] Time to serialize properties into /tmp/LTLFireability14243403560033482324.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9058203211156108526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14243403560033482324.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((s1<1)||(l312<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l312<1))"

BK_TIME_CONFINEMENT_REACHED

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-d1m09"
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-d1m09, 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-177946993600180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m09.tgz
mv DBSingleClientW-PT-d1m09 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;