About the Execution of ITS-Tools for DBSingleClientW-PT-d1m06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 765181.00 | 0.00 | 0.00 | FFFFTTFFFTFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063500076.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is DBSingleClientW-PT-d1m06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063500076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 432K May 29 14:32 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-d1m06-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748570312056
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-d1m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 01:58:34] [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]
[2025-05-30 01:58:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:58:35] [INFO ] Load time of PNML (sax parser for PT used): 340 ms
[2025-05-30 01:58:35] [INFO ] Transformed 1440 places.
[2025-05-30 01:58:35] [INFO ] Transformed 672 transitions.
[2025-05-30 01:58:35] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 574 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1093 places in 13 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 76 places :
Symmetric choice reduction at 1 with 76 rule applications. Total rules 177 place count 250 transition count 436
Iterating global reduction 1 with 76 rules applied. Total rules applied 253 place count 250 transition count 436
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 262 place count 250 transition count 427
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 320 place count 192 transition count 369
Iterating global reduction 2 with 58 rules applied. Total rules applied 378 place count 192 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 379 place count 192 transition count 368
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 408 place count 163 transition count 323
Iterating global reduction 3 with 29 rules applied. Total rules applied 437 place count 163 transition count 323
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 470 place count 163 transition count 290
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 473 place count 160 transition count 285
Iterating global reduction 4 with 3 rules applied. Total rules applied 476 place count 160 transition count 285
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 477 place count 159 transition count 284
Iterating global reduction 4 with 1 rules applied. Total rules applied 478 place count 159 transition count 284
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 479 place count 159 transition count 283
Applied a total of 479 rules in 135 ms. Remains 159 /347 variables (removed 188) and now considering 283/672 (removed 389) transitions.
// Phase 1: matrix 283 rows 159 cols
[2025-05-30 01:58:35] [INFO ] Computed 2 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:36] [INFO ] Implicit Places using invariants in 604 ms returned []
[2025-05-30 01:58:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-05-30 01:58:37] [INFO ] Implicit Places using invariants and state equation in 1242 ms returned []
Implicit Place search using SMT with State Equation took 1912 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2025-05-30 01:58:37] [INFO ] Invariant cache hit.
[2025-05-30 01:58:37] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 283/442 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 0/442 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 308 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (OVERLAPS) 283/442 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 147/308 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 282/590 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/442 variables, and 590 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61018ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 61042ms
Starting structural reductions in LTL mode, iteration 1 : 159/347 places, 283/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63122 ms. Remains : 159/347 places, 283/672 transitions.
Support contains 35 out of 159 places after structural reductions.
[2025-05-30 01:59:39] [INFO ] Flatten gal took : 67 ms
[2025-05-30 01:59:39] [INFO ] Flatten gal took : 34 ms
[2025-05-30 01:59:39] [INFO ] Input system was already deterministic with 283 transitions.
RANDOM walk for 40000 steps (9134 resets) in 3607 ms. (11 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4003 steps (187 resets) in 57 ms. (69 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (202 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (176 resets) in 40 ms. (97 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (190 resets) in 50 ms. (78 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (210 resets) in 39 ms. (100 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (183 resets) in 55 ms. (71 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (192 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (187 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (192 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (188 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (88 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (172 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (187 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (800 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (196 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (192 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (195 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (169 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (166 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (186 resets) in 27 ms. (143 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (191 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (405 resets) in 52 ms. (75 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (203 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (162 resets) in 33 ms. (117 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (436 resets) in 30 ms. (129 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (179 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (179 resets) in 27 ms. (142 steps per ms) remains 27/27 properties
[2025-05-30 01:59:40] [INFO ] Invariant cache hit.
[2025-05-30 01:59:40] [INFO ] State equation strengthened by 147 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (OVERLAPS) 53/85 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 36/121 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 250/371 variables, 121/123 constraints. Problems are: Problem set: 1 solved, 26 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 114/237 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/237 constraints. Problems are: Problem set: 1 solved, 26 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 8 (OVERLAPS) 71/442 variables, 38/275 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 33/308 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 0/308 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/442 variables, 0/308 constraints. Problems are: Problem set: 2 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 308 constraints, problems are : Problem set: 2 solved, 25 unsolved in 3864 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 25 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 54/84 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 36/120 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 245/365 variables, 120/122 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 109/231 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/232 constraints. Problems are: Problem set: 2 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:45] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 1/233 constraints. Problems are: Problem set: 2 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:59:46] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 8 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 1/234 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/234 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 77/442 variables, 39/273 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/442 variables, 38/311 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/442 variables, 24/335 constraints. Problems are: Problem set: 2 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/442 variables, and 335 constraints, problems are : Problem set: 2 solved, 25 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 25/27 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8954ms problems are : Problem set: 2 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 283/283 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 156 transition count 273
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 156 transition count 273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 155 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 155 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 154 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 154 transition count 271
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 154 transition count 269
Applied a total of 12 rules in 81 ms. Remains 154 /159 variables (removed 5) and now considering 269/283 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 154/159 places, 269/283 transitions.
RANDOM walk for 40000 steps (9174 resets) in 601 ms. (66 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (187 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (193 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (181 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (199 resets) in 46 ms. (85 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (184 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (205 resets) in 61 ms. (64 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (190 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (191 resets) in 49 ms. (80 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (201 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (185 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (176 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (194 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (800 resets) in 48 ms. (81 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (185 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (185 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (201 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (205 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (198 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (183 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (387 resets) in 55 ms. (71 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (182 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (210 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (420 resets) in 54 ms. (72 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (194 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (179 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
Probabilistic random walk after 1000001 steps, saw 342822 distinct states, run finished after 2469 ms. (steps per millisecond=405 ) properties seen :24
// Phase 1: matrix 269 rows 154 cols
[2025-05-30 01:59:52] [INFO ] Computed 2 invariants in 8 ms
[2025-05-30 01:59:52] [INFO ] State equation strengthened by 141 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 150/246 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 22/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 159/405 variables, 49/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 110/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/423 variables, 9/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 9/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/423 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 150/246 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 22/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 159/405 variables, 49/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 110/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 18/423 variables, 9/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/423 variables, 9/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/423 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 298 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1235 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 154/154 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1612ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 280 ms.
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 269/269 transitions.
Graph (complete) has 513 edges and 154 vertex of which 153 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 153 transition count 264
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 27 place count 132 transition count 185
Iterating global reduction 1 with 21 rules applied. Total rules applied 48 place count 132 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 132 transition count 182
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 66 place count 117 transition count 167
Iterating global reduction 2 with 15 rules applied. Total rules applied 81 place count 117 transition count 167
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 117 transition count 162
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 96 place count 107 transition count 148
Iterating global reduction 3 with 10 rules applied. Total rules applied 106 place count 107 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 107 transition count 146
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 114 place count 101 transition count 138
Iterating global reduction 4 with 6 rules applied. Total rules applied 120 place count 101 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 122 place count 101 transition count 136
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 126 place count 97 transition count 132
Iterating global reduction 5 with 4 rules applied. Total rules applied 130 place count 97 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 132 place count 97 transition count 130
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 135 place count 94 transition count 127
Iterating global reduction 6 with 3 rules applied. Total rules applied 138 place count 94 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 139 place count 94 transition count 126
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 140 place count 93 transition count 120
Iterating global reduction 7 with 1 rules applied. Total rules applied 141 place count 93 transition count 120
Applied a total of 141 rules in 76 ms. Remains 93 /154 variables (removed 61) and now considering 120/269 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 93/154 places, 120/269 transitions.
RANDOM walk for 40000 steps (9202 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1972 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 44432 steps, run visited all 1 properties in 96 ms. (steps per millisecond=462 )
Probabilistic random walk after 44432 steps, saw 18640 distinct states, run finished after 103 ms. (steps per millisecond=431 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 5 stabilizing places and 30 stable transitions
Graph (complete) has 593 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!((!p0 U X(p1)) U X(p2))||p0))||X(p1)))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 283/283 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 137 transition count 203
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 137 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 137 transition count 200
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 122 transition count 183
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 122 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 80 place count 122 transition count 180
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 112 transition count 167
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 112 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 104 place count 112 transition count 163
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 107 transition count 156
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 107 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 107 transition count 155
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 119 place count 103 transition count 151
Iterating global reduction 4 with 4 rules applied. Total rules applied 123 place count 103 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 125 place count 103 transition count 149
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 128 place count 100 transition count 145
Iterating global reduction 5 with 3 rules applied. Total rules applied 131 place count 100 transition count 145
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 99 transition count 139
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 99 transition count 139
Applied a total of 133 rules in 17 ms. Remains 99 /159 variables (removed 60) and now considering 139/283 (removed 144) transitions.
// Phase 1: matrix 139 rows 99 cols
[2025-05-30 01:59:55] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:59:55] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-05-30 01:59:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:59:55] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-05-30 01:59:56] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2025-05-30 01:59:56] [INFO ] Invariant cache hit.
[2025-05-30 01:59:56] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/238 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:01] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:04] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:04] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:07] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:07] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 159 constraints, problems are : Problem set: 0 solved, 138 unsolved in 20359 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 139/238 variables, 99/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 53/159 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 138/297 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/238 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 297 constraints, problems are : Problem set: 0 solved, 138 unsolved in 24414 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44862ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 44863ms
Starting structural reductions in LTL mode, iteration 1 : 99/159 places, 139/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45354 ms. Remains : 99/159 places, 139/283 transitions.
Stuttering acceptance computed with spot in 593 ms :[true, p1, (AND (NOT p1) (NOT p0) p2), (AND (NOT p1) (NOT p0) p2), (AND p1 p2), (AND p1 p2), p1, p2, p2]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-00
Product exploration explored 100000 steps with 22946 reset in 429 ms.
Product exploration explored 100000 steps with 23108 reset in 322 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 345 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 217 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[true, p1, p2, p2, (AND p1 p2), (AND p1 p2), p1, p2, p2]
RANDOM walk for 40000 steps (9227 resets) in 571 ms. (69 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1904 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1930 resets) in 215 ms. (185 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1887 resets) in 160 ms. (248 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1921 resets) in 303 ms. (131 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1845 resets) in 283 ms. (140 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1850 resets) in 222 ms. (179 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1818 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1857 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1898 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1915 resets) in 165 ms. (240 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1859 resets) in 136 ms. (291 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1895 resets) in 155 ms. (256 steps per ms) remains 12/12 properties
Finished probabilistic random walk after 46042 steps, run visited all 12 properties in 275 ms. (steps per millisecond=167 )
Probabilistic random walk after 46042 steps, saw 19902 distinct states, run finished after 277 ms. (steps per millisecond=166 ) properties seen :12
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F p0), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 11 factoid took 694 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 425 ms :[true, p1, p2, p2, (AND p1 p2), (AND p1 p2), p1, p2, p2]
Stuttering acceptance computed with spot in 410 ms :[true, p1, p2, p2, (AND p1 p2), (AND p1 p2), p1, p2, p2]
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 139/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2025-05-30 02:00:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:00:45] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-05-30 02:00:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:00:45] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-05-30 02:00:46] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2025-05-30 02:00:46] [INFO ] Invariant cache hit.
[2025-05-30 02:00:46] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/238 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:50] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:53] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:53] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:55] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:00:55] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 159 constraints, problems are : Problem set: 0 solved, 138 unsolved in 16237 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 139/238 variables, 99/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 53/159 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 138/297 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/238 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 297 constraints, problems are : Problem set: 0 solved, 138 unsolved in 21798 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38144ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 38145ms
Finished structural reductions in LTL mode , in 1 iterations and 38622 ms. Remains : 99/99 places, 139/139 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 345 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 179 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 423 ms :[true, p1, p2, p2, (AND p1 p2), (AND p1 p2), p1, p2, p2]
RANDOM walk for 40000 steps (9136 resets) in 358 ms. (111 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1892 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1912 resets) in 136 ms. (291 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1872 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1868 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1976 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1904 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1878 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1865 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1878 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1887 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1927 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1872 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
Finished probabilistic random walk after 46042 steps, run visited all 12 properties in 264 ms. (steps per millisecond=174 )
Probabilistic random walk after 46042 steps, saw 19902 distinct states, run finished after 264 ms. (steps per millisecond=174 ) properties seen :12
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 8 factoid took 724 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 406 ms :[true, p1, p2, p2, (AND p1 p2), (AND p1 p2), p1, p2, p2]
Stuttering acceptance computed with spot in 366 ms :[true, p1, p2, p2, (AND p1 p2), (AND p1 p2), p1, p2, p2]
Stuttering acceptance computed with spot in 388 ms :[true, p1, p2, p2, (AND p1 p2), (AND p1 p2), p1, p2, p2]
Product exploration explored 100000 steps with 22932 reset in 220 ms.
Product exploration explored 100000 steps with 22851 reset in 293 ms.
Applying partial POR strategy [true, true, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 384 ms :[true, p1, p2, p2, (AND p1 p2), (AND p1 p2), p1, p2, p2]
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 139/139 transitions.
Applied a total of 0 rules in 11 ms. Remains 99 /99 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:01:28] [INFO ] Redundant transitions in 5 ms returned []
Running 138 sub problems to find dead transitions.
[2025-05-30 02:01:28] [INFO ] Invariant cache hit.
[2025-05-30 02:01:28] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/238 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:34] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:37] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:37] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:39] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:01:40] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 159 constraints, problems are : Problem set: 0 solved, 138 unsolved in 19560 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 139/238 variables, 99/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 53/159 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 138/297 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/238 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 297 constraints, problems are : Problem set: 0 solved, 138 unsolved in 23118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42735ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 42737ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42779 ms. Remains : 99/99 places, 139/139 transitions.
Built C files in :
/tmp/ltsmin15810310339430586062
[2025-05-30 02:02:11] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15810310339430586062
Running compilation step : cd /tmp/ltsmin15810310339430586062;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 821 ms.
Running link step : cd /tmp/ltsmin15810310339430586062;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin15810310339430586062;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14047823819999782664.hoa' '--buchi-type=spotba'
LTSmin run took 4930 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-00 finished in 142038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p0)))))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 283/283 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 134 transition count 188
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 134 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 134 transition count 185
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 71 place count 116 transition count 165
Iterating global reduction 1 with 18 rules applied. Total rules applied 89 place count 116 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 94 place count 116 transition count 160
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 107 place count 103 transition count 143
Iterating global reduction 2 with 13 rules applied. Total rules applied 120 place count 103 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 124 place count 103 transition count 139
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 132 place count 95 transition count 124
Iterating global reduction 3 with 8 rules applied. Total rules applied 140 place count 95 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 142 place count 95 transition count 122
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 148 place count 89 transition count 116
Iterating global reduction 4 with 6 rules applied. Total rules applied 154 place count 89 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 156 place count 89 transition count 114
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 161 place count 84 transition count 108
Iterating global reduction 5 with 5 rules applied. Total rules applied 166 place count 84 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 167 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 168 place count 83 transition count 101
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 83 transition count 101
Applied a total of 169 rules in 11 ms. Remains 83 /159 variables (removed 76) and now considering 101/283 (removed 182) transitions.
// Phase 1: matrix 101 rows 83 cols
[2025-05-30 02:02:17] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:02:17] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-05-30 02:02:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:02:17] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-30 02:02:17] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-05-30 02:02:17] [INFO ] Invariant cache hit.
[2025-05-30 02:02:18] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:21] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:21] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:21] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:21] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:21] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:21] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:21] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:21] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:21] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:23] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:23] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:23] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:02:24] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 129 constraints, problems are : Problem set: 0 solved, 100 unsolved in 10514 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 101/184 variables, 83/98 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 31/129 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 100/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 229 constraints, problems are : Problem set: 0 solved, 100 unsolved in 17195 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27744ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 27745ms
Starting structural reductions in LTL mode, iteration 1 : 83/159 places, 101/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28124 ms. Remains : 83/159 places, 101/283 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-01 finished in 28300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 283/283 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 134 transition count 188
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 134 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 134 transition count 185
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 71 place count 116 transition count 165
Iterating global reduction 1 with 18 rules applied. Total rules applied 89 place count 116 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 94 place count 116 transition count 160
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 107 place count 103 transition count 143
Iterating global reduction 2 with 13 rules applied. Total rules applied 120 place count 103 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 124 place count 103 transition count 139
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 132 place count 95 transition count 124
Iterating global reduction 3 with 8 rules applied. Total rules applied 140 place count 95 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 142 place count 95 transition count 122
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 147 place count 90 transition count 117
Iterating global reduction 4 with 5 rules applied. Total rules applied 152 place count 90 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 154 place count 90 transition count 115
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 158 place count 86 transition count 110
Iterating global reduction 5 with 4 rules applied. Total rules applied 162 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 163 place count 85 transition count 104
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 85 transition count 104
Applied a total of 164 rules in 48 ms. Remains 85 /159 variables (removed 74) and now considering 104/283 (removed 179) transitions.
// Phase 1: matrix 104 rows 85 cols
[2025-05-30 02:02:45] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:02:46] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-05-30 02:02:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:02:46] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-30 02:02:46] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:02:46] [INFO ] Redundant transitions in 4 ms returned []
Running 103 sub problems to find dead transitions.
[2025-05-30 02:02:46] [INFO ] Invariant cache hit.
[2025-05-30 02:02:46] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4678 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 103/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 222 constraints, problems are : Problem set: 0 solved, 103 unsolved in 23012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27752ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 27753ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/159 places, 104/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28520 ms. Remains : 85/159 places, 104/283 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-02
Product exploration explored 100000 steps with 22881 reset in 496 ms.
Product exploration explored 100000 steps with 23033 reset in 262 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 5880 steps (1369 resets) in 18 ms. (309 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2025-05-30 02:03:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:03:15] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-05-30 02:03:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:03:15] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-30 02:03:16] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:03:16] [INFO ] Redundant transitions in 2 ms returned []
Running 103 sub problems to find dead transitions.
[2025-05-30 02:03:16] [INFO ] Invariant cache hit.
[2025-05-30 02:03:16] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 103 unsolved in 6296 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 103/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 222 constraints, problems are : Problem set: 0 solved, 103 unsolved in 24615 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30954ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 30956ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31455 ms. Remains : 85/85 places, 104/104 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 18515 steps (4264 resets) in 80 ms. (228 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23034 reset in 251 ms.
Product exploration explored 100000 steps with 22969 reset in 368 ms.
Built C files in :
/tmp/ltsmin18312448238103781967
[2025-05-30 02:03:48] [INFO ] Computing symmetric may disable matrix : 104 transitions.
[2025-05-30 02:03:48] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:03:48] [INFO ] Computing symmetric may enable matrix : 104 transitions.
[2025-05-30 02:03:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:03:48] [INFO ] Computing Do-Not-Accords matrix : 104 transitions.
[2025-05-30 02:03:48] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:03:48] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18312448238103781967
Running compilation step : cd /tmp/ltsmin18312448238103781967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 477 ms.
Running link step : cd /tmp/ltsmin18312448238103781967;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin18312448238103781967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2494657701992504720.hoa' '--buchi-type=spotba'
LTSmin run took 165 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-02 finished in 62944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((!p0&&(G(!p1)||(!p1&&F(!p2))))))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 283/283 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 136 transition count 195
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 136 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 136 transition count 193
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 119 transition count 174
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 119 transition count 174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 85 place count 119 transition count 171
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 96 place count 108 transition count 157
Iterating global reduction 2 with 11 rules applied. Total rules applied 107 place count 108 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 108 transition count 154
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 117 place count 101 transition count 141
Iterating global reduction 3 with 7 rules applied. Total rules applied 124 place count 101 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 101 transition count 140
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 131 place count 95 transition count 134
Iterating global reduction 4 with 6 rules applied. Total rules applied 137 place count 95 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 139 place count 95 transition count 132
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 144 place count 90 transition count 126
Iterating global reduction 5 with 5 rules applied. Total rules applied 149 place count 90 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 150 place count 90 transition count 125
Applied a total of 150 rules in 13 ms. Remains 90 /159 variables (removed 69) and now considering 125/283 (removed 158) transitions.
// Phase 1: matrix 125 rows 90 cols
[2025-05-30 02:03:48] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:03:49] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-05-30 02:03:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:03:49] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-05-30 02:03:49] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-05-30 02:03:49] [INFO ] Invariant cache hit.
[2025-05-30 02:03:49] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/215 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 47/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:53] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:53] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 0/215 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 141 constraints, problems are : Problem set: 0 solved, 124 unsolved in 8814 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 125/215 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 124/265 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (OVERLAPS) 0/215 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 265 constraints, problems are : Problem set: 0 solved, 124 unsolved in 23884 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32776ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 32777ms
Starting structural reductions in LTL mode, iteration 1 : 90/159 places, 125/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33459 ms. Remains : 90/159 places, 125/283 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (OR p1 p0), (OR p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-03
Product exploration explored 100000 steps with 22998 reset in 338 ms.
Product exploration explored 100000 steps with 22918 reset in 305 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 313 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (OR p1 p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (9247 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1920 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1904 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1887 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 12994 steps, run visited all 3 properties in 50 ms. (steps per millisecond=259 )
Probabilistic random walk after 12994 steps, saw 6108 distinct states, run finished after 50 ms. (steps per millisecond=259 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 9 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-03 finished in 34843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X((G(!p1) U !p2)))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 283/283 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 137 transition count 198
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 137 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 137 transition count 196
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 63 place count 120 transition count 177
Iterating global reduction 1 with 17 rules applied. Total rules applied 80 place count 120 transition count 177
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 85 place count 120 transition count 172
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 97 place count 108 transition count 156
Iterating global reduction 2 with 12 rules applied. Total rules applied 109 place count 108 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 112 place count 108 transition count 153
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 120 place count 100 transition count 138
Iterating global reduction 3 with 8 rules applied. Total rules applied 128 place count 100 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 130 place count 100 transition count 136
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 136 place count 94 transition count 130
Iterating global reduction 4 with 6 rules applied. Total rules applied 142 place count 94 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 144 place count 94 transition count 128
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 149 place count 89 transition count 122
Iterating global reduction 5 with 5 rules applied. Total rules applied 154 place count 89 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 155 place count 89 transition count 121
Applied a total of 155 rules in 9 ms. Remains 89 /159 variables (removed 70) and now considering 121/283 (removed 162) transitions.
// Phase 1: matrix 121 rows 89 cols
[2025-05-30 02:04:23] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:04:23] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-05-30 02:04:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:04:24] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-05-30 02:04:24] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-05-30 02:04:24] [INFO ] Invariant cache hit.
[2025-05-30 02:04:24] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/210 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 120 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 138 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5618 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/210 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 120/258 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 258 constraints, problems are : Problem set: 0 solved, 120 unsolved in 29789 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35451ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 35452ms
Starting structural reductions in LTL mode, iteration 1 : 89/159 places, 121/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35987 ms. Remains : 89/159 places, 121/283 transitions.
Stuttering acceptance computed with spot in 388 ms :[p2, p2, p2, p2, true, p1, p2, (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 241 ms.
Product exploration explored 100000 steps with 33333 reset in 264 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 307 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 24 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-04 finished in 36939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 283/283 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 135 transition count 189
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 135 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 135 transition count 187
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 117 transition count 167
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 117 transition count 167
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 91 place count 117 transition count 162
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 104 place count 104 transition count 145
Iterating global reduction 2 with 13 rules applied. Total rules applied 117 place count 104 transition count 145
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 121 place count 104 transition count 141
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 129 place count 96 transition count 126
Iterating global reduction 3 with 8 rules applied. Total rules applied 137 place count 96 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 139 place count 96 transition count 124
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 145 place count 90 transition count 118
Iterating global reduction 4 with 6 rules applied. Total rules applied 151 place count 90 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 153 place count 90 transition count 116
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 158 place count 85 transition count 110
Iterating global reduction 5 with 5 rules applied. Total rules applied 163 place count 85 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 164 place count 85 transition count 109
Applied a total of 164 rules in 12 ms. Remains 85 /159 variables (removed 74) and now considering 109/283 (removed 174) transitions.
// Phase 1: matrix 109 rows 85 cols
[2025-05-30 02:05:00] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:05:00] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-30 02:05:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:05:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 02:05:01] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2025-05-30 02:05:01] [INFO ] Invariant cache hit.
[2025-05-30 02:05:01] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/194 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 38/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 125 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/194 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 38/125 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 108/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 233 constraints, problems are : Problem set: 0 solved, 108 unsolved in 17725 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22898ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 22899ms
Starting structural reductions in LTL mode, iteration 1 : 85/159 places, 109/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23339 ms. Remains : 85/159 places, 109/283 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-08 finished in 23493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p0&&X(X(F(!p0))))||G(F(!p0))))))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 283/283 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 134 transition count 188
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 134 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 134 transition count 185
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 71 place count 116 transition count 165
Iterating global reduction 1 with 18 rules applied. Total rules applied 89 place count 116 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 94 place count 116 transition count 160
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 107 place count 103 transition count 143
Iterating global reduction 2 with 13 rules applied. Total rules applied 120 place count 103 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 124 place count 103 transition count 139
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 131 place count 96 transition count 126
Iterating global reduction 3 with 7 rules applied. Total rules applied 138 place count 96 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 140 place count 96 transition count 124
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 145 place count 91 transition count 119
Iterating global reduction 4 with 5 rules applied. Total rules applied 150 place count 91 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 152 place count 91 transition count 117
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 156 place count 87 transition count 112
Iterating global reduction 5 with 4 rules applied. Total rules applied 160 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 161 place count 86 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 86 transition count 106
Applied a total of 162 rules in 7 ms. Remains 86 /159 variables (removed 73) and now considering 106/283 (removed 177) transitions.
// Phase 1: matrix 106 rows 86 cols
[2025-05-30 02:05:24] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:05:24] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-30 02:05:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:05:24] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-30 02:05:24] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-05-30 02:05:24] [INFO ] Invariant cache hit.
[2025-05-30 02:05:24] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/192 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 120 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4330 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/192 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 105/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 105 unsolved in 22031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26413ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 26414ms
Starting structural reductions in LTL mode, iteration 1 : 86/159 places, 106/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26844 ms. Remains : 86/159 places, 106/283 transitions.
Stuttering acceptance computed with spot in 172 ms :[p0, p0, p0, p0]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-09
Product exploration explored 100000 steps with 28580 reset in 161 ms.
Product exploration explored 100000 steps with 28535 reset in 201 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 290 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[p0, p0, p0, p0]
RANDOM walk for 17456 steps (4007 resets) in 59 ms. (290 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 167 ms :[p0, p0, p0, p0]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2025-05-30 02:05:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:05:52] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-05-30 02:05:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:05:52] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-30 02:05:53] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-05-30 02:05:53] [INFO ] Invariant cache hit.
[2025-05-30 02:05:53] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/192 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 120 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5712 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/192 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 105/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 105 unsolved in 20844 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26615ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 26616ms
Finished structural reductions in LTL mode , in 1 iterations and 27208 ms. Remains : 86/86 places, 106/106 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 290 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[p0, p0, p0, p0]
RANDOM walk for 29750 steps (6785 resets) in 62 ms. (472 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 173 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 178 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 28579 reset in 207 ms.
Product exploration explored 100000 steps with 28569 reset in 228 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 180 ms :[p0, p0, p0, p0]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 7 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:06:21] [INFO ] Redundant transitions in 3 ms returned []
Running 105 sub problems to find dead transitions.
[2025-05-30 02:06:21] [INFO ] Invariant cache hit.
[2025-05-30 02:06:21] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/192 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 120 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5297 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/192 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 105/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 105 unsolved in 20289 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25624ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 25625ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25647 ms. Remains : 86/86 places, 106/106 transitions.
Built C files in :
/tmp/ltsmin13451380511370771173
[2025-05-30 02:06:46] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13451380511370771173
Running compilation step : cd /tmp/ltsmin13451380511370771173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 457 ms.
Running link step : cd /tmp/ltsmin13451380511370771173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13451380511370771173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11819327013706874365.hoa' '--buchi-type=spotba'
LTSmin run took 110 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-09 finished in 83438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(X(p0)) U p1))&&(F((G(p1)||X(p2))) U p3)))'
Support contains 6 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 283/283 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 138 transition count 207
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 138 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 138 transition count 204
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 61 place count 122 transition count 186
Iterating global reduction 1 with 16 rules applied. Total rules applied 77 place count 122 transition count 186
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 82 place count 122 transition count 181
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 93 place count 111 transition count 167
Iterating global reduction 2 with 11 rules applied. Total rules applied 104 place count 111 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 107 place count 111 transition count 164
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 113 place count 105 transition count 152
Iterating global reduction 3 with 6 rules applied. Total rules applied 119 place count 105 transition count 152
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 123 place count 105 transition count 148
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 127 place count 101 transition count 144
Iterating global reduction 4 with 4 rules applied. Total rules applied 131 place count 101 transition count 144
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 135 place count 97 transition count 139
Iterating global reduction 4 with 4 rules applied. Total rules applied 139 place count 97 transition count 139
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 140 place count 96 transition count 133
Iterating global reduction 4 with 1 rules applied. Total rules applied 141 place count 96 transition count 133
Applied a total of 141 rules in 34 ms. Remains 96 /159 variables (removed 63) and now considering 133/283 (removed 150) transitions.
// Phase 1: matrix 133 rows 96 cols
[2025-05-30 02:06:47] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:06:47] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-05-30 02:06:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:06:47] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-05-30 02:06:48] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:06:48] [INFO ] Redundant transitions in 7 ms returned []
Running 132 sub problems to find dead transitions.
[2025-05-30 02:06:48] [INFO ] Invariant cache hit.
[2025-05-30 02:06:48] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/229 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 52/150 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:53] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:53] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:53] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:53] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:53] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:06:53] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 156 constraints, problems are : Problem set: 0 solved, 132 unsolved in 10609 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/229 variables, 96/104 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 52/156 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 132/288 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/229 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 288 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40719ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 40720ms
Starting structural reductions in SI_LTL mode, iteration 1 : 96/159 places, 133/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41469 ms. Remains : 96/159 places, 133/283 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p3) (NOT p1)), (NOT p3), (OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-10 finished in 41754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (F(p2)&&p1)))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 283/283 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 137 transition count 208
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 137 transition count 208
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 49 place count 137 transition count 203
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 66 place count 120 transition count 184
Iterating global reduction 1 with 17 rules applied. Total rules applied 83 place count 120 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 87 place count 120 transition count 180
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 99 place count 108 transition count 164
Iterating global reduction 2 with 12 rules applied. Total rules applied 111 place count 108 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 116 place count 108 transition count 159
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 123 place count 101 transition count 146
Iterating global reduction 3 with 7 rules applied. Total rules applied 130 place count 101 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 101 transition count 145
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 137 place count 95 transition count 139
Iterating global reduction 4 with 6 rules applied. Total rules applied 143 place count 95 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 145 place count 95 transition count 137
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 150 place count 90 transition count 131
Iterating global reduction 5 with 5 rules applied. Total rules applied 155 place count 90 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 156 place count 90 transition count 130
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 157 place count 89 transition count 124
Iterating global reduction 6 with 1 rules applied. Total rules applied 158 place count 89 transition count 124
Applied a total of 158 rules in 22 ms. Remains 89 /159 variables (removed 70) and now considering 124/283 (removed 159) transitions.
// Phase 1: matrix 124 rows 89 cols
[2025-05-30 02:07:29] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:07:29] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-05-30 02:07:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:07:29] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-05-30 02:07:29] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:07:29] [INFO ] Redundant transitions in 1 ms returned []
Running 123 sub problems to find dead transitions.
[2025-05-30 02:07:29] [INFO ] Invariant cache hit.
[2025-05-30 02:07:29] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/213 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 51/142 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:35] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 13 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/213 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 143 constraints, problems are : Problem set: 0 solved, 123 unsolved in 9119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 124/213 variables, 89/92 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 51/143 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 123/266 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 266 constraints, problems are : Problem set: 0 solved, 123 unsolved in 26346 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35521ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 35523ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/159 places, 124/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36170 ms. Remains : 89/159 places, 124/283 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-11 finished in 36304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 283/283 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 136 transition count 198
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 136 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 136 transition count 194
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 66 place count 120 transition count 176
Iterating global reduction 1 with 16 rules applied. Total rules applied 82 place count 120 transition count 176
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 87 place count 120 transition count 171
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 98 place count 109 transition count 156
Iterating global reduction 2 with 11 rules applied. Total rules applied 109 place count 109 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 113 place count 109 transition count 152
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 119 place count 103 transition count 143
Iterating global reduction 3 with 6 rules applied. Total rules applied 125 place count 103 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 129 place count 103 transition count 139
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 133 place count 99 transition count 135
Iterating global reduction 4 with 4 rules applied. Total rules applied 137 place count 99 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 139 place count 99 transition count 133
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 142 place count 96 transition count 129
Iterating global reduction 5 with 3 rules applied. Total rules applied 145 place count 96 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 95 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 95 transition count 123
Applied a total of 147 rules in 9 ms. Remains 95 /159 variables (removed 64) and now considering 123/283 (removed 160) transitions.
// Phase 1: matrix 123 rows 95 cols
[2025-05-30 02:08:05] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:08:05] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-05-30 02:08:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:08:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-30 02:08:06] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2025-05-30 02:08:06] [INFO ] Invariant cache hit.
[2025-05-30 02:08:06] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 138 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8331 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 122/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 260 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38395ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 38395ms
Starting structural reductions in LTL mode, iteration 1 : 95/159 places, 123/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38863 ms. Remains : 95/159 places, 123/283 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-12
Product exploration explored 100000 steps with 22981 reset in 287 ms.
Product exploration explored 100000 steps with 23166 reset in 315 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 325 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (9185 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1961 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1854 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 20248 steps, run visited all 2 properties in 89 ms. (steps per millisecond=227 )
Probabilistic random walk after 20248 steps, saw 9385 distinct states, run finished after 89 ms. (steps per millisecond=227 ) properties seen :2
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2025-05-30 02:08:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:08:46] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-05-30 02:08:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:08:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-30 02:08:46] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:08:46] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2025-05-30 02:08:46] [INFO ] Invariant cache hit.
[2025-05-30 02:08:46] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 138 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8084 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 122/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 260 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38141ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 38141ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38619 ms. Remains : 95/95 places, 123/123 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 325 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (9199 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1919 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1865 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 20248 steps, run visited all 2 properties in 76 ms. (steps per millisecond=266 )
Probabilistic random walk after 20248 steps, saw 9385 distinct states, run finished after 76 ms. (steps per millisecond=266 ) properties seen :2
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 22962 reset in 281 ms.
Product exploration explored 100000 steps with 22888 reset in 291 ms.
Built C files in :
/tmp/ltsmin3251215113536859648
[2025-05-30 02:09:25] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2025-05-30 02:09:25] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:09:25] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2025-05-30 02:09:25] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:09:25] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2025-05-30 02:09:25] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 02:09:25] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3251215113536859648
Running compilation step : cd /tmp/ltsmin3251215113536859648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 622 ms.
Running link step : cd /tmp/ltsmin3251215113536859648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin3251215113536859648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8324130998978273515.hoa' '--buchi-type=spotba'
LTSmin run took 396 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-12 finished in 81374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 283/283 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 136 transition count 194
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 136 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 136 transition count 191
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 65 place count 120 transition count 175
Iterating global reduction 1 with 16 rules applied. Total rules applied 81 place count 120 transition count 175
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 85 place count 120 transition count 171
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 95 place count 110 transition count 158
Iterating global reduction 2 with 10 rules applied. Total rules applied 105 place count 110 transition count 158
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 109 place count 110 transition count 154
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 114 place count 105 transition count 146
Iterating global reduction 3 with 5 rules applied. Total rules applied 119 place count 105 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 105 transition count 145
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 124 place count 101 transition count 141
Iterating global reduction 4 with 4 rules applied. Total rules applied 128 place count 101 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 130 place count 101 transition count 139
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 133 place count 98 transition count 136
Iterating global reduction 5 with 3 rules applied. Total rules applied 136 place count 98 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 137 place count 98 transition count 135
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 138 place count 97 transition count 129
Iterating global reduction 6 with 1 rules applied. Total rules applied 139 place count 97 transition count 129
Applied a total of 139 rules in 32 ms. Remains 97 /159 variables (removed 62) and now considering 129/283 (removed 154) transitions.
// Phase 1: matrix 129 rows 97 cols
[2025-05-30 02:09:27] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:09:27] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-05-30 02:09:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:09:27] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-05-30 02:09:27] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:09:27] [INFO ] Redundant transitions in 2 ms returned []
Running 128 sub problems to find dead transitions.
[2025-05-30 02:09:27] [INFO ] Invariant cache hit.
[2025-05-30 02:09:27] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/226 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 44/143 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/226 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 143 constraints, problems are : Problem set: 0 solved, 128 unsolved in 7450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/226 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 44/143 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 128/271 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/226 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 271 constraints, problems are : Problem set: 0 solved, 128 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37531ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 37532ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/159 places, 129/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38469 ms. Remains : 97/159 places, 129/283 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-13 finished in 38588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 283/283 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 135 transition count 192
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 135 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 135 transition count 189
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 68 place count 118 transition count 170
Iterating global reduction 1 with 17 rules applied. Total rules applied 85 place count 118 transition count 170
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 90 place count 118 transition count 165
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 102 place count 106 transition count 149
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 106 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 116 place count 106 transition count 147
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 124 place count 98 transition count 132
Iterating global reduction 3 with 8 rules applied. Total rules applied 132 place count 98 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 134 place count 98 transition count 130
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 140 place count 92 transition count 124
Iterating global reduction 4 with 6 rules applied. Total rules applied 146 place count 92 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 148 place count 92 transition count 122
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 153 place count 87 transition count 116
Iterating global reduction 5 with 5 rules applied. Total rules applied 158 place count 87 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 159 place count 87 transition count 115
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 86 transition count 109
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 86 transition count 109
Applied a total of 161 rules in 27 ms. Remains 86 /159 variables (removed 73) and now considering 109/283 (removed 174) transitions.
// Phase 1: matrix 109 rows 86 cols
[2025-05-30 02:10:05] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:10:05] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-05-30 02:10:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:10:05] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-30 02:10:06] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:10:06] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2025-05-30 02:10:06] [INFO ] Invariant cache hit.
[2025-05-30 02:10:06] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 120 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6288 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 108/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 228 constraints, problems are : Problem set: 0 solved, 108 unsolved in 23785 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30136ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 30137ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/159 places, 109/283 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30773 ms. Remains : 86/159 places, 109/283 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-14 finished in 30838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p0 U p1)||X(F((F(p3)&&p2))))))'
Support contains 6 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 283/283 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 138 transition count 196
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 138 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 138 transition count 193
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 125 transition count 180
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 125 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 74 place count 125 transition count 177
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 116 transition count 167
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 116 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 96 place count 116 transition count 163
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 101 place count 111 transition count 152
Iterating global reduction 3 with 5 rules applied. Total rules applied 106 place count 111 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 111 transition count 151
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 111 place count 107 transition count 147
Iterating global reduction 4 with 4 rules applied. Total rules applied 115 place count 107 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 117 place count 107 transition count 145
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 120 place count 104 transition count 142
Iterating global reduction 5 with 3 rules applied. Total rules applied 123 place count 104 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 124 place count 104 transition count 141
Applied a total of 124 rules in 9 ms. Remains 104 /159 variables (removed 55) and now considering 141/283 (removed 142) transitions.
// Phase 1: matrix 141 rows 104 cols
[2025-05-30 02:10:36] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:10:36] [INFO ] Implicit Places using invariants in 269 ms returned []
[2025-05-30 02:10:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:10:36] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-05-30 02:10:37] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2025-05-30 02:10:37] [INFO ] Invariant cache hit.
[2025-05-30 02:10:37] [INFO ] State equation strengthened by 51 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/245 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 51/157 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/245 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 157 constraints, problems are : Problem set: 0 solved, 140 unsolved in 9624 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/245 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 51/157 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 140/297 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 245/245 variables, and 297 constraints, problems are : Problem set: 0 solved, 140 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39733ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 39735ms
Starting structural reductions in LTL mode, iteration 1 : 104/159 places, 141/283 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40602 ms. Remains : 104/159 places, 141/283 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-15 finished in 40757 ms.
All properties solved by simple procedures.
Total runtime 762498 ms.
BK_STOP 1748571077237
--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-d1m06"
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-5832"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d1m06, 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 r058-smll-174854063500076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m06.tgz
mv DBSingleClientW-PT-d1m06 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 ;