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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.7K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 6 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 6 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 6 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:46 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-d0m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779558598048

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-d0m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 17:50:00] [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 17:50:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:50:00] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2026-05-23 17:50:00] [INFO ] Transformed 553 places.
[2026-05-23 17:50:00] [INFO ] Transformed 150 transitions.
[2026-05-23 17:50:00] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 395 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 30 place count 90 transition count 122
Iterating global reduction 1 with 12 rules applied. Total rules applied 42 place count 90 transition count 122
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 86 transition count 118
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 86 transition count 118
Applied a total of 50 rules in 65 ms. Remains 86 /109 variables (removed 23) and now considering 118/150 (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-15387806734851302280.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14970736364324106733.kers'
[2026-05-23 17:50:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15387806734851302280.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14970736364324106733.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 118 rows 86 cols 362 entries
Finished phase 1 with 82 SingleSign rule and 2 generalized
[2026-05-23 17:50:01] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14970736364324106733.kers
Total runtime 3 ms.
[2026-05-23 17:50:01] [INFO ] Implicit Places using invariants in 471 ms returned []
[2026-05-23 17:50:01] [INFO ] Invariant cache hit.
[2026-05-23 17:50:02] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-23 17:50:02] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2026-05-23 17:50:02] [INFO ] Invariant cache hit.
[2026-05-23 17:50:02] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/204 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 49/137 constraints. Problems are: Problem set: 0 solved, 117 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 137 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5948 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/204 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 49/137 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 117/254 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 254 constraints, problems are : Problem set: 0 solved, 117 unsolved in 27444 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33787ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 33813ms
Starting structural reductions in LTL mode, iteration 1 : 86/109 places, 118/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34905 ms. Remains : 86/109 places, 118/150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2026-05-23 17:50:36] [INFO ] Invariant cache hit.
[2026-05-23 17:50:36] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-23 17:50:36] [INFO ] Invariant cache hit.
[2026-05-23 17:50:36] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-23 17:50:36] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 86/86 places, 118/118 transitions.
Support contains 28 out of 86 places after structural reductions.
[2026-05-23 17:50:37] [INFO ] Flatten gal took : 69 ms
[2026-05-23 17:50:37] [INFO ] Flatten gal took : 30 ms
[2026-05-23 17:50:37] [INFO ] Input system was already deterministic with 118 transitions.
Support contains 27 out of 86 places (down from 28) after GAL structural reductions.
RANDOM walk for 40000 steps (9204 resets) in 2229 ms. (17 steps per ms) remains 13/23 properties
BEST_FIRST walk for 40003 steps (1957 resets) in 592 ms. (67 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40003 steps (1975 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (2029 resets) in 174 ms. (228 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (3983 resets) in 197 ms. (202 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40002 steps (4105 resets) in 171 ms. (232 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (1963 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (3981 resets) in 144 ms. (275 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40000 steps (2046 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1995 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
[2026-05-23 17:50:38] [INFO ] Invariant cache hit.
[2026-05-23 17:50:38] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 30/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 23/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 94/157 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 47/204 variables, 23/113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/204 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 137 constraints, problems are : Problem set: 0 solved, 7 unsolved in 592 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 30/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 23/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 94/157 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 47/204 variables, 23/113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 24/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 7/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/204 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 144 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1831 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2463ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 1 properties in 1734 ms.
Support contains 9 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 118/118 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 77 transition count 100
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 77 transition count 100
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 72 transition count 95
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 72 transition count 95
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 71 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 71 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 70 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 70 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 69 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 69 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 69 transition count 88
Applied a total of 36 rules in 51 ms. Remains 69 /86 variables (removed 17) and now considering 88/118 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 69/86 places, 88/118 transitions.
RANDOM walk for 40000 steps (9130 resets) in 271 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1939 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1991 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (4070 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4059 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1970 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (2033 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 5224 steps, run visited all 6 properties in 80 ms. (steps per millisecond=65 )
Probabilistic random walk after 5224 steps, saw 2393 distinct states, run finished after 87 ms. (steps per millisecond=60 ) properties seen :6
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 290 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(p1)&&F(G(p2))))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 75 transition count 97
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 75 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 75 transition count 96
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 68 transition count 88
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 68 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 66 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 64 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 64 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 62 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 62 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 61 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 61 transition count 71
Applied a total of 58 rules in 25 ms. Remains 61 /86 variables (removed 25) and now considering 71/118 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12665934024025857362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16868083883999669024.kers'
[2026-05-23 17:50:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12665934024025857362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16868083883999669024.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 71 rows 61 cols 225 entries
Finished phase 1 with 57 SingleSign rule and 2 generalized
[2026-05-23 17:50:43] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16868083883999669024.kers
Total runtime 1 ms.
[2026-05-23 17:50:44] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-23 17:50:44] [INFO ] Invariant cache hit.
[2026-05-23 17:50:44] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-23 17:50:44] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2026-05-23 17:50:44] [INFO ] Invariant cache hit.
[2026-05-23 17:50:44] [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, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 89 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2416 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: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 70/159 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 159 constraints, problems are : Problem set: 0 solved, 70 unsolved in 9128 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: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11612ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 11615ms
Starting structural reductions in LTL mode, iteration 1 : 61/86 places, 71/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11957 ms. Remains : 61/86 places, 71/118 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&F(G(p1))&&p2))))'
Stuttering acceptance computed with spot in 480 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-00 finished in 12580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1||X(!p2)))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 74 transition count 93
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 74 transition count 93
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 66 transition count 84
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 66 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 64 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 62 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 62 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 60 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 59 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 59 transition count 67
Applied a total of 61 rules in 27 ms. Remains 59 /86 variables (removed 27) and now considering 67/118 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1790674363709694556.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2536743988806199919.kers'
[2026-05-23 17:50:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1790674363709694556.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2536743988806199919.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 67 rows 59 cols 215 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-23 17:50:56] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2536743988806199919.kers
Total runtime 1 ms.
[2026-05-23 17:50:56] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-23 17:50:56] [INFO ] Invariant cache hit.
[2026-05-23 17:50:56] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-23 17:50:56] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2026-05-23 17:50:56] [INFO ] Invariant cache hit.
[2026-05-23 17:50:56] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/126 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 0/126 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 89 constraints, problems are : Problem set: 0 solved, 66 unsolved in 6389 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 67/126 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 23/89 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 66/155 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 155 constraints, problems are : Problem set: 0 solved, 66 unsolved in 6886 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13308ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 13309ms
Starting structural reductions in LTL mode, iteration 1 : 59/86 places, 67/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13667 ms. Remains : 59/86 places, 67/118 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (X(!p1)||p2))))'
Stuttering acceptance computed with spot in 192 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 365 ms.
Product exploration explored 100000 steps with 33333 reset in 237 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.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 11 factoid took 20 ms. Proved property starting from automaton with 6 states, 10 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 27 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-01 finished in 14531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 91
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 73 transition count 90
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 65 transition count 81
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 65 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 63 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 59 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 58 transition count 64
Applied a total of 64 rules in 29 ms. Remains 58 /86 variables (removed 28) and now considering 64/118 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17362842441578807731.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11094805752271465727.kers'
[2026-05-23 17:51:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17362842441578807731.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11094805752271465727.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 64 rows 58 cols 210 entries
Finished phase 1 with 54 SingleSign rule and 2 generalized
[2026-05-23 17:51:10] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11094805752271465727.kers
Total runtime 0 ms.
[2026-05-23 17:51:11] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-23 17:51:11] [INFO ] Invariant cache hit.
[2026-05-23 17:51:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 17:51:11] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2026-05-23 17:51:11] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2026-05-23 17:51:11] [INFO ] Invariant cache hit.
[2026-05-23 17:51:11] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1705 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 9839 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11584ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 11584ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/86 places, 64/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11941 ms. Remains : 58/86 places, 64/118 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 37 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-03
Product exploration explored 100000 steps with 22965 reset in 196 ms.
Product exploration explored 100000 steps with 22789 reset in 352 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 186 edges and 58 vertex of which 57 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 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9141 resets) in 754 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (2032 resets) in 236 ms. (168 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4124 steps, run visited all 1 properties in 20 ms. (steps per millisecond=206 )
Probabilistic random walk after 4124 steps, saw 1878 distinct states, run finished after 20 ms. (steps per millisecond=206 ) properties seen :1
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Knowledge-based reduction took 525 ms.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 58 /58 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2026-05-23 17:51:24] [INFO ] Invariant cache hit.
[2026-05-23 17:51:24] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-23 17:51:24] [INFO ] Invariant cache hit.
[2026-05-23 17:51:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 17:51:24] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2026-05-23 17:51:24] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 300 ms. Remains : 58/58 places, 64/64 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 186 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9150 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2055 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4124 steps, run visited all 1 properties in 19 ms. (steps per millisecond=217 )
Probabilistic random walk after 4124 steps, saw 1878 distinct states, run finished after 20 ms. (steps per millisecond=206 ) properties seen :1
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Knowledge-based reduction took 314 ms.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22986 reset in 221 ms.
Product exploration explored 100000 steps with 22897 reset in 243 ms.
Built C files in :
/tmp/ltsmin18192329852991144735
[2026-05-23 17:51:25] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2026-05-23 17:51:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:51:25] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2026-05-23 17:51:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:51:25] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2026-05-23 17:51:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:51:25] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18192329852991144735
Running compilation step : cd /tmp/ltsmin18192329852991144735;'/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 646 ms.
Running link step : cd /tmp/ltsmin18192329852991144735;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin18192329852991144735;'/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/stateBased17615499548623437745.hoa' '--buchi-type=spotba'
LTSmin run took 114 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-03 finished in 15280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1)||F(p2))&&(X(X(!p1)) U ((!p3&&X(X(!p1)))||X(X(G(!p1)))))))'
Support contains 7 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 74 transition count 94
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 74 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 74 transition count 93
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 67 transition count 85
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 67 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 66 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 65 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 64 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 64 transition count 75
Applied a total of 50 rules in 14 ms. Remains 64 /86 variables (removed 22) and now considering 75/118 (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-1761052556359095070.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7713283290565897470.kers'
[2026-05-23 17:51:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1761052556359095070.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7713283290565897470.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 64 cols 245 entries
Finished phase 1 with 60 SingleSign rule and 2 generalized
[2026-05-23 17:51:26] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7713283290565897470.kers
Total runtime 1 ms.
[2026-05-23 17:51:26] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-23 17:51:26] [INFO ] Invariant cache hit.
[2026-05-23 17:51:26] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-23 17:51:26] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2026-05-23 17:51:26] [INFO ] Invariant cache hit.
[2026-05-23 17:51:26] [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, 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, 24/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/139 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 98 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5577 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: 74/74 constraints, Known Traps: 8/8 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, 7/10 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/139 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 74/172 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 172 constraints, problems are : Problem set: 0 solved, 74 unsolved in 18606 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: 74/74 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24229ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 24230ms
Starting structural reductions in LTL mode, iteration 1 : 64/86 places, 75/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24636 ms. Remains : 64/86 places, 75/118 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)&&(X(X(!p1)) U ((!p2&&X(X(!p1)))||X(X(G(!p1)))))&&(G(p1)||F(p3))))'
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (NOT p3) p1), (NOT p0), (NOT p3), (AND (NOT p3) (NOT p1)), p1, p1, p1, true]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-04
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-04 finished in 25025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((G(p1) U X(X(p0))))))))'
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 74 transition count 94
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 74 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 74 transition count 93
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 68 transition count 87
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 68 transition count 87
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 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 66 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 64 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 63 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 63 transition count 75
Applied a total of 51 rules in 12 ms. Remains 63 /86 variables (removed 23) and now considering 75/118 (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-6519622324926820851.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4296773598450734330.kers'
[2026-05-23 17:51:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6519622324926820851.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4296773598450734330.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 63 cols 241 entries
Finished phase 1 with 59 SingleSign rule and 2 generalized
[2026-05-23 17:51:51] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4296773598450734330.kers
Total runtime 1 ms.
[2026-05-23 17:51:51] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-23 17:51:51] [INFO ] Invariant cache hit.
[2026-05-23 17:51:51] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-23 17:51:51] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2026-05-23 17:51:51] [INFO ] Invariant cache hit.
[2026-05-23 17:51:51] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/138 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 91 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2841 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 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/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/138 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 74/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 165 constraints, problems are : Problem set: 0 solved, 74 unsolved in 7851 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10728ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 10729ms
Starting structural reductions in LTL mode, iteration 1 : 63/86 places, 75/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11080 ms. Remains : 63/86 places, 75/118 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((G(p0) U X(X(p1))))||p1))))'
Stuttering acceptance computed with spot in 881 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-05 finished in 12042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X((X(X((F(p0)||p1)))||!p2))))'
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 75 transition count 97
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 75 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 75 transition count 96
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 68 transition count 89
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 68 transition count 89
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 68 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 66 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 64 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 63 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 63 transition count 77
Applied a total of 51 rules in 9 ms. Remains 63 /86 variables (removed 23) and now considering 77/118 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4636597213318907876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11814573823673720138.kers'
[2026-05-23 17:52:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4636597213318907876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11814573823673720138.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 63 cols 247 entries
Finished phase 1 with 59 SingleSign rule and 2 generalized
[2026-05-23 17:52:03] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11814573823673720138.kers
Total runtime 1 ms.
[2026-05-23 17:52:03] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-23 17:52:03] [INFO ] Invariant cache hit.
[2026-05-23 17:52:03] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-23 17:52:03] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2026-05-23 17:52:03] [INFO ] Invariant cache hit.
[2026-05-23 17:52:03] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/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, 27/92 constraints. Problems are: Problem set: 0 solved, 76 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 92 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3070 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 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, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/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, 27/92 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/168 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 168 constraints, problems are : Problem set: 0 solved, 76 unsolved in 13755 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16860ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 16862ms
Starting structural reductions in LTL mode, iteration 1 : 63/86 places, 77/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17169 ms. Remains : 63/86 places, 77/118 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X((X(X((F(p0)||p1)))||!p2))))'
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) p1 p0), (OR (NOT p2) p1 p0), true, (OR p1 p0), (OR p1 p0), p0]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-06 finished in 17427 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 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 74 transition count 92
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 74 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 74 transition count 91
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 68 transition count 84
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 68 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 68 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 67 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 66 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 66 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 65 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 64 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 64 transition count 74
Applied a total of 50 rules in 14 ms. Remains 64 /86 variables (removed 22) and now considering 74/118 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1759231920785702251.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2395105667640116873.kers'
[2026-05-23 17:52:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1759231920785702251.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2395105667640116873.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 74 rows 64 cols 246 entries
Finished phase 1 with 60 SingleSign rule and 2 generalized
[2026-05-23 17:52:20] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2395105667640116873.kers
Total runtime 1 ms.
[2026-05-23 17:52:20] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-23 17:52:20] [INFO ] Invariant cache hit.
[2026-05-23 17:52:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 17:52:20] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2026-05-23 17:52:21] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2026-05-23 17:52:21] [INFO ] Invariant cache hit.
[2026-05-23 17:52:21] [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, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/138 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 90 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2697 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: 73/73 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 74/138 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 73/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 163 constraints, problems are : Problem set: 0 solved, 73 unsolved in 10151 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: 73/73 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12868ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 12869ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/86 places, 74/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13134 ms. Remains : 64/86 places, 74/118 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-08
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-08 finished in 13193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0) U p1)&&X((X(!p2) U p3)))))'
Support contains 7 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 76 transition count 96
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 76 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 76 transition count 95
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 70 transition count 89
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 70 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 69 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 68 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 67 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 67 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 67 transition count 81
Applied a total of 42 rules in 6 ms. Remains 67 /86 variables (removed 19) and now considering 81/118 (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-8072343296361807897.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14157285719807822428.kers'
[2026-05-23 17:52:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8072343296361807897.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14157285719807822428.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 81 rows 67 cols 265 entries
Finished phase 1 with 63 SingleSign rule and 2 generalized
[2026-05-23 17:52:33] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14157285719807822428.kers
Total runtime 1 ms.
[2026-05-23 17:52:34] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-23 17:52:34] [INFO ] Invariant cache hit.
[2026-05-23 17:52:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-23 17:52:34] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2026-05-23 17:52:34] [INFO ] Invariant cache hit.
[2026-05-23 17:52:34] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/148 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 95 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3619 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/148 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 80/175 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/148 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 175 constraints, problems are : Problem set: 0 solved, 80 unsolved in 12619 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16289ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 16289ms
Starting structural reductions in LTL mode, iteration 1 : 67/86 places, 81/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16532 ms. Remains : 67/86 places, 81/118 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0) U p1)&&X((X(!p2) U p3)))))'
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), p0, (NOT p1), (NOT p3), (OR (NOT p3) p2), true]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-09 finished in 16848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U p1))'
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 74 transition count 94
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 74 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 74 transition count 93
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 67 transition count 85
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 67 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 66 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 66 transition count 79
Applied a total of 44 rules in 17 ms. Remains 66 /86 variables (removed 20) and now considering 79/118 (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-9382657224284293031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8406936725276464119.kers'
[2026-05-23 17:52:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9382657224284293031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8406936725276464119.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 79 rows 66 cols 257 entries
Finished phase 1 with 62 SingleSign rule and 2 generalized
[2026-05-23 17:52:50] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8406936725276464119.kers
Total runtime 1 ms.
[2026-05-23 17:52:50] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-23 17:52:50] [INFO ] Invariant cache hit.
[2026-05-23 17:52:51] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-23 17:52:51] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2026-05-23 17:52:51] [INFO ] Redundant transitions in 3 ms returned []
Running 78 sub problems to find dead transitions.
[2026-05-23 17:52:51] [INFO ] Invariant cache hit.
[2026-05-23 17:52:51] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/145 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 78 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/145 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 101 constraints, problems are : Problem set: 0 solved, 78 unsolved in 8308 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 79/145 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 26/101 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 78/179 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 179 constraints, problems are : Problem set: 0 solved, 78 unsolved in 10870 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19207ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 19208ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/86 places, 79/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19604 ms. Remains : 66/86 places, 79/118 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U p1))'
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), p0]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-10 finished in 19704 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||(!p1&&G(p2))))))'
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 75 transition count 99
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 75 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 75 transition count 98
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 69 transition count 91
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 69 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 69 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 68 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 67 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 66 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 66 transition count 81
Applied a total of 46 rules in 16 ms. Remains 66 /86 variables (removed 20) and now considering 81/118 (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-5670725517500859687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2302041009216952494.kers'
[2026-05-23 17:53:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5670725517500859687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2302041009216952494.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 81 rows 66 cols 256 entries
Finished phase 1 with 62 SingleSign rule and 2 generalized
[2026-05-23 17:53:10] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2302041009216952494.kers
Total runtime 0 ms.
[2026-05-23 17:53:10] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-23 17:53:10] [INFO ] Invariant cache hit.
[2026-05-23 17:53:10] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-23 17:53:10] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2026-05-23 17:53:10] [INFO ] Redundant transitions in 3 ms returned []
Running 80 sub problems to find dead transitions.
[2026-05-23 17:53:10] [INFO ] Invariant cache hit.
[2026-05-23 17:53:10] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/147 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 30/98 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 98 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3643 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/147 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 30/98 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 80/178 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/147 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 178 constraints, problems are : Problem set: 0 solved, 80 unsolved in 10017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13691ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 13691ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/86 places, 81/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13974 ms. Remains : 66/86 places, 81/118 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||(G(p1)&&p2)))))'
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-11
Product exploration explored 100000 steps with 22915 reset in 279 ms.
Product exploration explored 100000 steps with 22894 reset in 341 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 215 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge based reduction with 13 factoid took 63 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (9181 resets) in 498 ms. (80 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (1973 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
[2026-05-23 17:53:25] [INFO ] Invariant cache hit.
[2026-05-23 17:53:25] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/107 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 38/145 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/147 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/147 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/147 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/107 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 38/145 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/147 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/147 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/147 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/147 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 288ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 28 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 6 ms.
Knowledge based reduction with 13 factoid took 127 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 784 ms.
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2026-05-23 17:53:26] [INFO ] Invariant cache hit.
[2026-05-23 17:53:26] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-23 17:53:26] [INFO ] Invariant cache hit.
[2026-05-23 17:53:26] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-23 17:53:26] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2026-05-23 17:53:26] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 66/66 places, 81/81 transitions.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 215 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge based reduction with 13 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (9121 resets) in 208 ms. (191 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (2011 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2026-05-23 17:53:26] [INFO ] Invariant cache hit.
[2026-05-23 17:53:26] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/107 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 38/145 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/147 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/147 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/147 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/107 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 38/145 variables, 19/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 19/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/147 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/147 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/147 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/147 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 416ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 31 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 0 ms.
Knowledge based reduction with 13 factoid took 188 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 953 ms.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 23047 reset in 307 ms.
Product exploration explored 100000 steps with 22872 reset in 277 ms.
Built C files in :
/tmp/ltsmin8011024604082267541
[2026-05-23 17:53:28] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2026-05-23 17:53:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:53:28] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2026-05-23 17:53:28] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:53:28] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2026-05-23 17:53:28] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:53:28] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8011024604082267541
Running compilation step : cd /tmp/ltsmin8011024604082267541;'/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 287 ms.
Running link step : cd /tmp/ltsmin8011024604082267541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8011024604082267541;'/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/stateBased15369169369739910900.hoa' '--buchi-type=spotba'
LTSmin run took 58 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-11 finished in 18232 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 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 91
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 73 transition count 90
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 66 transition count 82
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 66 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 64 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 62 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 60 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 59 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 59 transition count 65
Applied a total of 62 rules in 14 ms. Remains 59 /86 variables (removed 27) and now considering 65/118 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14655817984349341070.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17875915738365445655.kers'
[2026-05-23 17:53:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14655817984349341070.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17875915738365445655.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 65 rows 59 cols 214 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-23 17:53:28] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17875915738365445655.kers
Total runtime 1 ms.
[2026-05-23 17:53:28] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-23 17:53:28] [INFO ] Invariant cache hit.
[2026-05-23 17:53:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 17:53:28] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2026-05-23 17:53:28] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2026-05-23 17:53:28] [INFO ] Invariant cache hit.
[2026-05-23 17:53:28] [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, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/124 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 87 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3706 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: 64/64 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 65/124 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 64/151 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 151 constraints, problems are : Problem set: 0 solved, 64 unsolved in 7591 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: 64/64 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11319ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 11319ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/86 places, 65/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11542 ms. Remains : 59/86 places, 65/118 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 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-12
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-12 finished in 11636 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((G(F(!p0))||(!p1&&F(!p0))))&&F((p2&&X(X(!p3)))))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 75 transition count 98
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 75 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 75 transition count 96
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 68 transition count 88
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 68 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 41 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 66 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 65 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 65 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 64 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 64 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 64 transition count 77
Applied a total of 51 rules in 10 ms. Remains 64 /86 variables (removed 22) and now considering 77/118 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11367835372056747781.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15490164023325322117.kers'
[2026-05-23 17:53:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11367835372056747781.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15490164023325322117.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 64 cols 247 entries
Finished phase 1 with 60 SingleSign rule and 2 generalized
[2026-05-23 17:53:40] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15490164023325322117.kers
Total runtime 2 ms.
[2026-05-23 17:53:40] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-23 17:53:40] [INFO ] Invariant cache hit.
[2026-05-23 17:53:40] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-23 17:53:40] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2026-05-23 17:53:40] [INFO ] Invariant cache hit.
[2026-05-23 17:53:40] [INFO ] State equation strengthened by 27 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, 27/93 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/141 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 93 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2980 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 27/27 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, 27/93 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 76/169 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/141 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 169 constraints, problems are : Problem set: 0 solved, 76 unsolved in 10962 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13969ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 13970ms
Starting structural reductions in LTL mode, iteration 1 : 64/86 places, 77/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14206 ms. Remains : 64/86 places, 77/118 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((G(F(p0))||(p1&&F(p0))))&&F((p2&&X(X(p3)))))))'
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p2) (NOT p0) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-14
Product exploration explored 100000 steps with 29789 reset in 149 ms.
Product exploration explored 100000 steps with 29791 reset in 340 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 208 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge based reduction with 8 factoid took 106 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (9239 resets) in 271 ms. (147 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (2003 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1957 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2012 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
[2026-05-23 17:53:55] [INFO ] Invariant cache hit.
[2026-05-23 17:53:55] [INFO ] State equation strengthened by 27 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) 21/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 8 (OVERLAPS) 33/141 variables, 18/78 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 15/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 93 constraints, problems are : Problem set: 1 solved, 2 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/46 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 12/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 33/141 variables, 18/78 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 15/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 2/95 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/141 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 95 constraints, problems are : Problem set: 1 solved, 2 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 653ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 162 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 77/77 transitions.
Graph (complete) has 189 edges and 64 vertex of which 63 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 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 62 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 62 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 61 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 61 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 60 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 59 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 59 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 58 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 58 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 14 place count 58 transition count 68
Applied a total of 14 rules in 22 ms. Remains 58 /64 variables (removed 6) and now considering 68/77 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 58/64 places, 68/77 transitions.
RANDOM walk for 40000 steps (9255 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2034 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2036 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4124 steps, run visited all 2 properties in 30 ms. (steps per millisecond=137 )
Probabilistic random walk after 4124 steps, saw 1878 distinct states, run finished after 30 ms. (steps per millisecond=137 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge based reduction with 9 factoid took 165 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p2) (NOT p0) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (NOT p3), (NOT p3)]
Knowledge-based reduction took 1745 ms.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p2) (NOT p0) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (NOT p3), (NOT p3)]
Support contains 4 out of 64 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 77/77 transitions.
Applied a total of 0 rules in 0 ms. Remains 64 /64 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2026-05-23 17:53:57] [INFO ] Invariant cache hit.
[2026-05-23 17:53:57] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-23 17:53:57] [INFO ] Invariant cache hit.
[2026-05-23 17:53:57] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-23 17:53:57] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 64/64 places, 77/77 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 208 edges and 64 vertex of which 63 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 6 factoid took 107 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (9192 resets) in 113 ms. (350 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (1982 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
[2026-05-23 17:53:57] [INFO ] Invariant cache hit.
[2026-05-23 17:53:57] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/102 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 39/141 variables, 19/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 93 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 57/102 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 39/141 variables, 19/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/141 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/141 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 406ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1590 steps, including 225 resets, run visited all 1 properties in 7 ms. (steps per millisecond=227 )
Parikh walk visited 1 properties in 6 ms.
Knowledge based reduction with 6 factoid took 177 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p2) (NOT p0) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (NOT p3), (NOT p3)]
Knowledge-based reduction took 1042 ms.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p2) (NOT p0) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p2) (NOT p0) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 29801 reset in 256 ms.
Product exploration explored 100000 steps with 29763 reset in 316 ms.
Spot run failed in 122 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/ltsmin7464019915832576889
[2026-05-23 17:54:00] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7464019915832576889
Running compilation step : cd /tmp/ltsmin7464019915832576889;'/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 243 ms.
Running link step : cd /tmp/ltsmin7464019915832576889;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7464019915832576889;'/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/stateBased4375594736205882687.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 77/77 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 62 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 62 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 61 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 60 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 59 transition count 69
Applied a total of 12 rules in 5 ms. Remains 59 /64 variables (removed 5) and now considering 69/77 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4677936536461297411.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18429290487777427989.kers'
[2026-05-23 17:54:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4677936536461297411.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18429290487777427989.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 17:54:15] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18429290487777427989.kers
Total runtime 2 ms.
[2026-05-23 17:54:15] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-23 17:54:15] [INFO ] Invariant cache hit.
[2026-05-23 17:54:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 17:54:15] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2026-05-23 17:54:15] [INFO ] Invariant cache hit.
[2026-05-23 17:54:15] [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 2298 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 7226 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 9551ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 9552ms
Starting structural reductions in LTL mode, iteration 1 : 59/64 places, 69/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9873 ms. Remains : 59/64 places, 69/77 transitions.
Built C files in :
/tmp/ltsmin207357017168205868
[2026-05-23 17:54:24] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin207357017168205868
Running compilation step : cd /tmp/ltsmin207357017168205868;'/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 215 ms.
Running link step : cd /tmp/ltsmin207357017168205868;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin207357017168205868;'/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/stateBased14034169147502944095.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 17:54:39] [INFO ] Flatten gal took : 7 ms
[2026-05-23 17:54:39] [INFO ] Flatten gal took : 6 ms
[2026-05-23 17:54:39] [INFO ] Time to serialize gal into /tmp/LTL6539857263475621864.gal : 3 ms
[2026-05-23 17:54:40] [INFO ] Time to serialize properties into /tmp/LTL545374872692406726.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6539857263475621864.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12977791424943084367.hoa' '-atoms' '/tmp/LTL545374872692406726.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL545374872692406726.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12977791424943084367.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t68, t86, t88, t89, t9...339
Computing Next relation with stutter on 5.32955e+06 deadlock states
Detected timeout of ITS tools.
[2026-05-23 17:54:55] [INFO ] Flatten gal took : 8 ms
[2026-05-23 17:54:55] [INFO ] Flatten gal took : 7 ms
[2026-05-23 17:54:55] [INFO ] Time to serialize gal into /tmp/LTL4477380559427083962.gal : 3 ms
[2026-05-23 17:54:55] [INFO ] Time to serialize properties into /tmp/LTL2598052174568603863.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4477380559427083962.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2598052174568603863.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F((G(F("((s1<1)||(l114<1))")))||(("((s1<1)||(l484<1))")&&(F("((s1<1)||(l114<1))")))))&&(F(("((s1<1)||(l150<1))")&&(X(X("((s1<1)|...174
Formula 0 simplified : F(G(FG!"((s1<1)||(l114<1))" & (!"((s1<1)||(l484<1))" | G!"((s1<1)||(l114<1))")) | G(!"((s1<1)||(l150<1))" | XX!"((s1<1)||(l355<1))")...156
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t68, t86, t88, t89, t9...351
Computing Next relation with stutter on 1.35637e+07 deadlock states
Detected timeout of ITS tools.
[2026-05-23 17:55:10] [INFO ] Flatten gal took : 6 ms
[2026-05-23 17:55:10] [INFO ] Applying decomposition
[2026-05-23 17:55:10] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13087464342497755746.txt' '-o' '/tmp/graph13087464342497755746.bin' '-w' '/tmp/graph13087464342497755746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13087464342497755746.bin' '-l' '-1' '-v' '-w' '/tmp/graph13087464342497755746.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:55:10] [INFO ] Decomposing Gal with order
[2026-05-23 17:55:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:55:10] [INFO ] Removed a total of 69 redundant transitions.
[2026-05-23 17:55:10] [INFO ] Flatten gal took : 114 ms
[2026-05-23 17:55:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 14 ms.
[2026-05-23 17:55:10] [INFO ] Time to serialize gal into /tmp/LTL1877060894729390235.gal : 6 ms
[2026-05-23 17:55:10] [INFO ] Time to serialize properties into /tmp/LTL14191542579796512819.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1877060894729390235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14191542579796512819.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F((G(F("((i4.u1.s1<1)||(u5.l114<1))")))||(("((i4.u1.s1<1)||(i5.u12.l484<1))")&&(F("((i4.u1.s1<1)||(u5.l114<1))")))))&&(F(("((i4....227
Formula 0 simplified : F(G(FG!"((i4.u1.s1<1)||(u5.l114<1))" & (!"((i4.u1.s1<1)||(i5.u12.l484<1))" | G!"((i4.u1.s1<1)||(u5.l114<1))")) | G(!"((i4.u1.s1<1)||...209
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t9, t25, t68, t86, t88, t90, t92, t93, t94, t95, t97, t100, t101, t103, t105, t106, t...308
Computing Next relation with stutter on 1.35637e+07 deadlock states
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-14 finished in 105092 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((X(X(!p1))&&(X(!p2) U ((!p3&&X(!p2))||X(G(!p2))))))))'
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 118/118 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 76 transition count 98
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 76 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 76 transition count 97
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 70 transition count 90
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 70 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 70 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 68 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 66 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 66 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 64 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 63 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 75
Applied a total of 52 rules in 5 ms. Remains 63 /86 variables (removed 23) and now considering 75/118 (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-956031184635841981.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-684987779573965874.kers'
[2026-05-23 17:55:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-956031184635841981.kers, --Pflows, --basisKERS=/tmp/petrispot-output-684987779573965874.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 63 cols 238 entries
Finished phase 1 with 59 SingleSign rule and 2 generalized
[2026-05-23 17:55:25] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-684987779573965874.kers
Total runtime 1 ms.
[2026-05-23 17:55:25] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-23 17:55:25] [INFO ] Invariant cache hit.
[2026-05-23 17:55:25] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-23 17:55:25] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2026-05-23 17:55:25] [INFO ] Invariant cache hit.
[2026-05-23 17:55:25] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/138 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 27/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 74 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 13 (OVERLAPS) 0/138 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 96 constraints, problems are : Problem set: 0 solved, 74 unsolved in 6976 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 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/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/138 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 27/96 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 74/170 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 170 constraints, problems are : Problem set: 0 solved, 74 unsolved in 12322 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19334ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 19335ms
Starting structural reductions in LTL mode, iteration 1 : 63/86 places, 75/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19638 ms. Remains : 63/86 places, 75/118 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((X(X(p1))&&(X(!p2) U ((!p3&&X(!p2))||X(G(!p2))))))))'
Stuttering acceptance computed with spot in 299 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), false, (NOT p1), false, (NOT p1), p2, false]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 267 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 204 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 11 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 19 ms. Proved property starting from automaton with 8 states, 23 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-15 finished in 20456 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((G(F(!p0))||(!p1&&F(!p0))))&&F((p2&&X(X(!p3)))))))'
Spot run failed in 85 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-23 17:55:46] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4979717085868316119
[2026-05-23 17:55:46] [INFO ] Computing symmetric may disable matrix : 118 transitions.
[2026-05-23 17:55:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:55:46] [INFO ] Computing symmetric may enable matrix : 118 transitions.
[2026-05-23 17:55:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:55:46] [INFO ] Applying decomposition
[2026-05-23 17:55:46] [INFO ] Computing Do-Not-Accords matrix : 118 transitions.
[2026-05-23 17:55:46] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:55:46] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4979717085868316119
Running compilation step : cd /tmp/ltsmin4979717085868316119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-23 17:55:46] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15017173759032754363.txt' '-o' '/tmp/graph15017173759032754363.bin' '-w' '/tmp/graph15017173759032754363.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15017173759032754363.bin' '-l' '-1' '-v' '-w' '/tmp/graph15017173759032754363.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:55:46] [INFO ] Decomposing Gal with order
[2026-05-23 17:55:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:55:46] [INFO ] Removed a total of 132 redundant transitions.
[2026-05-23 17:55:46] [INFO ] Flatten gal took : 34 ms
[2026-05-23 17:55:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 18 ms.
[2026-05-23 17:55:46] [INFO ] Time to serialize gal into /tmp/LTLFireability12107259668978259946.gal : 6 ms
[2026-05-23 17:55:46] [INFO ] Time to serialize properties into /tmp/LTLFireability1316873274203097438.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12107259668978259946.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1316873274203097438.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F((G(F(!("((i3.u1.s1>=1)&&(i2.u5.l114>=1))"))))||((!("((i3.u1.s1>=1)&&(i0.u12.l484>=1))"))&&(F(!("((i3.u1.s1>=1)&&(i2.u5.l114>=1...255
Formula 0 simplified : F(G(FG"((i3.u1.s1>=1)&&(i2.u5.l114>=1))" & ("((i3.u1.s1>=1)&&(i0.u12.l484>=1))" | G"((i3.u1.s1>=1)&&(i2.u5.l114>=1))")) | G(!"((i3.u...221
Compilation finished in 703 ms.
Running link step : cd /tmp/ltsmin4979717085868316119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4979717085868316119;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((<>(([](<>(!(LTLAPp0==true)))||(!(LTLAPp1==true)&&<>(!(LTLAPp0==true)))))&&<>(((LTLAPp2==true)&&X(X(!(LTLAPp3==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-23 18:17:46] [INFO ] Flatten gal took : 687 ms
[2026-05-23 18:17:46] [INFO ] Time to serialize gal into /tmp/LTLFireability2573072079632788123.gal : 255 ms
[2026-05-23 18:17:46] [INFO ] Time to serialize properties into /tmp/LTLFireability5735542344604159037.ltl : 56 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2573072079632788123.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5735542344604159037.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G((F((G(F(!("((s1>=1)&&(l114>=1))"))))||((!("((s1>=1)&&(l484>=1))"))&&(F(!("((s1>=1)&&(l114>=1))"))))))&&(F(("((s1<1)||(l150<1))")&...194
Formula 0 simplified : F(G(FG"((s1>=1)&&(l114>=1))" & ("((s1>=1)&&(l484>=1))" | G"((s1>=1)&&(l114>=1))")) | G(!"((s1<1)||(l150<1))" | XX"((s1>=1)&&(l355>=1...160
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t19, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t54,...498
Computing Next relation with stutter on 2.31169e+08 deadlock states
154 unique states visited
0 strongly connected components in search stack
266 transitions explored
45 items max in DFS search stack
13775 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,137.821,1694996,1,0,682,6.84596e+06,282,449,3364,7.42407e+06,1606
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1817668 ms.

BK_STOP 1779560419729

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

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m09.tgz
mv DBSingleClientW-PT-d0m09 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 ;