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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.5K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 6 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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-d0m07-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779554002324

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-d0m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 16:33:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 16:33:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 16:33:25] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2026-05-23 16:33:25] [INFO ] Transformed 553 places.
[2026-05-23 16:33:25] [INFO ] Transformed 150 transitions.
[2026-05-23 16:33:25] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 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 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 31 place count 89 transition count 120
Iterating global reduction 1 with 13 rules applied. Total rules applied 44 place count 89 transition count 120
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 86 transition count 117
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 86 transition count 117
Applied a total of 50 rules in 89 ms. Remains 86 /109 variables (removed 23) and now considering 117/150 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6156061990053495366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15412162502962343307.kers'
[2026-05-23 16:33:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6156061990053495366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15412162502962343307.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 117 rows 86 cols 360 entries
Finished phase 1 with 82 SingleSign rule and 2 generalized
[2026-05-23 16:33:25] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15412162502962343307.kers
Total runtime 2 ms.
[2026-05-23 16:33:26] [INFO ] Implicit Places using invariants in 450 ms returned []
[2026-05-23 16:33:26] [INFO ] Invariant cache hit.
[2026-05-23 16:33:26] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-23 16:33:26] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 846 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2026-05-23 16:33:26] [INFO ] Invariant cache hit.
[2026-05-23 16:33:26] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/203 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 48/136 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 136 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7602 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/203 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 48/136 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 116/252 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 252 constraints, problems are : Problem set: 0 solved, 116 unsolved in 21839 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29815ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 29839ms
Starting structural reductions in LTL mode, iteration 1 : 86/109 places, 117/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30855 ms. Remains : 86/109 places, 117/150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2026-05-23 16:33:56] [INFO ] Invariant cache hit.
[2026-05-23 16:33:56] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-23 16:33:56] [INFO ] Invariant cache hit.
[2026-05-23 16:33:56] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-23 16:33:56] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. Remains : 86/86 places, 117/117 transitions.
Support contains 31 out of 86 places after structural reductions.
[2026-05-23 16:33:57] [INFO ] Flatten gal took : 52 ms
[2026-05-23 16:33:57] [INFO ] Flatten gal took : 23 ms
[2026-05-23 16:33:57] [INFO ] Input system was already deterministic with 117 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (9145 resets) in 2716 ms. (14 steps per ms) remains 14/24 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 420 ms. (95 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1995 resets) in 118 ms. (336 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40002 steps (2008 resets) in 317 ms. (125 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1991 resets) in 217 ms. (183 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (4045 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (2012 resets) in 172 ms. (231 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (4090 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1967 resets) in 244 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3972 resets) in 164 ms. (242 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (4008 resets) in 171 ms. (232 steps per ms) remains 9/9 properties
[2026-05-23 16:33:58] [INFO ] Invariant cache hit.
[2026-05-23 16:33:58] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 27/42 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 23/65 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 96/161 variables, 65/67 constraints. Problems are: Problem set: 1 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 27/94 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 40/201 variables, 20/114 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 20/134 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 2/203 variables, 1/135 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 1/136 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/203 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/203 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 136 constraints, problems are : Problem set: 1 solved, 8 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 27/41 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 23/64 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 94/158 variables, 64/66 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 25/91 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 1/92 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 43/201 variables, 21/113 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 22/135 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 8/143 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 2/203 variables, 1/144 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/203 variables, 1/145 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/203 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/203 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 145 constraints, problems are : Problem set: 1 solved, 8 unsolved in 3086 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3900ms problems are : Problem set: 1 solved, 8 unsolved
Parikh walk visited 0 properties in 1530 ms.
Support contains 14 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 117/117 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 80 transition count 105
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 80 transition count 105
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 77 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 77 transition count 102
Applied a total of 18 rules in 25 ms. Remains 77 /86 variables (removed 9) and now considering 102/117 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 77/86 places, 102/117 transitions.
RANDOM walk for 40000 steps (9152 resets) in 225 ms. (176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 192 ms. (207 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (2008 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1978 resets) in 90 ms. (439 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (4207 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (2017 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3945 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (4077 resets) in 134 ms. (296 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (4065 resets) in 182 ms. (218 steps per ms) remains 7/7 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4615992487707572400.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11180573676010222376.kers'
[2026-05-23 16:34:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4615992487707572400.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11180573676010222376.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 77 cols 324 entries
Finished phase 1 with 73 SingleSign rule and 2 generalized
[2026-05-23 16:34:04] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11180573676010222376.kers
Total runtime 1 ms.
[2026-05-23 16:34:04] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 24/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 22/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 87/145 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 32/177 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2/179 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/179 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/179 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 116 constraints, problems are : Problem set: 0 solved, 7 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 37/37 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 24/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 22/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 87/145 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 32/177 variables, 18/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 14/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 7/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 2/179 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/179 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/179 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/179 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 123 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1292 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 77/77 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1772ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 1 properties in 2131 ms.
Support contains 10 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 102/102 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 75 transition count 100
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 75 transition count 100
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 74 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 74 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 7 place count 74 transition count 97
Applied a total of 7 rules in 17 ms. Remains 74 /77 variables (removed 3) and now considering 97/102 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 74/77 places, 97/102 transitions.
RANDOM walk for 40000 steps (9177 resets) in 223 ms. (178 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1964 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1942 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1926 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4034 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4068 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 15997 steps, run visited all 6 properties in 91 ms. (steps per millisecond=175 )
Probabilistic random walk after 15997 steps, saw 7233 distinct states, run finished after 98 ms. (steps per millisecond=163 ) properties seen :6
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 286 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 117/117 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 73 transition count 95
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 73 transition count 95
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 94
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 66 transition count 85
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 66 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 66 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 63 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 63 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 63 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 61 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 57 place count 60 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 58 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 59 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 59 transition count 69
Applied a total of 62 rules in 33 ms. Remains 59 /86 variables (removed 27) and now considering 69/117 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8062935901141838429.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10619812258959944329.kers'
[2026-05-23 16:34:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8062935901141838429.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10619812258959944329.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 69 rows 59 cols 219 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-23 16:34:09] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10619812258959944329.kers
Total runtime 1 ms.
[2026-05-23 16:34:09] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-23 16:34:09] [INFO ] Invariant cache hit.
[2026-05-23 16:34:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 16:34:09] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2026-05-23 16:34:09] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2026-05-23 16:34:09] [INFO ] Invariant cache hit.
[2026-05-23 16:34:09] [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 2302 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 8684 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 11035ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 11036ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/86 places, 69/117 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11356 ms. Remains : 59/86 places, 69/117 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-02
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-02 finished in 11808 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, 117/117 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 72 transition count 90
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 72 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 72 transition count 89
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 65 transition count 80
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 65 transition count 78
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 62 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 60 transition count 70
Iterating global reduction 3 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 3 with 2 rules applied. Total rules applied 58 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 58 transition count 66
Iterating global reduction 4 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 4 with 2 rules applied. Total rules applied 64 place count 58 transition count 64
Applied a total of 64 rules in 28 ms. Remains 58 /86 variables (removed 28) and now considering 64/117 (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-10096262219024955174.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8685971114098799583.kers'
[2026-05-23 16:34:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10096262219024955174.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8685971114098799583.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 16:34:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8685971114098799583.kers
Total runtime 0 ms.
[2026-05-23 16:34:21] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-23 16:34:21] [INFO ] Invariant cache hit.
[2026-05-23 16:34:21] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:34:21] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2026-05-23 16:34:21] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2026-05-23 16:34:21] [INFO ] Invariant cache hit.
[2026-05-23 16:34:21] [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, 5/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 86 constraints, problems are : Problem set: 0 solved, 63 unsolved in 4789 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: 6/6 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, 3/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/122 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 63/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 149 constraints, problems are : Problem set: 0 solved, 63 unsolved in 7541 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: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12362ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 12362ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/86 places, 64/117 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12649 ms. Remains : 58/86 places, 64/117 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 46 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-04
Product exploration explored 100000 steps with 22941 reset in 581 ms.
Product exploration explored 100000 steps with 22920 reset in 421 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 49 steps (8 resets) in 7 ms. (6 steps per ms) remains 0/1 properties
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 56 ms :[(NOT p0)]
Knowledge-based reduction took 228 ms.
Stuttering acceptance computed with spot in 48 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 16:34:35] [INFO ] Invariant cache hit.
[2026-05-23 16:34:35] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-23 16:34:35] [INFO ] Invariant cache hit.
[2026-05-23 16:34:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:34:35] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2026-05-23 16:34:35] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 277 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.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge based reduction with 3 factoid took 67 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 139 steps (31 resets) in 8 ms. (15 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 125 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 50 ms :[(NOT p0)]
Knowledge-based reduction took 249 ms.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22928 reset in 132 ms.
Product exploration explored 100000 steps with 22842 reset in 159 ms.
Built C files in :
/tmp/ltsmin7855752824457260343
[2026-05-23 16:34:36] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2026-05-23 16:34:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:34:36] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2026-05-23 16:34:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:34:36] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2026-05-23 16:34:36] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:34:36] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7855752824457260343
Running compilation step : cd /tmp/ltsmin7855752824457260343;'/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 600 ms.
Running link step : cd /tmp/ltsmin7855752824457260343;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin7855752824457260343;'/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/stateBased5250326308846324793.hoa' '--buchi-type=spotba'
LTSmin run took 108 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-04 finished in 15806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X(p1)||G(p2)||G(!p2))))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 117/117 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 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 69 transition count 86
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 69 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 66 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 66 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 64 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 64 transition count 78
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 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 62 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 62 transition count 72
Applied a total of 54 rules in 13 ms. Remains 62 /86 variables (removed 24) and now considering 72/117 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13679195861029486314.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8512725118917137103.kers'
[2026-05-23 16:34:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13679195861029486314.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8512725118917137103.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 72 rows 62 cols 233 entries
Finished phase 1 with 58 SingleSign rule and 2 generalized
[2026-05-23 16:34:37] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8512725118917137103.kers
Total runtime 1 ms.
[2026-05-23 16:34:37] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-23 16:34:37] [INFO ] Invariant cache hit.
[2026-05-23 16:34:37] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-23 16:34:37] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2026-05-23 16:34:37] [INFO ] Invariant cache hit.
[2026-05-23 16:34:37] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 88 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2764 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 71/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 159 constraints, problems are : Problem set: 0 solved, 71 unsolved in 9085 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11903ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 11904ms
Starting structural reductions in LTL mode, iteration 1 : 62/86 places, 72/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12243 ms. Remains : 62/86 places, 72/117 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(p0)||G(p1)||G(!p1)))||p2)))'
Stuttering acceptance computed with spot in 297 ms :[true, false, (AND p1 (NOT p0)), (AND (NOT p1) (NOT p0)), p1, (NOT p1), false, false]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-06
Product exploration explored 100000 steps with 22978 reset in 496 ms.
Product exploration explored 100000 steps with 22952 reset in 285 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 200 edges and 62 vertex of which 61 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 3 factoid took 85 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9183 resets) in 314 ms. (126 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (2077 resets) in 263 ms. (151 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3999 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
[2026-05-23 16:34:50] [INFO ] Invariant cache hit.
[2026-05-23 16:34:50] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/102 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/132 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/134 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 88 constraints, problems are : Problem set: 0 solved, 2 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/102 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/132 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/134 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/134 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/134 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 90 constraints, problems are : Problem set: 0 solved, 2 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 595ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 160 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Graph (complete) has 182 edges and 62 vertex of which 61 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 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 60 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 59 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 59 transition count 69
Applied a total of 6 rules in 18 ms. Remains 59 /62 variables (removed 3) and now considering 69/72 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 59/62 places, 69/72 transitions.
RANDOM walk for 40000 steps (9144 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2024 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (4152 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4229 steps, run visited all 2 properties in 36 ms. (steps per millisecond=117 )
Probabilistic random walk after 4229 steps, saw 1909 distinct states, run finished after 37 ms. (steps per millisecond=114 ) properties seen :2
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 1741 ms.
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2026-05-23 16:34:52] [INFO ] Invariant cache hit.
[2026-05-23 16:34:52] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-23 16:34:52] [INFO ] Invariant cache hit.
[2026-05-23 16:34:52] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-23 16:34:52] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 62/62 places, 72/72 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 200 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (9157 resets) in 148 ms. (268 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (2020 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3974 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
[2026-05-23 16:34:53] [INFO ] Invariant cache hit.
[2026-05-23 16:34:53] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/102 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/132 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/134 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 88 constraints, problems are : Problem set: 0 solved, 2 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 57/102 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/132 variables, 16/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/134 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/134 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/134 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 90 constraints, problems are : Problem set: 0 solved, 2 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 695ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 182 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Graph (complete) has 182 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 60 transition count 70
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 59 transition count 69
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 59 transition count 69
Applied a total of 6 rules in 17 ms. Remains 59 /62 variables (removed 3) and now considering 69/72 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 59/62 places, 69/72 transitions.
RANDOM walk for 40000 steps (9286 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2071 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4092 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4229 steps, run visited all 2 properties in 56 ms. (steps per millisecond=75 )
Probabilistic random walk after 4229 steps, saw 1909 distinct states, run finished after 56 ms. (steps per millisecond=75 ) properties seen :2
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 1649 ms.
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 23039 reset in 192 ms.
Product exploration explored 100000 steps with 22946 reset in 155 ms.
Spot run failed in 144 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/ltsmin3227267568763211333
[2026-05-23 16:34:55] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3227267568763211333
Running compilation step : cd /tmp/ltsmin3227267568763211333;'/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 337 ms.
Running link step : cd /tmp/ltsmin3227267568763211333;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3227267568763211333;'/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/stateBased13535485250487022653.hoa' '--buchi-type=spotba'
LTSmin run took 26 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-06 finished in 18810 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(G(p0))))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 117/117 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 72 transition count 90
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 72 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 72 transition count 89
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 65 transition count 80
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 65 transition count 78
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 62 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 60 transition count 70
Iterating global reduction 3 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 3 with 2 rules applied. Total rules applied 58 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 58 transition count 66
Iterating global reduction 4 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 4 with 2 rules applied. Total rules applied 64 place count 58 transition count 64
Applied a total of 64 rules in 7 ms. Remains 58 /86 variables (removed 28) and now considering 64/117 (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-15147554116178639716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6205511527951992255.kers'
[2026-05-23 16:34:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15147554116178639716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6205511527951992255.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 16:34:56] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6205511527951992255.kers
Total runtime 1 ms.
[2026-05-23 16:34:56] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-23 16:34:56] [INFO ] Invariant cache hit.
[2026-05-23 16:34:56] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:34:56] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2026-05-23 16:34:56] [INFO ] Invariant cache hit.
[2026-05-23 16:34:56] [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, 5/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 86 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3911 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: 6/6 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, 3/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/122 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 63/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 149 constraints, problems are : Problem set: 0 solved, 63 unsolved in 6386 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: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10320ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 10320ms
Starting structural reductions in LTL mode, iteration 1 : 58/86 places, 64/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10577 ms. Remains : 58/86 places, 64/117 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(G(p0))))'
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-07
Entered a terminal (fully accepting) state of product in 91 steps with 18 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-07 finished in 10769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 117/117 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 81
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 66 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 64 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 62 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 62 transition count 72
Applied a total of 53 rules in 20 ms. Remains 62 /86 variables (removed 24) and now considering 72/117 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7993693160194298205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4415829384525133097.kers'
[2026-05-23 16:35:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7993693160194298205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4415829384525133097.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 72 rows 62 cols 238 entries
Finished phase 1 with 58 SingleSign rule and 2 generalized
[2026-05-23 16:35:06] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4415829384525133097.kers
Total runtime 1 ms.
[2026-05-23 16:35:06] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-23 16:35:06] [INFO ] Invariant cache hit.
[2026-05-23 16:35:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 16:35:07] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2026-05-23 16:35:07] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2026-05-23 16:35:07] [INFO ] Invariant cache hit.
[2026-05-23 16:35:07] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 88 constraints, problems are : Problem set: 0 solved, 71 unsolved in 4378 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 72/134 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 71/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 159 constraints, problems are : Problem set: 0 solved, 71 unsolved in 10991 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15389ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 15389ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/86 places, 72/117 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15742 ms. Remains : 62/86 places, 72/117 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 36 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-08
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-08 finished in 15805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p1)&&p0)))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 117/117 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 85
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 68 transition count 85
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 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
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 66 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 66 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 66 transition count 79
Applied a total of 45 rules in 3 ms. Remains 66 /86 variables (removed 20) and now considering 79/117 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14488150888902832156.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8085750141403174791.kers'
[2026-05-23 16:35:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14488150888902832156.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8085750141403174791.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 16:35:22] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8085750141403174791.kers
Total runtime 1 ms.
[2026-05-23 16:35:22] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-23 16:35:22] [INFO ] Invariant cache hit.
[2026-05-23 16:35:22] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-23 16:35:22] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2026-05-23 16:35:22] [INFO ] Invariant cache hit.
[2026-05-23 16:35:22] [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, 0/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 94 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4242 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: 0/0 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, 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, 78/172 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 172 constraints, problems are : Problem set: 0 solved, 78 unsolved in 12041 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: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16309ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 16310ms
Starting structural reductions in LTL mode, iteration 1 : 66/86 places, 79/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16558 ms. Remains : 66/86 places, 79/117 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p1)&&p0)))))'
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-11 finished in 16781 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((X(X(F(p0))) U (p1 U X(!p2))))))'
Support contains 5 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 117/117 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 72 transition count 90
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 72 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 72 transition count 89
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 65 transition count 80
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 65 transition count 78
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 48 place count 62 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 51 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 54 place count 60 transition count 70
Iterating global reduction 3 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 3 with 2 rules applied. Total rules applied 58 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 58 transition count 66
Iterating global reduction 4 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 4 with 2 rules applied. Total rules applied 64 place count 58 transition count 64
Applied a total of 64 rules in 5 ms. Remains 58 /86 variables (removed 28) and now considering 64/117 (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-2638485625910455449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12563902802578887973.kers'
[2026-05-23 16:35:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2638485625910455449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12563902802578887973.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 16:35:39] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12563902802578887973.kers
Total runtime 1 ms.
[2026-05-23 16:35:39] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-23 16:35:39] [INFO ] Invariant cache hit.
[2026-05-23 16:35:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:35:39] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2026-05-23 16:35:39] [INFO ] Invariant cache hit.
[2026-05-23 16:35:39] [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, 5/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 86 constraints, problems are : Problem set: 0 solved, 63 unsolved in 4824 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: 6/6 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, 3/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/122 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 63/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 149 constraints, problems are : Problem set: 0 solved, 63 unsolved in 7839 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: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12695ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 12695ms
Starting structural reductions in LTL mode, iteration 1 : 58/86 places, 64/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12933 ms. Remains : 58/86 places, 64/117 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(F(p0))) U (p1 U X(!p2))))))'
Stuttering acceptance computed with spot in 211 ms :[p2, p2, (AND p2 (NOT p0)), p2, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-13
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-13 finished in 13199 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&&G((p1&&(F(G(p3))||p2))))))'
Support contains 6 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 117/117 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 75 transition count 93
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 75 transition count 93
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 92
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 70 transition count 87
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 70 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 35 place count 70 transition count 85
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 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 68 transition count 82
Applied a total of 39 rules in 4 ms. Remains 68 /86 variables (removed 18) and now considering 82/117 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12030395085154823862.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10956528810020350901.kers'
[2026-05-23 16:35:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12030395085154823862.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10956528810020350901.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 68 cols 274 entries
Finished phase 1 with 64 SingleSign rule and 2 generalized
[2026-05-23 16:35:52] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10956528810020350901.kers
Total runtime 2 ms.
[2026-05-23 16:35:52] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-23 16:35:52] [INFO ] Invariant cache hit.
[2026-05-23 16:35:52] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-23 16:35:52] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2026-05-23 16:35:52] [INFO ] Invariant cache hit.
[2026-05-23 16:35:52] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/150 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 24/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 94 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2832 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/150 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 24/94 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 81/175 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 175 constraints, problems are : Problem set: 0 solved, 81 unsolved in 13635 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16504ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 16504ms
Starting structural reductions in LTL mode, iteration 1 : 68/86 places, 82/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16842 ms. Remains : 68/86 places, 82/117 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&&(F(G(p2))||p1)))&&p3)))'
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p3) (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-14
Product exploration explored 100000 steps with 22942 reset in 228 ms.
Entered a terminal (fully accepting) state of product in 29270 steps with 6775 reset in 82 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-14 finished in 17403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(G(p1))))))'
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 117/117 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 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 69 transition count 88
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 67 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 66 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 66 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 65 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 64 transition count 80
Iterating global reduction 2 with 1 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
Applied a total of 48 rules in 6 ms. Remains 64 /86 variables (removed 22) and now considering 78/117 (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-3118033022358987245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8975550656452869898.kers'
[2026-05-23 16:36:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3118033022358987245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8975550656452869898.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 78 rows 64 cols 257 entries
Finished phase 1 with 59 SingleSign rule and 3 generalized
[2026-05-23 16:36:09] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8975550656452869898.kers
Total runtime 1 ms.
[2026-05-23 16:36:10] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-23 16:36:10] [INFO ] Invariant cache hit.
[2026-05-23 16:36:10] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-23 16:36:10] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2026-05-23 16:36:10] [INFO ] Invariant cache hit.
[2026-05-23 16:36:10] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 24/90 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/142 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 98 constraints, problems are : Problem set: 0 solved, 77 unsolved in 7071 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: 77/77 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 78/142 variables, 64/74 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 77/175 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 175 constraints, problems are : Problem set: 0 solved, 77 unsolved in 11459 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: 77/77 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18569ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 18569ms
Starting structural reductions in LTL mode, iteration 1 : 64/86 places, 78/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18922 ms. Remains : 64/86 places, 78/117 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(G(p1))))))'
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : DBSingleClientW-PT-d0m07-LTLFireability-15
Product exploration explored 100000 steps with 23014 reset in 262 ms.
Product exploration explored 100000 steps with 22865 reset in 415 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 209 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (9175 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1976 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7099 steps, run visited all 1 properties in 23 ms. (steps per millisecond=308 )
Probabilistic random walk after 7099 steps, saw 3038 distinct states, run finished after 23 ms. (steps per millisecond=308 ) properties seen :1
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 462 ms.
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 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, 78/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2026-05-23 16:36:30] [INFO ] Invariant cache hit.
[2026-05-23 16:36:30] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-23 16:36:30] [INFO ] Invariant cache hit.
[2026-05-23 16:36:30] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-23 16:36:30] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 64/64 places, 78/78 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 209 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (9181 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2022 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7099 steps, run visited all 1 properties in 17 ms. (steps per millisecond=417 )
Probabilistic random walk after 7099 steps, saw 3038 distinct states, run finished after 17 ms. (steps per millisecond=417 ) properties seen :1
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 420 ms.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 22969 reset in 130 ms.
Product exploration explored 100000 steps with 22845 reset in 185 ms.
Spot run failed in 70 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/ltsmin6019254980049049852
[2026-05-23 16:36:32] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6019254980049049852
Running compilation step : cd /tmp/ltsmin6019254980049049852;'/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 258 ms.
Running link step : cd /tmp/ltsmin6019254980049049852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin6019254980049049852;'/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/stateBased1615289856322007229.hoa' '--buchi-type=spotba'
LTSmin run took 25 ms.
FORMULA DBSingleClientW-PT-d0m07-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m07-LTLFireability-15 finished in 22416 ms.
All properties solved by simple procedures.
Total runtime 187690 ms.

BK_STOP 1779554192495

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

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