Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r091-tall-171624187900532.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is DBSingleClientW-PT-d1m09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187900532
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716293861073

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 12:17:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 12:17:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:17:42] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-21 12:17:42] [INFO ] Transformed 1440 places.
[2024-05-21 12:17:42] [INFO ] Transformed 672 transitions.
[2024-05-21 12:17:42] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 179 place count 248 transition count 401
Iterating global reduction 1 with 78 rules applied. Total rules applied 257 place count 248 transition count 401
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 266 place count 248 transition count 392
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 323 place count 191 transition count 335
Iterating global reduction 2 with 57 rules applied. Total rules applied 380 place count 191 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 382 place count 191 transition count 333
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 405 place count 168 transition count 301
Iterating global reduction 3 with 23 rules applied. Total rules applied 428 place count 168 transition count 301
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 450 place count 168 transition count 279
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 452 place count 166 transition count 276
Iterating global reduction 4 with 2 rules applied. Total rules applied 454 place count 166 transition count 276
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 455 place count 165 transition count 275
Iterating global reduction 4 with 1 rules applied. Total rules applied 456 place count 165 transition count 275
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 457 place count 164 transition count 274
Iterating global reduction 4 with 1 rules applied. Total rules applied 458 place count 164 transition count 274
Applied a total of 458 rules in 88 ms. Remains 164 /347 variables (removed 183) and now considering 274/672 (removed 398) transitions.
// Phase 1: matrix 274 rows 164 cols
[2024-05-21 12:17:42] [INFO ] Computed 2 invariants in 24 ms
[2024-05-21 12:17:43] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-21 12:17:43] [INFO ] Invariant cache hit.
[2024-05-21 12:17:43] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-21 12:17:43] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2024-05-21 12:17:43] [INFO ] Invariant cache hit.
[2024-05-21 12:17:43] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 274/438 variables, 164/166 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 123/289 constraints. Problems are: Problem set: 0 solved, 273 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (OVERLAPS) 0/438 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 289 constraints, problems are : Problem set: 0 solved, 273 unsolved in 10878 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 274/438 variables, 164/166 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 123/289 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 273/562 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (OVERLAPS) 0/438 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 562 constraints, problems are : Problem set: 0 solved, 273 unsolved in 23122 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 0/0 constraints]
After SMT, in 34678ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 34693ms
Starting structural reductions in LTL mode, iteration 1 : 164/347 places, 274/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35534 ms. Remains : 164/347 places, 274/672 transitions.
Support contains 34 out of 164 places after structural reductions.
[2024-05-21 12:18:18] [INFO ] Flatten gal took : 52 ms
[2024-05-21 12:18:18] [INFO ] Flatten gal took : 23 ms
[2024-05-21 12:18:18] [INFO ] Input system was already deterministic with 274 transitions.
Support contains 30 out of 164 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (9073 resets) in 2611 ms. (15 steps per ms) remains 18/21 properties
BEST_FIRST walk for 4003 steps (192 resets) in 58 ms. (67 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (191 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (167 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (163 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (197 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (187 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (180 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (186 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (192 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (403 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (386 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (392 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (423 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (187 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (190 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (187 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (188 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (201 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
[2024-05-21 12:18:19] [INFO ] Invariant cache hit.
[2024-05-21 12:18:19] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 54/81 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-21 12:18:19] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 39/120 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 218/338 variables, 120/123 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 67/190 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 98/436 variables, 43/233 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 55/288 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 2/438 variables, 1/289 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 1/290 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/290 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 0/438 variables, 0/290 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 290 constraints, problems are : Problem set: 1 solved, 17 unsolved in 1554 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 56/79 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 40/119 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 218/337 variables, 119/121 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 67/188 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-21 12:18:21] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-21 12:18:21] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-21 12:18:21] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 3/191 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-21 12:18:21] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-21 12:18:21] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 12:18:21] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 12:18:21] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-21 12:18:21] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 12:18:21] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 6/197 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 99/436 variables, 44/241 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 55/296 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 17/313 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 1/314 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/436 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 2/438 variables, 1/315 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 1/316 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/438 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 0/438 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 316 constraints, problems are : Problem set: 1 solved, 17 unsolved in 4176 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 17/18 constraints, Known Traps: 10/10 constraints]
After SMT, in 5816ms problems are : Problem set: 1 solved, 17 unsolved
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 1 properties in 1058 ms.
Support contains 21 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 153 transition count 247
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 153 transition count 247
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 153 transition count 245
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 147 transition count 237
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 147 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 147 transition count 235
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 143 transition count 230
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 143 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 143 transition count 227
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 141 transition count 225
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 141 transition count 225
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 139 transition count 222
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 139 transition count 222
Applied a total of 57 rules in 41 ms. Remains 139 /164 variables (removed 25) and now considering 222/274 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 139/164 places, 222/274 transitions.
RANDOM walk for 40000 steps (9140 resets) in 343 ms. (116 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (170 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (198 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (195 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (182 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (186 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (190 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (193 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (180 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (402 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (410 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (356 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (381 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (174 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (182 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (188 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (188 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
Finished probabilistic random walk after 6876 steps, run visited all 16 properties in 96 ms. (steps per millisecond=71 )
Probabilistic random walk after 6876 steps, saw 3161 distinct states, run finished after 100 ms. (steps per millisecond=68 ) properties seen :16
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 25 stable transitions
Graph (complete) has 600 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 212
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 212
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 141 transition count 207
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 66 place count 126 transition count 184
Iterating global reduction 1 with 15 rules applied. Total rules applied 81 place count 126 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 126 transition count 181
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 100 place count 110 transition count 161
Iterating global reduction 2 with 16 rules applied. Total rules applied 116 place count 110 transition count 161
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 121 place count 110 transition count 156
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 131 place count 100 transition count 138
Iterating global reduction 3 with 10 rules applied. Total rules applied 141 place count 100 transition count 138
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 148 place count 100 transition count 131
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 153 place count 95 transition count 125
Iterating global reduction 4 with 5 rules applied. Total rules applied 158 place count 95 transition count 125
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 161 place count 92 transition count 122
Iterating global reduction 4 with 3 rules applied. Total rules applied 164 place count 92 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 166 place count 92 transition count 120
Applied a total of 166 rules in 17 ms. Remains 92 /164 variables (removed 72) and now considering 120/274 (removed 154) transitions.
// Phase 1: matrix 120 rows 92 cols
[2024-05-21 12:18:27] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 12:18:27] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 12:18:27] [INFO ] Invariant cache hit.
[2024-05-21 12:18:27] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 12:18:27] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-21 12:18:27] [INFO ] Invariant cache hit.
[2024-05-21 12:18:27] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/212 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 43/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 137 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/212 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 43/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 119/256 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 256 constraints, problems are : Problem set: 0 solved, 119 unsolved in 4609 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 6973ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 6977ms
Starting structural reductions in LTL mode, iteration 1 : 92/164 places, 120/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7207 ms. Remains : 92/164 places, 120/274 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-01 finished in 7545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p1)||p0))&&F(p2))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 209
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 141 transition count 206
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 65 place count 125 transition count 182
Iterating global reduction 1 with 16 rules applied. Total rules applied 81 place count 125 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 125 transition count 179
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 101 place count 108 transition count 158
Iterating global reduction 2 with 17 rules applied. Total rules applied 118 place count 108 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 124 place count 108 transition count 152
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 134 place count 98 transition count 134
Iterating global reduction 3 with 10 rules applied. Total rules applied 144 place count 98 transition count 134
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 149 place count 98 transition count 129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 154 place count 93 transition count 123
Iterating global reduction 4 with 5 rules applied. Total rules applied 159 place count 93 transition count 123
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 163 place count 89 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 167 place count 89 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 169 place count 89 transition count 112
Applied a total of 169 rules in 17 ms. Remains 89 /164 variables (removed 75) and now considering 112/274 (removed 162) transitions.
// Phase 1: matrix 112 rows 89 cols
[2024-05-21 12:18:34] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 12:18:34] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 12:18:34] [INFO ] Invariant cache hit.
[2024-05-21 12:18:34] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 12:18:34] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-21 12:18:34] [INFO ] Invariant cache hit.
[2024-05-21 12:18:34] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/201 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 37/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/201 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 128 constraints, problems are : Problem set: 0 solved, 111 unsolved in 2024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/201 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 37/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 111/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/201 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 239 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4288 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 6408ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 6409ms
Starting structural reductions in LTL mode, iteration 1 : 89/164 places, 112/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6601 ms. Remains : 89/164 places, 112/274 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-02 finished in 6857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(p1)&&p0) U X(p1)))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 212
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 212
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 141 transition count 208
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 65 place count 126 transition count 185
Iterating global reduction 1 with 15 rules applied. Total rules applied 80 place count 126 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 83 place count 126 transition count 182
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 99 place count 110 transition count 161
Iterating global reduction 2 with 16 rules applied. Total rules applied 115 place count 110 transition count 161
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 121 place count 110 transition count 155
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 131 place count 100 transition count 140
Iterating global reduction 3 with 10 rules applied. Total rules applied 141 place count 100 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 146 place count 100 transition count 135
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 151 place count 95 transition count 129
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 95 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 158 place count 93 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 93 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 163 place count 93 transition count 124
Applied a total of 163 rules in 17 ms. Remains 93 /164 variables (removed 71) and now considering 124/274 (removed 150) transitions.
// Phase 1: matrix 124 rows 93 cols
[2024-05-21 12:18:41] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 12:18:41] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 12:18:41] [INFO ] Invariant cache hit.
[2024-05-21 12:18:41] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 12:18:41] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-21 12:18:41] [INFO ] Invariant cache hit.
[2024-05-21 12:18:41] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/217 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 123 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/217 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 141 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2376 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/217 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 46/141 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 123/264 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 264 constraints, problems are : Problem set: 0 solved, 123 unsolved in 5100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 7615ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 7617ms
Starting structural reductions in LTL mode, iteration 1 : 93/164 places, 124/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7892 ms. Remains : 93/164 places, 124/274 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-04 finished in 8137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 218
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 218
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 141 transition count 213
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 67 place count 125 transition count 189
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 125 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 86 place count 125 transition count 186
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 103 place count 108 transition count 165
Iterating global reduction 2 with 17 rules applied. Total rules applied 120 place count 108 transition count 165
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 127 place count 108 transition count 158
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 137 place count 98 transition count 140
Iterating global reduction 3 with 10 rules applied. Total rules applied 147 place count 98 transition count 140
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 154 place count 98 transition count 133
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 159 place count 93 transition count 127
Iterating global reduction 4 with 5 rules applied. Total rules applied 164 place count 93 transition count 127
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 168 place count 89 transition count 118
Iterating global reduction 4 with 4 rules applied. Total rules applied 172 place count 89 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 173 place count 89 transition count 117
Applied a total of 173 rules in 29 ms. Remains 89 /164 variables (removed 75) and now considering 117/274 (removed 157) transitions.
// Phase 1: matrix 117 rows 89 cols
[2024-05-21 12:18:49] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 12:18:49] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 12:18:49] [INFO ] Invariant cache hit.
[2024-05-21 12:18:49] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 12:18:49] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-21 12:18:49] [INFO ] Redundant transitions in 3 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-21 12:18:49] [INFO ] Invariant cache hit.
[2024-05-21 12:18:49] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/206 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 12:18:51] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 4 ms to minimize.
[2024-05-21 12:18:51] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 12:18:52] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 135 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4108 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/206 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 41/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 116/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/206 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 251 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4440 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints]
After SMT, in 8643ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 8644ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/164 places, 117/274 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8858 ms. Remains : 89/164 places, 117/274 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-05
Product exploration explored 100000 steps with 23064 reset in 226 ms.
Product exploration explored 100000 steps with 23111 reset in 183 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9225 resets) in 362 ms. (110 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1853 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4849 steps, run visited all 1 properties in 21 ms. (steps per millisecond=230 )
Probabilistic random walk after 4849 steps, saw 2265 distinct states, run finished after 21 ms. (steps per millisecond=230 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 117/117 transitions.
Applied a total of 0 rules in 14 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 12:18:59] [INFO ] Invariant cache hit.
[2024-05-21 12:18:59] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 12:18:59] [INFO ] Invariant cache hit.
[2024-05-21 12:18:59] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 12:18:59] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-21 12:18:59] [INFO ] Redundant transitions in 2 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-21 12:18:59] [INFO ] Invariant cache hit.
[2024-05-21 12:18:59] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/206 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 12:19:01] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 12:19:01] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 12:19:02] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 135 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3996 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/206 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 41/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 116/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/206 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 251 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4530 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints]
After SMT, in 8644ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 8647ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8901 ms. Remains : 89/89 places, 117/117 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9147 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4849 steps, run visited all 1 properties in 13 ms. (steps per millisecond=373 )
Probabilistic random walk after 4849 steps, saw 2265 distinct states, run finished after 13 ms. (steps per millisecond=373 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22919 reset in 135 ms.
Product exploration explored 100000 steps with 22937 reset in 117 ms.
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 117/117 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 12:19:09] [INFO ] Invariant cache hit.
[2024-05-21 12:19:09] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 12:19:09] [INFO ] Invariant cache hit.
[2024-05-21 12:19:09] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 12:19:09] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-21 12:19:09] [INFO ] Redundant transitions in 2 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-21 12:19:09] [INFO ] Invariant cache hit.
[2024-05-21 12:19:09] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/206 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 12:19:10] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 12:19:10] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 12:19:11] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 135 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 117/206 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 41/135 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 116/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/206 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 251 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4557 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints]
After SMT, in 8707ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 8708ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8907 ms. Remains : 89/89 places, 117/117 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-05 finished in 28649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 216
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 216
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 141 transition count 211
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 66 place count 126 transition count 188
Iterating global reduction 1 with 15 rules applied. Total rules applied 81 place count 126 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 126 transition count 185
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 99 place count 111 transition count 166
Iterating global reduction 2 with 15 rules applied. Total rules applied 114 place count 111 transition count 166
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 120 place count 111 transition count 160
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 129 place count 102 transition count 146
Iterating global reduction 3 with 9 rules applied. Total rules applied 138 place count 102 transition count 146
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 145 place count 102 transition count 139
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 149 place count 98 transition count 134
Iterating global reduction 4 with 4 rules applied. Total rules applied 153 place count 98 transition count 134
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 156 place count 95 transition count 126
Iterating global reduction 4 with 3 rules applied. Total rules applied 159 place count 95 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 95 transition count 125
Applied a total of 160 rules in 48 ms. Remains 95 /164 variables (removed 69) and now considering 125/274 (removed 149) transitions.
// Phase 1: matrix 125 rows 95 cols
[2024-05-21 12:19:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 12:19:18] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-21 12:19:18] [INFO ] Invariant cache hit.
[2024-05-21 12:19:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 12:19:18] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-05-21 12:19:18] [INFO ] Redundant transitions in 2 ms returned []
Running 124 sub problems to find dead transitions.
[2024-05-21 12:19:18] [INFO ] Invariant cache hit.
[2024-05-21 12:19:18] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/220 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 42/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 139 constraints, problems are : Problem set: 0 solved, 124 unsolved in 2433 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/220 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 42/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 124/263 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 263 constraints, problems are : Problem set: 0 solved, 124 unsolved in 5117 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
After SMT, in 7693ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 7695ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/164 places, 125/274 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8137 ms. Remains : 95/164 places, 125/274 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-06
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-06 finished in 8330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||(!p0&&G(!p1)))))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 140 transition count 208
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 140 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 140 transition count 205
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 68 place count 123 transition count 180
Iterating global reduction 1 with 17 rules applied. Total rules applied 85 place count 123 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 88 place count 123 transition count 177
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 105 place count 106 transition count 155
Iterating global reduction 2 with 17 rules applied. Total rules applied 122 place count 106 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 129 place count 106 transition count 148
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 139 place count 96 transition count 131
Iterating global reduction 3 with 10 rules applied. Total rules applied 149 place count 96 transition count 131
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 154 place count 96 transition count 126
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 159 place count 91 transition count 120
Iterating global reduction 4 with 5 rules applied. Total rules applied 164 place count 91 transition count 120
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 167 place count 88 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 170 place count 88 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 172 place count 88 transition count 110
Applied a total of 172 rules in 26 ms. Remains 88 /164 variables (removed 76) and now considering 110/274 (removed 164) transitions.
// Phase 1: matrix 110 rows 88 cols
[2024-05-21 12:19:26] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 12:19:26] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 12:19:26] [INFO ] Invariant cache hit.
[2024-05-21 12:19:26] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 12:19:26] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-05-21 12:19:26] [INFO ] Redundant transitions in 4 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 12:19:26] [INFO ] Invariant cache hit.
[2024-05-21 12:19:26] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1863 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4533 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6495ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6496ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/164 places, 110/274 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6780 ms. Remains : 88/164 places, 110/274 transitions.
Stuttering acceptance computed with spot in 171 ms :[p0, p0, (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-07
Product exploration explored 100000 steps with 22930 reset in 167 ms.
Product exploration explored 100000 steps with 22923 reset in 217 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 158 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[p0, p0, (AND p0 p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (9261 resets) in 227 ms. (175 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1940 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1874 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3980 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (3903 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1902 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1901 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 2283336 steps, run timeout after 3001 ms. (steps per millisecond=760 ) properties seen :5 out of 6
Probabilistic random walk after 2283336 steps, saw 916246 distinct states, run finished after 3004 ms. (steps per millisecond=760 ) properties seen :5
[2024-05-21 12:19:37] [INFO ] Invariant cache hit.
[2024-05-21 12:19:37] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf6 is UNSAT
After SMT solving in domain Real declared 36/198 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/88 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 30ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 365 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 130 ms :[p0, p0, (AND p0 p1)]
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 7 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 12:19:38] [INFO ] Invariant cache hit.
[2024-05-21 12:19:38] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 12:19:38] [INFO ] Invariant cache hit.
[2024-05-21 12:19:38] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 12:19:38] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-21 12:19:38] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 12:19:38] [INFO ] Invariant cache hit.
[2024-05-21 12:19:38] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1919 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4525 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6534ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6536ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6801 ms. Remains : 88/88 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 110 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[p0, p0, (AND p0 p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (9133 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1887 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1917 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3946 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3910 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1930 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1961 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 2305985 steps, run timeout after 3001 ms. (steps per millisecond=768 ) properties seen :5 out of 6
Probabilistic random walk after 2305985 steps, saw 926064 distinct states, run finished after 3001 ms. (steps per millisecond=768 ) properties seen :5
[2024-05-21 12:19:48] [INFO ] Invariant cache hit.
[2024-05-21 12:19:48] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf6 is UNSAT
After SMT solving in domain Real declared 36/198 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/88 constraints, ReadFeed: 0/35 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 12 factoid took 361 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 185 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 120 ms :[p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 22970 reset in 113 ms.
Product exploration explored 100000 steps with 23069 reset in 120 ms.
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 12:19:49] [INFO ] Invariant cache hit.
[2024-05-21 12:19:49] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 12:19:49] [INFO ] Invariant cache hit.
[2024-05-21 12:19:49] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 12:19:49] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-05-21 12:19:49] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 12:19:49] [INFO ] Invariant cache hit.
[2024-05-21 12:19:49] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1882 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4450 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6419ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6421ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6702 ms. Remains : 88/88 places, 110/110 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-07 finished in 29814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(G(!p0))||G(p1))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 208
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 141 transition count 205
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 66 place count 124 transition count 180
Iterating global reduction 1 with 17 rules applied. Total rules applied 83 place count 124 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 86 place count 124 transition count 177
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 103 place count 107 transition count 156
Iterating global reduction 2 with 17 rules applied. Total rules applied 120 place count 107 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 127 place count 107 transition count 149
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 137 place count 97 transition count 132
Iterating global reduction 3 with 10 rules applied. Total rules applied 147 place count 97 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 150 place count 97 transition count 129
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 156 place count 91 transition count 122
Iterating global reduction 4 with 6 rules applied. Total rules applied 162 place count 91 transition count 122
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 166 place count 87 transition count 113
Iterating global reduction 4 with 4 rules applied. Total rules applied 170 place count 87 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 173 place count 87 transition count 110
Applied a total of 173 rules in 14 ms. Remains 87 /164 variables (removed 77) and now considering 110/274 (removed 164) transitions.
// Phase 1: matrix 110 rows 87 cols
[2024-05-21 12:19:56] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 12:19:56] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 12:19:56] [INFO ] Invariant cache hit.
[2024-05-21 12:19:56] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 12:19:56] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-21 12:19:56] [INFO ] Redundant transitions in 0 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 12:19:56] [INFO ] Invariant cache hit.
[2024-05-21 12:19:56] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/197 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 34/123 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 123 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1919 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/197 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 34/123 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 109/232 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 232 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3739 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 5749ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 5751ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/164 places, 110/274 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5967 ms. Remains : 87/164 places, 110/274 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), p0, (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-08
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-08 finished in 6135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 212
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 212
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 141 transition count 207
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 66 place count 126 transition count 187
Iterating global reduction 1 with 15 rules applied. Total rules applied 81 place count 126 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 126 transition count 184
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 100 place count 110 transition count 164
Iterating global reduction 2 with 16 rules applied. Total rules applied 116 place count 110 transition count 164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 122 place count 110 transition count 158
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 131 place count 101 transition count 141
Iterating global reduction 3 with 9 rules applied. Total rules applied 140 place count 101 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 146 place count 101 transition count 135
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 151 place count 96 transition count 129
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 96 transition count 129
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 160 place count 92 transition count 120
Iterating global reduction 4 with 4 rules applied. Total rules applied 164 place count 92 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 165 place count 92 transition count 119
Applied a total of 165 rules in 30 ms. Remains 92 /164 variables (removed 72) and now considering 119/274 (removed 155) transitions.
// Phase 1: matrix 119 rows 92 cols
[2024-05-21 12:20:02] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 12:20:02] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 12:20:02] [INFO ] Invariant cache hit.
[2024-05-21 12:20:02] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 12:20:02] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-05-21 12:20:02] [INFO ] Redundant transitions in 0 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-21 12:20:02] [INFO ] Invariant cache hit.
[2024-05-21 12:20:02] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/211 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 118 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 130 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2524 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/211 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 118/248 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/211 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 248 constraints, problems are : Problem set: 0 solved, 118 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 7661ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 7663ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/164 places, 119/274 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7946 ms. Remains : 92/164 places, 119/274 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-10
Product exploration explored 100000 steps with 23023 reset in 110 ms.
Product exploration explored 100000 steps with 22958 reset in 119 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 314 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9091 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3939 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22065 steps, run visited all 1 properties in 32 ms. (steps per millisecond=689 )
Probabilistic random walk after 22065 steps, saw 10069 distinct states, run finished after 32 ms. (steps per millisecond=689 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 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)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 119/119 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-21 12:20:11] [INFO ] Invariant cache hit.
[2024-05-21 12:20:11] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 12:20:11] [INFO ] Invariant cache hit.
[2024-05-21 12:20:11] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 12:20:11] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-21 12:20:11] [INFO ] Redundant transitions in 0 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-21 12:20:11] [INFO ] Invariant cache hit.
[2024-05-21 12:20:11] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/211 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 118 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 130 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2487 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/211 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 118/248 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/211 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 248 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4985 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 7592ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 7594ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7814 ms. Remains : 92/92 places, 119/119 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 314 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9137 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3948 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22065 steps, run visited all 1 properties in 30 ms. (steps per millisecond=735 )
Probabilistic random walk after 22065 steps, saw 10069 distinct states, run finished after 30 ms. (steps per millisecond=735 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23013 reset in 116 ms.
Product exploration explored 100000 steps with 22958 reset in 115 ms.
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 119/119 transitions.
Applied a total of 0 rules in 9 ms. Remains 92 /92 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-21 12:20:19] [INFO ] Invariant cache hit.
[2024-05-21 12:20:19] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 12:20:19] [INFO ] Invariant cache hit.
[2024-05-21 12:20:20] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 12:20:20] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-21 12:20:20] [INFO ] Redundant transitions in 0 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-21 12:20:20] [INFO ] Invariant cache hit.
[2024-05-21 12:20:20] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/211 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 118 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 130 constraints, problems are : Problem set: 0 solved, 118 unsolved in 2575 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/211 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 118/248 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/211 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 248 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4861 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 7559ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 7561ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7782 ms. Remains : 92/92 places, 119/119 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-10 finished in 25220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||X(G(p1))))) U G(p2)))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 142 transition count 214
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 142 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 142 transition count 211
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 127 transition count 191
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 127 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 80 place count 127 transition count 188
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 96 place count 111 transition count 167
Iterating global reduction 2 with 16 rules applied. Total rules applied 112 place count 111 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 119 place count 111 transition count 160
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 127 place count 103 transition count 145
Iterating global reduction 3 with 8 rules applied. Total rules applied 135 place count 103 transition count 145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 138 place count 103 transition count 142
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 142 place count 99 transition count 137
Iterating global reduction 4 with 4 rules applied. Total rules applied 146 place count 99 transition count 137
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 149 place count 96 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 152 place count 96 transition count 129
Applied a total of 152 rules in 9 ms. Remains 96 /164 variables (removed 68) and now considering 129/274 (removed 145) transitions.
// Phase 1: matrix 129 rows 96 cols
[2024-05-21 12:20:27] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 12:20:27] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 12:20:27] [INFO ] Invariant cache hit.
[2024-05-21 12:20:27] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 12:20:27] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-21 12:20:27] [INFO ] Invariant cache hit.
[2024-05-21 12:20:27] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/225 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 41/139 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 139 constraints, problems are : Problem set: 0 solved, 128 unsolved in 2500 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/225 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 41/139 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 128/267 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 267 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5264 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 7894ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 7896ms
Starting structural reductions in LTL mode, iteration 1 : 96/164 places, 129/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8123 ms. Remains : 96/164 places, 129/274 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-11 finished in 8406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(F(p0)) U p1)||X(F(p2)))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 142 transition count 213
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 142 transition count 213
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 142 transition count 209
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 127 transition count 186
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 127 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 80 place count 127 transition count 184
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 96 place count 111 transition count 163
Iterating global reduction 2 with 16 rules applied. Total rules applied 112 place count 111 transition count 163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 118 place count 111 transition count 157
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 127 place count 102 transition count 142
Iterating global reduction 3 with 9 rules applied. Total rules applied 136 place count 102 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 140 place count 102 transition count 138
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 146 place count 96 transition count 131
Iterating global reduction 4 with 6 rules applied. Total rules applied 152 place count 96 transition count 131
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 156 place count 92 transition count 122
Iterating global reduction 4 with 4 rules applied. Total rules applied 160 place count 92 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 162 place count 92 transition count 120
Applied a total of 162 rules in 14 ms. Remains 92 /164 variables (removed 72) and now considering 120/274 (removed 154) transitions.
// Phase 1: matrix 120 rows 92 cols
[2024-05-21 12:20:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 12:20:36] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 12:20:36] [INFO ] Invariant cache hit.
[2024-05-21 12:20:36] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 12:20:36] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-21 12:20:36] [INFO ] Invariant cache hit.
[2024-05-21 12:20:36] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/212 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 43/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 137 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2408 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/212 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 43/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 119/256 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 256 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5080 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 7593ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 7595ms
Starting structural reductions in LTL mode, iteration 1 : 92/164 places, 120/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7800 ms. Remains : 92/164 places, 120/274 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-12
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-12 finished in 7906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(!p1)||p0)))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 208
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 141 transition count 204
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 66 place count 125 transition count 180
Iterating global reduction 1 with 16 rules applied. Total rules applied 82 place count 125 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 85 place count 125 transition count 177
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 102 place count 108 transition count 156
Iterating global reduction 2 with 17 rules applied. Total rules applied 119 place count 108 transition count 156
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 125 place count 108 transition count 150
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 135 place count 98 transition count 132
Iterating global reduction 3 with 10 rules applied. Total rules applied 145 place count 98 transition count 132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 150 place count 98 transition count 127
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 155 place count 93 transition count 121
Iterating global reduction 4 with 5 rules applied. Total rules applied 160 place count 93 transition count 121
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 164 place count 89 transition count 112
Iterating global reduction 4 with 4 rules applied. Total rules applied 168 place count 89 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 169 place count 89 transition count 111
Applied a total of 169 rules in 8 ms. Remains 89 /164 variables (removed 75) and now considering 111/274 (removed 163) transitions.
// Phase 1: matrix 111 rows 89 cols
[2024-05-21 12:20:44] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 12:20:44] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 12:20:44] [INFO ] Invariant cache hit.
[2024-05-21 12:20:44] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 12:20:44] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 12:20:44] [INFO ] Invariant cache hit.
[2024-05-21 12:20:44] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1889 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4552 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6534ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6537ms
Starting structural reductions in LTL mode, iteration 1 : 89/164 places, 111/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6809 ms. Remains : 89/164 places, 111/274 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p0) p1), p1]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-15
Product exploration explored 100000 steps with 22851 reset in 160 ms.
Product exploration explored 100000 steps with 23010 reset in 178 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 301 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 115 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (9216 resets) in 122 ms. (325 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (1907 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1882 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
[2024-05-21 12:20:51] [INFO ] Invariant cache hit.
[2024-05-21 12:20:51] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/200 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 127 constraints, problems are : Problem set: 0 solved, 2 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 98 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 111/111 transitions.
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 109
Applied a total of 3 rules in 11 ms. Remains 88 /89 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 88/89 places, 109/111 transitions.
RANDOM walk for 40000 steps (9262 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1927 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1928 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18613 steps, run visited all 2 properties in 144 ms. (steps per millisecond=129 )
Probabilistic random walk after 18613 steps, saw 8891 distinct states, run finished after 145 ms. (steps per millisecond=128 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 228 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) p1), p1]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-21 12:20:52] [INFO ] Invariant cache hit.
[2024-05-21 12:20:52] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 12:20:52] [INFO ] Invariant cache hit.
[2024-05-21 12:20:52] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 12:20:52] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 12:20:52] [INFO ] Invariant cache hit.
[2024-05-21 12:20:52] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1883 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4599 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6585ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6586ms
Finished structural reductions in LTL mode , in 1 iterations and 6789 ms. Remains : 89/89 places, 111/111 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 301 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (9208 resets) in 120 ms. (330 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (1882 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1814 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
[2024-05-21 12:20:59] [INFO ] Invariant cache hit.
[2024-05-21 12:20:59] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/200 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 127 constraints, problems are : Problem set: 0 solved, 2 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 299ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 113 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 111/111 transitions.
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 109
Applied a total of 3 rules in 3 ms. Remains 88 /89 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 88/89 places, 109/111 transitions.
RANDOM walk for 40000 steps (9188 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1929 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1856 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18613 steps, run visited all 2 properties in 82 ms. (steps per millisecond=226 )
Probabilistic random walk after 18613 steps, saw 8891 distinct states, run finished after 83 ms. (steps per millisecond=224 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 187 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 22862 reset in 116 ms.
Product exploration explored 100000 steps with 22955 reset in 128 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 111/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-21 12:21:01] [INFO ] Invariant cache hit.
[2024-05-21 12:21:01] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 12:21:01] [INFO ] Invariant cache hit.
[2024-05-21 12:21:01] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 12:21:01] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 12:21:01] [INFO ] Invariant cache hit.
[2024-05-21 12:21:01] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1887 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4613 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6595ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6596ms
Finished structural reductions in LTL mode , in 1 iterations and 6773 ms. Remains : 89/89 places, 111/111 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-15 finished in 24004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||(!p0&&G(!p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(!p1)||p0)))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m09-LTLFireability-15
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) p1), p1]
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 208
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 141 transition count 204
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 66 place count 125 transition count 180
Iterating global reduction 1 with 16 rules applied. Total rules applied 82 place count 125 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 85 place count 125 transition count 177
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 102 place count 108 transition count 156
Iterating global reduction 2 with 17 rules applied. Total rules applied 119 place count 108 transition count 156
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 125 place count 108 transition count 150
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 135 place count 98 transition count 132
Iterating global reduction 3 with 10 rules applied. Total rules applied 145 place count 98 transition count 132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 150 place count 98 transition count 127
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 155 place count 93 transition count 121
Iterating global reduction 4 with 5 rules applied. Total rules applied 160 place count 93 transition count 121
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 164 place count 89 transition count 112
Iterating global reduction 4 with 4 rules applied. Total rules applied 168 place count 89 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 169 place count 89 transition count 111
Applied a total of 169 rules in 18 ms. Remains 89 /164 variables (removed 75) and now considering 111/274 (removed 163) transitions.
[2024-05-21 12:21:08] [INFO ] Invariant cache hit.
[2024-05-21 12:21:08] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 12:21:08] [INFO ] Invariant cache hit.
[2024-05-21 12:21:08] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 12:21:08] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 12:21:08] [INFO ] Invariant cache hit.
[2024-05-21 12:21:08] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1887 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4564 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6557ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6559ms
Starting structural reductions in LI_LTL mode, iteration 1 : 89/164 places, 111/274 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6759 ms. Remains : 89/164 places, 111/274 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-15
Product exploration explored 100000 steps with 23051 reset in 115 ms.
Product exploration explored 100000 steps with 22912 reset in 114 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 301 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 177 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (9271 resets) in 129 ms. (307 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (1912 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1867 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
[2024-05-21 12:21:15] [INFO ] Invariant cache hit.
[2024-05-21 12:21:15] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/200 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 127 constraints, problems are : Problem set: 0 solved, 2 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 277ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 102 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 111/111 transitions.
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 109
Applied a total of 3 rules in 3 ms. Remains 88 /89 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 88/89 places, 109/111 transitions.
RANDOM walk for 40000 steps (9197 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1886 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1917 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18613 steps, run visited all 2 properties in 78 ms. (steps per millisecond=238 )
Probabilistic random walk after 18613 steps, saw 8891 distinct states, run finished after 78 ms. (steps per millisecond=238 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 212 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 102 ms :[true, (AND (NOT p0) p1), p1]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-21 12:21:16] [INFO ] Invariant cache hit.
[2024-05-21 12:21:16] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 12:21:16] [INFO ] Invariant cache hit.
[2024-05-21 12:21:16] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 12:21:17] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 12:21:17] [INFO ] Invariant cache hit.
[2024-05-21 12:21:17] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1861 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4534 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6508ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6510ms
Finished structural reductions in LTL mode , in 1 iterations and 6683 ms. Remains : 89/89 places, 111/111 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 301 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (9191 resets) in 118 ms. (336 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (1857 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1914 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
[2024-05-21 12:21:23] [INFO ] Invariant cache hit.
[2024-05-21 12:21:23] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/200 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 2 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 86/149 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 47/196 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 23/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/200 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/200 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 127 constraints, problems are : Problem set: 0 solved, 2 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 295ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 78 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 111/111 transitions.
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 109
Applied a total of 3 rules in 3 ms. Remains 88 /89 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 88/89 places, 109/111 transitions.
RANDOM walk for 40000 steps (9153 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1861 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1910 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18613 steps, run visited all 2 properties in 59 ms. (steps per millisecond=315 )
Probabilistic random walk after 18613 steps, saw 8891 distinct states, run finished after 59 ms. (steps per millisecond=315 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 267 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 106 ms :[true, (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 22994 reset in 130 ms.
Product exploration explored 100000 steps with 22943 reset in 119 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 111/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-21 12:21:25] [INFO ] Invariant cache hit.
[2024-05-21 12:21:25] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 12:21:25] [INFO ] Invariant cache hit.
[2024-05-21 12:21:25] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 12:21:25] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 12:21:25] [INFO ] Invariant cache hit.
[2024-05-21 12:21:25] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1915 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4620 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6654ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6655ms
Finished structural reductions in LTL mode , in 1 iterations and 6845 ms. Remains : 89/89 places, 111/111 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-15 finished in 23887 ms.
[2024-05-21 12:21:32] [INFO ] Flatten gal took : 16 ms
[2024-05-21 12:21:32] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 12:21:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 164 places, 274 transitions and 1076 arcs took 3 ms.
Total runtime 230016 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d1m09

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 164
TRANSITIONS: 274
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1745
MODEL NAME: /home/mcc/execution/412/model
164 places, 274 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d1m09"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is DBSingleClientW-PT-d1m09, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624187900532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;