About the Execution of ITS-Tools for DBSingleClientW-PT-d0m08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 630.703 | 344068.00 | 396172.00 | 1104.50 | TFTTTFTFFTFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r082-smll-177946993500116.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-d0m08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993500116
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.7K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 6 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 15 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 15 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 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-d0m08-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779555652179
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-d0m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 17:00:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 17:00:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:00:55] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2026-05-23 17:00:55] [INFO ] Transformed 553 places.
[2026-05-23 17:00:55] [INFO ] Transformed 150 transitions.
[2026-05-23 17:00:55] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 419 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 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 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 32 place count 88 transition count 116
Iterating global reduction 1 with 14 rules applied. Total rules applied 46 place count 88 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 88 transition count 115
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 85 transition count 112
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 85 transition count 112
Applied a total of 53 rules in 90 ms. Remains 85 /109 variables (removed 24) and now considering 112/150 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4200304542704413928.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12801142507143962402.kers'
[2026-05-23 17:00:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4200304542704413928.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12801142507143962402.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 112 rows 85 cols 349 entries
Finished phase 1 with 81 SingleSign rule and 2 generalized
[2026-05-23 17:00:55] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12801142507143962402.kers
Total runtime 2 ms.
[2026-05-23 17:00:56] [INFO ] Implicit Places using invariants in 481 ms returned []
[2026-05-23 17:00:56] [INFO ] Invariant cache hit.
[2026-05-23 17:00:56] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-23 17:00:56] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2026-05-23 17:00:56] [INFO ] Invariant cache hit.
[2026-05-23 17:00:56] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/197 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 44/131 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 131 constraints, problems are : Problem set: 0 solved, 111 unsolved in 6255 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/197 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 44/131 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 111/242 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 242 constraints, problems are : Problem set: 0 solved, 111 unsolved in 17964 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24601ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 24637ms
Starting structural reductions in LTL mode, iteration 1 : 85/109 places, 112/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25864 ms. Remains : 85/109 places, 112/150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2026-05-23 17:01:21] [INFO ] Invariant cache hit.
[2026-05-23 17:01:21] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-23 17:01:21] [INFO ] Invariant cache hit.
[2026-05-23 17:01:21] [INFO ] State equation strengthened by 44 read => feed constraints.
[2026-05-23 17:01:22] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 950 ms. Remains : 85/85 places, 112/112 transitions.
Support contains 27 out of 85 places after structural reductions.
[2026-05-23 17:01:22] [INFO ] Flatten gal took : 45 ms
[2026-05-23 17:01:22] [INFO ] Flatten gal took : 20 ms
[2026-05-23 17:01:22] [INFO ] Input system was already deterministic with 112 transitions.
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40000 steps (9094 resets) in 2581 ms. (15 steps per ms) remains 14/23 properties
BEST_FIRST walk for 40002 steps (1978 resets) in 275 ms. (144 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1925 resets) in 239 ms. (166 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40001 steps (1984 resets) in 128 ms. (310 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (2058 resets) in 146 ms. (272 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1974 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (2001 resets) in 150 ms. (264 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1998 resets) in 135 ms. (294 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (4100 resets) in 223 ms. (178 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1997 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (4080 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1967 resets) in 154 ms. (258 steps per ms) remains 10/10 properties
[2026-05-23 17:01:24] [INFO ] Invariant cache hit.
[2026-05-23 17:01:24] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 28/42 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 23/65 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 92/157 variables, 65/67 constraints. Problems are: Problem set: 1 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 24/91 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 38/195 variables, 19/110 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 19/129 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2/197 variables, 1/130 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 1/131 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/197 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 131 constraints, problems are : Problem set: 1 solved, 9 unsolved in 792 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 29/41 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 23/64 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 91/155 variables, 64/66 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 23/89 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 1/90 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 40/195 variables, 20/110 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 20/130 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 8/138 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2/197 variables, 1/139 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 1/140 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/197 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 140 constraints, problems are : Problem set: 1 solved, 9 unsolved in 3743 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4564ms problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 1683 ms.
Support contains 12 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 112/112 transitions.
Graph (complete) has 252 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 111
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 79 transition count 102
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 79 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 77 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 77 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 77 transition count 98
Applied a total of 17 rules in 38 ms. Remains 77 /85 variables (removed 8) and now considering 98/112 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 77/85 places, 98/112 transitions.
RANDOM walk for 40000 steps (9113 resets) in 217 ms. (183 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1929 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (2001 resets) in 92 ms. (430 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (2001 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (2002 resets) in 130 ms. (305 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (4067 resets) in 194 ms. (205 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1925 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (3951 resets) in 150 ms. (264 steps per ms) remains 5/7 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2674511342518268330.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14388482002132847586.kers'
[2026-05-23 17:01:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2674511342518268330.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14388482002132847586.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 77 cols 313 entries
Finished phase 1 with 70 SingleSign rule and 5 generalized
[2026-05-23 17:01:31] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14388482002132847586.kers
Total runtime 2 ms.
[2026-05-23 17:01:31] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 43/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 81/137 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 38/175 variables, 21/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 17/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/175 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 114 constraints, problems are : Problem set: 0 solved, 5 unsolved in 340 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 43/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 81/137 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 18/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 38/175 variables, 21/97 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 17/114 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/175 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 119 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1076 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1437ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 639 ms.
Support contains 7 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 98/98 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 74 transition count 93
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 74 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 72 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 72 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 11 place count 72 transition count 90
Applied a total of 11 rules in 20 ms. Remains 72 /77 variables (removed 5) and now considering 90/98 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 72/77 places, 90/98 transitions.
RANDOM walk for 40000 steps (9195 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1925 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2030 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4037 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1955 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 23282 steps, run visited all 4 properties in 162 ms. (steps per millisecond=143 )
Probabilistic random walk after 23282 steps, saw 10400 distinct states, run finished after 169 ms. (steps per millisecond=137 ) properties seen :4
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 281 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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((X(!(X(p0) U X(p1)))||!(!p1 U p2))))))'
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 94
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 67 transition count 85
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 67 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 65 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 63 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 61 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 60 transition count 68
Applied a total of 57 rules in 22 ms. Remains 60 /85 variables (removed 25) and now considering 68/112 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5821894139227853968.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16728710681859083698.kers'
[2026-05-23 17:01:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5821894139227853968.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16728710681859083698.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 60 cols 217 entries
Finished phase 1 with 56 SingleSign rule and 2 generalized
[2026-05-23 17:01:34] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16728710681859083698.kers
Total runtime 1 ms.
[2026-05-23 17:01:34] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-23 17:01:34] [INFO ] Invariant cache hit.
[2026-05-23 17:01:34] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-23 17:01:34] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2026-05-23 17:01:34] [INFO ] Invariant cache hit.
[2026-05-23 17:01:34] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 24/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 88 constraints, problems are : Problem set: 0 solved, 67 unsolved in 3505 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 68/128 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 67/155 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 155 constraints, problems are : Problem set: 0 solved, 67 unsolved in 7168 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10703ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 10703ms
Starting structural reductions in LTL mode, iteration 1 : 60/85 places, 68/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10963 ms. Remains : 60/85 places, 68/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(!(X(p0) U X(p1)))||!(!p1 U p2))))))'
Stuttering acceptance computed with spot in 559 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), p1, true, (AND p2 p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-00
Product exploration explored 100000 steps with 25522 reset in 577 ms.
Product exploration explored 100000 steps with 25454 reset in 302 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 192 edges and 60 vertex of which 59 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 4 factoid took 64 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (9144 resets) in 581 ms. (68 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (1626 resets) in 260 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2031 resets) in 179 ms. (222 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (2013 resets) in 272 ms. (146 steps per ms) remains 3/3 properties
[2026-05-23 17:01:46] [INFO ] Invariant cache hit.
[2026-05-23 17:01:46] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 19/24 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 17/41 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/94 variables, 41/43 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 9/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 32/126 variables, 18/70 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 14/84 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/128 variables, 1/85 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 1/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 1 solved, 2 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/23 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/41 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/94 variables, 41/43 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 9/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 32/126 variables, 18/70 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 14/84 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 2/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/128 variables, 1/87 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 1/88 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/128 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 88 constraints, problems are : Problem set: 1 solved, 2 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 450ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 68/68 transitions.
Graph (complete) has 174 edges and 60 vertex of which 59 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 59 transition count 67
Applied a total of 2 rules in 11 ms. Remains 59 /60 variables (removed 1) and now considering 67/68 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 59/60 places, 67/68 transitions.
RANDOM walk for 40000 steps (9193 resets) in 117 ms. (338 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2009 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2030 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1232 steps, run visited all 2 properties in 16 ms. (steps per millisecond=77 )
Probabilistic random walk after 1232 steps, saw 639 distinct states, run finished after 16 ms. (steps per millisecond=77 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), p1, true]
Knowledge-based reduction took 1595 ms.
Stuttering acceptance computed with spot in 355 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), p1, true]
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2026-05-23 17:01:48] [INFO ] Invariant cache hit.
[2026-05-23 17:01:48] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-23 17:01:48] [INFO ] Invariant cache hit.
[2026-05-23 17:01:48] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-23 17:01:48] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 60/60 places, 68/68 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 192 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (9163 resets) in 164 ms. (242 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (1943 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2018 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
[2026-05-23 17:01:49] [INFO ] Invariant cache hit.
[2026-05-23 17:01:49] [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) 20/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/94 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 32/126 variables, 18/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/128 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 2 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 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) 20/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 53/94 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 32/126 variables, 18/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/128 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/128 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 88 constraints, problems are : Problem set: 0 solved, 2 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 652ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 68/68 transitions.
Graph (complete) has 174 edges and 60 vertex of which 59 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 59 transition count 67
Applied a total of 2 rules in 5 ms. Remains 59 /60 variables (removed 1) and now considering 67/68 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 59/60 places, 67/68 transitions.
RANDOM walk for 40000 steps (9185 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1988 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2012 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1232 steps, run visited all 2 properties in 13 ms. (steps per millisecond=94 )
Probabilistic random walk after 1232 steps, saw 639 distinct states, run finished after 13 ms. (steps per millisecond=94 ) properties seen :2
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), p1, true]
Knowledge-based reduction took 1471 ms.
Stuttering acceptance computed with spot in 342 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), p1, true]
Stuttering acceptance computed with spot in 341 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), p1, true]
Product exploration explored 100000 steps with 26873 reset in 207 ms.
Product exploration explored 100000 steps with 26837 reset in 524 ms.
Spot run failed in 160 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/ltsmin16328246874465337519
[2026-05-23 17:01:51] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16328246874465337519
Running compilation step : cd /tmp/ltsmin16328246874465337519;'/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 383 ms.
Running link step : cd /tmp/ltsmin16328246874465337519;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin16328246874465337519;'/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/stateBased11691015574240181061.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 68/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2026-05-23 17:02:06] [INFO ] Invariant cache hit.
[2026-05-23 17:02:07] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-23 17:02:07] [INFO ] Invariant cache hit.
[2026-05-23 17:02:07] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-23 17:02:07] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 60/60 places, 68/68 transitions.
Built C files in :
/tmp/ltsmin1054668661673438384
[2026-05-23 17:02:07] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1054668661673438384
Running compilation step : cd /tmp/ltsmin1054668661673438384;'/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 204 ms.
Running link step : cd /tmp/ltsmin1054668661673438384;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1054668661673438384;'/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/stateBased8885348005050919382.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 17:02:22] [INFO ] Flatten gal took : 10 ms
[2026-05-23 17:02:22] [INFO ] Flatten gal took : 10 ms
[2026-05-23 17:02:22] [INFO ] Time to serialize gal into /tmp/LTL18135305979180487279.gal : 4 ms
[2026-05-23 17:02:22] [INFO ] Time to serialize properties into /tmp/LTL14120931271500024304.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18135305979180487279.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7226848149892802298.hoa' '-atoms' '/tmp/LTL14120931271500024304.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14120931271500024304.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7226848149892802298.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t29, t60, t63, t64, t65, t82, t83, t84, t85, t87, t88, t89, t90, t91, t9...306
Computing Next relation with stutter on 2.65421e+06 deadlock states
26 unique states visited
0 strongly connected components in search stack
34 transitions explored
21 items max in DFS search stack
1133 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.3704,222516,1,0,195,945781,173,113,2183,884849,344
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-00 finished in 60698 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(p0) U X((p1||G((!p2 U (p1 U p3)))))))'
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 112/112 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 101
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 74 transition count 96
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 74 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 74 transition count 95
Applied a total of 23 rules in 5 ms. Remains 74 /85 variables (removed 11) and now considering 95/112 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3682421076221031664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3476352246709846373.kers'
[2026-05-23 17:02:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3682421076221031664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3476352246709846373.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 95 rows 74 cols 303 entries
Finished phase 1 with 70 SingleSign rule and 2 generalized
[2026-05-23 17:02:34] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3476352246709846373.kers
Total runtime 2 ms.
[2026-05-23 17:02:34] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-23 17:02:34] [INFO ] Invariant cache hit.
[2026-05-23 17:02:34] [INFO ] State equation strengthened by 34 read => feed constraints.
[2026-05-23 17:02:35] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2026-05-23 17:02:35] [INFO ] Invariant cache hit.
[2026-05-23 17:02:35] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/169 variables, 74/76 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 34/110 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/169 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 115 constraints, problems are : Problem set: 0 solved, 94 unsolved in 11342 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (OVERLAPS) 1/74 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 95/169 variables, 74/81 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 34/115 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 94/209 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 209 constraints, problems are : Problem set: 0 solved, 94 unsolved in 14189 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 74/74 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25592ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 25594ms
Starting structural reductions in LTL mode, iteration 1 : 74/85 places, 95/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25980 ms. Remains : 74/85 places, 95/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((G((!p1 U (p2 U p3)))||p2))))'
Stuttering acceptance computed with spot in 575 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p3), (NOT p3), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-01 finished in 26624 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(!p0)||X(!p1)))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 94
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 67 transition count 85
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 65 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 63 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 60 transition count 70
Applied a total of 55 rules in 8 ms. Remains 60 /85 variables (removed 25) and now considering 70/112 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11347383770522119439.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17977928056643966257.kers'
[2026-05-23 17:03:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11347383770522119439.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17977928056643966257.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 70 rows 60 cols 227 entries
Finished phase 1 with 55 SingleSign rule and 3 generalized
[2026-05-23 17:03:01] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17977928056643966257.kers
Total runtime 1 ms.
[2026-05-23 17:03:01] [INFO ] Implicit Places using invariants in 118 ms returned []
[2026-05-23 17:03:01] [INFO ] Invariant cache hit.
[2026-05-23 17:03:01] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-23 17:03:01] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2026-05-23 17:03:01] [INFO ] Invariant cache hit.
[2026-05-23 17:03:01] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 87 constraints, problems are : Problem set: 0 solved, 69 unsolved in 3221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 70/130 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 23/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 69/156 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 156 constraints, problems are : Problem set: 0 solved, 69 unsolved in 15089 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18328ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 18329ms
Starting structural reductions in LTL mode, iteration 1 : 60/85 places, 70/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18641 ms. Remains : 60/85 places, 70/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Product exploration explored 100000 steps with 50000 reset in 278 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 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
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 17 ms. Proved property starting from automaton with 5 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 26 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-02 finished in 19473 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((X(X(F(p1)))&&p0))))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 92
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 92
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 67 transition count 84
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 65 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 63 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 62 transition count 72
Applied a total of 50 rules in 12 ms. Remains 62 /85 variables (removed 23) and now considering 72/112 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11462478834310571965.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9790013335909064561.kers'
[2026-05-23 17:03:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11462478834310571965.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9790013335909064561.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 17:03:20] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9790013335909064561.kers
Total runtime 1 ms.
[2026-05-23 17:03:20] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-23 17:03:20] [INFO ] Invariant cache hit.
[2026-05-23 17:03:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 17:03:21] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2026-05-23 17:03:21] [INFO ] Invariant cache hit.
[2026-05-23 17:03:21] [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 3939 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, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 72/134 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 71/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (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: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13079ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 13081ms
Starting structural reductions in LTL mode, iteration 1 : 62/85 places, 72/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13442 ms. Remains : 62/85 places, 72/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(X(F(p1)))&&p0))))'
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-07 finished in 13615 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(p1) U p2))||p0)&&F(G(p3)))))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 94
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 66 transition count 84
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 66 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 64 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 62 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 62 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 60 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 59 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 59 transition count 67
Applied a total of 59 rules in 8 ms. Remains 59 /85 variables (removed 26) and now considering 67/112 (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-10897292241742395155.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7180732134486201133.kers'
[2026-05-23 17:03:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10897292241742395155.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7180732134486201133.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 67 rows 59 cols 215 entries
Finished phase 1 with 55 SingleSign rule and 2 generalized
[2026-05-23 17:03:34] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7180732134486201133.kers
Total runtime 2 ms.
[2026-05-23 17:03:34] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-23 17:03:34] [INFO ] Invariant cache hit.
[2026-05-23 17:03:34] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-23 17:03:34] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2026-05-23 17:03:34] [INFO ] Invariant cache hit.
[2026-05-23 17:03:34] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 67/126 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 86 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3807 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 67/126 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 23/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 66/152 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 152 constraints, problems are : Problem set: 0 solved, 66 unsolved in 8395 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12228ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 12228ms
Starting structural reductions in LTL mode, iteration 1 : 59/85 places, 67/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12501 ms. Remains : 59/85 places, 67/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(X((F(p2) U p3))||p1))))'
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p3), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-08
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-08 finished in 12762 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(((!p1 U (p2||G(!p1)))||p0))))'
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 112/112 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 76 transition count 95
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 76 transition count 95
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 67 transition count 85
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 67 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 67 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 65 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 65 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 63 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 63 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 61 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 61 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 61 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 60 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 60 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 60 transition count 69
Applied a total of 56 rules in 19 ms. Remains 60 /85 variables (removed 25) and now considering 69/112 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3017221405295083908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10243257409274704781.kers'
[2026-05-23 17:03:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3017221405295083908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10243257409274704781.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 69 rows 60 cols 223 entries
Finished phase 1 with 56 SingleSign rule and 2 generalized
[2026-05-23 17:03:47] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10243257409274704781.kers
Total runtime 1 ms.
[2026-05-23 17:03:47] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-23 17:03:47] [INFO ] Invariant cache hit.
[2026-05-23 17:03:47] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-23 17:03:47] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2026-05-23 17:03:47] [INFO ] Redundant transitions in 1 ms returned []
Running 68 sub problems to find dead transitions.
[2026-05-23 17:03:47] [INFO ] Invariant cache hit.
[2026-05-23 17:03:47] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/129 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 85 constraints, problems are : Problem set: 0 solved, 68 unsolved in 2449 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 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/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/129 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 68/153 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 153 constraints, problems are : Problem set: 0 solved, 68 unsolved in 11237 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13718ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 13718ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/85 places, 69/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13969 ms. Remains : 60/85 places, 69/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p1 U (p2||G(!p1)))||p0))))'
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-09
Product exploration explored 100000 steps with 22809 reset in 209 ms.
Product exploration explored 100000 steps with 22849 reset in 253 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 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 11 factoid took 80 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (9188 resets) in 182 ms. (218 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (1195 resets) in 338 ms. (118 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (2000 resets) in 331 ms. (120 steps per ms) remains 1/1 properties
[2026-05-23 17:04:02] [INFO ] Invariant cache hit.
[2026-05-23 17:04:02] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 25/129 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/60 constraints, ReadFeed: 0/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 12 factoid took 96 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 547 ms.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 5 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2026-05-23 17:04:02] [INFO ] Invariant cache hit.
[2026-05-23 17:04:02] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-23 17:04:02] [INFO ] Invariant cache hit.
[2026-05-23 17:04:02] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-23 17:04:02] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2026-05-23 17:04:02] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 60/60 places, 69/69 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 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 7 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (9230 resets) in 183 ms. (217 steps per ms) remains 2/3 properties
BEST_FIRST walk for 35606 steps (1801 resets) in 48 ms. (726 steps per ms) remains 0/2 properties
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 385 ms.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 22933 reset in 210 ms.
Product exploration explored 100000 steps with 23014 reset in 237 ms.
Built C files in :
/tmp/ltsmin5810828571249168892
[2026-05-23 17:04:03] [INFO ] Computing symmetric may disable matrix : 69 transitions.
[2026-05-23 17:04:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:04:03] [INFO ] Computing symmetric may enable matrix : 69 transitions.
[2026-05-23 17:04:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:04:03] [INFO ] Computing Do-Not-Accords matrix : 69 transitions.
[2026-05-23 17:04:03] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:04:03] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5810828571249168892
Running compilation step : cd /tmp/ltsmin5810828571249168892;'/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 389 ms.
Running link step : cd /tmp/ltsmin5810828571249168892;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin5810828571249168892;'/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/stateBased712874897511594575.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 69/69 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2026-05-23 17:04:18] [INFO ] Invariant cache hit.
[2026-05-23 17:04:18] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-23 17:04:18] [INFO ] Invariant cache hit.
[2026-05-23 17:04:18] [INFO ] State equation strengthened by 23 read => feed constraints.
[2026-05-23 17:04:18] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2026-05-23 17:04:18] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 60/60 places, 69/69 transitions.
Built C files in :
/tmp/ltsmin14806842862393474564
[2026-05-23 17:04:18] [INFO ] Computing symmetric may disable matrix : 69 transitions.
[2026-05-23 17:04:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:04:18] [INFO ] Computing symmetric may enable matrix : 69 transitions.
[2026-05-23 17:04:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:04:18] [INFO ] Computing Do-Not-Accords matrix : 69 transitions.
[2026-05-23 17:04:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:04:18] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14806842862393474564
Running compilation step : cd /tmp/ltsmin14806842862393474564;'/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 269 ms.
Running link step : cd /tmp/ltsmin14806842862393474564;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14806842862393474564;'/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/stateBased5172786443624803394.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 17:04:34] [INFO ] Flatten gal took : 8 ms
[2026-05-23 17:04:34] [INFO ] Flatten gal took : 7 ms
[2026-05-23 17:04:34] [INFO ] Time to serialize gal into /tmp/LTL14749137488610976517.gal : 3 ms
[2026-05-23 17:04:34] [INFO ] Time to serialize properties into /tmp/LTL2745701587699349660.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14749137488610976517.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11443514657714229175.hoa' '-atoms' '/tmp/LTL2745701587699349660.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2745701587699349660.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11443514657714229175.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t29, t49, t50, t51, t60, t82, t83, t84, t85, t87, t88, t89, t90,...320
Computing Next relation with stutter on 2.04548e+06 deadlock states
27 unique states visited
0 strongly connected components in search stack
52 transitions explored
27 items max in DFS search stack
512 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.13799,120044,1,0,216,432227,172,144,2212,513945,411
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-09 finished in 52446 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((p0||(p1 U p2))) U X(X(X(p3))))&&X(p4)))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 112/112 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 78 transition count 97
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 78 transition count 97
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 73 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 73 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 73 transition count 89
Applied a total of 26 rules in 2 ms. Remains 73 /85 variables (removed 12) and now considering 89/112 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13683506964934241396.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10236088658707237920.kers'
[2026-05-23 17:04:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13683506964934241396.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10236088658707237920.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 73 cols 293 entries
Finished phase 1 with 69 SingleSign rule and 2 generalized
[2026-05-23 17:04:39] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10236088658707237920.kers
Total runtime 1 ms.
[2026-05-23 17:04:39] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-23 17:04:39] [INFO ] Invariant cache hit.
[2026-05-23 17:04:39] [INFO ] State equation strengthened by 28 read => feed constraints.
[2026-05-23 17:04:39] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2026-05-23 17:04:39] [INFO ] Invariant cache hit.
[2026-05-23 17:04:39] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 89/162 variables, 73/75 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 28/103 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 0/162 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 104 constraints, problems are : Problem set: 0 solved, 88 unsolved in 6753 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 89/162 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 28/104 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 88/192 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 192 constraints, problems are : Problem set: 0 solved, 88 unsolved in 16371 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23170ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 23170ms
Starting structural reductions in LTL mode, iteration 1 : 73/85 places, 89/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23481 ms. Remains : 73/85 places, 89/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((p0||(p1 U p2))) U X(X(X(p3))))&&X(p4)))'
Stuttering acceptance computed with spot in 654 ms :[(OR (NOT p4) (NOT p3)), (NOT p3), (NOT p4), (AND p0 (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), true, (AND p0 (NOT p2) (NOT p3)), (NOT p3), (AND p0 (NOT p2) (NOT p3)), (NOT p3), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-10
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-10 finished in 24214 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 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 112/112 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 75 transition count 94
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 75 transition count 94
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 67 transition count 85
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 67 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 66 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 65 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 64 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 64 transition count 75
Applied a total of 47 rules in 19 ms. Remains 64 /85 variables (removed 21) and now considering 75/112 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10858598828107947827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1055325273921867210.kers'
[2026-05-23 17:05:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10858598828107947827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1055325273921867210.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 64 cols 243 entries
Finished phase 1 with 60 SingleSign rule and 2 generalized
[2026-05-23 17:05:03] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1055325273921867210.kers
Total runtime 2 ms.
[2026-05-23 17:05:03] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-23 17:05:03] [INFO ] Invariant cache hit.
[2026-05-23 17:05:04] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 17:05:04] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2026-05-23 17:05:04] [INFO ] Redundant transitions in 2 ms returned []
Running 74 sub problems to find dead transitions.
[2026-05-23 17:05:04] [INFO ] Invariant cache hit.
[2026-05-23 17:05:04] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 91 constraints, problems are : Problem set: 0 solved, 74 unsolved in 3202 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 74/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 165 constraints, problems are : Problem set: 0 solved, 74 unsolved in 14480 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17714ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 17715ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/85 places, 75/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18098 ms. Remains : 64/85 places, 75/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-11
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-11 finished in 18159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 112/112 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 74 transition count 91
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 74 transition count 91
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 66 transition count 82
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 66 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 65 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 64 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 63 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 62 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 62 transition count 72
Applied a total of 51 rules in 12 ms. Remains 62 /85 variables (removed 23) and now considering 72/112 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11417324541327647243.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2788325165061467303.kers'
[2026-05-23 17:05:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11417324541327647243.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2788325165061467303.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 72 rows 62 cols 240 entries
Finished phase 1 with 58 SingleSign rule and 2 generalized
[2026-05-23 17:05:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2788325165061467303.kers
Total runtime 0 ms.
[2026-05-23 17:05:22] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-23 17:05:22] [INFO ] Invariant cache hit.
[2026-05-23 17:05:22] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 17:05:22] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2026-05-23 17:05:22] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2026-05-23 17:05:22] [INFO ] Invariant cache hit.
[2026-05-23 17:05:22] [INFO ] State equation strengthened by 21 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, 21/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 89 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3058 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 4/4 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, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 72/134 variables, 62/68 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 21/89 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 71/160 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 160 constraints, problems are : Problem set: 0 solved, 71 unsolved in 12353 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15430ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 15431ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/85 places, 72/112 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15670 ms. Remains : 62/85 places, 72/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-13
Product exploration explored 100000 steps with 22858 reset in 124 ms.
Product exploration explored 100000 steps with 22949 reset in 123 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 201 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 9 stable transitions
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9221 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4060 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3052 steps, run visited all 1 properties in 10 ms. (steps per millisecond=305 )
Probabilistic random walk after 3052 steps, saw 1437 distinct states, run finished after 10 ms. (steps per millisecond=305 ) properties seen :1
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 244 ms.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2026-05-23 17:05:38] [INFO ] Invariant cache hit.
[2026-05-23 17:05:38] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-23 17:05:38] [INFO ] Invariant cache hit.
[2026-05-23 17:05:38] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 17:05:38] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2026-05-23 17:05:38] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 62/62 places, 72/72 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 201 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 9 stable transitions
Knowledge based reduction with 3 factoid took 44 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (9112 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4159 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3052 steps, run visited all 1 properties in 8 ms. (steps per millisecond=381 )
Probabilistic random walk after 3052 steps, saw 1437 distinct states, run finished after 8 ms. (steps per millisecond=381 ) properties seen :1
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 212 ms.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23054 reset in 115 ms.
Product exploration explored 100000 steps with 22916 reset in 124 ms.
Built C files in :
/tmp/ltsmin4732896715263414346
[2026-05-23 17:05:39] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2026-05-23 17:05:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:05:39] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2026-05-23 17:05:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:05:39] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2026-05-23 17:05:39] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:05:39] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4732896715263414346
Running compilation step : cd /tmp/ltsmin4732896715263414346;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 243 ms.
Running link step : cd /tmp/ltsmin4732896715263414346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4732896715263414346;'/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/stateBased14803090046908007348.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2026-05-23 17:05:54] [INFO ] Invariant cache hit.
[2026-05-23 17:05:54] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-23 17:05:54] [INFO ] Invariant cache hit.
[2026-05-23 17:05:54] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-23 17:05:54] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2026-05-23 17:05:54] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 345 ms. Remains : 62/62 places, 72/72 transitions.
Built C files in :
/tmp/ltsmin5101604900739248022
[2026-05-23 17:05:54] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2026-05-23 17:05:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:05:54] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2026-05-23 17:05:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:05:54] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2026-05-23 17:05:54] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 17:05:54] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5101604900739248022
Running compilation step : cd /tmp/ltsmin5101604900739248022;'/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 345 ms.
Running link step : cd /tmp/ltsmin5101604900739248022;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin5101604900739248022;'/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/stateBased14046061072013288124.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 17:06:09] [INFO ] Flatten gal took : 6 ms
[2026-05-23 17:06:09] [INFO ] Flatten gal took : 6 ms
[2026-05-23 17:06:09] [INFO ] Time to serialize gal into /tmp/LTL3976164738176942148.gal : 2 ms
[2026-05-23 17:06:09] [INFO ] Time to serialize properties into /tmp/LTL13830860334982058152.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3976164738176942148.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18031690667222463867.hoa' '-atoms' '/tmp/LTL13830860334982058152.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13830860334982058152.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18031690667222463867.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t29, t60, t82, t83, t84, t85, t87, t88, t89, t90, t91, t92, t93, t94, t9...303
Computing Next relation with stutter on 3.29798e+06 deadlock states
10 unique states visited
0 strongly connected components in search stack
18 transitions explored
10 items max in DFS search stack
1106 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.0786,210996,1,0,156,767940,174,82,2276,845562,231
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-13 finished in 59654 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)&&F(p1)&&(!p2 U (p3||G(!p2))))))'
Support contains 6 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 112/112 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 77 transition count 94
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 77 transition count 94
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 71 transition count 88
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 71 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 71 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 70 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 70 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 69 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 69 transition count 83
Applied a total of 34 rules in 3 ms. Remains 69 /85 variables (removed 16) and now considering 83/112 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15962621530321361908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14250634182507461365.kers'
[2026-05-23 17:06:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15962621530321361908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14250634182507461365.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 83 rows 69 cols 276 entries
Finished phase 1 with 65 SingleSign rule and 2 generalized
[2026-05-23 17:06:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14250634182507461365.kers
Total runtime 1 ms.
[2026-05-23 17:06:21] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-23 17:06:21] [INFO ] Invariant cache hit.
[2026-05-23 17:06:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-23 17:06:21] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2026-05-23 17:06:21] [INFO ] Invariant cache hit.
[2026-05-23 17:06:21] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/152 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 82 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 97 constraints, problems are : Problem set: 0 solved, 82 unsolved in 3775 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 83/152 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 82/179 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/152 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 179 constraints, problems are : Problem set: 0 solved, 82 unsolved in 10263 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14098ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 14098ms
Starting structural reductions in LTL mode, iteration 1 : 69/85 places, 83/112 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14326 ms. Remains : 69/85 places, 83/112 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1)&&(!p2 U (p3||G(!p2))))))'
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), (OR (NOT p0) (NOT p1) (AND p2 (NOT p3))), true, (NOT p0), (NOT p1), (AND (NOT p3) p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-14
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-14 finished in 14590 ms.
All properties solved by simple procedures.
Total runtime 341495 ms.
BK_STOP 1779555996247
--------------------
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-d0m08"
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-d0m08, 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-177946993500116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m08.tgz
mv DBSingleClientW-PT-d0m08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;
