Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063400060.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-d1m04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063400060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K 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-d1m04-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748567847755

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-d1m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 01:17:29] [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:17:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:17:30] [INFO ] Load time of PNML (sax parser for PT used): 313 ms
[2025-05-30 01:17:30] [INFO ] Transformed 1440 places.
[2025-05-30 01:17:30] [INFO ] Transformed 672 transitions.
[2025-05-30 01:17:30] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 543 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1093 places in 17 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 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 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 181 place count 246 transition count 421
Iterating global reduction 1 with 80 rules applied. Total rules applied 261 place count 246 transition count 421
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 279 place count 246 transition count 403
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 334 place count 191 transition count 348
Iterating global reduction 2 with 55 rules applied. Total rules applied 389 place count 191 transition count 348
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 392 place count 191 transition count 345
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 416 place count 167 transition count 313
Iterating global reduction 3 with 24 rules applied. Total rules applied 440 place count 167 transition count 313
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 464 place count 167 transition count 289
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 467 place count 164 transition count 284
Iterating global reduction 4 with 3 rules applied. Total rules applied 470 place count 164 transition count 284
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 471 place count 163 transition count 283
Iterating global reduction 4 with 1 rules applied. Total rules applied 472 place count 163 transition count 283
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 473 place count 162 transition count 282
Iterating global reduction 4 with 1 rules applied. Total rules applied 474 place count 162 transition count 282
Applied a total of 474 rules in 135 ms. Remains 162 /347 variables (removed 185) and now considering 282/672 (removed 390) transitions.
// Phase 1: matrix 282 rows 162 cols
[2025-05-30 01:17:31] [INFO ] Computed 2 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:17:31] [INFO ] Implicit Places using invariants in 567 ms returned []
[2025-05-30 01:17:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:17:32] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-30 01:17:33] [INFO ] Implicit Places using invariants and state equation in 1628 ms returned []
Implicit Place search using SMT with State Equation took 2251 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-05-30 01:17:33] [INFO ] Invariant cache hit.
[2025-05-30 01:17:33] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 282/444 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 132/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 296 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 282/444 variables, 162/164 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 132/296 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 281/577 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 577 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61093ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 61126ms
Starting structural reductions in LTL mode, iteration 1 : 162/347 places, 282/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63545 ms. Remains : 162/347 places, 282/672 transitions.
Support contains 41 out of 162 places after structural reductions.
[2025-05-30 01:18:35] [INFO ] Flatten gal took : 104 ms
[2025-05-30 01:18:35] [INFO ] Flatten gal took : 55 ms
[2025-05-30 01:18:35] [INFO ] Input system was already deterministic with 282 transitions.
Reduction of identical properties reduced properties to check from 36 to 31
RANDOM walk for 40000 steps (9162 resets) in 4122 ms. (9 steps per ms) remains 27/31 properties
BEST_FIRST walk for 4002 steps (195 resets) in 110 ms. (36 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (199 resets) in 130 ms. (30 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (190 resets) in 27 ms. (143 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (196 resets) in 48 ms. (81 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (188 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (210 resets) in 37 ms. (105 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (195 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (177 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (199 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (187 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (355 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (190 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (437 resets) in 37 ms. (105 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (368 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (403 resets) in 30 ms. (129 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (386 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (181 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (366 resets) in 48 ms. (81 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (191 resets) in 32 ms. (121 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (188 resets) in 32 ms. (121 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (195 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (384 resets) in 29 ms. (133 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (192 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (177 resets) in 43 ms. (90 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (192 resets) in 25 ms. (154 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (800 resets) in 49 ms. (80 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (185 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
[2025-05-30 01:18:37] [INFO ] Invariant cache hit.
[2025-05-30 01:18:37] [INFO ] State equation strengthened by 132 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 51/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 39/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 245/371 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 27 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 95/223 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp35 is UNSAT
At refinement iteration 8 (OVERLAPS) 73/444 variables, 36/259 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 37/296 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/444 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 296 constraints, problems are : Problem set: 1 solved, 26 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 162/162 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 26 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 51/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) 39/124 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:42] [INFO ] Deduced a trap composed of 59 places in 165 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:42] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:43] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:43] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:43] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:43] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:43] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:43] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:18:43] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 9/11 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 240/364 variables, 124/135 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 90/225 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 2/227 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 80/444 variables, 38/265 constraints. Problems are: Problem set: 1 solved, 26 unsolved
SMT process timed out in 10083ms, After SMT, problems are : Problem set: 1 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 282/282 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 161 transition count 277
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 161 transition count 277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 160 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 160 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 159 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 159 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 159 transition count 273
Applied a total of 7 rules in 52 ms. Remains 159 /162 variables (removed 3) and now considering 273/282 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 159/162 places, 273/282 transitions.
RANDOM walk for 40000 steps (9138 resets) in 802 ms. (49 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (209 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (194 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (199 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (188 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (175 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (191 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (186 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (221 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (185 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (185 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (413 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (206 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (408 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (376 resets) in 40 ms. (97 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (386 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (185 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (373 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (194 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (190 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (190 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (373 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (203 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (184 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (184 resets) in 56 ms. (70 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (800 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
Finished probabilistic random walk after 84691 steps, run visited all 25 properties in 780 ms. (steps per millisecond=108 )
Probabilistic random walk after 84691 steps, saw 33507 distinct states, run finished after 788 ms. (steps per millisecond=107 ) properties seen :25
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 23 stable transitions
Graph (complete) has 604 edges and 162 vertex of which 161 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 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((X((p0||X(p0)))&&(G(p0)||p1))))'
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 282/282 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 141 transition count 216
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 141 transition count 216
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 141 transition count 213
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 63 place count 123 transition count 189
Iterating global reduction 1 with 18 rules applied. Total rules applied 81 place count 123 transition count 189
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 123 transition count 183
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 103 place count 107 transition count 155
Iterating global reduction 2 with 16 rules applied. Total rules applied 119 place count 107 transition count 155
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 125 place count 107 transition count 149
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 134 place count 98 transition count 135
Iterating global reduction 3 with 9 rules applied. Total rules applied 143 place count 98 transition count 135
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 148 place count 98 transition count 130
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 154 place count 92 transition count 124
Iterating global reduction 4 with 6 rules applied. Total rules applied 160 place count 92 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 164 place count 92 transition count 120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 167 place count 89 transition count 116
Iterating global reduction 5 with 3 rules applied. Total rules applied 170 place count 89 transition count 116
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 171 place count 88 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 172 place count 88 transition count 110
Applied a total of 172 rules in 35 ms. Remains 88 /162 variables (removed 74) and now considering 110/282 (removed 172) transitions.
// Phase 1: matrix 110 rows 88 cols
[2025-05-30 01:18:49] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:18:49] [INFO ] Implicit Places using invariants in 244 ms returned []
[2025-05-30 01:18:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:18:49] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-30 01:18:49] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2025-05-30 01:18:49] [INFO ] Invariant cache hit.
[2025-05-30 01:18:49] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5747 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 20741 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26587ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 26592ms
Starting structural reductions in LTL mode, iteration 1 : 88/162 places, 110/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27298 ms. Remains : 88/162 places, 110/282 transitions.
Stuttering acceptance computed with spot in 484 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-00 finished in 27905 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((X(X(X(p0)))||(X(X(p2))&&p1))))'
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 282/282 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 142 transition count 219
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 142 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 142 transition count 217
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 125 transition count 194
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 125 transition count 194
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 82 place count 125 transition count 188
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 98 place count 109 transition count 162
Iterating global reduction 2 with 16 rules applied. Total rules applied 114 place count 109 transition count 162
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 122 place count 109 transition count 154
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 131 place count 100 transition count 140
Iterating global reduction 3 with 9 rules applied. Total rules applied 140 place count 100 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 143 place count 100 transition count 137
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 149 place count 94 transition count 131
Iterating global reduction 4 with 6 rules applied. Total rules applied 155 place count 94 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 158 place count 94 transition count 128
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 161 place count 91 transition count 124
Iterating global reduction 5 with 3 rules applied. Total rules applied 164 place count 91 transition count 124
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 165 place count 90 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 90 transition count 118
Applied a total of 166 rules in 34 ms. Remains 90 /162 variables (removed 72) and now considering 118/282 (removed 164) transitions.
// Phase 1: matrix 118 rows 90 cols
[2025-05-30 01:19:17] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:19:17] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-05-30 01:19:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:19:17] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 01:19:17] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2025-05-30 01:19:17] [INFO ] Invariant cache hit.
[2025-05-30 01:19:17] [INFO ] State equation strengthened by 39 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, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 39/131 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:19:21] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:19:23] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:19:24] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:19:25] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:19:25] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:19:25] [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 01:19:25] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 138 constraints, problems are : Problem set: 0 solved, 117 unsolved in 12161 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 118/208 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 39/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 117/255 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 255 constraints, problems are : Problem set: 0 solved, 117 unsolved in 25431 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37645ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 37646ms
Starting structural reductions in LTL mode, iteration 1 : 90/162 places, 118/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38315 ms. Remains : 90/162 places, 118/282 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-01
Product exploration explored 100000 steps with 26938 reset in 849 ms.
Product exploration explored 100000 steps with 26816 reset in 265 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 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 13 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (9117 resets) in 757 ms. (52 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1884 resets) in 384 ms. (103 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1869 resets) in 334 ms. (119 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 16889 steps, run visited all 2 properties in 151 ms. (steps per millisecond=111 )
Probabilistic random walk after 16889 steps, saw 7320 distinct states, run finished after 151 ms. (steps per millisecond=111 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 2 factoid took 231 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 338 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2))]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2025-05-30 01:19:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:19:59] [INFO ] Implicit Places using invariants in 244 ms returned []
[2025-05-30 01:19:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:19:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 01:19:59] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2025-05-30 01:19:59] [INFO ] Invariant cache hit.
[2025-05-30 01:19:59] [INFO ] State equation strengthened by 39 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, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 39/131 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:04] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 18 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:06] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:07] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:07] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:08] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:08] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:08] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 138 constraints, problems are : Problem set: 0 solved, 117 unsolved in 12824 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 118/208 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 39/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 117/255 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 255 constraints, problems are : Problem set: 0 solved, 117 unsolved in 25189 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38087ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 38089ms
Finished structural reductions in LTL mode , in 1 iterations and 38882 ms. Remains : 90/90 places, 118/118 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 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 13 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (9257 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1913 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1912 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 16889 steps, run visited all 2 properties in 68 ms. (steps per millisecond=248 )
Probabilistic random walk after 16889 steps, saw 7320 distinct states, run finished after 68 ms. (steps per millisecond=248 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 309 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 26915 reset in 200 ms.
Product exploration explored 100000 steps with 26873 reset in 210 ms.
Applying partial POR strategy [false, false, false, false, true, true, false]
Stuttering acceptance computed with spot in 292 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2))]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 12 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:20:40] [INFO ] Redundant transitions in 4 ms returned []
Running 117 sub problems to find dead transitions.
[2025-05-30 01:20:40] [INFO ] Invariant cache hit.
[2025-05-30 01:20:40] [INFO ] State equation strengthened by 39 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, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/208 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 39/131 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:44] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:46] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:47] [INFO ] Deduced a trap composed of 11 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 01:20:48] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:48] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:48] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:20:48] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 138 constraints, problems are : Problem set: 0 solved, 117 unsolved in 12573 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 118/208 variables, 90/99 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 39/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 117/255 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 255 constraints, problems are : Problem set: 0 solved, 117 unsolved in 24921 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37564ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 37565ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37592 ms. Remains : 90/90 places, 118/118 transitions.
Built C files in :
/tmp/ltsmin16590911183138147157
[2025-05-30 01:21:18] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16590911183138147157
Running compilation step : cd /tmp/ltsmin16590911183138147157;'/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 829 ms.
Running link step : cd /tmp/ltsmin16590911183138147157;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin16590911183138147157;'/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/stateBased10746898781857028169.hoa' '--buchi-type=spotba'
LTSmin run took 421 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-01 finished in 122558 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 (p1||G(!p0)))||(p2&&X(p2)))))'
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 282/282 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 143 transition count 224
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 143 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 143 transition count 223
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 125 transition count 199
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 125 transition count 199
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 82 place count 125 transition count 192
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 98 place count 109 transition count 163
Iterating global reduction 2 with 16 rules applied. Total rules applied 114 place count 109 transition count 163
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 122 place count 109 transition count 155
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 132 place count 99 transition count 140
Iterating global reduction 3 with 10 rules applied. Total rules applied 142 place count 99 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 145 place count 99 transition count 137
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 152 place count 92 transition count 130
Iterating global reduction 4 with 7 rules applied. Total rules applied 159 place count 92 transition count 130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 164 place count 92 transition count 125
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 167 place count 89 transition count 121
Iterating global reduction 5 with 3 rules applied. Total rules applied 170 place count 89 transition count 121
Applied a total of 170 rules in 56 ms. Remains 89 /162 variables (removed 73) and now considering 121/282 (removed 161) transitions.
// Phase 1: matrix 121 rows 89 cols
[2025-05-30 01:21:19] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:21:19] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-05-30 01:21:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:21:19] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-05-30 01:21:20] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:21:20] [INFO ] Redundant transitions in 5 ms returned []
Running 120 sub problems to find dead transitions.
[2025-05-30 01:21:20] [INFO ] Invariant cache hit.
[2025-05-30 01:21:20] [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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:25] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:25] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:25] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:21:27] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 142 constraints, problems are : Problem set: 0 solved, 120 unsolved in 13302 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: 4/4 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, 4/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/210 variables, 89/95 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 47/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 120/262 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 262 constraints, problems are : Problem set: 0 solved, 120 unsolved in 23742 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: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37117ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 37121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/162 places, 121/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37872 ms. Remains : 89/162 places, 121/282 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-02
Product exploration explored 100000 steps with 23036 reset in 238 ms.
Product exploration explored 100000 steps with 22951 reset in 392 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.3 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (OR (AND p2 (NOT p0)) p1)), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT p0)), (X (OR (AND p2 p1) (AND p2 (NOT p0)))), (X p1), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (OR (AND p2 (NOT p0)) p1))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p0))), (X (X (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 208 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 40000 steps (9136 resets) in 424 ms. (94 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1937 resets) in 332 ms. (120 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1899 resets) in 210 ms. (189 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1961 resets) in 203 ms. (196 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1849 resets) in 188 ms. (211 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1878 resets) in 224 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1930 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1889 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1865 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1852 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
Probably explored full state space saw : 10295 states, properties seen :8
Probabilistic random walk after 24980 steps, saw 10295 distinct states, run finished after 316 ms. (steps per millisecond=79 ) properties seen :8
Explored full state space saw : 10318 states, properties seen :0
Exhaustive walk after 25025 steps, saw 10318 distinct states, run finished after 177 ms. (steps per millisecond=141 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (OR (AND p2 (NOT p0)) p1)), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT p0)), (X (OR (AND p2 p1) (AND p2 (NOT p0)))), (X p1), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (OR (AND p2 (NOT p0)) p1))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p0))), (X (X (OR (AND p2 p1) (AND p2 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (G (OR p0 p2 p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR (AND (NOT p0) p2) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (F p0), (F (NOT p1))]
Knowledge based reduction with 23 factoid took 526 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 121/121 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2025-05-30 01:22:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:22:00] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-05-30 01:22:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:22:01] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-05-30 01:22:01] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:22:01] [INFO ] Redundant transitions in 3 ms returned []
Running 120 sub problems to find dead transitions.
[2025-05-30 01:22:01] [INFO ] Invariant cache hit.
[2025-05-30 01:22:01] [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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:22:05] [INFO ] Deduced a trap composed of 33 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 01:22:05] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:22:06] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:22:08] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 142 constraints, problems are : Problem set: 0 solved, 120 unsolved in 11787 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: 4/4 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, 4/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/210 variables, 89/95 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 47/142 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 120/262 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/210 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 262 constraints, problems are : Problem set: 0 solved, 120 unsolved in 25955 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: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37789ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 37790ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38444 ms. Remains : 89/89 places, 121/121 transitions.
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.4 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p2), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (OR (AND (NOT p0) p2) (AND p2 p1))), (X p1), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p2)), (X (X (OR (NOT p0) p1))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 223 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p2), (AND (NOT p2) p0 (NOT p1))]
RANDOM walk for 40000 steps (9249 resets) in 272 ms. (146 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1869 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1916 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1935 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1911 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1857 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1920 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1875 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
Probably explored full state space saw : 10295 states, properties seen :6
Probabilistic random walk after 24980 steps, saw 10295 distinct states, run finished after 159 ms. (steps per millisecond=157 ) properties seen :6
Explored full state space saw : 10318 states, properties seen :0
Exhaustive walk after 25025 steps, saw 10318 distinct states, run finished after 60 ms. (steps per millisecond=417 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p2), (X (OR (NOT p0) p1)), (X (NOT p0)), (X (OR (AND (NOT p0) p2) (AND p2 p1))), (X p1), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p2)), (X (X (OR (NOT p0) p1))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (X p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p2))]
Knowledge based reduction with 16 factoid took 414 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p2), (AND (NOT p2) p0 (NOT p1))]
Product exploration explored 100000 steps with 22993 reset in 214 ms.
Product exploration explored 100000 steps with 22983 reset in 203 ms.
Built C files in :
/tmp/ltsmin6940827360926122496
[2025-05-30 01:22:41] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2025-05-30 01:22:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:22:41] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2025-05-30 01:22:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:22:41] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2025-05-30 01:22:41] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:22:41] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6940827360926122496
Running compilation step : cd /tmp/ltsmin6940827360926122496;'/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 385 ms.
Running link step : cd /tmp/ltsmin6940827360926122496;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin6940827360926122496;'/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/stateBased17483631667038013510.hoa' '--buchi-type=spotba'
LTSmin run took 592 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-02 finished in 82757 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(p1))))) U (p2||X(p3))))'
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 282/282 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 143 transition count 228
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 143 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 143 transition count 224
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 126 transition count 201
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 126 transition count 201
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 82 place count 126 transition count 195
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 97 place count 111 transition count 169
Iterating global reduction 2 with 15 rules applied. Total rules applied 112 place count 111 transition count 169
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 118 place count 111 transition count 163
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 127 place count 102 transition count 149
Iterating global reduction 3 with 9 rules applied. Total rules applied 136 place count 102 transition count 149
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 143 place count 102 transition count 142
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 149 place count 96 transition count 136
Iterating global reduction 4 with 6 rules applied. Total rules applied 155 place count 96 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 158 place count 96 transition count 133
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 161 place count 93 transition count 129
Iterating global reduction 5 with 3 rules applied. Total rules applied 164 place count 93 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 165 place count 92 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 92 transition count 123
Applied a total of 166 rules in 14 ms. Remains 92 /162 variables (removed 70) and now considering 123/282 (removed 159) transitions.
// Phase 1: matrix 123 rows 92 cols
[2025-05-30 01:22:42] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:22:42] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-05-30 01:22:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:22:42] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-05-30 01:22:42] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2025-05-30 01:22:42] [INFO ] Invariant cache hit.
[2025-05-30 01:22:42] [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/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/215 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 44/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:22:47] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:22:47] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:22:50] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/215 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 141 constraints, problems are : Problem set: 0 solved, 122 unsolved in 12714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 3/3 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/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/215 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 44/141 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 122/263 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/215 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 263 constraints, problems are : Problem set: 0 solved, 122 unsolved in 27292 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40081ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 40081ms
Starting structural reductions in LTL mode, iteration 1 : 92/162 places, 123/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40609 ms. Remains : 92/162 places, 123/282 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-03
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-03 finished in 40857 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((X((F(p2)||p1))&&p0))))'
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 282/282 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 142 transition count 226
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 142 transition count 226
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 142 transition count 222
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 61 place count 125 transition count 199
Iterating global reduction 1 with 17 rules applied. Total rules applied 78 place count 125 transition count 199
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 85 place count 125 transition count 192
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 100 place count 110 transition count 166
Iterating global reduction 2 with 15 rules applied. Total rules applied 115 place count 110 transition count 166
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 123 place count 110 transition count 158
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 131 place count 102 transition count 145
Iterating global reduction 3 with 8 rules applied. Total rules applied 139 place count 102 transition count 145
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 144 place count 102 transition count 140
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 149 place count 97 transition count 135
Iterating global reduction 4 with 5 rules applied. Total rules applied 154 place count 97 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 158 place count 97 transition count 131
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 161 place count 94 transition count 127
Iterating global reduction 5 with 3 rules applied. Total rules applied 164 place count 94 transition count 127
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 165 place count 93 transition count 121
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 93 transition count 121
Applied a total of 166 rules in 13 ms. Remains 93 /162 variables (removed 69) and now considering 121/282 (removed 161) transitions.
// Phase 1: matrix 121 rows 93 cols
[2025-05-30 01:23:23] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:23:23] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-05-30 01:23:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:23:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-30 01:23:23] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2025-05-30 01:23:23] [INFO ] Invariant cache hit.
[2025-05-30 01:23:23] [INFO ] State equation strengthened by 42 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/214 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 42/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/214 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 137 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8602 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 42/42 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/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/214 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 42/137 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 120/257 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 257 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38685ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 38685ms
Starting structural reductions in LTL mode, iteration 1 : 93/162 places, 121/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39259 ms. Remains : 93/162 places, 121/282 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-04 finished in 39517 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(X((X(G(p1))||p0)))&&(p2 U p3))))'
Support contains 7 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 282/282 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 144 transition count 215
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 144 transition count 215
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 144 transition count 213
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 129 transition count 196
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 129 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 71 place count 129 transition count 193
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 86 place count 114 transition count 166
Iterating global reduction 2 with 15 rules applied. Total rules applied 101 place count 114 transition count 166
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 108 place count 114 transition count 159
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 116 place count 106 transition count 146
Iterating global reduction 3 with 8 rules applied. Total rules applied 124 place count 106 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 126 place count 106 transition count 144
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 132 place count 100 transition count 138
Iterating global reduction 4 with 6 rules applied. Total rules applied 138 place count 100 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 142 place count 100 transition count 134
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 145 place count 97 transition count 130
Iterating global reduction 5 with 3 rules applied. Total rules applied 148 place count 97 transition count 130
Applied a total of 148 rules in 17 ms. Remains 97 /162 variables (removed 65) and now considering 130/282 (removed 152) transitions.
// Phase 1: matrix 130 rows 97 cols
[2025-05-30 01:24:02] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:24:02] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-05-30 01:24:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:24:03] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-05-30 01:24:03] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2025-05-30 01:24:03] [INFO ] Invariant cache hit.
[2025-05-30 01:24:03] [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, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/227 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 44/143 constraints. Problems are: Problem set: 0 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 143 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7687 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: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 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, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/227 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 44/143 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 129/272 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 272 constraints, problems are : Problem set: 0 solved, 129 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: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37796ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 37797ms
Starting structural reductions in LTL mode, iteration 1 : 97/162 places, 130/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38290 ms. Remains : 97/162 places, 130/282 transitions.
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-06 finished in 38705 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 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 282/282 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 140 transition count 211
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 140 transition count 211
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 140 transition count 209
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 121 transition count 184
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 121 transition count 184
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 121 transition count 178
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 106 place count 105 transition count 150
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 105 transition count 150
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 place count 105 transition count 144
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 137 place count 96 transition count 130
Iterating global reduction 3 with 9 rules applied. Total rules applied 146 place count 96 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 149 place count 96 transition count 127
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 155 place count 90 transition count 121
Iterating global reduction 4 with 6 rules applied. Total rules applied 161 place count 90 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 165 place count 90 transition count 117
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 168 place count 87 transition count 113
Iterating global reduction 5 with 3 rules applied. Total rules applied 171 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 172 place count 86 transition count 107
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 86 transition count 107
Applied a total of 173 rules in 45 ms. Remains 86 /162 variables (removed 76) and now considering 107/282 (removed 175) transitions.
// Phase 1: matrix 107 rows 86 cols
[2025-05-30 01:24:41] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:24:41] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-05-30 01:24:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:24:41] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-05-30 01:24:41] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:24:41] [INFO ] Redundant transitions in 4 ms returned []
Running 106 sub problems to find dead transitions.
[2025-05-30 01:24:41] [INFO ] Invariant cache hit.
[2025-05-30 01:24:41] [INFO ] State equation strengthened by 33 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, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/193 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 121 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5791 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 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, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/193 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 106/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 227 constraints, problems are : Problem set: 0 solved, 106 unsolved in 19172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25030ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 25031ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/162 places, 107/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25593 ms. Remains : 86/162 places, 107/282 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-07
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-07 finished in 25672 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(p0)))'
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 282/282 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 141 transition count 216
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 141 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 141 transition count 214
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 62 place count 123 transition count 190
Iterating global reduction 1 with 18 rules applied. Total rules applied 80 place count 123 transition count 190
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 123 transition count 185
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 101 place count 107 transition count 156
Iterating global reduction 2 with 16 rules applied. Total rules applied 117 place count 107 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 124 place count 107 transition count 149
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 133 place count 98 transition count 136
Iterating global reduction 3 with 9 rules applied. Total rules applied 142 place count 98 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 98 transition count 134
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 151 place count 91 transition count 127
Iterating global reduction 4 with 7 rules applied. Total rules applied 158 place count 91 transition count 127
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 163 place count 91 transition count 122
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 166 place count 88 transition count 118
Iterating global reduction 5 with 3 rules applied. Total rules applied 169 place count 88 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 170 place count 87 transition count 112
Iterating global reduction 5 with 1 rules applied. Total rules applied 171 place count 87 transition count 112
Applied a total of 171 rules in 22 ms. Remains 87 /162 variables (removed 75) and now considering 112/282 (removed 170) transitions.
// Phase 1: matrix 112 rows 87 cols
[2025-05-30 01:25:07] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:25:07] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-05-30 01:25:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:25:07] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 01:25:07] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:25:07] [INFO ] Redundant transitions in 5 ms returned []
Running 111 sub problems to find dead transitions.
[2025-05-30 01:25:07] [INFO ] Invariant cache hit.
[2025-05-30 01:25:07] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 128 constraints, problems are : Problem set: 0 solved, 111 unsolved in 7308 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 111/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 239 constraints, problems are : Problem set: 0 solved, 111 unsolved in 19622 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26993ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 26993ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/162 places, 112/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27573 ms. Remains : 87/162 places, 112/282 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-08
Product exploration explored 100000 steps with 22942 reset in 197 ms.
Product exploration explored 100000 steps with 22985 reset in 422 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 297 edges and 87 vertex of which 86 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9191 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1934 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14476 steps, run visited all 1 properties in 51 ms. (steps per millisecond=283 )
Probabilistic random walk after 14476 steps, saw 6485 distinct states, run finished after 52 ms. (steps per millisecond=278 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 112/112 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2025-05-30 01:25:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:25:36] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-05-30 01:25:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:25:36] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 01:25:36] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:25:36] [INFO ] Redundant transitions in 1 ms returned []
Running 111 sub problems to find dead transitions.
[2025-05-30 01:25:36] [INFO ] Invariant cache hit.
[2025-05-30 01:25:36] [INFO ] State equation strengthened by 39 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 128 constraints, problems are : Problem set: 0 solved, 111 unsolved in 7049 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 111/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 239 constraints, problems are : Problem set: 0 solved, 111 unsolved in 19044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26161ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 26161ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26634 ms. Remains : 87/87 places, 112/112 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 297 edges and 87 vertex of which 86 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9212 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1915 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14476 steps, run visited all 1 properties in 44 ms. (steps per millisecond=329 )
Probabilistic random walk after 14476 steps, saw 6485 distinct states, run finished after 44 ms. (steps per millisecond=329 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22797 reset in 278 ms.
Product exploration explored 100000 steps with 22970 reset in 306 ms.
Built C files in :
/tmp/ltsmin3738612642237349004
[2025-05-30 01:26:04] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2025-05-30 01:26:04] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:26:04] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2025-05-30 01:26:04] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:26:04] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2025-05-30 01:26:04] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 01:26:04] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3738612642237349004
Running compilation step : cd /tmp/ltsmin3738612642237349004;'/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 585 ms.
Running link step : cd /tmp/ltsmin3738612642237349004;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3738612642237349004;'/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/stateBased16750640593779459203.hoa' '--buchi-type=spotba'
LTSmin run took 522 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-08 finished in 58185 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 p1))))'
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 282/282 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 141 transition count 216
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 141 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 141 transition count 214
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 61 place count 124 transition count 191
Iterating global reduction 1 with 17 rules applied. Total rules applied 78 place count 124 transition count 191
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 84 place count 124 transition count 185
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 98 place count 110 transition count 160
Iterating global reduction 2 with 14 rules applied. Total rules applied 112 place count 110 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 119 place count 110 transition count 153
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 127 place count 102 transition count 143
Iterating global reduction 3 with 8 rules applied. Total rules applied 135 place count 102 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 138 place count 102 transition count 140
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 143 place count 97 transition count 135
Iterating global reduction 4 with 5 rules applied. Total rules applied 148 place count 97 transition count 135
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 153 place count 97 transition count 130
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 96 transition count 128
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 96 transition count 128
Applied a total of 155 rules in 39 ms. Remains 96 /162 variables (removed 66) and now considering 128/282 (removed 154) transitions.
// Phase 1: matrix 128 rows 96 cols
[2025-05-30 01:26:05] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:26:05] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-05-30 01:26:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:26:05] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 01:26:06] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:26:06] [INFO ] Redundant transitions in 1 ms returned []
Running 127 sub problems to find dead transitions.
[2025-05-30 01:26:06] [INFO ] Invariant cache hit.
[2025-05-30 01:26:06] [INFO ] State equation strengthened by 45 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, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/224 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 45/143 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:26:12] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:26:12] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 17 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/224 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:26:14] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:26:14] [INFO ] Deduced a trap composed of 39 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 01:26:14] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (OVERLAPS) 0/224 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 148 constraints, problems are : Problem set: 0 solved, 127 unsolved in 13717 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 128/224 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 45/148 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 127/275 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/224 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 275 constraints, problems are : Problem set: 0 solved, 127 unsolved in 27429 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41221ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 41222ms
Starting structural reductions in SI_LTL mode, iteration 1 : 96/162 places, 128/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41986 ms. Remains : 96/162 places, 128/282 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-09 finished in 42124 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(X((p0 U X(p1)))) U G(!(F(X(p1))&&p2))))'
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 282/282 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 143 transition count 218
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 143 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 143 transition count 216
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 56 place count 127 transition count 196
Iterating global reduction 1 with 16 rules applied. Total rules applied 72 place count 127 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 76 place count 127 transition count 192
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 90 place count 113 transition count 168
Iterating global reduction 2 with 14 rules applied. Total rules applied 104 place count 113 transition count 168
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 111 place count 113 transition count 161
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 118 place count 106 transition count 150
Iterating global reduction 3 with 7 rules applied. Total rules applied 125 place count 106 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 127 place count 106 transition count 148
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 132 place count 101 transition count 143
Iterating global reduction 4 with 5 rules applied. Total rules applied 137 place count 101 transition count 143
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 142 place count 101 transition count 138
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 143 place count 100 transition count 137
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 100 transition count 137
Applied a total of 144 rules in 16 ms. Remains 100 /162 variables (removed 62) and now considering 137/282 (removed 145) transitions.
// Phase 1: matrix 137 rows 100 cols
[2025-05-30 01:26:47] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:26:47] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-05-30 01:26:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:26:47] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-05-30 01:26:48] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2025-05-30 01:26:48] [INFO ] Invariant cache hit.
[2025-05-30 01:26:48] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/237 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 50/152 constraints. Problems are: Problem set: 0 solved, 136 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 152 constraints, problems are : Problem set: 0 solved, 136 unsolved in 9354 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/237 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 50/152 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 136/288 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/237 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 288 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39464ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 39465ms
Starting structural reductions in LTL mode, iteration 1 : 100/162 places, 137/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40162 ms. Remains : 100/162 places, 137/282 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (AND p1 (NOT p2)), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), false]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-10
Stuttering criterion allowed to conclude after 18 steps with 4 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-10 finished in 40531 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)&&F((G(p1)&&X(X(F(!p2))))))))'
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 282/282 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 143 transition count 220
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 143 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 143 transition count 218
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 57 place count 126 transition count 195
Iterating global reduction 1 with 17 rules applied. Total rules applied 74 place count 126 transition count 195
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 80 place count 126 transition count 189
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 95 place count 111 transition count 162
Iterating global reduction 2 with 15 rules applied. Total rules applied 110 place count 111 transition count 162
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 116 place count 111 transition count 156
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 126 place count 101 transition count 141
Iterating global reduction 3 with 10 rules applied. Total rules applied 136 place count 101 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 139 place count 101 transition count 138
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 146 place count 94 transition count 131
Iterating global reduction 4 with 7 rules applied. Total rules applied 153 place count 94 transition count 131
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 158 place count 94 transition count 126
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 161 place count 91 transition count 122
Iterating global reduction 5 with 3 rules applied. Total rules applied 164 place count 91 transition count 122
Applied a total of 164 rules in 9 ms. Remains 91 /162 variables (removed 71) and now considering 122/282 (removed 160) transitions.
// Phase 1: matrix 122 rows 91 cols
[2025-05-30 01:27:27] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:27:28] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-05-30 01:27:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:27:28] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-05-30 01:27:28] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-05-30 01:27:28] [INFO ] Invariant cache hit.
[2025-05-30 01:27:28] [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/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/213 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 47/140 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:27:32] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:27:32] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:27:34] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:27:36] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:27:36] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 16 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 121 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 145 constraints, problems are : Problem set: 0 solved, 121 unsolved in 12318 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/213 variables, 91/98 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 47/145 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 121/266 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 266 constraints, problems are : Problem set: 0 solved, 121 unsolved in 23849 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36271ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 36275ms
Starting structural reductions in LTL mode, iteration 1 : 91/162 places, 122/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36806 ms. Remains : 91/162 places, 122/282 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0) p2), (NOT p0), (OR (NOT p1) p2), (NOT p1), p2, p2]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-11 finished in 37165 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((F(p1)&&F(p2)))||p0)))'
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 282/282 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 140 transition count 211
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 140 transition count 211
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 140 transition count 209
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 121 transition count 184
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 121 transition count 184
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 121 transition count 178
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 106 place count 105 transition count 150
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 105 transition count 150
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 129 place count 105 transition count 143
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 138 place count 96 transition count 130
Iterating global reduction 3 with 9 rules applied. Total rules applied 147 place count 96 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 149 place count 96 transition count 128
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 156 place count 89 transition count 121
Iterating global reduction 4 with 7 rules applied. Total rules applied 163 place count 89 transition count 121
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 168 place count 89 transition count 116
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 171 place count 86 transition count 112
Iterating global reduction 5 with 3 rules applied. Total rules applied 174 place count 86 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 175 place count 85 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 85 transition count 106
Applied a total of 176 rules in 10 ms. Remains 85 /162 variables (removed 77) and now considering 106/282 (removed 176) transitions.
// Phase 1: matrix 106 rows 85 cols
[2025-05-30 01:28:05] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:28:05] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-05-30 01:28:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:28:05] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-05-30 01:28:05] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-05-30 01:28:05] [INFO ] Invariant cache hit.
[2025-05-30 01:28:05] [INFO ] State equation strengthened by 34 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, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/191 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 34/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 121 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5404 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 34/34 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/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/191 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 34/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 105/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 226 constraints, problems are : Problem set: 0 solved, 105 unsolved in 22225 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27684ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 27690ms
Starting structural reductions in LTL mode, iteration 1 : 85/162 places, 106/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28224 ms. Remains : 85/162 places, 106/282 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 344 ms.
Product exploration explored 100000 steps with 50000 reset in 356 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 288 edges and 85 vertex of which 84 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 p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 15 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-12 finished in 29200 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(X((p0 U ((p1 U G(p0))&&G(p1)))))))'
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 282/282 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 141 transition count 213
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 141 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 141 transition count 212
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 122 transition count 187
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 122 transition count 187
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 87 place count 122 transition count 181
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 103 place count 106 transition count 153
Iterating global reduction 2 with 16 rules applied. Total rules applied 119 place count 106 transition count 153
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 126 place count 106 transition count 146
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 136 place count 96 transition count 131
Iterating global reduction 3 with 10 rules applied. Total rules applied 146 place count 96 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 149 place count 96 transition count 128
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 156 place count 89 transition count 121
Iterating global reduction 4 with 7 rules applied. Total rules applied 163 place count 89 transition count 121
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 168 place count 89 transition count 116
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 171 place count 86 transition count 112
Iterating global reduction 5 with 3 rules applied. Total rules applied 174 place count 86 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 175 place count 85 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 85 transition count 106
Applied a total of 176 rules in 13 ms. Remains 85 /162 variables (removed 77) and now considering 106/282 (removed 176) transitions.
// Phase 1: matrix 106 rows 85 cols
[2025-05-30 01:28:34] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:28:34] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-05-30 01:28:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:28:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-30 01:28:34] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2025-05-30 01:28:34] [INFO ] Invariant cache hit.
[2025-05-30 01:28:34] [INFO ] State equation strengthened by 36 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, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/191 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/123 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 123 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4993 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 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/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/191 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/123 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 105/228 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 228 constraints, problems are : Problem set: 0 solved, 105 unsolved in 20364 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25415ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 25415ms
Starting structural reductions in LTL mode, iteration 1 : 85/162 places, 106/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25990 ms. Remains : 85/162 places, 106/282 transitions.
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (AND p0 (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-13 finished in 26336 ms.
All properties solved by simple procedures.
Total runtime 690612 ms.

BK_STOP 1748568540657

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

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

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