About the Execution of ITS-Tools for DBSingleClientW-PT-d1m09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 1470698.00 | 0.00 | 0.00 | FFFFFFFTFFFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063500100.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-d1m09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063500100
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K 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 4.0K 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-d1m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748590515081
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-d1m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 07:35:17] [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 07:35:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 07:35:18] [INFO ] Load time of PNML (sax parser for PT used): 324 ms
[2025-05-30 07:35:18] [INFO ] Transformed 1440 places.
[2025-05-30 07:35:18] [INFO ] Transformed 672 transitions.
[2025-05-30 07:35:18] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 568 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1093 places in 13 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 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 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 173 place count 254 transition count 455
Iterating global reduction 1 with 72 rules applied. Total rules applied 245 place count 254 transition count 455
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 273 place count 254 transition count 427
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 324 place count 203 transition count 376
Iterating global reduction 2 with 51 rules applied. Total rules applied 375 place count 203 transition count 376
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 377 place count 203 transition count 374
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 400 place count 180 transition count 343
Iterating global reduction 3 with 23 rules applied. Total rules applied 423 place count 180 transition count 343
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 447 place count 180 transition count 319
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 449 place count 178 transition count 314
Iterating global reduction 4 with 2 rules applied. Total rules applied 451 place count 178 transition count 314
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 453 place count 176 transition count 312
Iterating global reduction 4 with 2 rules applied. Total rules applied 455 place count 176 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 456 place count 176 transition count 311
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 457 place count 175 transition count 310
Iterating global reduction 5 with 1 rules applied. Total rules applied 458 place count 175 transition count 310
Applied a total of 458 rules in 196 ms. Remains 175 /347 variables (removed 172) and now considering 310/672 (removed 362) transitions.
// Phase 1: matrix 310 rows 175 cols
[2025-05-30 07:35:18] [INFO ] Computed 2 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:35:19] [INFO ] Implicit Places using invariants in 686 ms returned []
[2025-05-30 07:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:35:19] [INFO ] State equation strengthened by 154 read => feed constraints.
[2025-05-30 07:35:21] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 2354 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2025-05-30 07:35:21] [INFO ] Invariant cache hit.
[2025-05-30 07:35:21] [INFO ] State equation strengthened by 154 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/485 variables, 175/177 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 154/331 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/485 variables, and 331 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/485 variables, 175/177 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 154/331 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 309/640 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/485 variables, and 640 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61054ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 61086ms
Starting structural reductions in LTL mode, iteration 1 : 175/347 places, 310/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63675 ms. Remains : 175/347 places, 310/672 transitions.
Support contains 44 out of 175 places after structural reductions.
[2025-05-30 07:36:22] [INFO ] Flatten gal took : 98 ms
[2025-05-30 07:36:22] [INFO ] Flatten gal took : 53 ms
[2025-05-30 07:36:22] [INFO ] Input system was already deterministic with 310 transitions.
Support contains 41 out of 175 places (down from 44) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (9211 resets) in 4213 ms. (9 steps per ms) remains 27/31 properties
BEST_FIRST walk for 4003 steps (169 resets) in 35 ms. (111 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (182 resets) in 31 ms. (125 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (192 resets) in 40 ms. (97 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (168 resets) in 59 ms. (66 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (197 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (419 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (189 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (379 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (209 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (194 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (179 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (219 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (375 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (394 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (195 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (175 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (192 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (180 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (189 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (195 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (189 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (204 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (179 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (195 resets) in 55 ms. (71 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (172 resets) in 36 ms. (108 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (173 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
[2025-05-30 07:36:24] [INFO ] Invariant cache hit.
[2025-05-30 07:36:24] [INFO ] State equation strengthened by 154 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 58/93 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 38/131 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:36:25] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:36:25] [INFO ] Deduced a trap composed of 59 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 07:36:25] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:36:25] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:36:25] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:36:25] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 254/385 variables, 131/139 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 98/237 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/237 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Problem AtomicPropp23 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 98/483 variables, 43/280 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 55/335 constraints. Problems are: Problem set: 2 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/485 variables, and 335 constraints, problems are : Problem set: 2 solved, 24 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/175 constraints, ReadFeed: 153/154 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 24 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 60/89 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 41/130 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 6/8 constraints. Problems are: Problem set: 2 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:36:29] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 254/384 variables, 130/139 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 98/237 constraints. Problems are: Problem set: 2 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:36:30] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:36:30] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:36:31] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 3/240 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/240 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 99/483 variables, 44/284 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/483 variables, 55/339 constraints. Problems are: Problem set: 2 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/485 variables, and 363 constraints, problems are : Problem set: 2 solved, 24 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 174/175 constraints, ReadFeed: 153/154 constraints, PredecessorRefiner: 24/26 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10137ms problems are : Problem set: 2 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 310/310 transitions.
Graph (complete) has 597 edges and 175 vertex of which 174 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 174 transition count 306
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 12 place count 167 transition count 290
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 167 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 167 transition count 288
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 164 transition count 280
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 164 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 161 transition count 277
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 161 transition count 277
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 159 transition count 275
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 159 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 159 transition count 273
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 158 transition count 272
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 158 transition count 272
Applied a total of 41 rules in 76 ms. Remains 158 /175 variables (removed 17) and now considering 272/310 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 158/175 places, 272/310 transitions.
RANDOM walk for 40000 steps (9177 resets) in 753 ms. (53 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (176 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (170 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (180 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (186 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (183 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (403 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (180 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (399 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (201 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (205 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (181 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (181 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (374 resets) in 43 ms. (90 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (439 resets) in 48 ms. (81 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (174 resets) in 27 ms. (143 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (194 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (171 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (198 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (210 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (199 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (202 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (190 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (183 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (214 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
Finished probabilistic random walk after 179573 steps, run visited all 24 properties in 1250 ms. (steps per millisecond=143 )
Probabilistic random walk after 179573 steps, saw 70903 distinct states, run finished after 1256 ms. (steps per millisecond=142 ) properties seen :24
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 27 stable transitions
Graph (complete) has 656 edges and 175 vertex of which 174 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(X(G(!p0))))) U X(p1)))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 310/310 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 147 transition count 222
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 147 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 147 transition count 219
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 81 place count 125 transition count 190
Iterating global reduction 1 with 22 rules applied. Total rules applied 103 place count 125 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 109 place count 125 transition count 184
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 123 place count 111 transition count 161
Iterating global reduction 2 with 14 rules applied. Total rules applied 137 place count 111 transition count 161
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 143 place count 111 transition count 155
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 151 place count 103 transition count 143
Iterating global reduction 3 with 8 rules applied. Total rules applied 159 place count 103 transition count 143
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 165 place count 103 transition count 137
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 169 place count 99 transition count 133
Iterating global reduction 4 with 4 rules applied. Total rules applied 173 place count 99 transition count 133
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 177 place count 95 transition count 124
Iterating global reduction 4 with 4 rules applied. Total rules applied 181 place count 95 transition count 124
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 182 place count 94 transition count 122
Iterating global reduction 4 with 1 rules applied. Total rules applied 183 place count 94 transition count 122
Applied a total of 183 rules in 37 ms. Remains 94 /175 variables (removed 81) and now considering 122/310 (removed 188) transitions.
// Phase 1: matrix 122 rows 94 cols
[2025-05-30 07:36:36] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:36:37] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-05-30 07:36:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:36:37] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-30 07:36:37] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-05-30 07:36:37] [INFO ] Invariant cache hit.
[2025-05-30 07:36:37] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/216 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 41/137 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/216 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 137 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 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/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/216 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 41/137 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 121/258 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 216/216 variables, and 258 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37281ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 37282ms
Starting structural reductions in LTL mode, iteration 1 : 94/175 places, 122/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37937 ms. Remains : 94/175 places, 122/310 transitions.
Stuttering acceptance computed with spot in 694 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND p0 (NOT p1)), p0, p0, true, p0, p0]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-00
Stuttering criterion allowed to conclude after 46 steps with 10 reset in 4 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-00 finished in 38765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(!p0)) U ((X(X(!p0))&&(p1 U (G(p1)||(p1&&G(!p2)))))||X(X(G(!p0))))))'
Support contains 5 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 310/310 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 149 transition count 227
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 149 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 149 transition count 224
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 75 place count 129 transition count 197
Iterating global reduction 1 with 20 rules applied. Total rules applied 95 place count 129 transition count 197
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 100 place count 129 transition count 192
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 111 place count 118 transition count 174
Iterating global reduction 2 with 11 rules applied. Total rules applied 122 place count 118 transition count 174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 118 transition count 171
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 134 place count 109 transition count 157
Iterating global reduction 3 with 9 rules applied. Total rules applied 143 place count 109 transition count 157
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 109 transition count 152
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 153 place count 104 transition count 147
Iterating global reduction 4 with 5 rules applied. Total rules applied 158 place count 104 transition count 147
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 162 place count 100 transition count 143
Iterating global reduction 4 with 4 rules applied. Total rules applied 166 place count 100 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 167 place count 100 transition count 142
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 168 place count 99 transition count 140
Iterating global reduction 5 with 1 rules applied. Total rules applied 169 place count 99 transition count 140
Applied a total of 169 rules in 24 ms. Remains 99 /175 variables (removed 76) and now considering 140/310 (removed 170) transitions.
// Phase 1: matrix 140 rows 99 cols
[2025-05-30 07:37:15] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:37:15] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-05-30 07:37:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:37:15] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-30 07:37:16] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2025-05-30 07:37:16] [INFO ] Invariant cache hit.
[2025-05-30 07:37:16] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/239 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 56/157 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 157 constraints, problems are : Problem set: 0 solved, 139 unsolved in 8529 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/239 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 56/157 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 139/296 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 239/239 variables, and 296 constraints, problems are : Problem set: 0 solved, 139 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38687ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 38689ms
Starting structural reductions in LTL mode, iteration 1 : 99/175 places, 140/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39302 ms. Remains : 99/175 places, 140/310 transitions.
Stuttering acceptance computed with spot in 779 ms :[p0, p0, p0, (AND p0 (NOT p1) p2), (AND p0 (NOT p1)), (AND p0 p2), (AND p0 p2), (AND p0 (NOT p1) p2), (AND p0 (NOT p1)), true, (AND p2 p0), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), p2, (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-02
Product exploration explored 100000 steps with 29893 reset in 602 ms.
Product exploration explored 100000 steps with 29795 reset in 483 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 346 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 35 factoid took 365 ms. Reduced automaton from 16 states, 68 edges and 3 AP (stutter sensitive) to 16 states, 68 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 614 ms :[p0, p0, p0, (AND p0 (NOT p1) p2), (AND p0 (NOT p1)), (AND p0 p2), (AND p0 p2), (AND p0 (NOT p1) p2), (AND p0 (NOT p1)), true, (AND p2 p0), (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), p2, (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9134 resets) in 1129 ms. (35 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (179 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (189 resets) in 55 ms. (71 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (196 resets) in 50 ms. (78 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (199 resets) in 50 ms. (78 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (193 resets) in 46 ms. (85 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (197 resets) in 43 ms. (90 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (170 resets) in 52 ms. (75 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (176 resets) in 54 ms. (72 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (187 resets) in 52 ms. (75 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (200 resets) in 54 ms. (72 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (187 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (211 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (201 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (200 resets) in 44 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (189 resets) in 44 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (166 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (182 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (182 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (181 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 326708 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :13 out of 19
Probabilistic random walk after 326708 steps, saw 125076 distinct states, run finished after 3004 ms. (steps per millisecond=108 ) properties seen :13
[2025-05-30 07:38:01] [INFO ] Invariant cache hit.
[2025-05-30 07:38:01] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf5 is UNSAT
Problem apf9 is UNSAT
Problem apf12 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/41 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 27/68 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 105/173 variables, 68/70 constraints. Problems are: Problem set: 3 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 21/91 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf11 is UNSAT
Problem apf16 is UNSAT
After SMT solving in domain Real declared 239/239 variables, and 122 constraints, problems are : Problem set: 6 solved, 0 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 21/56 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 175ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (G (OR (NOT p0) (NOT p2) p1)), (G (OR (NOT p0) p2 (NOT p1))), (G (OR (NOT p2) p1)), (G (OR p0 (NOT p2) p1)), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F p1), (F p0), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 41 factoid took 1053 ms. Reduced automaton from 16 states, 68 edges and 3 AP (stutter sensitive) to 11 states, 34 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 503 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), (AND p0 p2), (OR (AND p0 (NOT p1)) (AND p0 p2)), true, (AND p0 p2), p2]
Stuttering acceptance computed with spot in 508 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), (AND p0 p2), (OR (AND p0 (NOT p1)) (AND p0 p2)), true, (AND p0 p2), p2]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 140/140 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2025-05-30 07:38:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:38:03] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-05-30 07:38:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:38:04] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-30 07:38:04] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2025-05-30 07:38:04] [INFO ] Invariant cache hit.
[2025-05-30 07:38:04] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/239 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 56/157 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 157 constraints, problems are : Problem set: 0 solved, 139 unsolved in 7826 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/239 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 56/157 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 139/296 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 239/239 variables, and 296 constraints, problems are : Problem set: 0 solved, 139 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37918ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 37918ms
Finished structural reductions in LTL mode , in 1 iterations and 38552 ms. Remains : 99/99 places, 140/140 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 346 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 223 ms. Reduced automaton from 11 states, 34 edges and 3 AP (stutter sensitive) to 11 states, 34 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 483 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), (AND p0 p2), (OR (AND p0 (NOT p1)) (AND p0 p2)), true, (AND p0 p2), p2]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (9195 resets) in 550 ms. (72 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1936 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1883 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1895 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1886 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1843 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1883 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1874 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1870 resets) in 216 ms. (184 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 41053 steps, run visited all 8 properties in 361 ms. (steps per millisecond=113 )
Probabilistic random walk after 41053 steps, saw 18043 distinct states, run finished after 361 ms. (steps per millisecond=113 ) properties seen :8
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p1) p2))), (F p0), (F (NOT (OR p0 (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F p1)]
Knowledge based reduction with 18 factoid took 825 ms. Reduced automaton from 11 states, 34 edges and 3 AP (stutter sensitive) to 11 states, 34 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 522 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), (AND p0 p2), (OR (AND p0 (NOT p1)) (AND p0 p2)), true, (AND p0 p2), p2]
Stuttering acceptance computed with spot in 529 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), (AND p0 p2), (OR (AND p0 (NOT p1)) (AND p0 p2)), true, (AND p0 p2), p2]
Stuttering acceptance computed with spot in 550 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), (AND p0 p2), (OR (AND p0 (NOT p1)) (AND p0 p2)), true, (AND p0 p2), p2]
Product exploration explored 100000 steps with 29874 reset in 240 ms.
Product exploration explored 100000 steps with 29777 reset in 246 ms.
Applying partial POR strategy [false, true, false, false, false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 527 ms :[p0, p0, p0, (AND p0 p2), p0, (AND p0 p2), (AND p0 p2), (OR (AND p0 (NOT p1)) (AND p0 p2)), true, (AND p0 p2), p2]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 140/140 transitions.
Applied a total of 0 rules in 18 ms. Remains 99 /99 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:38:47] [INFO ] Redundant transitions in 7 ms returned []
Running 139 sub problems to find dead transitions.
[2025-05-30 07:38:47] [INFO ] Invariant cache hit.
[2025-05-30 07:38:47] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/239 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 56/157 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 157 constraints, problems are : Problem set: 0 solved, 139 unsolved in 6875 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/239 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 56/157 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 139/296 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 239/239 variables, and 296 constraints, problems are : Problem set: 0 solved, 139 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36986ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 36987ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37024 ms. Remains : 99/99 places, 140/140 transitions.
Built C files in :
/tmp/ltsmin8103270114254238899
[2025-05-30 07:39:24] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8103270114254238899
Running compilation step : cd /tmp/ltsmin8103270114254238899;'/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 754 ms.
Running link step : cd /tmp/ltsmin8103270114254238899;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin8103270114254238899;'/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/stateBased13398109267178451377.hoa' '--buchi-type=spotba'
LTSmin run took 190 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-02 finished in 130441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||G((p0 U X(p1)))) U (p2 U p3))||X(X(p2))))'
Support contains 6 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 310/310 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 147 transition count 219
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 147 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 147 transition count 216
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 80 place count 126 transition count 188
Iterating global reduction 1 with 21 rules applied. Total rules applied 101 place count 126 transition count 188
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 106 place count 126 transition count 183
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 119 place count 113 transition count 163
Iterating global reduction 2 with 13 rules applied. Total rules applied 132 place count 113 transition count 163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 138 place count 113 transition count 157
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 146 place count 105 transition count 144
Iterating global reduction 3 with 8 rules applied. Total rules applied 154 place count 105 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 157 place count 105 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 162 place count 100 transition count 136
Iterating global reduction 4 with 5 rules applied. Total rules applied 167 place count 100 transition count 136
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 172 place count 95 transition count 126
Iterating global reduction 4 with 5 rules applied. Total rules applied 177 place count 95 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 180 place count 95 transition count 123
Applied a total of 180 rules in 25 ms. Remains 95 /175 variables (removed 80) and now considering 123/310 (removed 187) transitions.
// Phase 1: matrix 123 rows 95 cols
[2025-05-30 07:39:26] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:39:26] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-05-30 07:39:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:39:26] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-05-30 07:39:26] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2025-05-30 07:39:26] [INFO ] Invariant cache hit.
[2025-05-30 07:39:26] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 43/140 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 140 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8144 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 43/140 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 122/262 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 218/218 variables, and 262 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38236ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 38236ms
Starting structural reductions in LTL mode, iteration 1 : 95/175 places, 123/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38834 ms. Remains : 95/175 places, 123/310 transitions.
Stuttering acceptance computed with spot in 1125 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) p0 (NOT p1)), (AND (NOT p3) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-03 finished in 40017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 310/310 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 146 transition count 218
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 146 transition count 218
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 146 transition count 215
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 84 place count 123 transition count 185
Iterating global reduction 1 with 23 rules applied. Total rules applied 107 place count 123 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 111 place count 123 transition count 181
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 125 place count 109 transition count 159
Iterating global reduction 2 with 14 rules applied. Total rules applied 139 place count 109 transition count 159
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 145 place count 109 transition count 153
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 154 place count 100 transition count 139
Iterating global reduction 3 with 9 rules applied. Total rules applied 163 place count 100 transition count 139
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 166 place count 100 transition count 136
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 172 place count 94 transition count 130
Iterating global reduction 4 with 6 rules applied. Total rules applied 178 place count 94 transition count 130
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 184 place count 88 transition count 119
Iterating global reduction 4 with 6 rules applied. Total rules applied 190 place count 88 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 193 place count 88 transition count 116
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 87 transition count 114
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 87 transition count 114
Applied a total of 195 rules in 20 ms. Remains 87 /175 variables (removed 88) and now considering 114/310 (removed 196) transitions.
// Phase 1: matrix 114 rows 87 cols
[2025-05-30 07:40:06] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:40:06] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-05-30 07:40:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:40:06] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 07:40:06] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-05-30 07:40:06] [INFO ] Invariant cache hit.
[2025-05-30 07:40:06] [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, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:40:08] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/201 variables, 87/90 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 39/129 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:40:11] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:40:13] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:40:13] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 132 constraints, problems are : Problem set: 0 solved, 113 unsolved in 12423 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: 113/113 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 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, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/201 variables, 87/93 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 39/132 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 113/245 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 201/201 variables, and 245 constraints, problems are : Problem set: 0 solved, 113 unsolved in 30011 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: 113/113 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42475ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 42476ms
Starting structural reductions in LTL mode, iteration 1 : 87/175 places, 114/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43175 ms. Remains : 87/175 places, 114/310 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-04
Product exploration explored 100000 steps with 22950 reset in 597 ms.
Product exploration explored 100000 steps with 22982 reset in 388 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 298 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 : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 186 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (9168 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 13672 steps (1320 resets) in 25 ms. (525 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 13 factoid took 252 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-04 finished in 44974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 310/310 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 146 transition count 217
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 146 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 146 transition count 214
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 84 place count 123 transition count 184
Iterating global reduction 1 with 23 rules applied. Total rules applied 107 place count 123 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 113 place count 123 transition count 178
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 127 place count 109 transition count 156
Iterating global reduction 2 with 14 rules applied. Total rules applied 141 place count 109 transition count 156
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 146 place count 109 transition count 151
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 156 place count 99 transition count 135
Iterating global reduction 3 with 10 rules applied. Total rules applied 166 place count 99 transition count 135
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 172 place count 99 transition count 129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 177 place count 94 transition count 124
Iterating global reduction 4 with 5 rules applied. Total rules applied 182 place count 94 transition count 124
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 187 place count 89 transition count 114
Iterating global reduction 4 with 5 rules applied. Total rules applied 192 place count 89 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 194 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 195 place count 88 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 196 place count 88 transition count 110
Applied a total of 196 rules in 54 ms. Remains 88 /175 variables (removed 87) and now considering 110/310 (removed 200) transitions.
// Phase 1: matrix 110 rows 88 cols
[2025-05-30 07:40:51] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:40:51] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-05-30 07:40:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:40:51] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-30 07:40:51] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:40:51] [INFO ] Redundant transitions in 5 ms returned []
Running 109 sub problems to find dead transitions.
[2025-05-30 07:40:51] [INFO ] Invariant cache hit.
[2025-05-30 07:40:51] [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 5993 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 25403 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 31457ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 31458ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/175 places, 110/310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32100 ms. Remains : 88/175 places, 110/310 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-05 finished in 32162 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))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 310/310 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 147 transition count 215
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 147 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 58 place count 147 transition count 213
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 81 place count 124 transition count 184
Iterating global reduction 1 with 23 rules applied. Total rules applied 104 place count 124 transition count 184
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 109 place count 124 transition count 179
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 124 place count 109 transition count 155
Iterating global reduction 2 with 15 rules applied. Total rules applied 139 place count 109 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 145 place count 109 transition count 149
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 155 place count 99 transition count 133
Iterating global reduction 3 with 10 rules applied. Total rules applied 165 place count 99 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 169 place count 99 transition count 129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 174 place count 94 transition count 124
Iterating global reduction 4 with 5 rules applied. Total rules applied 179 place count 94 transition count 124
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 183 place count 90 transition count 120
Iterating global reduction 4 with 4 rules applied. Total rules applied 187 place count 90 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 189 place count 90 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 89 transition count 116
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 89 transition count 116
Applied a total of 191 rules in 31 ms. Remains 89 /175 variables (removed 86) and now considering 116/310 (removed 194) transitions.
// Phase 1: matrix 116 rows 89 cols
[2025-05-30 07:41:23] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:41:23] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-30 07:41:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:41:23] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-30 07:41:23] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:41:23] [INFO ] Redundant transitions in 5 ms returned []
Running 115 sub problems to find dead transitions.
[2025-05-30 07:41:23] [INFO ] Invariant cache hit.
[2025-05-30 07:41:23] [INFO ] State equation strengthened by 40 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, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 40/131 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 131 constraints, problems are : Problem set: 0 solved, 115 unsolved in 5879 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 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, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 40/131 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 115/246 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 246 constraints, problems are : Problem set: 0 solved, 115 unsolved in 24633 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30568ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 30570ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/175 places, 116/310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31220 ms. Remains : 89/175 places, 116/310 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), true, p0]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-06
Stuttering criterion allowed to conclude after 15 steps with 3 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-06 finished in 31333 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((X(X(X(F(p1))))||p0))))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 310/310 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 146 transition count 214
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 146 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 146 transition count 211
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 84 place count 123 transition count 182
Iterating global reduction 1 with 23 rules applied. Total rules applied 107 place count 123 transition count 182
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 112 place count 123 transition count 177
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 127 place count 108 transition count 153
Iterating global reduction 2 with 15 rules applied. Total rules applied 142 place count 108 transition count 153
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 148 place count 108 transition count 147
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 158 place count 98 transition count 131
Iterating global reduction 3 with 10 rules applied. Total rules applied 168 place count 98 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 172 place count 98 transition count 127
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 178 place count 92 transition count 121
Iterating global reduction 4 with 6 rules applied. Total rules applied 184 place count 92 transition count 121
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 189 place count 87 transition count 116
Iterating global reduction 4 with 5 rules applied. Total rules applied 194 place count 87 transition count 116
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 197 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 86 transition count 111
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 86 transition count 111
Applied a total of 199 rules in 32 ms. Remains 86 /175 variables (removed 89) and now considering 111/310 (removed 199) transitions.
// Phase 1: matrix 111 rows 86 cols
[2025-05-30 07:41:54] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:41:54] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-05-30 07:41:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:41:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 07:41:55] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:41:55] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2025-05-30 07:41:55] [INFO ] Invariant cache hit.
[2025-05-30 07:41:55] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/197 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 126 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5305 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 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, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/197 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 110/236 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 236 constraints, problems are : Problem set: 0 solved, 110 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35351ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 35351ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/175 places, 111/310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36110 ms. Remains : 86/175 places, 111/310 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-07
Product exploration explored 100000 steps with 22978 reset in 262 ms.
Product exploration explored 100000 steps with 23041 reset in 313 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 294 edges and 86 vertex of which 85 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 159 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9158 resets) in 223 ms. (178 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (3048 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (4043 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3862 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
[2025-05-30 07:42:31] [INFO ] Invariant cache hit.
[2025-05-30 07:42:31] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 31/35 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/58 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:42:31] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 79/137 variables, 58/61 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 6/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 56/193 variables, 26/93 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 30/123 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/197 variables, 2/125 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 2/127 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/197 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/197 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 127 constraints, problems are : Problem set: 1 solved, 2 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/58 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:42:32] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 79/137 variables, 58/62 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 6/68 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 56/193 variables, 26/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 30/124 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 2/126 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 4/197 variables, 2/128 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/197 variables, 2/130 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/197 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/197 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 130 constraints, problems are : Problem set: 1 solved, 2 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1044ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 90 ms.
Support contains 4 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 111/111 transitions.
Graph (complete) has 272 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 85 transition count 109
Applied a total of 3 rules in 11 ms. Remains 85 /86 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 85/86 places, 109/111 transitions.
RANDOM walk for 40000 steps (9302 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4116 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4034 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 14714 steps, run visited all 2 properties in 75 ms. (steps per millisecond=196 )
Probabilistic random walk after 14714 steps, saw 7010 distinct states, run finished after 75 ms. (steps per millisecond=196 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 20 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-07 finished in 38688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (F(p2)&&p1)))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 310/310 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 146 transition count 217
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 146 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 146 transition count 214
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 84 place count 123 transition count 184
Iterating global reduction 1 with 23 rules applied. Total rules applied 107 place count 123 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 113 place count 123 transition count 178
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 127 place count 109 transition count 156
Iterating global reduction 2 with 14 rules applied. Total rules applied 141 place count 109 transition count 156
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 146 place count 109 transition count 151
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 156 place count 99 transition count 135
Iterating global reduction 3 with 10 rules applied. Total rules applied 166 place count 99 transition count 135
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 172 place count 99 transition count 129
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 176 place count 95 transition count 125
Iterating global reduction 4 with 4 rules applied. Total rules applied 180 place count 95 transition count 125
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 184 place count 91 transition count 116
Iterating global reduction 4 with 4 rules applied. Total rules applied 188 place count 91 transition count 116
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 189 place count 90 transition count 114
Iterating global reduction 4 with 1 rules applied. Total rules applied 190 place count 90 transition count 114
Applied a total of 190 rules in 11 ms. Remains 90 /175 variables (removed 85) and now considering 114/310 (removed 196) transitions.
// Phase 1: matrix 114 rows 90 cols
[2025-05-30 07:42:33] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:42:33] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-05-30 07:42:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:42:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-30 07:42:33] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-05-30 07:42:33] [INFO ] Invariant cache hit.
[2025-05-30 07:42:33] [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/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/204 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 36/128 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 128 constraints, problems are : Problem set: 0 solved, 113 unsolved in 7407 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/204 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 36/128 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 113/241 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 241 constraints, problems are : Problem set: 0 solved, 113 unsolved in 18926 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26373ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 26374ms
Starting structural reductions in LTL mode, iteration 1 : 90/175 places, 114/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27010 ms. Remains : 90/175 places, 114/310 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-08 finished in 27196 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(X(X(F(p1))))))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 310/310 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 147 transition count 225
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 147 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 147 transition count 221
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 83 place count 124 transition count 191
Iterating global reduction 1 with 23 rules applied. Total rules applied 106 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 112 place count 124 transition count 185
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 110 transition count 163
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 110 transition count 163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 146 place count 110 transition count 157
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 156 place count 100 transition count 141
Iterating global reduction 3 with 10 rules applied. Total rules applied 166 place count 100 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 172 place count 100 transition count 135
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 177 place count 95 transition count 130
Iterating global reduction 4 with 5 rules applied. Total rules applied 182 place count 95 transition count 130
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 187 place count 90 transition count 120
Iterating global reduction 4 with 5 rules applied. Total rules applied 192 place count 90 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 193 place count 90 transition count 119
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 89 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 89 transition count 117
Applied a total of 195 rules in 13 ms. Remains 89 /175 variables (removed 86) and now considering 117/310 (removed 193) transitions.
// Phase 1: matrix 117 rows 89 cols
[2025-05-30 07:43:00] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:43:00] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-05-30 07:43:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:43:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2025-05-30 07:43:00] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2025-05-30 07:43:00] [INFO ] Invariant cache hit.
[2025-05-30 07:43:00] [INFO ] State equation strengthened by 41 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/206 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/206 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 132 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6900 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
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, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/206 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 116/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 206/206 variables, and 248 constraints, problems are : Problem set: 0 solved, 116 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36976ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 36977ms
Starting structural reductions in LTL mode, iteration 1 : 89/175 places, 117/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37471 ms. Remains : 89/175 places, 117/310 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-09 finished in 37831 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||G(p1)))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 175/175 places, 310/310 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 147 transition count 216
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 147 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 58 place count 147 transition count 214
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 80 place count 125 transition count 185
Iterating global reduction 1 with 22 rules applied. Total rules applied 102 place count 125 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 108 place count 125 transition count 179
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 122 place count 111 transition count 158
Iterating global reduction 2 with 14 rules applied. Total rules applied 136 place count 111 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 142 place count 111 transition count 152
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 151 place count 102 transition count 137
Iterating global reduction 3 with 9 rules applied. Total rules applied 160 place count 102 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 164 place count 102 transition count 133
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 169 place count 97 transition count 128
Iterating global reduction 4 with 5 rules applied. Total rules applied 174 place count 97 transition count 128
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 178 place count 93 transition count 124
Iterating global reduction 4 with 4 rules applied. Total rules applied 182 place count 93 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 185 place count 93 transition count 121
Applied a total of 185 rules in 41 ms. Remains 93 /175 variables (removed 82) and now considering 121/310 (removed 189) transitions.
// Phase 1: matrix 121 rows 93 cols
[2025-05-30 07:43:38] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:43:38] [INFO ] Implicit Places using invariants in 140 ms returned []
[2025-05-30 07:43:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:43:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-30 07:43:38] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:43:38] [INFO ] Redundant transitions in 5 ms returned []
Running 120 sub problems to find dead transitions.
[2025-05-30 07:43:38] [INFO ] Invariant cache hit.
[2025-05-30 07:43:38] [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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:43:43] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/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 07:43:46] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:43:46] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:43:46] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 16 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/214 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 141 constraints, problems are : Problem set: 0 solved, 120 unsolved in 14720 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: 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/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 121/214 variables, 93/99 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 42/141 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 120/261 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/214 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 261 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30007 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: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44798ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 44799ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/175 places, 121/310 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45547 ms. Remains : 93/175 places, 121/310 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-11 finished in 45641 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(F(p0)) U p1)||X(F(p2)))))'
Support contains 3 out of 175 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 310/310 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 148 transition count 220
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 148 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 148 transition count 217
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 79 place count 126 transition count 188
Iterating global reduction 1 with 22 rules applied. Total rules applied 101 place count 126 transition count 188
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 106 place count 126 transition count 183
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 119 place count 113 transition count 161
Iterating global reduction 2 with 13 rules applied. Total rules applied 132 place count 113 transition count 161
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 137 place count 113 transition count 156
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 145 place count 105 transition count 144
Iterating global reduction 3 with 8 rules applied. Total rules applied 153 place count 105 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 156 place count 105 transition count 141
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 162 place count 99 transition count 135
Iterating global reduction 4 with 6 rules applied. Total rules applied 168 place count 99 transition count 135
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 174 place count 93 transition count 124
Iterating global reduction 4 with 6 rules applied. Total rules applied 180 place count 93 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 182 place count 93 transition count 122
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 183 place count 92 transition count 120
Iterating global reduction 5 with 1 rules applied. Total rules applied 184 place count 92 transition count 120
Applied a total of 184 rules in 10 ms. Remains 92 /175 variables (removed 83) and now considering 120/310 (removed 190) transitions.
// Phase 1: matrix 120 rows 92 cols
[2025-05-30 07:44:23] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:44:23] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-30 07:44:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:44:24] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-05-30 07:44:24] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2025-05-30 07:44:24] [INFO ] Invariant cache hit.
[2025-05-30 07:44:24] [INFO ] State equation strengthened by 43 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, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/212 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 43/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 137 constraints, problems are : Problem set: 0 solved, 119 unsolved in 6994 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 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, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/212 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 43/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 119/256 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 256 constraints, problems are : Problem set: 0 solved, 119 unsolved in 22315 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29365ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 29366ms
Starting structural reductions in LTL mode, iteration 1 : 92/175 places, 120/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29833 ms. Remains : 92/175 places, 120/310 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-12 finished in 29937 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(!p1)||p0)))'
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 310/310 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 147 transition count 215
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 147 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 147 transition count 212
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 82 place count 124 transition count 182
Iterating global reduction 1 with 23 rules applied. Total rules applied 105 place count 124 transition count 182
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 111 place count 124 transition count 176
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 125 place count 110 transition count 154
Iterating global reduction 2 with 14 rules applied. Total rules applied 139 place count 110 transition count 154
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 144 place count 110 transition count 149
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 154 place count 100 transition count 133
Iterating global reduction 3 with 10 rules applied. Total rules applied 164 place count 100 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 168 place count 100 transition count 129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 173 place count 95 transition count 124
Iterating global reduction 4 with 5 rules applied. Total rules applied 178 place count 95 transition count 124
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 183 place count 90 transition count 114
Iterating global reduction 4 with 5 rules applied. Total rules applied 188 place count 90 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 189 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 89 transition count 111
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 89 transition count 111
Applied a total of 191 rules in 12 ms. Remains 89 /175 variables (removed 86) and now considering 111/310 (removed 199) transitions.
// Phase 1: matrix 111 rows 89 cols
[2025-05-30 07:44:53] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:44:53] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-05-30 07:44:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:44:54] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-05-30 07:44:54] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2025-05-30 07:44:54] [INFO ] Invariant cache hit.
[2025-05-30 07:44:54] [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/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5476 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 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, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 19145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24687ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 24688ms
Starting structural reductions in LTL mode, iteration 1 : 89/175 places, 111/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25221 ms. Remains : 89/175 places, 111/310 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) p1), p1]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-15
Product exploration explored 100000 steps with 23081 reset in 225 ms.
Product exploration explored 100000 steps with 22901 reset in 320 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 301 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 164 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (9199 resets) in 199 ms. (200 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (1914 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1884 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
[2025-05-30 07:45:20] [INFO ] Invariant cache hit.
[2025-05-30 07:45:20] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/200 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 127 constraints, problems are : Problem set: 0 solved, 2 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 848ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 111/111 transitions.
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 109
Applied a total of 3 rules in 6 ms. Remains 88 /89 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 88/89 places, 109/111 transitions.
RANDOM walk for 40000 steps (9258 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1921 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1885 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18613 steps, run visited all 2 properties in 70 ms. (steps per millisecond=265 )
Probabilistic random walk after 18613 steps, saw 8891 distinct states, run finished after 70 ms. (steps per millisecond=265 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 218 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p0) p1), p1]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 111/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2025-05-30 07:45:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:45:21] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-05-30 07:45:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:45:21] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-05-30 07:45:22] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2025-05-30 07:45:22] [INFO ] Invariant cache hit.
[2025-05-30 07:45:22] [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/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 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, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 20460 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25652ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 25652ms
Finished structural reductions in LTL mode , in 1 iterations and 26125 ms. Remains : 89/89 places, 111/111 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 301 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 147 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (9120 resets) in 215 ms. (185 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (1847 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1894 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
[2025-05-30 07:45:48] [INFO ] Invariant cache hit.
[2025-05-30 07:45:48] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/200 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 127 constraints, problems are : Problem set: 0 solved, 2 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 965ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 119 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 111/111 transitions.
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 109
Applied a total of 3 rules in 6 ms. Remains 88 /89 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 88/89 places, 109/111 transitions.
RANDOM walk for 40000 steps (9174 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1908 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1930 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18613 steps, run visited all 2 properties in 111 ms. (steps per millisecond=167 )
Probabilistic random walk after 18613 steps, saw 8891 distinct states, run finished after 111 ms. (steps per millisecond=167 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 250 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 23018 reset in 289 ms.
Product exploration explored 100000 steps with 22974 reset in 317 ms.
Built C files in :
/tmp/ltsmin232137410812258392
[2025-05-30 07:45:50] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin232137410812258392
Running compilation step : cd /tmp/ltsmin232137410812258392;'/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 478 ms.
Running link step : cd /tmp/ltsmin232137410812258392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin232137410812258392;'/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/stateBased13141002125489991626.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 111/111 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2025-05-30 07:46:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:46:06] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-05-30 07:46:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:46:06] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-05-30 07:46:06] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2025-05-30 07:46:06] [INFO ] Invariant cache hit.
[2025-05-30 07:46:06] [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/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 6044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 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, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 22377 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28486ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 28487ms
Finished structural reductions in LTL mode , in 1 iterations and 28853 ms. Remains : 89/89 places, 111/111 transitions.
Built C files in :
/tmp/ltsmin13490521956571798839
[2025-05-30 07:46:34] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13490521956571798839
Running compilation step : cd /tmp/ltsmin13490521956571798839;'/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 339 ms.
Running link step : cd /tmp/ltsmin13490521956571798839;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13490521956571798839;'/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/stateBased8065474730369939091.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 07:46:49] [INFO ] Flatten gal took : 10 ms
[2025-05-30 07:46:50] [INFO ] Flatten gal took : 10 ms
[2025-05-30 07:46:50] [INFO ] Time to serialize gal into /tmp/LTL5247548129373119192.gal : 3 ms
[2025-05-30 07:46:50] [INFO ] Time to serialize properties into /tmp/LTL10814907245530097401.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5247548129373119192.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14872087315697428876.hoa' '-atoms' '/tmp/LTL10814907245530097401.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10814907245530097401.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14872087315697428876.hoa
Detected timeout of ITS tools.
[2025-05-30 07:47:05] [INFO ] Flatten gal took : 9 ms
[2025-05-30 07:47:05] [INFO ] Flatten gal took : 8 ms
[2025-05-30 07:47:05] [INFO ] Time to serialize gal into /tmp/LTL5557328564593017080.gal : 2 ms
[2025-05-30 07:47:05] [INFO ] Time to serialize properties into /tmp/LTL11059810456394483820.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5557328564593017080.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11059810456394483820.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((s1<1)||(l1293<1))")||(X("((p94<1)||(l0<1))")))))
Formula 0 simplified : F(!"((s1<1)||(l1293<1))" & X!"((p94<1)||(l0<1))")
Detected timeout of ITS tools.
[2025-05-30 07:47:20] [INFO ] Flatten gal took : 8 ms
[2025-05-30 07:47:20] [INFO ] Applying decomposition
[2025-05-30 07:47:20] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7721886581956679854.txt' '-o' '/tmp/graph7721886581956679854.bin' '-w' '/tmp/graph7721886581956679854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7721886581956679854.bin' '-l' '-1' '-v' '-w' '/tmp/graph7721886581956679854.weights' '-q' '0' '-e' '0.001'
[2025-05-30 07:47:20] [INFO ] Decomposing Gal with order
[2025-05-30 07:47:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 07:47:20] [INFO ] Removed a total of 95 redundant transitions.
[2025-05-30 07:47:20] [INFO ] Flatten gal took : 96 ms
[2025-05-30 07:47:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 21 ms.
[2025-05-30 07:47:20] [INFO ] Time to serialize gal into /tmp/LTL4521623983105136632.gal : 7 ms
[2025-05-30 07:47:20] [INFO ] Time to serialize properties into /tmp/LTL10684622177626579091.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4521623983105136632.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10684622177626579091.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("((u1.s1<1)||(i0.u16.l1293<1))")||(X("((i4.u11.p94<1)||(u1.l0<1))")))))
Formula 0 simplified : F(!"((u1.s1<1)||(i0.u16.l1293<1))" & X!"((i4.u11.p94<1)||(u1.l0<1))")
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-15 finished in 161712 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(!p1)||p0)))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m09-LTLFireability-15
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p0) p1), p1]
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 175/175 places, 310/310 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 147 transition count 215
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 147 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 147 transition count 212
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 82 place count 124 transition count 182
Iterating global reduction 1 with 23 rules applied. Total rules applied 105 place count 124 transition count 182
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 111 place count 124 transition count 176
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 125 place count 110 transition count 154
Iterating global reduction 2 with 14 rules applied. Total rules applied 139 place count 110 transition count 154
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 144 place count 110 transition count 149
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 154 place count 100 transition count 133
Iterating global reduction 3 with 10 rules applied. Total rules applied 164 place count 100 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 168 place count 100 transition count 129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 173 place count 95 transition count 124
Iterating global reduction 4 with 5 rules applied. Total rules applied 178 place count 95 transition count 124
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 183 place count 90 transition count 114
Iterating global reduction 4 with 5 rules applied. Total rules applied 188 place count 90 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 189 place count 90 transition count 113
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 89 transition count 111
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 89 transition count 111
Applied a total of 191 rules in 26 ms. Remains 89 /175 variables (removed 86) and now considering 111/310 (removed 199) transitions.
[2025-05-30 07:47:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:47:35] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-05-30 07:47:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:47:36] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-05-30 07:47:36] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2025-05-30 07:47:36] [INFO ] Invariant cache hit.
[2025-05-30 07:47:36] [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/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 6155 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 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, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 22191 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28413ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 28414ms
Starting structural reductions in LI_LTL mode, iteration 1 : 89/175 places, 111/310 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 29028 ms. Remains : 89/175 places, 111/310 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-15
Product exploration explored 100000 steps with 22920 reset in 169 ms.
Product exploration explored 100000 steps with 23013 reset in 182 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 301 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 139 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (9156 resets) in 156 ms. (254 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (1924 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1874 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
[2025-05-30 07:48:05] [INFO ] Invariant cache hit.
[2025-05-30 07:48:05] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/200 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 127 constraints, problems are : Problem set: 0 solved, 2 unsolved in 738 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 992ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 111/111 transitions.
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 109
Applied a total of 3 rules in 7 ms. Remains 88 /89 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 88/89 places, 109/111 transitions.
RANDOM walk for 40000 steps (9185 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1900 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1935 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18613 steps, run visited all 2 properties in 141 ms. (steps per millisecond=132 )
Probabilistic random walk after 18613 steps, saw 8891 distinct states, run finished after 141 ms. (steps per millisecond=132 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 301 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) p1), p1]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 111/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2025-05-30 07:48:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:48:07] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-05-30 07:48:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:48:07] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-05-30 07:48:07] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2025-05-30 07:48:07] [INFO ] Invariant cache hit.
[2025-05-30 07:48:07] [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/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 6179 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 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, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 21025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27257ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 27257ms
Finished structural reductions in LTL mode , in 1 iterations and 27579 ms. Remains : 89/89 places, 111/111 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 301 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (9156 resets) in 128 ms. (310 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (1854 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1898 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
[2025-05-30 07:48:35] [INFO ] Invariant cache hit.
[2025-05-30 07:48:35] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/200 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 127 constraints, problems are : Problem set: 0 solved, 2 unsolved in 758 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1020ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 138 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 111/111 transitions.
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 109
Applied a total of 3 rules in 7 ms. Remains 88 /89 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 88/89 places, 109/111 transitions.
RANDOM walk for 40000 steps (9174 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1917 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1830 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18613 steps, run visited all 2 properties in 152 ms. (steps per millisecond=122 )
Probabilistic random walk after 18613 steps, saw 8891 distinct states, run finished after 152 ms. (steps per millisecond=122 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 284 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 115 ms :[true, (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 22963 reset in 289 ms.
Product exploration explored 100000 steps with 22923 reset in 323 ms.
Built C files in :
/tmp/ltsmin17626350622129231306
[2025-05-30 07:48:38] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17626350622129231306
Running compilation step : cd /tmp/ltsmin17626350622129231306;'/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 485 ms.
Running link step : cd /tmp/ltsmin17626350622129231306;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin17626350622129231306;'/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/stateBased11382842295661773608.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 111/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2025-05-30 07:48:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:48:53] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-05-30 07:48:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:48:53] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-05-30 07:48:53] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2025-05-30 07:48:53] [INFO ] Invariant cache hit.
[2025-05-30 07:48:53] [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/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 6169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 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, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 21596 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27802ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 27803ms
Finished structural reductions in LTL mode , in 1 iterations and 28163 ms. Remains : 89/89 places, 111/111 transitions.
Built C files in :
/tmp/ltsmin15392805101597880894
[2025-05-30 07:49:21] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15392805101597880894
Running compilation step : cd /tmp/ltsmin15392805101597880894;'/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 334 ms.
Running link step : cd /tmp/ltsmin15392805101597880894;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin15392805101597880894;'/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/stateBased17725803025196600612.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 07:49:36] [INFO ] Flatten gal took : 17 ms
[2025-05-30 07:49:36] [INFO ] Flatten gal took : 17 ms
[2025-05-30 07:49:36] [INFO ] Time to serialize gal into /tmp/LTL11832250698250732819.gal : 2 ms
[2025-05-30 07:49:36] [INFO ] Time to serialize properties into /tmp/LTL7478306280148074292.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11832250698250732819.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17044855439590665704.hoa' '-atoms' '/tmp/LTL7478306280148074292.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7478306280148074292.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17044855439590665704.hoa
Detected timeout of ITS tools.
[2025-05-30 07:49:51] [INFO ] Flatten gal took : 9 ms
[2025-05-30 07:49:51] [INFO ] Flatten gal took : 14 ms
[2025-05-30 07:49:51] [INFO ] Time to serialize gal into /tmp/LTL7661940349904708671.gal : 2 ms
[2025-05-30 07:49:51] [INFO ] Time to serialize properties into /tmp/LTL9782612929822041877.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7661940349904708671.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9782612929822041877.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("((s1<1)||(l1293<1))")||(X("((p94<1)||(l0<1))")))))
Formula 0 simplified : F(!"((s1<1)||(l1293<1))" & X!"((p94<1)||(l0<1))")
Detected timeout of ITS tools.
[2025-05-30 07:50:06] [INFO ] Flatten gal took : 10 ms
[2025-05-30 07:50:06] [INFO ] Applying decomposition
[2025-05-30 07:50:06] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13384777589651841969.txt' '-o' '/tmp/graph13384777589651841969.bin' '-w' '/tmp/graph13384777589651841969.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13384777589651841969.bin' '-l' '-1' '-v' '-w' '/tmp/graph13384777589651841969.weights' '-q' '0' '-e' '0.001'
[2025-05-30 07:50:06] [INFO ] Decomposing Gal with order
[2025-05-30 07:50:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 07:50:06] [INFO ] Removed a total of 98 redundant transitions.
[2025-05-30 07:50:06] [INFO ] Flatten gal took : 18 ms
[2025-05-30 07:50:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 6 ms.
[2025-05-30 07:50:06] [INFO ] Time to serialize gal into /tmp/LTL17157276731426326576.gal : 3 ms
[2025-05-30 07:50:06] [INFO ] Time to serialize properties into /tmp/LTL10595433536862151475.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17157276731426326576.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10595433536862151475.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(("((i3.u1.s1<1)||(i7.u15.l1293<1))")||(X("((i5.u11.p94<1)||(i3.u1.l0<1))")))))
Formula 0 simplified : F(!"((i3.u1.s1<1)||(i7.u15.l1293<1))" & X!"((i5.u11.p94<1)||(i3.u1.l0<1))")
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-15 finished in 166393 ms.
[2025-05-30 07:50:21] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin439162587655336005
[2025-05-30 07:50:21] [INFO ] Computing symmetric may disable matrix : 310 transitions.
[2025-05-30 07:50:21] [INFO ] Applying decomposition
[2025-05-30 07:50:21] [INFO ] Flatten gal took : 16 ms
[2025-05-30 07:50:21] [INFO ] Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:50:21] [INFO ] Computing symmetric may enable matrix : 310 transitions.
[2025-05-30 07:50:21] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15594694029933146990.txt' '-o' '/tmp/graph15594694029933146990.bin' '-w' '/tmp/graph15594694029933146990.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15594694029933146990.bin' '-l' '-1' '-v' '-w' '/tmp/graph15594694029933146990.weights' '-q' '0' '-e' '0.001'
[2025-05-30 07:50:21] [INFO ] Decomposing Gal with order
[2025-05-30 07:50:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 07:50:22] [INFO ] Computing Do-Not-Accords matrix : 310 transitions.
[2025-05-30 07:50:22] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:50:22] [INFO ] Built C files in 121ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin439162587655336005
Running compilation step : cd /tmp/ltsmin439162587655336005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
[2025-05-30 07:50:22] [INFO ] Removed a total of 308 redundant transitions.
[2025-05-30 07:50:22] [INFO ] Flatten gal took : 66 ms
[2025-05-30 07:50:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 248 labels/synchronizations in 13 ms.
[2025-05-30 07:50:22] [INFO ] Time to serialize gal into /tmp/LTLFireability17747524154017316475.gal : 5 ms
[2025-05-30 07:50:22] [INFO ] Time to serialize properties into /tmp/LTLFireability10258239352245466943.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17747524154017316475.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10258239352245466943.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(("((i3.u0.s1<1)||(u18.l1293<1))")||(X(!("((i3.u17.p94>=1)&&(i3.u0.l0>=1))"))))))
Formula 0 simplified : F(!"((i3.u0.s1<1)||(u18.l1293<1))" & X"((i3.u17.p94>=1)&&(i3.u0.l0>=1))")
Compilation finished in 1059 ms.
Running link step : cd /tmp/ltsmin439162587655336005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin439162587655336005;'/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' '--ltl' '[]((X(!(LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 562026 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1468211 ms.
BK_STOP 1748591985779
--------------------
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-d1m09"
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-d1m09, 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-174854063500100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m09.tgz
mv DBSingleClientW-PT-d1m09 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;