About the Execution of ITS-Tools for DBSingleClientW-PT-d2m10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 599.275 | 619386.00 | 688838.00 | 1731.40 | TFFFFFFFFFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r082-smll-177946993600244.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-d2m10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993600244
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.9K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 6 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:51 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 1.6M 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-d2m10-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779633617388
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-d2m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 14:40:19] [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 14:40:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 14:40:20] [INFO ] Load time of PNML (sax parser for PT used): 431 ms
[2026-05-24 14:40:20] [INFO ] Transformed 4763 places.
[2026-05-24 14:40:20] [INFO ] Transformed 2478 transitions.
[2026-05-24 14:40:20] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 634 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 3580 places in 23 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 377 places :
Symmetric choice reduction at 1 with 377 rule applications. Total rules 622 place count 760 transition count 1329
Iterating global reduction 1 with 377 rules applied. Total rules applied 999 place count 760 transition count 1329
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1008 place count 760 transition count 1320
Discarding 300 places :
Symmetric choice reduction at 2 with 300 rule applications. Total rules 1308 place count 460 transition count 1020
Iterating global reduction 2 with 300 rules applied. Total rules applied 1608 place count 460 transition count 1020
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1618 place count 460 transition count 1010
Discarding 219 places :
Symmetric choice reduction at 3 with 219 rule applications. Total rules 1837 place count 241 transition count 700
Iterating global reduction 3 with 219 rules applied. Total rules applied 2056 place count 241 transition count 700
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Iterating post reduction 3 with 253 rules applied. Total rules applied 2309 place count 241 transition count 447
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 2328 place count 222 transition count 418
Iterating global reduction 4 with 19 rules applied. Total rules applied 2347 place count 222 transition count 418
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2351 place count 222 transition count 414
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 2362 place count 211 transition count 403
Iterating global reduction 5 with 11 rules applied. Total rules applied 2373 place count 211 transition count 403
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2377 place count 211 transition count 399
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 2385 place count 203 transition count 391
Iterating global reduction 6 with 8 rules applied. Total rules applied 2393 place count 203 transition count 391
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2401 place count 203 transition count 383
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2403 place count 201 transition count 379
Iterating global reduction 7 with 2 rules applied. Total rules applied 2405 place count 201 transition count 379
Applied a total of 2405 rules in 280 ms. Remains 201 /1183 variables (removed 982) and now considering 379/2478 (removed 2099) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4568243946476475053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15092219189539898209.kers'
[2026-05-24 14:40:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4568243946476475053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15092219189539898209.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 379 rows 201 cols 1115 entries
Finished phase 1 with 197 SingleSign rule and 2 generalized
[2026-05-24 14:40:21] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15092219189539898209.kers
Total runtime 3 ms.
[2026-05-24 14:40:21] [INFO ] Implicit Places using invariants in 633 ms returned []
[2026-05-24 14:40:21] [INFO ] Invariant cache hit.
[2026-05-24 14:40:22] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-24 14:40:23] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 2122 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2026-05-24 14:40:23] [INFO ] Invariant cache hit.
[2026-05-24 14:40:23] [INFO ] State equation strengthened by 187 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/201 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 379/580 variables, 201/203 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 187/390 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/580 variables, and 390 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 201/201 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/201 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (OVERLAPS) 379/580 variables, 201/203 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 187/390 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 378/768 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/580 variables, and 768 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 201/201 constraints, ReadFeed: 187/187 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61117ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 61171ms
Starting structural reductions in LTL mode, iteration 1 : 201/1183 places, 379/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63638 ms. Remains : 201/1183 places, 379/2478 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 379/379 transitions.
Applied a total of 0 rules in 6 ms. Remains 201 /201 variables (removed 0) and now considering 379/379 (removed 0) transitions.
[2026-05-24 14:41:24] [INFO ] Invariant cache hit.
[2026-05-24 14:41:24] [INFO ] Implicit Places using invariants in 448 ms returned []
[2026-05-24 14:41:24] [INFO ] Invariant cache hit.
[2026-05-24 14:41:25] [INFO ] State equation strengthened by 187 read => feed constraints.
[2026-05-24 14:41:26] [INFO ] Implicit Places using invariants and state equation in 1475 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1955 ms. Remains : 201/201 places, 379/379 transitions.
Support contains 34 out of 201 places after structural reductions.
[2026-05-24 14:41:26] [INFO ] Flatten gal took : 107 ms
[2026-05-24 14:41:26] [INFO ] Flatten gal took : 58 ms
[2026-05-24 14:41:27] [INFO ] Input system was already deterministic with 379 transitions.
Support contains 32 out of 201 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (9117 resets) in 3837 ms. (10 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4002 steps (173 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (370 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (394 resets) in 45 ms. (87 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (157 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (340 resets) in 76 ms. (51 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (402 resets) in 62 ms. (63 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (180 resets) in 46 ms. (85 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (167 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (197 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (167 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (350 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (184 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (184 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (365 resets) in 56 ms. (70 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (186 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (381 resets) in 48 ms. (81 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (187 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (175 resets) in 25 ms. (154 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (174 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (194 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (392 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (191 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 450209 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :19 out of 22
Probabilistic random walk after 450209 steps, saw 173246 distinct states, run finished after 3014 ms. (steps per millisecond=149 ) properties seen :19
[2026-05-24 14:41:31] [INFO ] Invariant cache hit.
[2026-05-24 14:41:31] [INFO ] State equation strengthened by 187 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Real declared 82/580 variables, and 1 constraints, problems are : Problem set: 3 solved, 0 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/201 constraints, ReadFeed: 0/187 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 30 stable transitions
Graph (complete) has 787 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 379/379 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 176 transition count 308
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 176 transition count 308
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 56 place count 176 transition count 302
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 73 place count 159 transition count 277
Iterating global reduction 1 with 17 rules applied. Total rules applied 90 place count 159 transition count 277
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 98 place count 159 transition count 269
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 111 place count 146 transition count 248
Iterating global reduction 2 with 13 rules applied. Total rules applied 124 place count 146 transition count 248
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 129 place count 146 transition count 243
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 137 place count 138 transition count 216
Iterating global reduction 3 with 8 rules applied. Total rules applied 145 place count 138 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 147 place count 138 transition count 214
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 150 place count 135 transition count 211
Iterating global reduction 4 with 3 rules applied. Total rules applied 153 place count 135 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 156 place count 135 transition count 208
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 161 place count 130 transition count 186
Iterating global reduction 5 with 5 rules applied. Total rules applied 166 place count 130 transition count 186
Applied a total of 166 rules in 21 ms. Remains 130 /201 variables (removed 71) and now considering 186/379 (removed 193) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8261837969362552506.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6842907652949047540.kers'
[2026-05-24 14:41:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8261837969362552506.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6842907652949047540.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 130 cols 609 entries
Finished phase 1 with 126 SingleSign rule and 2 generalized
[2026-05-24 14:41:32] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6842907652949047540.kers
Total runtime 2 ms.
[2026-05-24 14:41:32] [INFO ] Implicit Places using invariants in 209 ms returned []
[2026-05-24 14:41:32] [INFO ] Invariant cache hit.
[2026-05-24 14:41:32] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-24 14:41:32] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-24 14:41:32] [INFO ] Invariant cache hit.
[2026-05-24 14:41:32] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/316 variables, and 201 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 186/316 variables, 130/140 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 61/201 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 185/386 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 386 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 130/201 places, 186/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61011 ms. Remains : 130/201 places, 186/379 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 411 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-00
Product exploration explored 100000 steps with 28589 reset in 659 ms.
Product exploration explored 100000 steps with 28590 reset in 376 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 470 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 1 factoid took 57 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (9206 resets) in 340 ms. (117 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1806 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22324 steps, run visited all 1 properties in 52 ms. (steps per millisecond=429 )
Probabilistic random walk after 22324 steps, saw 11010 distinct states, run finished after 57 ms. (steps per millisecond=391 ) properties seen :1
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 472 ms.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 186/186 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-05-24 14:42:35] [INFO ] Invariant cache hit.
[2026-05-24 14:42:35] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-24 14:42:35] [INFO ] Invariant cache hit.
[2026-05-24 14:42:35] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-24 14:42:35] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 766 ms. Remains : 130/130 places, 186/186 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 470 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge based reduction with 1 factoid took 51 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (9220 resets) in 306 ms. (130 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1786 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22324 steps, run visited all 1 properties in 71 ms. (steps per millisecond=314 )
Probabilistic random walk after 22324 steps, saw 11010 distinct states, run finished after 71 ms. (steps per millisecond=314 ) properties seen :1
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 499 ms.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 28563 reset in 185 ms.
Product exploration explored 100000 steps with 28529 reset in 187 ms.
Spot run failed in 131 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/ltsmin3213236382553979033
[2026-05-24 14:42:37] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3213236382553979033
Running compilation step : cd /tmp/ltsmin3213236382553979033;'/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 728 ms.
Running link step : cd /tmp/ltsmin3213236382553979033;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 166 ms.
Running LTSmin : cd /tmp/ltsmin3213236382553979033;'/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/stateBased13748207708079309464.hoa' '--buchi-type=spotba'
LTSmin run took 59 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-00 finished in 66340 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 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 379/379 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 177 transition count 303
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 177 transition count 303
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 177 transition count 297
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 71 place count 160 transition count 275
Iterating global reduction 1 with 17 rules applied. Total rules applied 88 place count 160 transition count 275
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 96 place count 160 transition count 267
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 109 place count 147 transition count 246
Iterating global reduction 2 with 13 rules applied. Total rules applied 122 place count 147 transition count 246
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 127 place count 147 transition count 241
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 134 place count 140 transition count 215
Iterating global reduction 3 with 7 rules applied. Total rules applied 141 place count 140 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 140 transition count 213
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 145 place count 138 transition count 211
Iterating global reduction 4 with 2 rules applied. Total rules applied 147 place count 138 transition count 211
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 149 place count 136 transition count 209
Iterating global reduction 4 with 2 rules applied. Total rules applied 151 place count 136 transition count 209
Applied a total of 151 rules in 95 ms. Remains 136 /201 variables (removed 65) and now considering 209/379 (removed 170) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11782057422998885751.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15016522803598902443.kers'
[2026-05-24 14:42:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11782057422998885751.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15016522803598902443.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 136 cols 667 entries
Finished phase 1 with 132 SingleSign rule and 2 generalized
[2026-05-24 14:42:38] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15016522803598902443.kers
Total runtime 2 ms.
[2026-05-24 14:42:38] [INFO ] Implicit Places using invariants in 202 ms returned []
[2026-05-24 14:42:38] [INFO ] Invariant cache hit.
[2026-05-24 14:42:38] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-24 14:42:39] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
[2026-05-24 14:42:40] [INFO ] Redundant transitions in 11 ms returned []
Running 208 sub problems to find dead transitions.
[2026-05-24 14:42:40] [INFO ] Invariant cache hit.
[2026-05-24 14:42:40] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/345 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 77/215 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/345 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 219 constraints, problems are : Problem set: 0 solved, 208 unsolved in 22471 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (OVERLAPS) 209/345 variables, 136/142 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 77/219 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 208/427 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 345/345 variables, and 427 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52622ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 52624ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/201 places, 209/379 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54296 ms. Remains : 136/201 places, 209/379 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 180 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-01
Product exploration explored 100000 steps with 22863 reset in 443 ms.
Product exploration explored 100000 steps with 23185 reset in 347 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 500 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge based reduction with 5 factoid took 76 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 40000 steps (9223 resets) in 305 ms. (130 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3893 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3796 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 25095 steps, run visited all 2 properties in 140 ms. (steps per millisecond=179 )
Probabilistic random walk after 25095 steps, saw 12320 distinct states, run finished after 140 ms. (steps per millisecond=179 ) properties seen :2
Knowledge based reduction with 5 factoid took 107 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 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 692 ms.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 209/209 transitions.
Applied a total of 0 rules in 25 ms. Remains 136 /136 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2026-05-24 14:43:34] [INFO ] Invariant cache hit.
[2026-05-24 14:43:34] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-24 14:43:34] [INFO ] Invariant cache hit.
[2026-05-24 14:43:34] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-24 14:43:36] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 1649 ms to find 0 implicit places.
[2026-05-24 14:43:36] [INFO ] Redundant transitions in 13 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1697 ms. Remains : 136/136 places, 209/209 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 500 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge based reduction with 5 factoid took 63 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 40000 steps (9159 resets) in 220 ms. (180 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3789 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3800 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 25095 steps, run visited all 2 properties in 251 ms. (steps per millisecond=99 )
Probabilistic random walk after 25095 steps, saw 12320 distinct states, run finished after 251 ms. (steps per millisecond=99 ) properties seen :2
Knowledge based reduction with 5 factoid took 99 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 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 721 ms.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 22880 reset in 407 ms.
Product exploration explored 100000 steps with 22807 reset in 449 ms.
Built C files in :
/tmp/ltsmin9984590609826071037
[2026-05-24 14:43:38] [INFO ] Computing symmetric may disable matrix : 209 transitions.
[2026-05-24 14:43:38] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 14:43:38] [INFO ] Computing symmetric may enable matrix : 209 transitions.
[2026-05-24 14:43:38] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 14:43:38] [INFO ] Computing Do-Not-Accords matrix : 209 transitions.
[2026-05-24 14:43:38] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 14:43:38] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9984590609826071037
Running compilation step : cd /tmp/ltsmin9984590609826071037;'/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 970 ms.
Running link step : cd /tmp/ltsmin9984590609826071037;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9984590609826071037;'/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/stateBased6019034174356180601.hoa' '--buchi-type=spotba'
LTSmin run took 310 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-01 finished in 61138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 379/379 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 177 transition count 303
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 177 transition count 303
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 177 transition count 298
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 69 place count 161 transition count 276
Iterating global reduction 1 with 16 rules applied. Total rules applied 85 place count 161 transition count 276
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 92 place count 161 transition count 269
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 105 place count 148 transition count 249
Iterating global reduction 2 with 13 rules applied. Total rules applied 118 place count 148 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 122 place count 148 transition count 245
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 130 place count 140 transition count 223
Iterating global reduction 3 with 8 rules applied. Total rules applied 138 place count 140 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 140 place count 140 transition count 221
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 144 place count 136 transition count 217
Iterating global reduction 4 with 4 rules applied. Total rules applied 148 place count 136 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 151 place count 136 transition count 214
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 157 place count 130 transition count 191
Iterating global reduction 5 with 6 rules applied. Total rules applied 163 place count 130 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 165 place count 130 transition count 189
Applied a total of 165 rules in 39 ms. Remains 130 /201 variables (removed 71) and now considering 189/379 (removed 190) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17745414215307155902.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8353943655609350620.kers'
[2026-05-24 14:43:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17745414215307155902.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8353943655609350620.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 189 rows 130 cols 616 entries
Finished phase 1 with 126 SingleSign rule and 2 generalized
[2026-05-24 14:43:39] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8353943655609350620.kers
Total runtime 2 ms.
[2026-05-24 14:43:39] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-24 14:43:39] [INFO ] Invariant cache hit.
[2026-05-24 14:43:39] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-24 14:43:40] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
[2026-05-24 14:43:40] [INFO ] Redundant transitions in 3 ms returned []
Running 188 sub problems to find dead transitions.
[2026-05-24 14:43:40] [INFO ] Invariant cache hit.
[2026-05-24 14:43:40] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/319 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 5/200 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/319 variables, and 212 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 189/319 variables, 130/149 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 63/212 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 188/400 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 400 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/201 places, 189/379 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61126 ms. Remains : 130/201 places, 189/379 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-05 finished in 61250 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((X(F(X(X(p0)))) U p1))))'
Support contains 3 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 379/379 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 176 transition count 302
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 176 transition count 302
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 56 place count 176 transition count 296
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 72 place count 160 transition count 275
Iterating global reduction 1 with 16 rules applied. Total rules applied 88 place count 160 transition count 275
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 96 place count 160 transition count 267
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 108 place count 148 transition count 247
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 148 transition count 247
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 124 place count 148 transition count 243
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 132 place count 140 transition count 215
Iterating global reduction 3 with 8 rules applied. Total rules applied 140 place count 140 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 142 place count 140 transition count 213
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 145 place count 137 transition count 210
Iterating global reduction 4 with 3 rules applied. Total rules applied 148 place count 137 transition count 210
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 151 place count 134 transition count 207
Iterating global reduction 4 with 3 rules applied. Total rules applied 154 place count 134 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 156 place count 134 transition count 205
Applied a total of 156 rules in 58 ms. Remains 134 /201 variables (removed 67) and now considering 205/379 (removed 174) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-619386160009100511.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14837703013683296824.kers'
[2026-05-24 14:44:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-619386160009100511.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14837703013683296824.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 205 rows 134 cols 649 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-24 14:44:40] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14837703013683296824.kers
Total runtime 3 ms.
[2026-05-24 14:44:41] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-24 14:44:41] [INFO ] Invariant cache hit.
[2026-05-24 14:44:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 14:44:43] [INFO ] Implicit Places using invariants and state equation in 2174 ms returned []
Implicit Place search using SMT with State Equation took 2433 ms to find 0 implicit places.
[2026-05-24 14:44:43] [INFO ] Redundant transitions in 4 ms returned []
Running 204 sub problems to find dead transitions.
[2026-05-24 14:44:43] [INFO ] Invariant cache hit.
[2026-05-24 14:44:43] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 205/339 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 78/214 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 214 constraints, problems are : Problem set: 0 solved, 204 unsolved in 16705 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 205/339 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 78/214 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 204/418 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 339/339 variables, and 418 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46876ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 46877ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/201 places, 205/379 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49383 ms. Remains : 134/201 places, 205/379 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(X(X(p0)))) U p1))))'
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-06 finished in 49616 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(F(p0)) U (!p0&&F(p0)))))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 379/379 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 175 transition count 301
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 175 transition count 301
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 58 place count 175 transition count 295
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 76 place count 157 transition count 269
Iterating global reduction 1 with 18 rules applied. Total rules applied 94 place count 157 transition count 269
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 102 place count 157 transition count 261
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 116 place count 143 transition count 239
Iterating global reduction 2 with 14 rules applied. Total rules applied 130 place count 143 transition count 239
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 135 place count 143 transition count 234
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 144 place count 134 transition count 205
Iterating global reduction 3 with 9 rules applied. Total rules applied 153 place count 134 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 155 place count 134 transition count 203
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 159 place count 130 transition count 199
Iterating global reduction 4 with 4 rules applied. Total rules applied 163 place count 130 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 166 place count 130 transition count 196
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 171 place count 125 transition count 180
Iterating global reduction 5 with 5 rules applied. Total rules applied 176 place count 125 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 178 place count 125 transition count 178
Applied a total of 178 rules in 16 ms. Remains 125 /201 variables (removed 76) and now considering 178/379 (removed 201) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9543603337744012664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9269372112896271381.kers'
[2026-05-24 14:45:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9543603337744012664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9269372112896271381.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 178 rows 125 cols 581 entries
Finished phase 1 with 121 SingleSign rule and 2 generalized
[2026-05-24 14:45:30] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9269372112896271381.kers
Total runtime 3 ms.
[2026-05-24 14:45:30] [INFO ] Implicit Places using invariants in 178 ms returned []
[2026-05-24 14:45:30] [INFO ] Invariant cache hit.
[2026-05-24 14:45:30] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-24 14:45:31] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2026-05-24 14:45:31] [INFO ] Invariant cache hit.
[2026-05-24 14:45:31] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 59/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 186 constraints, problems are : Problem set: 0 solved, 177 unsolved in 12497 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 59/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 177/363 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/303 variables, and 363 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42588ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 42590ms
Starting structural reductions in LTL mode, iteration 1 : 125/201 places, 178/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43378 ms. Remains : 125/201 places, 178/379 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(F(p0)) U (!p0&&F(p0)))))'
Stuttering acceptance computed with spot in 202 ms :[true, true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-07
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-07 finished in 43625 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(F((F(G(p0))&&(!(p1 U p2)||G(p1))))))'
Support contains 5 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 379/379 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 178 transition count 310
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 178 transition count 310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 178 transition count 304
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 67 place count 163 transition count 281
Iterating global reduction 1 with 15 rules applied. Total rules applied 82 place count 163 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 88 place count 163 transition count 275
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 100 place count 151 transition count 255
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 151 transition count 255
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 116 place count 151 transition count 251
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 123 place count 144 transition count 231
Iterating global reduction 3 with 7 rules applied. Total rules applied 130 place count 144 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 144 transition count 230
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 135 place count 140 transition count 226
Iterating global reduction 4 with 4 rules applied. Total rules applied 139 place count 140 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 142 place count 140 transition count 223
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 147 place count 135 transition count 207
Iterating global reduction 5 with 5 rules applied. Total rules applied 152 place count 135 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 154 place count 135 transition count 205
Applied a total of 154 rules in 45 ms. Remains 135 /201 variables (removed 66) and now considering 205/379 (removed 174) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14919423485406597805.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9939998031129911959.kers'
[2026-05-24 14:46:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14919423485406597805.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9939998031129911959.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 205 rows 135 cols 646 entries
Finished phase 1 with 131 SingleSign rule and 2 generalized
[2026-05-24 14:46:14] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9939998031129911959.kers
Total runtime 4 ms.
[2026-05-24 14:46:14] [INFO ] Implicit Places using invariants in 242 ms returned []
[2026-05-24 14:46:14] [INFO ] Invariant cache hit.
[2026-05-24 14:46:14] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-24 14:46:15] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
[2026-05-24 14:46:15] [INFO ] Redundant transitions in 3 ms returned []
Running 204 sub problems to find dead transitions.
[2026-05-24 14:46:15] [INFO ] Invariant cache hit.
[2026-05-24 14:46:15] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 205/340 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 79/216 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 9/225 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 340/340 variables, and 229 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 205/340 variables, 135/150 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 79/229 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 204/433 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 433 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60194ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/201 places, 205/379 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61467 ms. Remains : 135/201 places, 205/379 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(F((F(G(p0))&&(!(p1 U p2)||G(p1))))))'
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-08
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-08 finished in 61631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 379/379 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 177 transition count 303
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 177 transition count 303
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 177 transition count 297
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 70 place count 161 transition count 273
Iterating global reduction 1 with 16 rules applied. Total rules applied 86 place count 161 transition count 273
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 93 place count 161 transition count 266
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 106 place count 148 transition count 245
Iterating global reduction 2 with 13 rules applied. Total rules applied 119 place count 148 transition count 245
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 123 place count 148 transition count 241
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 131 place count 140 transition count 219
Iterating global reduction 3 with 8 rules applied. Total rules applied 139 place count 140 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 141 place count 140 transition count 217
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 145 place count 136 transition count 213
Iterating global reduction 4 with 4 rules applied. Total rules applied 149 place count 136 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 152 place count 136 transition count 210
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 157 place count 131 transition count 195
Iterating global reduction 5 with 5 rules applied. Total rules applied 162 place count 131 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 164 place count 131 transition count 193
Applied a total of 164 rules in 30 ms. Remains 131 /201 variables (removed 70) and now considering 193/379 (removed 186) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-208522772282754989.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15025034847054883835.kers'
[2026-05-24 14:47:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-208522772282754989.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15025034847054883835.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 193 rows 131 cols 618 entries
Finished phase 1 with 127 SingleSign rule and 2 generalized
[2026-05-24 14:47:15] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15025034847054883835.kers
Total runtime 4 ms.
[2026-05-24 14:47:15] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-24 14:47:15] [INFO ] Invariant cache hit.
[2026-05-24 14:47:15] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-24 14:47:16] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2026-05-24 14:47:16] [INFO ] Redundant transitions in 1 ms returned []
Running 192 sub problems to find dead transitions.
[2026-05-24 14:47:16] [INFO ] Invariant cache hit.
[2026-05-24 14:47:16] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/324 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 70/203 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 203 constraints, problems are : Problem set: 0 solved, 192 unsolved in 18976 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/324 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 70/203 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 192/395 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 324/324 variables, and 395 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49145ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 49148ms
Starting structural reductions in SI_LTL mode, iteration 1 : 131/201 places, 193/379 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50338 ms. Remains : 131/201 places, 193/379 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-09
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-09 finished in 50433 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 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 379/379 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 176 transition count 308
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 176 transition count 308
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 56 place count 176 transition count 302
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 73 place count 159 transition count 277
Iterating global reduction 1 with 17 rules applied. Total rules applied 90 place count 159 transition count 277
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 98 place count 159 transition count 269
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 111 place count 146 transition count 248
Iterating global reduction 2 with 13 rules applied. Total rules applied 124 place count 146 transition count 248
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 129 place count 146 transition count 243
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 137 place count 138 transition count 219
Iterating global reduction 3 with 8 rules applied. Total rules applied 145 place count 138 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 147 place count 138 transition count 217
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 150 place count 135 transition count 214
Iterating global reduction 4 with 3 rules applied. Total rules applied 153 place count 135 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 156 place count 135 transition count 211
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 161 place count 130 transition count 189
Iterating global reduction 5 with 5 rules applied. Total rules applied 166 place count 130 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 168 place count 130 transition count 187
Applied a total of 168 rules in 50 ms. Remains 130 /201 variables (removed 71) and now considering 187/379 (removed 192) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11103092825224810231.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1449253178817091224.kers'
[2026-05-24 14:48:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11103092825224810231.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1449253178817091224.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 187 rows 130 cols 613 entries
Finished phase 1 with 126 SingleSign rule and 2 generalized
[2026-05-24 14:48:06] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1449253178817091224.kers
Total runtime 3 ms.
[2026-05-24 14:48:06] [INFO ] Implicit Places using invariants in 252 ms returned []
[2026-05-24 14:48:06] [INFO ] Invariant cache hit.
[2026-05-24 14:48:06] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-24 14:48:07] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
[2026-05-24 14:48:07] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2026-05-24 14:48:07] [INFO ] Invariant cache hit.
[2026-05-24 14:48:07] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 193 constraints, problems are : Problem set: 0 solved, 186 unsolved in 17067 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 186/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 379 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47236ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 47237ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/201 places, 187/379 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48581 ms. Remains : 130/201 places, 187/379 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 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-13
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-13 finished in 48725 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 379/379 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 176 transition count 303
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 176 transition count 303
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 176 transition count 298
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 73 place count 158 transition count 272
Iterating global reduction 1 with 18 rules applied. Total rules applied 91 place count 158 transition count 272
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 99 place count 158 transition count 264
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 113 place count 144 transition count 242
Iterating global reduction 2 with 14 rules applied. Total rules applied 127 place count 144 transition count 242
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 132 place count 144 transition count 237
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 141 place count 135 transition count 208
Iterating global reduction 3 with 9 rules applied. Total rules applied 150 place count 135 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 152 place count 135 transition count 206
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 156 place count 131 transition count 202
Iterating global reduction 4 with 4 rules applied. Total rules applied 160 place count 131 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 163 place count 131 transition count 199
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 168 place count 126 transition count 184
Iterating global reduction 5 with 5 rules applied. Total rules applied 173 place count 126 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 175 place count 126 transition count 182
Applied a total of 175 rules in 43 ms. Remains 126 /201 variables (removed 75) and now considering 182/379 (removed 197) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9754251696068880683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12456827330125178678.kers'
[2026-05-24 14:48:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9754251696068880683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12456827330125178678.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 126 cols 593 entries
Finished phase 1 with 122 SingleSign rule and 2 generalized
[2026-05-24 14:48:54] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12456827330125178678.kers
Total runtime 2 ms.
[2026-05-24 14:48:55] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-24 14:48:55] [INFO ] Invariant cache hit.
[2026-05-24 14:48:55] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-24 14:48:56] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1322 ms to find 0 implicit places.
[2026-05-24 14:48:56] [INFO ] Redundant transitions in 2 ms returned []
Running 181 sub problems to find dead transitions.
[2026-05-24 14:48:56] [INFO ] Invariant cache hit.
[2026-05-24 14:48:56] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/308 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 61/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/308 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 189 constraints, problems are : Problem set: 0 solved, 181 unsolved in 15573 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/308 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 61/189 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 181/370 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/308 variables, and 370 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45714ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 45715ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/201 places, 182/379 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47090 ms. Remains : 126/201 places, 182/379 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-14
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-14 finished in 47189 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)&&F(p1)&&(p2||F(p3))))))'
Support contains 6 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 379/379 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 178 transition count 321
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 178 transition count 321
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 178 transition count 313
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 70 place count 162 transition count 290
Iterating global reduction 1 with 16 rules applied. Total rules applied 86 place count 162 transition count 290
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 94 place count 162 transition count 282
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 107 place count 149 transition count 261
Iterating global reduction 2 with 13 rules applied. Total rules applied 120 place count 149 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 149 transition count 256
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 132 place count 142 transition count 239
Iterating global reduction 3 with 7 rules applied. Total rules applied 139 place count 142 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 141 place count 142 transition count 237
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 144 place count 139 transition count 234
Iterating global reduction 4 with 3 rules applied. Total rules applied 147 place count 139 transition count 234
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 151 place count 139 transition count 230
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 156 place count 134 transition count 208
Iterating global reduction 5 with 5 rules applied. Total rules applied 161 place count 134 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 163 place count 134 transition count 206
Applied a total of 163 rules in 19 ms. Remains 134 /201 variables (removed 67) and now considering 206/379 (removed 173) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8451169032309186285.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-76964217620106281.kers'
[2026-05-24 14:49:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8451169032309186285.kers, --Pflows, --basisKERS=/tmp/petrispot-output-76964217620106281.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 134 cols 655 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-24 14:49:41] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-76964217620106281.kers
Total runtime 3 ms.
[2026-05-24 14:49:42] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-24 14:49:42] [INFO ] Invariant cache hit.
[2026-05-24 14:49:42] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-24 14:49:43] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2026-05-24 14:49:43] [INFO ] Invariant cache hit.
[2026-05-24 14:49:43] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/340 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 77/213 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/340 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 213 constraints, problems are : Problem set: 0 solved, 205 unsolved in 21128 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/340 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 77/213 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 205/418 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 418 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51312ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 51313ms
Starting structural reductions in LTL mode, iteration 1 : 134/201 places, 206/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53249 ms. Remains : 134/201 places, 206/379 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)&&F(p1)&&(F(p2)||p3)))))'
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 519 ms.
Product exploration explored 100000 steps with 33333 reset in 496 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 496 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 5 stabilizing places and 18 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 6 states, 8 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 36 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-15 finished in 54671 ms.
All properties solved by simple procedures.
Total runtime 616843 ms.
BK_STOP 1779634236774
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m10"
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-d2m10, 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-177946993600244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m10.tgz
mv DBSingleClientW-PT-d2m10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;
