Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M 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-d2m04-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748604801164

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-d2m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 11:33:23] [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 11:33:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:33:24] [INFO ] Load time of PNML (sax parser for PT used): 608 ms
[2025-05-30 11:33:24] [INFO ] Transformed 4763 places.
[2025-05-30 11:33:24] [INFO ] Transformed 2478 transitions.
[2025-05-30 11:33:24] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 860 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3580 places in 24 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 372 places :
Symmetric choice reduction at 1 with 372 rule applications. Total rules 617 place count 765 transition count 1440
Iterating global reduction 1 with 372 rules applied. Total rules applied 989 place count 765 transition count 1440
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 1034 place count 765 transition count 1395
Discarding 299 places :
Symmetric choice reduction at 2 with 299 rule applications. Total rules 1333 place count 466 transition count 1096
Iterating global reduction 2 with 299 rules applied. Total rules applied 1632 place count 466 transition count 1096
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1638 place count 466 transition count 1090
Discarding 220 places :
Symmetric choice reduction at 3 with 220 rule applications. Total rules 1858 place count 246 transition count 790
Iterating global reduction 3 with 220 rules applied. Total rules applied 2078 place count 246 transition count 790
Ensure Unique test removed 283 transitions
Reduce isomorphic transitions removed 283 transitions.
Iterating post reduction 3 with 283 rules applied. Total rules applied 2361 place count 246 transition count 507
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 2379 place count 228 transition count 476
Iterating global reduction 4 with 18 rules applied. Total rules applied 2397 place count 228 transition count 476
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2407 place count 228 transition count 466
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 2418 place count 217 transition count 455
Iterating global reduction 5 with 11 rules applied. Total rules applied 2429 place count 217 transition count 455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2430 place count 217 transition count 454
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 2440 place count 207 transition count 444
Iterating global reduction 6 with 10 rules applied. Total rules applied 2450 place count 207 transition count 444
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2462 place count 207 transition count 432
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2463 place count 206 transition count 430
Iterating global reduction 7 with 1 rules applied. Total rules applied 2464 place count 206 transition count 430
Applied a total of 2464 rules in 418 ms. Remains 206 /1183 variables (removed 977) and now considering 430/2478 (removed 2048) transitions.
// Phase 1: matrix 430 rows 206 cols
[2025-05-30 11:33:25] [INFO ] Computed 2 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:33:26] [INFO ] Implicit Places using invariants in 861 ms returned []
[2025-05-30 11:33:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:33:26] [INFO ] State equation strengthened by 226 read => feed constraints.
[2025-05-30 11:33:28] [INFO ] Implicit Places using invariants and state equation in 2586 ms returned []
Implicit Place search using SMT with State Equation took 3515 ms to find 0 implicit places.
Running 429 sub problems to find dead transitions.
[2025-05-30 11:33:29] [INFO ] Invariant cache hit.
[2025-05-30 11:33:29] [INFO ] State equation strengthened by 226 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 430/636 variables, 206/208 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/636 variables, 226/434 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/636 variables, and 434 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 430/636 variables, 206/208 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/636 variables, 226/434 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/636 variables, 429/863 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 636/636 variables, and 863 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61539ms problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 61569ms
Starting structural reductions in LTL mode, iteration 1 : 206/1183 places, 430/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65540 ms. Remains : 206/1183 places, 430/2478 transitions.
Support contains 33 out of 206 places after structural reductions.
[2025-05-30 11:34:31] [INFO ] Flatten gal took : 127 ms
[2025-05-30 11:34:31] [INFO ] Flatten gal took : 77 ms
[2025-05-30 11:34:31] [INFO ] Input system was already deterministic with 430 transitions.
Reduction of identical properties reduced properties to check from 32 to 29
RANDOM walk for 40000 steps (9251 resets) in 3613 ms. (11 steps per ms) remains 23/29 properties
BEST_FIRST walk for 4004 steps (157 resets) in 95 ms. (41 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (179 resets) in 89 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (402 resets) in 93 ms. (42 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (162 resets) in 65 ms. (60 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (171 resets) in 47 ms. (83 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (184 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (186 resets) in 73 ms. (54 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (354 resets) in 49 ms. (80 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (199 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (190 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (185 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (192 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (174 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (182 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (168 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (171 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (172 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (187 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (164 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (191 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (183 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (176 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (368 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
[2025-05-30 11:34:32] [INFO ] Invariant cache hit.
[2025-05-30 11:34:32] [INFO ] State equation strengthened by 226 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 72/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 46/145 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:33] [INFO ] Deduced a trap composed of 74 places in 154 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:33] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:33] [INFO ] Deduced a trap composed of 76 places in 172 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:34] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 331/476 variables, 145/151 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 127/278 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 160/636 variables, 61/339 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/636 variables, 99/438 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/636 variables, and 438 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 72/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 46/145 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:38] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:38] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:38] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:38] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:38] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 331/476 variables, 145/156 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 127/283 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:39] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:39] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:40] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:40] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:40] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 5/288 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 160/636 variables, 61/349 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/636 variables, 99/448 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 636/636 variables, and 471 constraints, problems are : Problem set: 0 solved, 23 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10194ms problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 430/430 transitions.
Graph (complete) has 773 edges and 206 vertex of which 205 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 205 transition count 423
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 13 place count 200 transition count 406
Iterating global reduction 1 with 5 rules applied. Total rules applied 18 place count 200 transition count 406
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 23 place count 200 transition count 401
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 26 place count 197 transition count 394
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 197 transition count 394
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 197 transition count 392
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 33 place count 195 transition count 389
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 195 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 195 transition count 388
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 37 place count 194 transition count 387
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 194 transition count 387
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 43 place count 194 transition count 382
Applied a total of 43 rules in 91 ms. Remains 194 /206 variables (removed 12) and now considering 382/430 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 194/206 places, 382/430 transitions.
RANDOM walk for 40000 steps (9208 resets) in 619 ms. (64 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (188 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (167 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (381 resets) in 41 ms. (95 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (177 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (192 resets) in 44 ms. (88 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (162 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (179 resets) in 75 ms. (52 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (367 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (197 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (176 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (181 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (195 resets) in 35 ms. (111 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (166 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (180 resets) in 34 ms. (114 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (177 resets) in 43 ms. (90 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (186 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (173 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (173 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (154 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (189 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (195 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (192 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (391 resets) in 41 ms. (95 steps per ms) remains 23/23 properties
Finished probabilistic random walk after 141137 steps, run visited all 23 properties in 1387 ms. (steps per millisecond=101 )
Probabilistic random walk after 141137 steps, saw 55395 distinct states, run finished after 1393 ms. (steps per millisecond=101 ) properties seen :23
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 34 stable transitions
Graph (complete) has 840 edges and 206 vertex of which 205 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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(F((F(G(p1))&&p0)))))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 430/430 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 180 transition count 323
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 180 transition count 323
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 58 place count 180 transition count 317
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 159 transition count 279
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 159 transition count 279
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 108 place count 159 transition count 271
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 125 place count 142 transition count 244
Iterating global reduction 2 with 17 rules applied. Total rules applied 142 place count 142 transition count 244
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 153 place count 142 transition count 233
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 165 place count 130 transition count 194
Iterating global reduction 3 with 12 rules applied. Total rules applied 177 place count 130 transition count 194
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 183 place count 130 transition count 188
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 187 place count 126 transition count 184
Iterating global reduction 4 with 4 rules applied. Total rules applied 191 place count 126 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 195 place count 126 transition count 180
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 125 transition count 179
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 125 transition count 179
Applied a total of 197 rules in 19 ms. Remains 125 /206 variables (removed 81) and now considering 179/430 (removed 251) transitions.
// Phase 1: matrix 179 rows 125 cols
[2025-05-30 11:34:45] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:34:45] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-05-30 11:34:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:34:45] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-30 11:34:46] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2025-05-30 11:34:46] [INFO ] Invariant cache hit.
[2025-05-30 11:34:46] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/304 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 60/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:54] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:54] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:55] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:34:55] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 191 constraints, problems are : Problem set: 0 solved, 178 unsolved in 22864 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 179/304 variables, 125/131 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 60/191 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 178/369 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 369 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53075ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 53078ms
Starting structural reductions in LTL mode, iteration 1 : 125/206 places, 179/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53890 ms. Remains : 125/206 places, 179/430 transitions.
Stuttering acceptance computed with spot in 462 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-00 finished in 54442 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&&G(!p1)) U (G((!p0&&G(!p1)))||(G(!p1)&&p2))))) U (G(X(X(((!p0&&G(!p1)) U ((G(!p1)&&p3)||G((!p0&&G(!p1))))))))||(!p4&&X(X(((!p0&&G(!p1)) U ((G(!p1)&&p5)||G((!p0&&G(!p1)))))))))))'
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 430/430 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 183 transition count 338
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 183 transition count 338
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 183 transition count 333
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 69 place count 165 transition count 302
Iterating global reduction 1 with 18 rules applied. Total rules applied 87 place count 165 transition count 302
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 95 place count 165 transition count 294
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 109 place count 151 transition count 272
Iterating global reduction 2 with 14 rules applied. Total rules applied 123 place count 151 transition count 272
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 133 place count 151 transition count 262
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 142 place count 142 transition count 226
Iterating global reduction 3 with 9 rules applied. Total rules applied 151 place count 142 transition count 226
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 163 place count 142 transition count 214
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 165 place count 140 transition count 212
Iterating global reduction 4 with 2 rules applied. Total rules applied 167 place count 140 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 168 place count 140 transition count 211
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 169 place count 139 transition count 210
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 139 transition count 210
Applied a total of 170 rules in 23 ms. Remains 139 /206 variables (removed 67) and now considering 210/430 (removed 220) transitions.
// Phase 1: matrix 210 rows 139 cols
[2025-05-30 11:35:40] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:35:40] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-05-30 11:35:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:35:40] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-30 11:35:41] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2025-05-30 11:35:41] [INFO ] Invariant cache hit.
[2025-05-30 11:35:41] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/349 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 71/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 0/349 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 212 constraints, problems are : Problem set: 0 solved, 209 unsolved in 18081 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/349 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 71/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 209/421 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/349 variables, and 421 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48275ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 48276ms
Starting structural reductions in LTL mode, iteration 1 : 139/206 places, 210/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49419 ms. Remains : 139/206 places, 210/430 transitions.
Stuttering acceptance computed with spot in 3224 ms :[(OR p1 (AND p0 (NOT p3) (NOT p5)) (AND p0 (NOT p3) p4)), (OR p1 (AND p0 (NOT p3) (NOT p5))), (OR p1 (AND p0 (NOT p3) (NOT p5)) (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p3) p4)), (OR p1 (AND p0 (NOT p2) (NOT p3) (NOT p5))), (OR p1 (AND p0 (NOT p3) (NOT p5))), (OR p1 (AND p0 (NOT p3) (NOT p5))), (OR p1 (AND p0 (NOT p2) (NOT p3))), (OR p1 (AND p0 (NOT p3) (NOT p5))), (OR p1 (AND p0 (NOT p3) (NOT p5)) (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p3) p4)), true, p1, (OR p1 (AND p0 (NOT p3))), (OR p1 (AND p0 (NOT p2) (NOT p3) (NOT p5))), p1, (OR p1 (AND p0 (NOT p2) (NOT p3) (NOT p5))), p1, (OR p1 (AND p0 (NOT p3) (NOT p5))), p1, (OR p1 (AND p0 (NOT p2) (NOT p3) (NOT p5))), p1, (OR p1 (AND p0 (NOT p3) (NOT p5))), p1, p1, (OR p1 (AND p0 (NOT p2) (NOT p3))), (OR p1 (AND p0 (NOT p2) (NOT p3) (NOT p5))), (OR p1 (AND p0 (NOT p3) (NOT p5))), (OR p1 (AND p0 (NOT p2) (NOT p3))), (OR p1 (AND p0 (NOT p3) (NOT p5)) (AND p0 (NOT p3) p4))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-01
Product exploration explored 100000 steps with 23001 reset in 970 ms.
Product exploration explored 100000 steps with 23011 reset in 421 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 510 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p4) (NOT p1) (NOT p0) p2 p5 p3), (X (NOT p4)), (X (X p2)), (X (X p3)), (X (X (NOT p4))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p5) p4)))), (X (X p5)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p5) p4)))), (X (X (AND (NOT p1) p5))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p5) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p5))))), (X (X (AND (NOT p1) (NOT p0) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (OR p1 (AND p0 (NOT p2) (NOT p3) (NOT p5)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p4)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3 (NOT p5))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p5)))), (X (X (NOT (OR p1 (AND p0 (NOT p5)))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p5))))), (X (X (NOT (OR (AND (NOT p1) p0 p3 (NOT p4)) (AND (NOT p1) p0 p5 (NOT p4)))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p5) p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p5) (NOT p4))))), (X (X (NOT (OR p1 (NOT p5))))), (X (X (NOT (OR (AND p1 p4) (AND p0 (NOT p3) (NOT p5) p4))))), (X (X (NOT (AND (NOT p1) p0 p3 p4)))), (X (X (NOT (OR (AND p1 (NOT p4)) (AND p0 (NOT p3) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p4) (AND (NOT p1) p3 p4))))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (NOT (OR (AND p1 (NOT p4)) (AND p0 (NOT p3) (NOT p5) (NOT p4)))))), (X (X (OR (AND (NOT p1) (NOT p0) (NOT p4)) (AND (NOT p1) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 p4) (AND p0 (NOT p3) p4))))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p5) (NOT p4))))), (X (X (NOT (OR p1 (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p1) p0 p3 p4) (AND (NOT p1) p0 p5 p4))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 40 factoid took 1167 ms. Reduced automaton from 28 states, 174 edges and 6 AP (stutter sensitive) to 27 states, 169 edges and 6 AP (stutter sensitive).
Stuttering acceptance computed with spot in 2682 ms :[(OR p1 (AND p0 (NOT p3) (NOT p5))), (OR p1 (AND p0 (NOT p3) (NOT p5))), (OR p1 (AND p0 (NOT p2) (NOT p3) (NOT p5))), (OR p1 (AND p0 (NOT p3) (NOT p5))), (OR p1 (AND p0 (NOT p3) (NOT p5))), (OR p1 (AND p0 (NOT p2) (NOT p3))), (OR p1 (AND p0 (NOT p3) (NOT p5))), (OR p1 (AND p0 (NOT p3) (NOT p5)) (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p3) p4)), true, p1, (OR p1 (AND p0 (NOT p3))), (OR p1 (AND p0 (NOT p2) (NOT p3) (NOT p5))), p1, (OR p1 (AND p0 (NOT p2) (NOT p3) (NOT p5))), p1, (OR p1 (AND p0 (NOT p3) (NOT p5))), p1, (OR p1 (AND p0 (NOT p2) (NOT p3) (NOT p5))), p1, (OR p1 (AND p0 (NOT p3) (NOT p5))), p1, p1, (OR p1 (AND p0 (NOT p2) (NOT p3))), (OR p1 (AND p0 (NOT p2) (NOT p3) (NOT p5))), (OR p1 (AND p0 (NOT p3) (NOT p5))), (OR p1 (AND p0 (NOT p2) (NOT p3))), (OR p1 (AND p0 (NOT p3) (NOT p5)) (AND p0 (NOT p3) p4))]
Reduction of identical properties reduced properties to check from 59 to 37
RANDOM walk for 40000 steps (9200 resets) in 2459 ms. (16 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (178 resets) in 62 ms. (63 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (185 resets) in 38 ms. (102 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (163 resets) in 84 ms. (47 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (177 resets) in 72 ms. (54 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (182 resets) in 72 ms. (54 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (173 resets) in 65 ms. (60 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (170 resets) in 65 ms. (60 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (389 resets) in 59 ms. (66 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (194 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (186 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (166 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (195 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (174 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (185 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (197 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (185 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (190 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (179 resets) in 38 ms. (102 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (177 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (188 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (384 resets) in 46 ms. (85 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (194 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (160 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (368 resets) in 47 ms. (83 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (190 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (179 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (186 resets) in 38 ms. (102 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (178 resets) in 45 ms. (87 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (172 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (166 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (376 resets) in 43 ms. (90 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (164 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (194 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (173 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (165 resets) in 39 ms. (100 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (174 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (385 resets) in 71 ms. (55 steps per ms) remains 37/37 properties
Probably explored full state space saw : 39746 states, properties seen :25
Probabilistic random walk after 97997 steps, saw 39746 distinct states, run finished after 1909 ms. (steps per millisecond=51 ) properties seen :25
Explored full state space saw : 39825 states, properties seen :0
Exhaustive walk after 98127 steps, saw 39825 distinct states, run finished after 1506 ms. (steps per millisecond=65 ) properties seen :0
Found 15 invariant AP formulas.
Knowledge obtained : [(AND (NOT p4) (NOT p1) (NOT p0) p2 p5 p3), (X (NOT p4)), (X (X p2)), (X (X p3)), (X (X (NOT p4))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p5) p4)))), (X (X p5)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p5) p4)))), (X (X (AND (NOT p1) p5))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p5) (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2) (NOT p5))))), (X (X (AND (NOT p1) (NOT p0) (NOT p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (OR p1 (AND p0 (NOT p2) (NOT p3) (NOT p5)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p4)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3 (NOT p5))))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p5)))), (X (X (NOT (OR p1 (AND p0 (NOT p5)))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p5))))), (X (X (NOT (OR (AND (NOT p1) p0 p3 (NOT p4)) (AND (NOT p1) p0 p5 (NOT p4)))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p5) p4)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p5) (NOT p4))))), (X (X (NOT (OR p1 (NOT p5))))), (X (X (NOT (OR (AND p1 p4) (AND p0 (NOT p3) (NOT p5) p4))))), (X (X (NOT (AND (NOT p1) p0 p3 p4)))), (X (X (NOT (OR (AND p1 (NOT p4)) (AND p0 (NOT p3) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p4) (AND (NOT p1) p3 p4))))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p4))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (NOT (OR (AND p1 (NOT p4)) (AND p0 (NOT p3) (NOT p5) (NOT p4)))))), (X (X (OR (AND (NOT p1) (NOT p0) (NOT p4)) (AND (NOT p1) p3 (NOT p4))))), (X (X (NOT (OR (AND p1 p4) (AND p0 (NOT p3) p4))))), (X (X (NOT (AND (NOT p1) p0 p3 (NOT p5) (NOT p4))))), (X (X (NOT (OR p1 (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p1) p0 p3 p4) (AND (NOT p1) p0 p5 p4))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p1 p5 (NOT p0) p4 (NOT p3))), (G (AND (OR p1 (NOT p5) (NOT p0) (NOT p4)) (OR p1 (NOT p0) (NOT p4) (NOT p3)))), (G (OR p1 p5 p0 (NOT p4))), (G (OR p1 p5 (NOT p0) (NOT p4) (NOT p3))), (G (OR p1 (NOT p0) p4 (NOT p3))), (G (AND (OR p1 (NOT p5) (NOT p0) p4) (OR p1 (NOT p0) p4 (NOT p3)))), (G (AND (OR (NOT p1) (NOT p4)) (OR p5 (NOT p0) (NOT p4) p3))), (G (OR p1 p0 (NOT p4) p3)), (G (OR p1 p5 p0 (NOT p4) p3)), (G (OR (NOT p1) (NOT p4))), (G (OR p1 (NOT p0) (NOT p4) (NOT p3))), (G (OR p1 p2 (NOT p0) (NOT p3))), (G (OR p1 p5 p2 (NOT p0) (NOT p3))), (G (AND (OR (NOT p1) (NOT p4)) (OR (NOT p0) (NOT p4) p3))), (G (OR p1 (NOT p0) (NOT p4)))]
False Knowledge obtained : [(F (NOT (AND (OR p1 (NOT p5) (NOT p4)) (OR p1 (NOT p4) (NOT p3))))), (F (NOT (OR (AND (NOT p1) p5) (AND (NOT p1) p2)))), (F (NOT (OR (AND (NOT p1) p5 (NOT p4)) (AND (NOT p1) (NOT p4) p3)))), (F (NOT (OR (AND (NOT p1) p5) (AND (NOT p1) p3)))), (F (NOT (OR p1 (NOT p4) (NOT p3)))), (F (NOT (OR p1 p5 p0 p4))), (F (NOT (OR p1 p5 p2 p0))), (F (NOT (AND (NOT p1) (NOT p4) p3))), (F (NOT (AND (NOT p1) p5))), (F (NOT (OR p1 p2 p0 p3))), (F (NOT (AND (OR (NOT p1) p4) (OR (NOT p0) p4 p3)))), (F (NOT (AND (NOT p1) (NOT p4)))), (F (NOT (AND (OR (NOT p1) p4) (OR p5 (NOT p0) p4 p3)))), (F (NOT (AND (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p4)))), (F (NOT (OR p1 (NOT p4)))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 p5 p0 p4 p3))), (F (NOT p5)), (F (NOT (OR (NOT p1) p4))), (F (NOT (OR p1 p5 p0 p3))), (F (NOT (AND (NOT p1) (OR p5 (NOT p0) p3)))), (F (NOT p2)), (F p4), (F (NOT p3)), (F (NOT (OR p1 p0 (NOT p4)))), (F (NOT (OR p1 (NOT p0) p4))), (F (NOT (AND (NOT p1) (OR (NOT p0) p3)))), (F (NOT (OR p1 p0 p4 p3))), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (F p1), (F (NOT (AND (OR p1 p0 (NOT p4)) (OR p1 (NOT p4) (NOT p3))))), (F (NOT (OR (AND (NOT p1) p5) (AND (NOT p1) p2) (AND (NOT p1) p3)))), (F p0), (F (NOT (AND (NOT p1) (OR p5 (NOT p0))))), (F (NOT (OR p1 p5 p0))), (F (NOT (AND (NOT p1) (OR p2 (NOT p0) p3)))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p3)))), (F (NOT (AND (NOT p1) p5))), (F (NOT (OR p1 p5 p2 p0 p3))), (F (NOT (AND (NOT p1) (OR p5 p2 (NOT p0) p3)))), (F (NOT (OR (AND (NOT p1) (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4) p3)))), (F (NOT (AND (NOT p1) p3))), (F (NOT (OR p1 p0 p3)))]
Knowledge based reduction with 55 factoid took 5603 ms. Reduced automaton from 27 states, 169 edges and 6 AP (stutter sensitive) to 17 states, 67 edges and 6 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1444 ms :[(OR p1 p0), (OR p1 p0), (OR p1 (AND p0 (NOT p2))), (OR p1 p0), (OR p1 p0), (OR p1 (AND p0 (NOT p2))), (OR p1 p0), true, p1, (OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), p1, (OR p1 p0), p1, p1, p1]
Stuttering acceptance computed with spot in 1482 ms :[(OR p1 p0), (OR p1 p0), (OR p1 (AND p0 (NOT p2))), (OR p1 p0), (OR p1 p0), (OR p1 (AND p0 (NOT p2))), (OR p1 p0), true, p1, (OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), p1, (OR p1 p0), p1, p1, p1]
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2025-05-30 11:36:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:36:51] [INFO ] Implicit Places using invariants in 255 ms returned []
[2025-05-30 11:36:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:36:51] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-30 11:36:52] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1261 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2025-05-30 11:36:52] [INFO ] Invariant cache hit.
[2025-05-30 11:36:52] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/349 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 71/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 0/349 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 212 constraints, problems are : Problem set: 0 solved, 209 unsolved in 18890 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/349 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 71/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 209/421 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/349 variables, and 421 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49146ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 49148ms
Finished structural reductions in LTL mode , in 1 iterations and 50413 ms. Remains : 139/139 places, 210/210 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 510 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p5 p2 p3 (NOT p4)), (X (X p2)), (X (X p3)), (X (X (NOT p4))), (X (X p5)), (X (X (AND (NOT p1) p5))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p5) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p5))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p5))))), (X (X (NOT (OR (AND p0 (NOT p2)) p1)))), (X (X (NOT (OR p1 (NOT p5))))), (X (X (OR (AND (NOT p0) (NOT p1) p5) (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) p3 (NOT p5)) (AND (NOT p1) (NOT p4) p5)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1157 ms. Reduced automaton from 17 states, 67 edges and 6 AP (stutter sensitive) to 17 states, 67 edges and 6 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1518 ms :[(OR p1 p0), (OR p1 p0), (OR p1 (AND p0 (NOT p2))), (OR p1 p0), (OR p1 p0), (OR p1 (AND p0 (NOT p2))), (OR p1 p0), true, p1, (OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), p1, (OR p1 p0), p1, p1, p1]
Reduction of identical properties reduced properties to check from 27 to 18
RANDOM walk for 40000 steps (9158 resets) in 1266 ms. (31 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (195 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (178 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (165 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (200 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (184 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (164 resets) in 58 ms. (67 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (163 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (385 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (193 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (168 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (197 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (185 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (166 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (177 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (180 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (173 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (187 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (390 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
Probably explored full state space saw : 39746 states, properties seen :17
Probabilistic random walk after 97997 steps, saw 39746 distinct states, run finished after 735 ms. (steps per millisecond=133 ) properties seen :17
Explored full state space saw : 39825 states, properties seen :0
Exhaustive walk after 98127 steps, saw 39825 distinct states, run finished after 207 ms. (steps per millisecond=474 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p5 p2 p3 (NOT p4)), (X (X p2)), (X (X p3)), (X (X (NOT p4))), (X (X p5)), (X (X (AND (NOT p1) p5))), (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p5) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p5))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p5))))), (X (X (NOT (OR (AND p0 (NOT p2)) p1)))), (X (X (NOT (OR p1 (NOT p5))))), (X (X (OR (AND (NOT p0) (NOT p1) p5) (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) p3 (NOT p5)) (AND (NOT p1) (NOT p4) p5)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p1 p5 (NOT p2) p3))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p5))), (F p0), (F (NOT p5)), (F (NOT (AND (NOT p0) (NOT p1) p5))), (F (NOT (OR (AND (NOT p1) (NOT p5) p3) (AND (NOT p1) p5 (NOT p4))))), (F (NOT (OR p0 p1 p3))), (F (NOT p2)), (F p4), (F (NOT p3)), (F (NOT (OR (AND (NOT p0) (NOT p1) (NOT p5)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p4))))), (F (NOT (AND (NOT p1) p5))), (F (NOT (OR p0 p1 p5 p3))), (F (NOT (AND (NOT p1) (NOT p4)))), (F (NOT (OR (AND (NOT p0) (NOT p1) (NOT p5)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p5 (NOT p4)) (AND (NOT p1) p3 (NOT p4))))), (F (NOT (OR p0 p1 p5))), (F (NOT (OR (AND (NOT p0) (NOT p1) p5) (AND (NOT p0) (NOT p1) p3)))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR (AND (NOT p0) (NOT p1) p5) (AND (NOT p1) p2)))), (F (NOT (OR (AND (NOT p0) (NOT p1) p5 (NOT p4)) (AND (NOT p0) (NOT p1) p3 (NOT p4))))), (F (NOT (OR p0 p1 p5 p2))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p1) p3 (NOT p4)))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (OR (NOT p0) p2) (NOT p1))))]
Knowledge based reduction with 17 factoid took 2172 ms. Reduced automaton from 17 states, 67 edges and 6 AP (stutter sensitive) to 17 states, 66 edges and 6 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1493 ms :[(OR p1 p0), (OR p1 p0), (OR p1 (AND p0 (NOT p2))), (OR p1 p0), (OR p1 p0), (OR p1 (AND p0 (NOT p2))), (OR p1 p0), true, p1, (OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), p1, (OR p1 p0), p1, p1, p1]
Stuttering acceptance computed with spot in 1504 ms :[(OR p1 p0), (OR p1 p0), (OR p1 (AND p0 (NOT p2))), (OR p1 p0), (OR p1 p0), (OR p1 (AND p0 (NOT p2))), (OR p1 p0), true, p1, (OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), p1, (OR p1 p0), p1, p1, p1]
Stuttering acceptance computed with spot in 1505 ms :[(OR p1 p0), (OR p1 p0), (OR p1 (AND p0 (NOT p2))), (OR p1 p0), (OR p1 p0), (OR p1 (AND p0 (NOT p2))), (OR p1 p0), true, p1, (OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), p1, (OR p1 p0), p1, p1, p1]
Product exploration explored 100000 steps with 23085 reset in 515 ms.
Product exploration explored 100000 steps with 22949 reset in 319 ms.
Applying partial POR strategy [false, false, true, false, true, true, true, true, true, true, true, false, true, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 1885 ms :[(OR p1 p0), (OR p1 p0), (OR p1 (AND p0 (NOT p2))), (OR p1 p0), (OR p1 p0), (OR p1 (AND p0 (NOT p2))), (OR p1 p0), true, p1, (OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), p1, (OR p1 p0), p1, p1, p1, (OR p1 p0), (OR p1 p0), (OR p1 (AND p0 (NOT p2)))]
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 210/210 transitions.
Applied a total of 0 rules in 21 ms. Remains 139 /139 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:37:55] [INFO ] Redundant transitions in 17 ms returned []
Running 209 sub problems to find dead transitions.
[2025-05-30 11:37:55] [INFO ] Invariant cache hit.
[2025-05-30 11:37:55] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/349 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 71/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 0/349 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 212 constraints, problems are : Problem set: 0 solved, 209 unsolved in 19701 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/349 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 71/212 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 209/421 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/349 variables, and 421 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 139/139 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49943ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 49944ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49993 ms. Remains : 139/139 places, 210/210 transitions.
Built C files in :
/tmp/ltsmin8953339244505749876
[2025-05-30 11:38:45] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8953339244505749876
Running compilation step : cd /tmp/ltsmin8953339244505749876;'/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 1090 ms.
Running link step : cd /tmp/ltsmin8953339244505749876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin8953339244505749876;'/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/stateBased4608343230869536988.hoa' '--buchi-type=spotba'
LTSmin run took 259 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-01 finished in 187598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((!p0 U X(p1))) U X(p2)) U X(X(p2))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 430/430 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 182 transition count 329
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 182 transition count 329
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 182 transition count 324
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 71 place count 164 transition count 290
Iterating global reduction 1 with 18 rules applied. Total rules applied 89 place count 164 transition count 290
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 95 place count 164 transition count 284
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 110 place count 149 transition count 259
Iterating global reduction 2 with 15 rules applied. Total rules applied 125 place count 149 transition count 259
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 136 place count 149 transition count 248
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 145 place count 140 transition count 223
Iterating global reduction 3 with 9 rules applied. Total rules applied 154 place count 140 transition count 223
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 159 place count 140 transition count 218
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 162 place count 137 transition count 215
Iterating global reduction 4 with 3 rules applied. Total rules applied 165 place count 137 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 169 place count 137 transition count 211
Applied a total of 169 rules in 25 ms. Remains 137 /206 variables (removed 69) and now considering 211/430 (removed 219) transitions.
// Phase 1: matrix 211 rows 137 cols
[2025-05-30 11:38:47] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:38:47] [INFO ] Implicit Places using invariants in 263 ms returned []
[2025-05-30 11:38:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:38:47] [INFO ] State equation strengthened by 79 read => feed constraints.
[2025-05-30 11:38:48] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2025-05-30 11:38:48] [INFO ] Invariant cache hit.
[2025-05-30 11:38:48] [INFO ] State equation strengthened by 79 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/348 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 79/218 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 218 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/348 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 79/218 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 210/428 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/348 variables, and 428 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Starting structural reductions in LTL mode, iteration 1 : 137/206 places, 211/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61360 ms. Remains : 137/206 places, 211/430 transitions.
Stuttering acceptance computed with spot in 567 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-03
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-03 finished in 61975 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||(p1&&G(p2))))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 430/430 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 182 transition count 324
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 182 transition count 324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 182 transition count 322
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 164 transition count 298
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 164 transition count 298
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 92 place count 164 transition count 292
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 108 place count 148 transition count 267
Iterating global reduction 2 with 16 rules applied. Total rules applied 124 place count 148 transition count 267
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 135 place count 148 transition count 256
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 145 place count 138 transition count 226
Iterating global reduction 3 with 10 rules applied. Total rules applied 155 place count 138 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 160 place count 138 transition count 221
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 164 place count 134 transition count 217
Iterating global reduction 4 with 4 rules applied. Total rules applied 168 place count 134 transition count 217
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 172 place count 134 transition count 213
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 173 place count 133 transition count 212
Iterating global reduction 5 with 1 rules applied. Total rules applied 174 place count 133 transition count 212
Applied a total of 174 rules in 75 ms. Remains 133 /206 variables (removed 73) and now considering 212/430 (removed 218) transitions.
// Phase 1: matrix 212 rows 133 cols
[2025-05-30 11:39:49] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:39:49] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-30 11:39:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:39:49] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-30 11:39:50] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:39:50] [INFO ] Redundant transitions in 15 ms returned []
Running 211 sub problems to find dead transitions.
[2025-05-30 11:39:50] [INFO ] Invariant cache hit.
[2025-05-30 11:39:50] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/345 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 87/222 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:40:03] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:40:03] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:40:03] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:40:04] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:40:04] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:40:05] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:40:05] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:40:05] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 8/230 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/345 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 230 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/345 variables, 133/143 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 87/230 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 211/441 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 345/345 variables, and 441 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60217ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Starting structural reductions in SI_LTL mode, iteration 1 : 133/206 places, 212/430 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61833 ms. Remains : 133/206 places, 212/430 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-05
Product exploration explored 100000 steps with 22982 reset in 469 ms.
Product exploration explored 100000 steps with 22964 reset in 484 ms.
Computed a total of 5 stabilizing places and 21 stable transitions
Graph (complete) has 494 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 159 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9171 resets) in 490 ms. (81 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (1802 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1798 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
[2025-05-30 11:40:52] [INFO ] Invariant cache hit.
[2025-05-30 11:40:52] [INFO ] State equation strengthened by 87 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) 52/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 145/232 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 105/337 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 63/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/345 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/345 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 588 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 87/87 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) 52/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 145/232 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 105/337 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 63/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/345 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/345 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/345 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 224 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1771 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2386ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 169 ms.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 212/212 transitions.
Graph (complete) has 460 edges and 133 vertex of which 132 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 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 132 transition count 208
Applied a total of 5 rules in 12 ms. Remains 132 /133 variables (removed 1) and now considering 208/212 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 132/133 places, 208/212 transitions.
RANDOM walk for 40000 steps (9152 resets) in 293 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1838 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1776 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 19084 steps, run visited all 2 properties in 135 ms. (steps per millisecond=141 )
Probabilistic random walk after 19084 steps, saw 8723 distinct states, run finished after 135 ms. (steps per millisecond=141 ) properties seen :2
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (AND (OR p2 p0) (OR p0 p1))))]
Knowledge based reduction with 13 factoid took 507 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 212/212 transitions.
Applied a total of 0 rules in 12 ms. Remains 133 /133 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2025-05-30 11:40:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:40:56] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-05-30 11:40:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:40:56] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-30 11:40:57] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:40:57] [INFO ] Redundant transitions in 3 ms returned []
Running 211 sub problems to find dead transitions.
[2025-05-30 11:40:57] [INFO ] Invariant cache hit.
[2025-05-30 11:40:57] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/345 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 87/222 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:41:09] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:41:10] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:41:10] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:41:10] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:41:10] [INFO ] Deduced a trap composed of 55 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:41:11] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:41:11] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:41:11] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 8/230 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/345 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 230 constraints, problems are : Problem set: 0 solved, 211 unsolved in 29505 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/345 variables, 133/143 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 87/230 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 211/441 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 345/345 variables, and 441 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59669ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 59670ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60831 ms. Remains : 133/133 places, 212/212 transitions.
Computed a total of 5 stabilizing places and 21 stable transitions
Graph (complete) has 494 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 214 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9182 resets) in 458 ms. (87 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (1779 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1805 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
[2025-05-30 11:41:58] [INFO ] Invariant cache hit.
[2025-05-30 11:41:58] [INFO ] State equation strengthened by 87 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) 52/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 145/232 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 105/337 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 63/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/345 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/345 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 660 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 87/87 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) 52/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 145/232 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 105/337 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 63/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 8/345 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/345 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/345 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 224 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1822 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2505ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 159 ms.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 212/212 transitions.
Graph (complete) has 460 edges and 133 vertex of which 132 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 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 132 transition count 208
Applied a total of 5 rules in 7 ms. Remains 132 /133 variables (removed 1) and now considering 208/212 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 132/133 places, 208/212 transitions.
RANDOM walk for 40000 steps (9251 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1782 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1819 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 19084 steps, run visited all 2 properties in 129 ms. (steps per millisecond=147 )
Probabilistic random walk after 19084 steps, saw 8723 distinct states, run finished after 130 ms. (steps per millisecond=146 ) properties seen :2
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F (NOT (AND (OR p2 p0) (OR p0 p1))))]
Knowledge based reduction with 13 factoid took 550 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 134 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 22984 reset in 376 ms.
Product exploration explored 100000 steps with 23077 reset in 362 ms.
Built C files in :
/tmp/ltsmin10658873277294509155
[2025-05-30 11:42:02] [INFO ] Computing symmetric may disable matrix : 212 transitions.
[2025-05-30 11:42:02] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:42:02] [INFO ] Computing symmetric may enable matrix : 212 transitions.
[2025-05-30 11:42:02] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:42:02] [INFO ] Computing Do-Not-Accords matrix : 212 transitions.
[2025-05-30 11:42:02] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:42:02] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10658873277294509155
Running compilation step : cd /tmp/ltsmin10658873277294509155;'/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 891 ms.
Running link step : cd /tmp/ltsmin10658873277294509155;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10658873277294509155;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased337284586400255230.hoa' '--buchi-type=spotba'
LTSmin run took 1474 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-05 finished in 135865 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(F(p0)))||G((p1&&X((p1 U (X(p2)||G(p1))))))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 430/430 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 182 transition count 327
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 182 transition count 327
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 182 transition count 322
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 71 place count 164 transition count 287
Iterating global reduction 1 with 18 rules applied. Total rules applied 89 place count 164 transition count 287
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 97 place count 164 transition count 279
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 111 place count 150 transition count 256
Iterating global reduction 2 with 14 rules applied. Total rules applied 125 place count 150 transition count 256
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 133 place count 150 transition count 248
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 143 place count 140 transition count 217
Iterating global reduction 3 with 10 rules applied. Total rules applied 153 place count 140 transition count 217
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 163 place count 140 transition count 207
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 166 place count 137 transition count 204
Iterating global reduction 4 with 3 rules applied. Total rules applied 169 place count 137 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 171 place count 137 transition count 202
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 172 place count 136 transition count 201
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 136 transition count 201
Applied a total of 173 rules in 15 ms. Remains 136 /206 variables (removed 70) and now considering 201/430 (removed 229) transitions.
// Phase 1: matrix 201 rows 136 cols
[2025-05-30 11:42:05] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:42:05] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-05-30 11:42:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:42:05] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-05-30 11:42:06] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-05-30 11:42:06] [INFO ] Invariant cache hit.
[2025-05-30 11:42:06] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/337 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 67/205 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 205 constraints, problems are : Problem set: 0 solved, 200 unsolved in 21559 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/337 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 67/205 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 200/405 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 405 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51772ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 51773ms
Starting structural reductions in LTL mode, iteration 1 : 136/206 places, 201/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52677 ms. Remains : 136/206 places, 201/430 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-07
Product exploration explored 100000 steps with 22985 reset in 457 ms.
Product exploration explored 100000 steps with 22989 reset in 470 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 496 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 134 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9258 resets) in 275 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1801 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1849 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1813 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1805 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 54307 steps, run visited all 4 properties in 284 ms. (steps per millisecond=191 )
Probabilistic random walk after 54307 steps, saw 22247 distinct states, run finished after 285 ms. (steps per millisecond=190 ) properties seen :4
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 246 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 136 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 201/201 transitions.
Applied a total of 0 rules in 3 ms. Remains 136 /136 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2025-05-30 11:43:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:43:00] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-05-30 11:43:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:43:00] [INFO ] State equation strengthened by 67 read => feed constraints.
[2025-05-30 11:43:01] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2025-05-30 11:43:01] [INFO ] Invariant cache hit.
[2025-05-30 11:43:01] [INFO ] State equation strengthened by 67 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/337 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 67/205 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 205 constraints, problems are : Problem set: 0 solved, 200 unsolved in 21184 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/337 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 67/205 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 200/405 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 405 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51348ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 51349ms
Finished structural reductions in LTL mode , in 1 iterations and 52089 ms. Remains : 136/136 places, 201/201 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 496 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9218 resets) in 312 ms. (127 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1846 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1832 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1756 resets) in 109 ms. (363 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1799 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 54307 steps, run visited all 4 properties in 274 ms. (steps per millisecond=198 )
Probabilistic random walk after 54307 steps, saw 22247 distinct states, run finished after 274 ms. (steps per millisecond=198 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 260 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 23017 reset in 290 ms.
Product exploration explored 100000 steps with 22856 reset in 277 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 201/201 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 134 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 134 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 133 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 133 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 133 transition count 193
Applied a total of 7 rules in 16 ms. Remains 133 /136 variables (removed 3) and now considering 193/201 (removed 8) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:43:55] [INFO ] Redundant transitions in 3 ms returned []
Running 192 sub problems to find dead transitions.
// Phase 1: matrix 193 rows 133 cols
[2025-05-30 11:43:55] [INFO ] Computed 2 invariants in 2 ms
[2025-05-30 11:43:55] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/326 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 192 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/326 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 201 constraints, problems are : Problem set: 0 solved, 192 unsolved in 24003 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/326 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 192/393 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 393 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54210ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 54211ms
Starting structural reductions in SI_LTL mode, iteration 1 : 133/136 places, 193/201 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54238 ms. Remains : 133/136 places, 193/201 transitions.
Built C files in :
/tmp/ltsmin6251142938775509269
[2025-05-30 11:44:49] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6251142938775509269
Running compilation step : cd /tmp/ltsmin6251142938775509269;'/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 663 ms.
Running link step : cd /tmp/ltsmin6251142938775509269;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin6251142938775509269;'/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/stateBased3035133874364386476.hoa' '--buchi-type=spotba'
LTSmin run took 275 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-07 finished in 165123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 430/430 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 180 transition count 319
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 180 transition count 319
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 180 transition count 314
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 78 place count 159 transition count 276
Iterating global reduction 1 with 21 rules applied. Total rules applied 99 place count 159 transition count 276
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 107 place count 159 transition count 268
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 124 place count 142 transition count 241
Iterating global reduction 2 with 17 rules applied. Total rules applied 141 place count 142 transition count 241
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 152 place count 142 transition count 230
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 164 place count 130 transition count 191
Iterating global reduction 3 with 12 rules applied. Total rules applied 176 place count 130 transition count 191
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 182 place count 130 transition count 185
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 186 place count 126 transition count 181
Iterating global reduction 4 with 4 rules applied. Total rules applied 190 place count 126 transition count 181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 194 place count 126 transition count 177
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 195 place count 125 transition count 176
Iterating global reduction 5 with 1 rules applied. Total rules applied 196 place count 125 transition count 176
Applied a total of 196 rules in 42 ms. Remains 125 /206 variables (removed 81) and now considering 176/430 (removed 254) transitions.
// Phase 1: matrix 176 rows 125 cols
[2025-05-30 11:44:50] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:44:50] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-05-30 11:44:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:44:50] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 11:44:51] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:44:51] [INFO ] Redundant transitions in 2 ms returned []
Running 175 sub problems to find dead transitions.
[2025-05-30 11:44:51] [INFO ] Invariant cache hit.
[2025-05-30 11:44:51] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/301 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/301 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 184 constraints, problems are : Problem set: 0 solved, 175 unsolved in 14809 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/301 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 175/359 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 359 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44996ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 44997ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/206 places, 176/430 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46116 ms. Remains : 125/206 places, 176/430 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-08
Product exploration explored 100000 steps with 22950 reset in 436 ms.
Product exploration explored 100000 steps with 22979 reset in 252 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 450 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9199 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1821 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 19183 steps, run visited all 1 properties in 58 ms. (steps per millisecond=330 )
Probabilistic random walk after 19183 steps, saw 8775 distinct states, run finished after 58 ms. (steps per millisecond=330 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 125 /125 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-30 11:45:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:38] [INFO ] Implicit Places using invariants in 208 ms returned []
[2025-05-30 11:45:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:45:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 11:45:38] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:45:38] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2025-05-30 11:45:38] [INFO ] Invariant cache hit.
[2025-05-30 11:45:38] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/301 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/301 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 184 constraints, problems are : Problem set: 0 solved, 175 unsolved in 14449 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/301 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 175/359 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 359 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44613ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 44614ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45644 ms. Remains : 125/125 places, 176/176 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 450 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9270 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1785 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 19183 steps, run visited all 1 properties in 71 ms. (steps per millisecond=270 )
Probabilistic random walk after 19183 steps, saw 8775 distinct states, run finished after 71 ms. (steps per millisecond=270 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22920 reset in 355 ms.
Product exploration explored 100000 steps with 23048 reset in 367 ms.
Built C files in :
/tmp/ltsmin6336674925373066959
[2025-05-30 11:46:25] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2025-05-30 11:46:25] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:46:25] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2025-05-30 11:46:25] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:46:25] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2025-05-30 11:46:25] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:46:25] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6336674925373066959
Running compilation step : cd /tmp/ltsmin6336674925373066959;'/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 914 ms.
Running link step : cd /tmp/ltsmin6336674925373066959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin6336674925373066959;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4147035348993239258.hoa' '--buchi-type=spotba'
LTSmin run took 1249 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-08 finished in 97023 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 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 430/430 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 180 transition count 315
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 180 transition count 315
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 180 transition count 310
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 77 place count 160 transition count 273
Iterating global reduction 1 with 20 rules applied. Total rules applied 97 place count 160 transition count 273
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 105 place count 160 transition count 265
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 121 place count 144 transition count 240
Iterating global reduction 2 with 16 rules applied. Total rules applied 137 place count 144 transition count 240
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 147 place count 144 transition count 230
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 158 place count 133 transition count 199
Iterating global reduction 3 with 11 rules applied. Total rules applied 169 place count 133 transition count 199
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 175 place count 133 transition count 193
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 179 place count 129 transition count 189
Iterating global reduction 4 with 4 rules applied. Total rules applied 183 place count 129 transition count 189
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 187 place count 129 transition count 185
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 128 transition count 184
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 128 transition count 184
Applied a total of 189 rules in 28 ms. Remains 128 /206 variables (removed 78) and now considering 184/430 (removed 246) transitions.
// Phase 1: matrix 184 rows 128 cols
[2025-05-30 11:46:27] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:46:27] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-05-30 11:46:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:46:27] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-05-30 11:46:28] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:46:28] [INFO ] Redundant transitions in 1 ms returned []
Running 183 sub problems to find dead transitions.
[2025-05-30 11:46:28] [INFO ] Invariant cache hit.
[2025-05-30 11:46:28] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (OVERLAPS) 184/312 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:46:37] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:46:37] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:46:37] [INFO ] Deduced a trap composed of 52 places in 167 ms of which 26 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 0/312 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 195 constraints, problems are : Problem set: 0 solved, 183 unsolved in 20590 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/312 variables, 128/133 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 62/195 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 183/378 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 378 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50806ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 50808ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/206 places, 184/430 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51821 ms. Remains : 128/206 places, 184/430 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-10
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-10 finished in 51885 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) U X(X(p1))))&&F(p2)))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 430/430 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 182 transition count 326
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 182 transition count 326
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 182 transition count 321
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 73 place count 162 transition count 284
Iterating global reduction 1 with 20 rules applied. Total rules applied 93 place count 162 transition count 284
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 101 place count 162 transition count 276
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 117 place count 146 transition count 251
Iterating global reduction 2 with 16 rules applied. Total rules applied 133 place count 146 transition count 251
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 143 place count 146 transition count 241
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 154 place count 135 transition count 203
Iterating global reduction 3 with 11 rules applied. Total rules applied 165 place count 135 transition count 203
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 171 place count 135 transition count 197
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 174 place count 132 transition count 194
Iterating global reduction 4 with 3 rules applied. Total rules applied 177 place count 132 transition count 194
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 132 transition count 191
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 181 place count 131 transition count 190
Iterating global reduction 5 with 1 rules applied. Total rules applied 182 place count 131 transition count 190
Applied a total of 182 rules in 19 ms. Remains 131 /206 variables (removed 75) and now considering 190/430 (removed 240) transitions.
// Phase 1: matrix 190 rows 131 cols
[2025-05-30 11:47:19] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:47:19] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-05-30 11:47:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:47:19] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-30 11:47:20] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2025-05-30 11:47:20] [INFO ] Invariant cache hit.
[2025-05-30 11:47:20] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/321 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 64/197 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 197 constraints, problems are : Problem set: 0 solved, 189 unsolved in 16251 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/321 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 64/197 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 189/386 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/321 variables, and 386 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46497ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 46498ms
Starting structural reductions in LTL mode, iteration 1 : 131/206 places, 190/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47590 ms. Remains : 131/206 places, 190/430 transitions.
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-11
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-11 finished in 48003 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)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 430/430 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 180 transition count 321
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 180 transition count 321
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 180 transition count 316
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 77 place count 160 transition count 279
Iterating global reduction 1 with 20 rules applied. Total rules applied 97 place count 160 transition count 279
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 105 place count 160 transition count 271
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 121 place count 144 transition count 246
Iterating global reduction 2 with 16 rules applied. Total rules applied 137 place count 144 transition count 246
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 147 place count 144 transition count 236
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 158 place count 133 transition count 198
Iterating global reduction 3 with 11 rules applied. Total rules applied 169 place count 133 transition count 198
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 179 place count 133 transition count 188
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 182 place count 130 transition count 185
Iterating global reduction 4 with 3 rules applied. Total rules applied 185 place count 130 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 187 place count 130 transition count 183
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 129 transition count 182
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 129 transition count 182
Applied a total of 189 rules in 16 ms. Remains 129 /206 variables (removed 77) and now considering 182/430 (removed 248) transitions.
// Phase 1: matrix 182 rows 129 cols
[2025-05-30 11:48:07] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:48:07] [INFO ] Implicit Places using invariants in 226 ms returned []
[2025-05-30 11:48:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:48:07] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 11:48:08] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-05-30 11:48:08] [INFO ] Invariant cache hit.
[2025-05-30 11:48:08] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 188 constraints, problems are : Problem set: 0 solved, 181 unsolved in 17163 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 181/369 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 369 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47322ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 47323ms
Starting structural reductions in LTL mode, iteration 1 : 129/206 places, 182/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48272 ms. Remains : 129/206 places, 182/430 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-12 finished in 48405 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)&&F(G(p1)))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 430/430 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 180 transition count 315
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 180 transition count 315
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 180 transition count 310
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 77 place count 160 transition count 273
Iterating global reduction 1 with 20 rules applied. Total rules applied 97 place count 160 transition count 273
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 105 place count 160 transition count 265
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 121 place count 144 transition count 240
Iterating global reduction 2 with 16 rules applied. Total rules applied 137 place count 144 transition count 240
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 147 place count 144 transition count 230
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 158 place count 133 transition count 198
Iterating global reduction 3 with 11 rules applied. Total rules applied 169 place count 133 transition count 198
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 175 place count 133 transition count 192
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 179 place count 129 transition count 188
Iterating global reduction 4 with 4 rules applied. Total rules applied 183 place count 129 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 187 place count 129 transition count 184
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 128 transition count 183
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 128 transition count 183
Applied a total of 189 rules in 44 ms. Remains 128 /206 variables (removed 78) and now considering 183/430 (removed 247) transitions.
// Phase 1: matrix 183 rows 128 cols
[2025-05-30 11:48:55] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:48:55] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-05-30 11:48:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:48:56] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 11:48:56] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:48:56] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2025-05-30 11:48:56] [INFO ] Invariant cache hit.
[2025-05-30 11:48:56] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 191 constraints, problems are : Problem set: 0 solved, 182 unsolved in 14162 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/311 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 61/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 182/373 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 373 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44359ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 44360ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/206 places, 183/430 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45470 ms. Remains : 128/206 places, 183/430 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-14 finished in 45655 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&&X((X(F(p1))||G(!p0)))))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 430/430 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 181 transition count 317
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 181 transition count 317
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 181 transition count 313
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 73 place count 162 transition count 285
Iterating global reduction 1 with 19 rules applied. Total rules applied 92 place count 162 transition count 285
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 99 place count 162 transition count 278
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 116 place count 145 transition count 251
Iterating global reduction 2 with 17 rules applied. Total rules applied 133 place count 145 transition count 251
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 144 place count 145 transition count 240
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 155 place count 134 transition count 202
Iterating global reduction 3 with 11 rules applied. Total rules applied 166 place count 134 transition count 202
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 134 transition count 196
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 175 place count 131 transition count 193
Iterating global reduction 4 with 3 rules applied. Total rules applied 178 place count 131 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 181 place count 131 transition count 190
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 182 place count 130 transition count 189
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 130 transition count 189
Applied a total of 183 rules in 37 ms. Remains 130 /206 variables (removed 76) and now considering 189/430 (removed 241) transitions.
// Phase 1: matrix 189 rows 130 cols
[2025-05-30 11:49:41] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:49:41] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-05-30 11:49:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:49:41] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-05-30 11:49:42] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:49:42] [INFO ] Redundant transitions in 1 ms returned []
Running 188 sub problems to find dead transitions.
[2025-05-30 11:49:42] [INFO ] Invariant cache hit.
[2025-05-30 11:49:42] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/319 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:49:52] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:49:52] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:49:53] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:03] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:04] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:04] [INFO ] Deduced a trap composed of 56 places in 149 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:04] [INFO ] Deduced a trap composed of 56 places in 153 ms of which 15 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/319 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:08] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/319 variables, and 203 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 189/319 variables, 130/140 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 63/203 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 188/391 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 391 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60235ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 60236ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/206 places, 189/430 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61290 ms. Remains : 130/206 places, 189/430 transitions.
Stuttering acceptance computed with spot in 258 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-15
Product exploration explored 100000 steps with 23099 reset in 434 ms.
Product exploration explored 100000 steps with 23093 reset in 450 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 473 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 137 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 9 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 484 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, false, false]
RANDOM walk for 40000 steps (9137 resets) in 347 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1794 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1767 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1831 resets) in 177 ms. (224 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1713 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3816 resets) in 124 ms. (320 steps per ms) remains 3/6 properties
[2025-05-30 11:50:44] [INFO ] Invariant cache hit.
[2025-05-30 11:50:44] [INFO ] State equation strengthened by 63 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 apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 52/56 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 137/225 variables, 88/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 11/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 88/313 variables, 39/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 49/189 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/319 variables, 3/192 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 3/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/319 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/319 variables, 0/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 195 constraints, problems are : Problem set: 1 solved, 2 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
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) 52/56 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 137/225 variables, 88/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 11/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 88/313 variables, 39/140 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 49/189 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 2/191 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 0/191 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/319 variables, 3/194 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/319 variables, 3/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/319 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 197 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1784 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2155ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 213 ms.
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 189/189 transitions.
Graph (complete) has 444 edges and 130 vertex of which 129 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 129 transition count 186
Applied a total of 4 rules in 9 ms. Remains 129 /130 variables (removed 1) and now considering 186/189 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 129/130 places, 186/189 transitions.
RANDOM walk for 40000 steps (9161 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1808 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1794 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 26001 steps, run visited all 2 properties in 191 ms. (steps per millisecond=136 )
Probabilistic random walk after 26001 steps, saw 11750 distinct states, run finished after 191 ms. (steps per millisecond=136 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p0))), (F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 373 ms. Reduced automaton from 9 states, 23 edges and 2 AP (stutter insensitive) to 8 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 414 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 415 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 189/189 transitions.
Applied a total of 0 rules in 7 ms. Remains 130 /130 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2025-05-30 11:50:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:48] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-05-30 11:50:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 11:50:49] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-05-30 11:50:49] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 11:50:49] [INFO ] Redundant transitions in 2 ms returned []
Running 188 sub problems to find dead transitions.
[2025-05-30 11:50:49] [INFO ] Invariant cache hit.
[2025-05-30 11:50:49] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/319 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 63/195 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:58] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:58] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:50:59] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:08] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:09] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:09] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:09] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 13 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/319 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 11:51:13] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 319/319 variables, and 203 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 189/319 variables, 130/140 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 63/203 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 188/391 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 391 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60241ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 60243ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61254 ms. Remains : 130/130 places, 189/189 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 473 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (OR p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (OR p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 197 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter insensitive) to 8 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 346 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (9185 resets) in 345 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1811 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3883 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1832 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1797 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1798 resets) in 156 ms. (254 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3838 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
Probably explored full state space saw : 28484 states, properties seen :5
Probabilistic random walk after 69033 steps, saw 28484 distinct states, run finished after 545 ms. (steps per millisecond=126 ) properties seen :5
Explored full state space saw : 28567 states, properties seen :0
Exhaustive walk after 69167 steps, saw 28567 distinct states, run finished after 161 ms. (steps per millisecond=429 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (OR p1 (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (OR p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 389 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter insensitive) to 8 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 339 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 377 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 407 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 22958 reset in 440 ms.
Product exploration explored 100000 steps with 22973 reset in 440 ms.
Built C files in :
/tmp/ltsmin948031825044581075
[2025-05-30 11:51:54] [INFO ] Computing symmetric may disable matrix : 189 transitions.
[2025-05-30 11:51:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:51:54] [INFO ] Computing symmetric may enable matrix : 189 transitions.
[2025-05-30 11:51:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:51:54] [INFO ] Computing Do-Not-Accords matrix : 189 transitions.
[2025-05-30 11:51:54] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 11:51:54] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin948031825044581075
Running compilation step : cd /tmp/ltsmin948031825044581075;'/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 733 ms.
Running link step : cd /tmp/ltsmin948031825044581075;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin948031825044581075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2719676172611975432.hoa' '--buchi-type=spotba'
LTSmin run took 3886 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-15 finished in 137490 ms.
All properties solved by simple procedures.
Total runtime 1115066 ms.

BK_STOP 1748605918859

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

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

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