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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.8K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K 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 4.0K Mar 15 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:45 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 119K 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-d0m05-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779552090610

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-d0m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 16:01:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 16:01:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 16:01:32] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2026-05-23 16:01:32] [INFO ] Transformed 553 places.
[2026-05-23 16:01:32] [INFO ] Transformed 150 transitions.
[2026-05-23 16:01:32] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 356 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 60 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 33 place count 87 transition count 117
Iterating global reduction 1 with 15 rules applied. Total rules applied 48 place count 87 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 87 transition count 116
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 83 transition count 112
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 83 transition count 112
Applied a total of 57 rules in 59 ms. Remains 83 /109 variables (removed 26) and now considering 112/150 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1104915911706220171.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14007872092794461222.kers'
[2026-05-23 16:01:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1104915911706220171.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14007872092794461222.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 83 cols 349 entries
Finished phase 1 with 79 SingleSign rule and 2 generalized
[2026-05-23 16:01:33] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14007872092794461222.kers
Total runtime 2 ms.
[2026-05-23 16:01:33] [INFO ] Implicit Places using invariants in 378 ms returned []
[2026-05-23 16:01:33] [INFO ] Invariant cache hit.
[2026-05-23 16:01:33] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-23 16:01:33] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2026-05-23 16:01:34] [INFO ] Invariant cache hit.
[2026-05-23 16:01:34] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/195 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 44/129 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 13 (OVERLAPS) 0/195 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 138 constraints, problems are : Problem set: 0 solved, 111 unsolved in 21395 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 112/195 variables, 83/94 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 44/138 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 111/249 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 249 constraints, problems are : Problem set: 0 solved, 111 unsolved in 16714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38397ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 38422ms
Starting structural reductions in LTL mode, iteration 1 : 83/109 places, 112/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39309 ms. Remains : 83/109 places, 112/150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Applied a total of 0 rules in 5 ms. Remains 83 /83 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2026-05-23 16:02:12] [INFO ] Invariant cache hit.
[2026-05-23 16:02:12] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-23 16:02:12] [INFO ] Invariant cache hit.
[2026-05-23 16:02:12] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-23 16:02:12] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 83/83 places, 112/112 transitions.
Support contains 33 out of 83 places after structural reductions.
[2026-05-23 16:02:13] [INFO ] Flatten gal took : 67 ms
[2026-05-23 16:02:13] [INFO ] Flatten gal took : 30 ms
[2026-05-23 16:02:13] [INFO ] Input system was already deterministic with 112 transitions.
Support contains 32 out of 83 places (down from 33) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (9171 resets) in 2479 ms. (16 steps per ms) remains 10/24 properties
BEST_FIRST walk for 40004 steps (1955 resets) in 636 ms. (62 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4104 resets) in 606 ms. (65 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3963 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4140 resets) in 161 ms. (246 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (4024 resets) in 157 ms. (253 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (1929 resets) in 108 ms. (366 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (2003 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (4108 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2025 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
[2026-05-23 16:02:14] [INFO ] Invariant cache hit.
[2026-05-23 16:02:14] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 27/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 23/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 94/158 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 35/193 variables, 18/110 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 17/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 2/195 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/195 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/195 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/195 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 130 constraints, problems are : Problem set: 0 solved, 8 unsolved in 886 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 27/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 23/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 94/158 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 35/193 variables, 18/110 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 17/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/195 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/195 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/195 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 138 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2620 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3524ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 4 properties in 1772 ms.
Support contains 8 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 112/112 transitions.
Graph (complete) has 249 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 82 transition count 111
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 75 transition count 100
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 75 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 72 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 72 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 72 transition count 95
Applied a total of 23 rules in 34 ms. Remains 72 /83 variables (removed 11) and now considering 95/112 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 72/83 places, 95/112 transitions.
RANDOM walk for 40000 steps (9196 resets) in 198 ms. (201 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1919 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4129 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4009 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1993 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 19186 steps, run visited all 4 properties in 130 ms. (steps per millisecond=147 )
Probabilistic random walk after 19186 steps, saw 8658 distinct states, run finished after 135 ms. (steps per millisecond=142 ) properties seen :4
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 276 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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((p0 U G(!p1))))))'
Support contains 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 72 transition count 91
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 72 transition count 91
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 68 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 68 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 66 transition count 83
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 64 transition count 80
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 63 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 63 transition count 77
Applied a total of 42 rules in 16 ms. Remains 63 /83 variables (removed 20) and now considering 77/112 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5942310902259845757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6177736256343902079.kers'
[2026-05-23 16:02:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5942310902259845757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6177736256343902079.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 63 cols 251 entries
Finished phase 1 with 58 SingleSign rule and 3 generalized
[2026-05-23 16:02:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6177736256343902079.kers
Total runtime 1 ms.
[2026-05-23 16:02:21] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-23 16:02:21] [INFO ] Invariant cache hit.
[2026-05-23 16:02:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 16:02:21] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2026-05-23 16:02:21] [INFO ] Invariant cache hit.
[2026-05-23 16:02:21] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 90 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2360 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 166 constraints, problems are : Problem set: 0 solved, 76 unsolved in 8086 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10520ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 10521ms
Starting structural reductions in LTL mode, iteration 1 : 63/83 places, 77/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10849 ms. Remains : 63/83 places, 77/112 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((p0 U G(!p1))))))'
Stuttering acceptance computed with spot in 531 ms :[p1, p1, p1, p1, true, p1]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-01
Product exploration explored 100000 steps with 22942 reset in 538 ms.
Product exploration explored 100000 steps with 23003 reset in 339 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge based reduction with 1 factoid took 56 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9154 resets) in 532 ms. (75 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (1965 resets) in 285 ms. (139 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2008 resets) in 232 ms. (171 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1960 resets) in 210 ms. (189 steps per ms) remains 3/3 properties
[2026-05-23 16:02:33] [INFO ] Invariant cache hit.
[2026-05-23 16:02:33] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 62/107 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 31/138 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/140 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 90 constraints, problems are : Problem set: 0 solved, 3 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 62/107 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 31/138 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/140 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 93 constraints, problems are : Problem set: 0 solved, 3 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 769ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 42 ms.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 77/77 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 76
Applied a total of 2 rules in 7 ms. Remains 62 /63 variables (removed 1) and now considering 76/77 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 62/63 places, 76/77 transitions.
RANDOM walk for 40000 steps (9173 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1967 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16138 steps, run visited all 1 properties in 43 ms. (steps per millisecond=375 )
Probabilistic random walk after 16138 steps, saw 7155 distinct states, run finished after 43 ms. (steps per millisecond=375 ) properties seen :1
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[p1, p1, p1, p1, true, p1]
Knowledge-based reduction took 1689 ms.
Stuttering acceptance computed with spot in 231 ms :[p1, p1, p1, p1, true, p1]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 77/77 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2026-05-23 16:02:35] [INFO ] Invariant cache hit.
[2026-05-23 16:02:35] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-23 16:02:35] [INFO ] Invariant cache hit.
[2026-05-23 16:02:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 16:02:35] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 63/63 places, 77/77 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge based reduction with 1 factoid took 59 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9104 resets) in 196 ms. (203 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (1938 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2015 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1998 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
[2026-05-23 16:02:35] [INFO ] Invariant cache hit.
[2026-05-23 16:02:35] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 62/107 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 31/138 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/140 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 90 constraints, problems are : Problem set: 0 solved, 3 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 62/107 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 31/138 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/140 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 93 constraints, problems are : Problem set: 0 solved, 3 unsolved in 824 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1021ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 255 ms.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 77/77 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 76
Applied a total of 2 rules in 11 ms. Remains 62 /63 variables (removed 1) and now considering 76/77 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 62/63 places, 76/77 transitions.
RANDOM walk for 40000 steps (9099 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1964 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (2027 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1931 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 16138 steps, run visited all 3 properties in 77 ms. (steps per millisecond=209 )
Probabilistic random walk after 16138 steps, saw 7155 distinct states, run finished after 77 ms. (steps per millisecond=209 ) properties seen :3
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[p1, p1, p1, p1, true, p1]
Knowledge-based reduction took 2034 ms.
Stuttering acceptance computed with spot in 214 ms :[p1, p1, p1, p1, true, p1]
Stuttering acceptance computed with spot in 213 ms :[p1, p1, p1, p1, true, p1]
Product exploration explored 100000 steps with 22846 reset in 179 ms.
Product exploration explored 100000 steps with 22925 reset in 240 ms.
Spot run failed in 156 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/ltsmin3622730912562967264
[2026-05-23 16:02:38] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3622730912562967264
Running compilation step : cd /tmp/ltsmin3622730912562967264;'/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 477 ms.
Running link step : cd /tmp/ltsmin3622730912562967264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin3622730912562967264;'/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/stateBased16755893305494211967.hoa' '--buchi-type=spotba'
LTSmin run took 92 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-01 finished in 18404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 73 transition count 90
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 73 transition count 90
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 68 transition count 84
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 68 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 68 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 67 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 67 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 66 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 65 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 64 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 64 transition count 75
Applied a total of 42 rules in 25 ms. Remains 64 /83 variables (removed 19) and now considering 75/112 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16758281757102218012.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6240464744659282052.kers'
[2026-05-23 16:02:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16758281757102218012.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6240464744659282052.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 64 cols 250 entries
Finished phase 1 with 60 SingleSign rule and 2 generalized
[2026-05-23 16:02:39] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6240464744659282052.kers
Total runtime 1 ms.
[2026-05-23 16:02:39] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-23 16:02:39] [INFO ] Invariant cache hit.
[2026-05-23 16:02:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 16:02:39] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2026-05-23 16:02:39] [INFO ] Redundant transitions in 2 ms returned []
Running 74 sub problems to find dead transitions.
[2026-05-23 16:02:39] [INFO ] Invariant cache hit.
[2026-05-23 16:02:39] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 75/139 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 89 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2212 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 75/139 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 74/163 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 163 constraints, problems are : Problem set: 0 solved, 74 unsolved in 10938 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13183ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 13184ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/83 places, 75/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13450 ms. Remains : 64/83 places, 75/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-02
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-02 finished in 13512 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(X(X(X(X(F(p1))))))||p0))))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 72 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 72 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 66 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 66 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 64 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 62 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 60 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 59 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 59 transition count 69
Applied a total of 55 rules in 22 ms. Remains 59 /83 variables (removed 24) and now considering 69/112 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12007209982193192417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3974290692068483311.kers'
[2026-05-23 16:02:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12007209982193192417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3974290692068483311.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 69 rows 59 cols 219 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-23 16:02:53] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3974290692068483311.kers
Total runtime 0 ms.
[2026-05-23 16:02:53] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 16:02:53] [INFO ] Invariant cache hit.
[2026-05-23 16:02:53] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 16:02:53] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2026-05-23 16:02:53] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2026-05-23 16:02:53] [INFO ] Invariant cache hit.
[2026-05-23 16:02:53] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 68 unsolved in 2305 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 68/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 154 constraints, problems are : Problem set: 0 solved, 68 unsolved in 7752 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10075ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 10076ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/83 places, 69/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10309 ms. Remains : 59/83 places, 69/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(X(X(X(F(p1))))))||p0))))'
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-04
Product exploration explored 100000 steps with 22863 reset in 450 ms.
Product exploration explored 100000 steps with 22954 reset in 399 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 191 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge based reduction with 9 factoid took 82 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 40000 steps (9226 resets) in 132 ms. (300 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (2005 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
[2026-05-23 16:03:04] [INFO ] Invariant cache hit.
[2026-05-23 16:03:04] [INFO ] State equation strengthened by 25 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 2/128 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/59 constraints, ReadFeed: 0/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 129 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1)]
Knowledge-based reduction took 435 ms.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2026-05-23 16:03:04] [INFO ] Invariant cache hit.
[2026-05-23 16:03:04] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-23 16:03:04] [INFO ] Invariant cache hit.
[2026-05-23 16:03:05] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 16:03:05] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2026-05-23 16:03:05] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 59/59 places, 69/69 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 191 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 33152 steps (7648 resets) in 59 ms. (552 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Knowledge-based reduction took 197 ms.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 23021 reset in 204 ms.
Product exploration explored 100000 steps with 22913 reset in 236 ms.
Built C files in :
/tmp/ltsmin7926279501509898150
[2026-05-23 16:03:05] [INFO ] Computing symmetric may disable matrix : 69 transitions.
[2026-05-23 16:03:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:03:05] [INFO ] Computing symmetric may enable matrix : 69 transitions.
[2026-05-23 16:03:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:03:05] [INFO ] Computing Do-Not-Accords matrix : 69 transitions.
[2026-05-23 16:03:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:03:05] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7926279501509898150
Running compilation step : cd /tmp/ltsmin7926279501509898150;'/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 246 ms.
Running link step : cd /tmp/ltsmin7926279501509898150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7926279501509898150;'/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/stateBased10256882475237122702.hoa' '--buchi-type=spotba'
LTSmin run took 652 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-04 finished in 13886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((((X(F(p0))||p1) U p1) U p2)&&F(X(p3))))'
Support contains 6 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 73 transition count 96
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 73 transition count 96
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 68 transition count 90
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 68 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 68 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 67 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 67 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 66 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 66 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 65 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 65 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 65 transition count 82
Applied a total of 39 rules in 12 ms. Remains 65 /83 variables (removed 18) and now considering 82/112 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8520133835148375535.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10774151063764287319.kers'
[2026-05-23 16:03:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8520133835148375535.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10774151063764287319.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 65 cols 262 entries
Finished phase 1 with 60 SingleSign rule and 3 generalized
[2026-05-23 16:03:06] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10774151063764287319.kers
Total runtime 1 ms.
[2026-05-23 16:03:07] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-23 16:03:07] [INFO ] Invariant cache hit.
[2026-05-23 16:03:07] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-23 16:03:07] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2026-05-23 16:03:07] [INFO ] Invariant cache hit.
[2026-05-23 16:03:07] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/147 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 29/96 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 6/102 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/147 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 106 constraints, problems are : Problem set: 0 solved, 81 unsolved in 7749 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 82/147 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 29/106 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 81/187 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 187 constraints, problems are : Problem set: 0 solved, 81 unsolved in 12706 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20501ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 20502ms
Starting structural reductions in LTL mode, iteration 1 : 65/83 places, 82/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20857 ms. Remains : 65/83 places, 82/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((((X(F(p0))||p1) U p1) U p2)&&F(X(p3))))'
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p2) (NOT p3)), (NOT p3), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-05
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-05 finished in 21131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (F(p1) U p2))))'
Support contains 5 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 73 transition count 92
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 73 transition count 92
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 68 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 66 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 65 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 65 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 64 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 64 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 64 transition count 77
Applied a total of 42 rules in 12 ms. Remains 64 /83 variables (removed 19) and now considering 77/112 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10962149302729550554.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12104740661822171569.kers'
[2026-05-23 16:03:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10962149302729550554.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12104740661822171569.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 64 cols 251 entries
Finished phase 1 with 60 SingleSign rule and 2 generalized
[2026-05-23 16:03:28] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12104740661822171569.kers
Total runtime 1 ms.
[2026-05-23 16:03:28] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-23 16:03:28] [INFO ] Invariant cache hit.
[2026-05-23 16:03:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 16:03:28] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2026-05-23 16:03:28] [INFO ] Invariant cache hit.
[2026-05-23 16:03:28] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/141 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/141 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 91 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3072 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/141 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 76/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/141 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 167 constraints, problems are : Problem set: 0 solved, 76 unsolved in 13185 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16293ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 16294ms
Starting structural reductions in LTL mode, iteration 1 : 64/83 places, 77/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16666 ms. Remains : 64/83 places, 77/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (F(p1) U p2))))'
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-07
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-07 finished in 16843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||F(!p1)) U X((X(X(G(p1))) U G(p2)))))'
Support contains 2 out of 83 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 73 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 73 transition count 94
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 67 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 67 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 65 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 63 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 60 transition count 70
Applied a total of 53 rules in 16 ms. Remains 60 /83 variables (removed 23) and now considering 70/112 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7886876578085274383.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8342837987723002670.kers'
[2026-05-23 16:03:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7886876578085274383.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8342837987723002670.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 70 rows 60 cols 223 entries
Finished phase 1 with 56 SingleSign rule and 2 generalized
[2026-05-23 16:03:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8342837987723002670.kers
Total runtime 2 ms.
[2026-05-23 16:03:45] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-23 16:03:45] [INFO ] Invariant cache hit.
[2026-05-23 16:03:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 16:03:45] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2026-05-23 16:03:45] [INFO ] Redundant transitions in 2 ms returned []
Running 69 sub problems to find dead transitions.
[2026-05-23 16:03:45] [INFO ] Invariant cache hit.
[2026-05-23 16:03:45] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 87 constraints, problems are : Problem set: 0 solved, 69 unsolved in 2562 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/156 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 156 constraints, problems are : Problem set: 0 solved, 69 unsolved in 7082 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9673ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 9673ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/83 places, 70/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9984 ms. Remains : 60/83 places, 70/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||F(!p1)) U X((X(X(G(p1))) U G(p2)))))'
Stuttering acceptance computed with spot in 53 ms :[(NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-08
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-08 finished in 10090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||X(p1)))&&F(G(!p1)))))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 72 transition count 91
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 72 transition count 91
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 67 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 67 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 66 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 65 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 64 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 64 transition count 75
Applied a total of 43 rules in 22 ms. Remains 64 /83 variables (removed 19) and now considering 75/112 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15589941508825339181.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9030589823352173016.kers'
[2026-05-23 16:03:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15589941508825339181.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9030589823352173016.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 64 cols 243 entries
Finished phase 1 with 60 SingleSign rule and 2 generalized
[2026-05-23 16:03:55] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9030589823352173016.kers
Total runtime 1 ms.
[2026-05-23 16:03:55] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-23 16:03:55] [INFO ] Invariant cache hit.
[2026-05-23 16:03:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 16:03:55] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2026-05-23 16:03:55] [INFO ] Redundant transitions in 2 ms returned []
Running 74 sub problems to find dead transitions.
[2026-05-23 16:03:55] [INFO ] Invariant cache hit.
[2026-05-23 16:03:55] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 102 constraints, problems are : Problem set: 0 solved, 74 unsolved in 4910 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/139 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 25/102 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 74/176 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 176 constraints, problems are : Problem set: 0 solved, 74 unsolved in 9865 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14809ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 14810ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/83 places, 75/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15133 ms. Remains : 64/83 places, 75/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||X(p1)))&&F(G(!p1)))))'
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), p1, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-09
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-09 finished in 15273 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((p0&&X(p1))))&&(!p2 U (G(!p2)||(!p2&&(F(!p0) U !p1))))))'
Support contains 5 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 71 transition count 88
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 71 transition count 88
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 66 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 66 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 65 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 65 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 64 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 63 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 63 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 63 transition count 72
Applied a total of 45 rules in 5 ms. Remains 63 /83 variables (removed 20) and now considering 72/112 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5146161558462039060.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16602718334719487216.kers'
[2026-05-23 16:04:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5146161558462039060.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16602718334719487216.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 72 rows 63 cols 238 entries
Finished phase 1 with 59 SingleSign rule and 2 generalized
[2026-05-23 16:04:10] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16602718334719487216.kers
Total runtime 1 ms.
[2026-05-23 16:04:10] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-23 16:04:10] [INFO ] Invariant cache hit.
[2026-05-23 16:04:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 16:04:10] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2026-05-23 16:04:10] [INFO ] Invariant cache hit.
[2026-05-23 16:04:10] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/135 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 87 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2756 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/135 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 71/158 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 158 constraints, problems are : Problem set: 0 solved, 71 unsolved in 8136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10912ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 10912ms
Starting structural reductions in LTL mode, iteration 1 : 63/83 places, 72/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11140 ms. Remains : 63/83 places, 72/112 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((p0&&X(p1))))&&(!p2 U (G(!p2)||(!p2&&(F(!p0) U !p1))))))'
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p1) (NOT p0) p2), true, (OR (NOT p0) (NOT p1)), (AND p1 p2), (AND p0 p2 (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), p0, p1]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-10
Product exploration explored 100000 steps with 34026 reset in 169 ms.
Product exploration explored 100000 steps with 33882 reset in 183 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 203 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge based reduction with 18 factoid took 121 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (9206 resets) in 303 ms. (131 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40001 steps (2003 resets) in 108 ms. (366 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (2484 resets) in 327 ms. (121 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4245 resets) in 178 ms. (223 steps per ms) remains 2/4 properties
[2026-05-23 16:04:22] [INFO ] Invariant cache hit.
[2026-05-23 16:04:22] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/102 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 31/133 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/135 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 87 constraints, problems are : Problem set: 0 solved, 2 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/102 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 31/133 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/135 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/135 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/135 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 491ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 26 ms.
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 72/72 transitions.
Graph (complete) has 185 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 71
Applied a total of 2 rules in 8 ms. Remains 62 /63 variables (removed 1) and now considering 71/72 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 62/63 places, 71/72 transitions.
RANDOM walk for 40000 steps (9133 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2005 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20520 steps, run visited all 1 properties in 50 ms. (steps per millisecond=410 )
Probabilistic random walk after 20520 steps, saw 9099 distinct states, run finished after 50 ms. (steps per millisecond=410 ) properties seen :1
Knowledge based reduction with 18 factoid took 286 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(OR (NOT p1) p2), true, (NOT p1), (AND p1 p2), (AND p0 (NOT p1) p2), (NOT p1), (NOT p1), p0, p1]
Knowledge-based reduction took 1734 ms.
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p1) p2), true, (NOT p1), (AND p1 p2), (AND p0 (NOT p1) p2), (NOT p1), (NOT p1), p0, p1]
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2026-05-23 16:04:24] [INFO ] Invariant cache hit.
[2026-05-23 16:04:24] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-23 16:04:24] [INFO ] Invariant cache hit.
[2026-05-23 16:04:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 16:04:24] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 63/63 places, 72/72 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 203 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge based reduction with 17 factoid took 101 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (9100 resets) in 288 ms. (138 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40002 steps (2035 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2014 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
[2026-05-23 16:04:24] [INFO ] Invariant cache hit.
[2026-05-23 16:04:24] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/102 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 31/133 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/135 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 87 constraints, problems are : Problem set: 0 solved, 2 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/102 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 31/133 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/135 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/135 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/135 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 89 constraints, problems are : Problem set: 0 solved, 2 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 681ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 15 ms.
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 72/72 transitions.
Graph (complete) has 185 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 71
Applied a total of 2 rules in 7 ms. Remains 62 /63 variables (removed 1) and now considering 71/72 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 62/63 places, 71/72 transitions.
RANDOM walk for 40000 steps (9180 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1992 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20520 steps, run visited all 1 properties in 48 ms. (steps per millisecond=427 )
Probabilistic random walk after 20520 steps, saw 9099 distinct states, run finished after 49 ms. (steps per millisecond=418 ) properties seen :1
Knowledge based reduction with 17 factoid took 230 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p1) p2), true, (NOT p1), (AND p1 p2), (AND p0 (NOT p1) p2), (NOT p1), (NOT p1), p0, p1]
Knowledge-based reduction took 1626 ms.
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p1) p2), true, (NOT p1), (AND p1 p2), (AND p0 (NOT p1) p2), (NOT p1), (NOT p1), p0, p1]
Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p1) p2), true, (NOT p1), (AND p1 p2), (AND p0 (NOT p1) p2), (NOT p1), (NOT p1), p0, p1]
Product exploration explored 100000 steps with 29237 reset in 251 ms.
Product exploration explored 100000 steps with 29153 reset in 278 ms.
Spot run failed in 55 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/ltsmin2158098721817339593
[2026-05-23 16:04:27] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2158098721817339593
Running compilation step : cd /tmp/ltsmin2158098721817339593;'/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 231 ms.
Running link step : cd /tmp/ltsmin2158098721817339593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2158098721817339593;'/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/stateBased2661570905688779360.hoa' '--buchi-type=spotba'
LTSmin run took 35 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-10 finished in 17634 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(((G(p0) U X(X(G(p1)))) U X(p2))) U !p0)))'
Support contains 5 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 72 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 72 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 66 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 66 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 64 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 62 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 61 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 61 transition count 73
Applied a total of 49 rules in 5 ms. Remains 61 /83 variables (removed 22) and now considering 73/112 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3735649052103207729.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18015681360269484125.kers'
[2026-05-23 16:04:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3735649052103207729.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18015681360269484125.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 61 cols 233 entries
Finished phase 1 with 57 SingleSign rule and 2 generalized
[2026-05-23 16:04:27] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18015681360269484125.kers
Total runtime 1 ms.
[2026-05-23 16:04:28] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-23 16:04:28] [INFO ] Invariant cache hit.
[2026-05-23 16:04:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-23 16:04:28] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2026-05-23 16:04:28] [INFO ] Invariant cache hit.
[2026-05-23 16:04:28] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/134 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 96 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4231 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/134 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 26/96 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 72/168 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 168 constraints, problems are : Problem set: 0 solved, 72 unsolved in 8404 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12667ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 12668ms
Starting structural reductions in LTL mode, iteration 1 : 61/83 places, 73/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13010 ms. Remains : 61/83 places, 73/112 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(((G(p0) U X(X(G(p1)))) U X(p2))) U !p0)))'
Stuttering acceptance computed with spot in 338 ms :[p0, p0, false, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1), true, (NOT p1), (AND (NOT p0) p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 16 ms. Proved property starting from automaton with 10 states, 25 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-11 finished in 13939 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(((!p0 U (p1||G(!p0)))||(X(!p2) U ((!p3&&X(!p2))||X(G(!p2))))))))'
Support contains 7 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 74 transition count 93
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 74 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 68 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 68 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 68 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 67 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 67 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 66 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 65 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 65 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 64 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 64 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 64 transition count 77
Applied a total of 42 rules in 5 ms. Remains 64 /83 variables (removed 19) and now considering 77/112 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9106430876238205352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3553303810726886209.kers'
[2026-05-23 16:04:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9106430876238205352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3553303810726886209.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 64 cols 253 entries
Finished phase 1 with 60 SingleSign rule and 2 generalized
[2026-05-23 16:04:41] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3553303810726886209.kers
Total runtime 1 ms.
[2026-05-23 16:04:41] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-23 16:04:41] [INFO ] Invariant cache hit.
[2026-05-23 16:04:42] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-23 16:04:42] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2026-05-23 16:04:42] [INFO ] Invariant cache hit.
[2026-05-23 16:04:42] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/141 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/141 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 90 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/141 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 76/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/141 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 166 constraints, problems are : Problem set: 0 solved, 76 unsolved in 9225 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11312ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 11312ms
Starting structural reductions in LTL mode, iteration 1 : 64/83 places, 77/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11604 ms. Remains : 64/83 places, 77/112 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(((!p0 U (p1||G(!p0)))||(X(!p2) U ((!p3&&X(!p2))||X(G(!p2))))))))'
Stuttering acceptance computed with spot in 404 ms :[(AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2), (AND (NOT p1) p0 p2), p2, (AND p0 (NOT p1) p2), p2, true, (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 153 ms.
Product exploration explored 100000 steps with 33333 reset in 158 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 209 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 20 ms. Proved property starting from automaton with 8 states, 15 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 23 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-13 finished in 12402 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 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 73 transition count 96
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 73 transition count 96
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 68 transition count 90
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 68 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 68 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 67 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 66 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 65 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 65 transition count 80
Applied a total of 41 rules in 16 ms. Remains 65 /83 variables (removed 18) and now considering 80/112 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17253836575433792977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-477681567529783730.kers'
[2026-05-23 16:04:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17253836575433792977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-477681567529783730.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 80 rows 65 cols 252 entries
Finished phase 1 with 61 SingleSign rule and 2 generalized
[2026-05-23 16:04:54] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-477681567529783730.kers
Total runtime 2 ms.
[2026-05-23 16:04:54] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-23 16:04:54] [INFO ] Invariant cache hit.
[2026-05-23 16:04:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-23 16:04:54] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2026-05-23 16:04:54] [INFO ] Redundant transitions in 2 ms returned []
Running 79 sub problems to find dead transitions.
[2026-05-23 16:04:54] [INFO ] Invariant cache hit.
[2026-05-23 16:04:54] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/145 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 30/97 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 100 constraints, problems are : Problem set: 0 solved, 79 unsolved in 4072 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 80/145 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 30/100 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 79/179 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 179 constraints, problems are : Problem set: 0 solved, 79 unsolved in 8982 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13093ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 13093ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/83 places, 80/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13418 ms. Remains : 65/83 places, 80/112 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 35 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-14 finished in 13483 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 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 72 transition count 89
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 72 transition count 89
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 66 transition count 82
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 66 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 64 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 62 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 60 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 59 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 59 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 59 transition count 66
Applied a total of 54 rules in 13 ms. Remains 59 /83 variables (removed 24) and now considering 66/112 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7498492876566552734.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11983095981599373720.kers'
[2026-05-23 16:05:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7498492876566552734.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11983095981599373720.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 59 cols 218 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-23 16:05:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11983095981599373720.kers
Total runtime 0 ms.
[2026-05-23 16:05:07] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 16:05:07] [INFO ] Invariant cache hit.
[2026-05-23 16:05:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:05:07] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2026-05-23 16:05:07] [INFO ] Redundant transitions in 2 ms returned []
Running 65 sub problems to find dead transitions.
[2026-05-23 16:05:07] [INFO ] Invariant cache hit.
[2026-05-23 16:05:07] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 66/125 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 84 constraints, problems are : Problem set: 0 solved, 65 unsolved in 4182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 66/125 variables, 59/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 65/149 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 149 constraints, problems are : Problem set: 0 solved, 65 unsolved in 6159 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10372ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 10373ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/83 places, 66/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10608 ms. Remains : 59/83 places, 66/112 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 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-15
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-15 finished in 10715 ms.
All properties solved by simple procedures.
Total runtime 225993 ms.

BK_STOP 1779552318479

--------------------
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-d0m05"
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-d0m05, 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-177946993500092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m05.tgz
mv DBSingleClientW-PT-d0m05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;