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.r480-tall-171624189500532.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 ltsminxred
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 r480-tall-171624189500532
=====================================================================

--------------------
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 1717189825739

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:10:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:10:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:10:27] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-05-31 21:10:27] [INFO ] Transformed 1440 places.
[2024-05-31 21:10:27] [INFO ] Transformed 672 transitions.
[2024-05-31 21:10:27] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 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 92 ms. Remains 164 /347 variables (removed 183) and now considering 274/672 (removed 398) transitions.
// Phase 1: matrix 274 rows 164 cols
[2024-05-31 21:10:27] [INFO ] Computed 2 invariants in 21 ms
[2024-05-31 21:10:28] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-31 21:10:28] [INFO ] Invariant cache hit.
[2024-05-31 21:10:28] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-31 21:10:28] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2024-05-31 21:10:28] [INFO ] Invariant cache hit.
[2024-05-31 21:10:28] [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 10854 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 22667 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 34219ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 34244ms
Starting structural reductions in LTL mode, iteration 1 : 164/347 places, 274/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35088 ms. Remains : 164/347 places, 274/672 transitions.
Support contains 34 out of 164 places after structural reductions.
[2024-05-31 21:11:02] [INFO ] Flatten gal took : 51 ms
[2024-05-31 21:11:02] [INFO ] Flatten gal took : 23 ms
[2024-05-31 21:11:02] [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 (9231 resets) in 2608 ms. (15 steps per ms) remains 19/21 properties
BEST_FIRST walk for 4000 steps (167 resets) in 93 ms. (42 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (188 resets) in 67 ms. (58 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (193 resets) in 72 ms. (54 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (184 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (192 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (195 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (197 resets) in 43 ms. (90 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (199 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (212 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (363 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (416 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (376 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (406 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (199 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (182 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (191 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (198 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (194 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (181 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
[2024-05-31 21:11:03] [INFO ] Invariant cache hit.
[2024-05-31 21:11:03] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 54/82 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2024-05-31 21:11:04] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 38/120 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 218/338 variables, 120/123 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 67/190 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 18 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, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 55/288 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 2/438 variables, 1/289 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 1/290 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 0/290 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/438 variables, 0/290 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 290 constraints, problems are : Problem set: 1 solved, 18 unsolved in 1733 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: 19/19 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 56/80 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 39/119 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 218/337 variables, 119/121 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 67/188 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2024-05-31 21:11:06] [INFO ] Deduced a trap composed of 23 places in 338 ms of which 3 ms to minimize.
[2024-05-31 21:11:06] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-31 21:11:07] [INFO ] Deduced a trap composed of 25 places in 347 ms of which 17 ms to minimize.
[2024-05-31 21:11:07] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 4/192 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 99/436 variables, 44/236 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 55/291 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 18/309 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 1/310 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 2/438 variables, 1/311 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/438 variables, 1/312 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 0/312 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 0/438 variables, 0/312 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 312 constraints, problems are : Problem set: 1 solved, 18 unsolved in 4749 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/19 constraints, Known Traps: 5/5 constraints]
After SMT, in 6557ms problems are : Problem set: 1 solved, 18 unsolved
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 1 properties in 779 ms.
Support contains 23 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 155 transition count 253
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 155 transition count 253
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 155 transition count 251
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 151 transition count 245
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 151 transition count 245
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 151 transition count 243
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 149 transition count 241
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 149 transition count 241
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 147 transition count 239
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 147 transition count 239
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 145 transition count 236
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 145 transition count 236
Applied a total of 42 rules in 45 ms. Remains 145 /164 variables (removed 19) and now considering 236/274 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 145/164 places, 236/274 transitions.
RANDOM walk for 40000 steps (9193 resets) in 412 ms. (96 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (197 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (199 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (180 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (183 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (197 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (190 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (165 resets) in 13 ms. (285 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 (176 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (385 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (403 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (409 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (371 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (200 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (205 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (187 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
Finished probabilistic random walk after 7153 steps, run visited all 16 properties in 117 ms. (steps per millisecond=61 )
Probabilistic random walk after 7153 steps, saw 3274 distinct states, run finished after 122 ms. (steps per millisecond=58 ) 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.7 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 16 ms. Remains 92 /164 variables (removed 72) and now considering 120/274 (removed 154) transitions.
// Phase 1: matrix 120 rows 92 cols
[2024-05-31 21:11:12] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:11:12] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-31 21:11:12] [INFO ] Invariant cache hit.
[2024-05-31 21:11:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:11:12] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-31 21:11:12] [INFO ] Invariant cache hit.
[2024-05-31 21:11:12] [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 2426 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 4775 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 7326ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 7329ms
Starting structural reductions in LTL mode, iteration 1 : 92/164 places, 120/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7810 ms. Remains : 92/164 places, 120/274 transitions.
Stuttering acceptance computed with spot in 258 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 3 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-01 finished in 8141 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 19 ms. Remains 89 /164 variables (removed 75) and now considering 112/274 (removed 162) transitions.
// Phase 1: matrix 112 rows 89 cols
[2024-05-31 21:11:20] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:11:20] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 21:11:20] [INFO ] Invariant cache hit.
[2024-05-31 21:11:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:11:20] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-31 21:11:20] [INFO ] Invariant cache hit.
[2024-05-31 21:11:20] [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 2226 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 4468 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 6804ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 6805ms
Starting structural reductions in LTL mode, iteration 1 : 89/164 places, 112/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7038 ms. Remains : 89/164 places, 112/274 transitions.
Stuttering acceptance computed with spot in 199 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 7262 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 13 ms. Remains 93 /164 variables (removed 71) and now considering 124/274 (removed 150) transitions.
// Phase 1: matrix 124 rows 93 cols
[2024-05-31 21:11:27] [INFO ] Computed 2 invariants in 8 ms
[2024-05-31 21:11:27] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 21:11:27] [INFO ] Invariant cache hit.
[2024-05-31 21:11:27] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-31 21:11:27] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-31 21:11:27] [INFO ] Invariant cache hit.
[2024-05-31 21:11:27] [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 2345 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 5178 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 7641ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 7643ms
Starting structural reductions in LTL mode, iteration 1 : 93/164 places, 124/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7916 ms. Remains : 93/164 places, 124/274 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-04
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-04 finished in 8172 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 37 ms. Remains 89 /164 variables (removed 75) and now considering 117/274 (removed 157) transitions.
// Phase 1: matrix 117 rows 89 cols
[2024-05-31 21:11:35] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:11:35] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 21:11:35] [INFO ] Invariant cache hit.
[2024-05-31 21:11:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:11:35] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-31 21:11:35] [INFO ] Redundant transitions in 2 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-31 21:11:35] [INFO ] Invariant cache hit.
[2024-05-31 21:11:35] [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-31 21:11:37] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-31 21:11:37] [INFO ] Deduced a trap composed of 11 places in 43 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-31 21:11:38] [INFO ] Deduced a trap composed of 38 places in 46 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 4369 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 4575 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 9046ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 9047ms
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 9303 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 22929 reset in 255 ms.
Product exploration explored 100000 steps with 23004 reset in 195 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 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 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9291 resets) in 444 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1898 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4849 steps, run visited all 1 properties in 39 ms. (steps per millisecond=124 )
Probabilistic random walk after 4849 steps, saw 2265 distinct states, run finished after 39 ms. (steps per millisecond=124 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 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 7 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-31 21:11:46] [INFO ] Invariant cache hit.
[2024-05-31 21:11:46] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 21:11:46] [INFO ] Invariant cache hit.
[2024-05-31 21:11:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:11:46] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-31 21:11:46] [INFO ] Redundant transitions in 2 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-31 21:11:46] [INFO ] Invariant cache hit.
[2024-05-31 21:11:46] [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-31 21:11:47] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-31 21:11:47] [INFO ] Deduced a trap composed of 11 places in 72 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-31 21:11:49] [INFO ] Deduced a trap composed of 38 places in 761 ms of which 31 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 5196 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 4687 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 10026ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 10029ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10256 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 72 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 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9147 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1947 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4849 steps, run visited all 1 properties in 27 ms. (steps per millisecond=179 )
Probabilistic random walk after 4849 steps, saw 2265 distinct states, run finished after 27 ms. (steps per millisecond=179 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22884 reset in 127 ms.
Product exploration explored 100000 steps with 23165 reset in 133 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 4 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-31 21:11:57] [INFO ] Invariant cache hit.
[2024-05-31 21:11:57] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 21:11:57] [INFO ] Invariant cache hit.
[2024-05-31 21:11:57] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:11:57] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-31 21:11:57] [INFO ] Redundant transitions in 2 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-31 21:11:57] [INFO ] Invariant cache hit.
[2024-05-31 21:11:57] [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-31 21:11:59] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 8 ms to minimize.
[2024-05-31 21:11:59] [INFO ] Deduced a trap composed of 11 places in 64 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-31 21:12:00] [INFO ] Deduced a trap composed of 38 places in 54 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 4534 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 4818 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 9455ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 9456ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9752 ms. Remains : 89/89 places, 117/117 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-05 finished in 31423 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 24 ms. Remains 95 /164 variables (removed 69) and now considering 125/274 (removed 149) transitions.
// Phase 1: matrix 125 rows 95 cols
[2024-05-31 21:12:07] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:12:07] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-31 21:12:07] [INFO ] Invariant cache hit.
[2024-05-31 21:12:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 21:12:07] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2024-05-31 21:12:07] [INFO ] Redundant transitions in 4 ms returned []
Running 124 sub problems to find dead transitions.
[2024-05-31 21:12:07] [INFO ] Invariant cache hit.
[2024-05-31 21:12:07] [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 2546 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 5267 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 7956ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 7959ms
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 8439 ms. Remains : 95/164 places, 125/274 transitions.
Stuttering acceptance computed with spot in 138 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 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-06 finished in 8606 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 28 ms. Remains 88 /164 variables (removed 76) and now considering 110/274 (removed 164) transitions.
// Phase 1: matrix 110 rows 88 cols
[2024-05-31 21:12:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:12:15] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-31 21:12:15] [INFO ] Invariant cache hit.
[2024-05-31 21:12:15] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 21:12:16] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2024-05-31 21:12:16] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-31 21:12:16] [INFO ] Invariant cache hit.
[2024-05-31 21:12:16] [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 1996 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 4631 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 6757ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6762ms
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 7222 ms. Remains : 88/164 places, 110/274 transitions.
Stuttering acceptance computed with spot in 140 ms :[p0, p0, (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-07
Product exploration explored 100000 steps with 22973 reset in 212 ms.
Product exploration explored 100000 steps with 22969 reset in 179 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.13 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 213 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 111 ms :[p0, p0, (AND p0 p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (9131 resets) in 414 ms. (96 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1927 resets) in 302 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1857 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (3918 resets) in 145 ms. (274 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3845 resets) in 162 ms. (245 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1893 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1867 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1564695 steps, run timeout after 3001 ms. (steps per millisecond=521 ) properties seen :5 out of 6
Probabilistic random walk after 1564695 steps, saw 627025 distinct states, run finished after 3004 ms. (steps per millisecond=520 ) properties seen :5
[2024-05-31 21:12:27] [INFO ] Invariant cache hit.
[2024-05-31 21:12:27] [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 21 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 324 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 115 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 113 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 8 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-31 21:12:27] [INFO ] Invariant cache hit.
[2024-05-31 21:12:27] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 21:12:27] [INFO ] Invariant cache hit.
[2024-05-31 21:12:27] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 21:12:28] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-31 21:12:28] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-31 21:12:28] [INFO ] Invariant cache hit.
[2024-05-31 21:12:28] [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 2002 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 4595 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 6699ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6701ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6926 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.2 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 156 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 130 ms :[p0, p0, (AND p0 p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (9229 resets) in 285 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1909 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1910 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3938 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3941 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1855 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1738497 steps, run timeout after 3001 ms. (steps per millisecond=579 ) properties seen :5 out of 6
Probabilistic random walk after 1738497 steps, saw 697516 distinct states, run finished after 3001 ms. (steps per millisecond=579 ) properties seen :5
[2024-05-31 21:12:38] [INFO ] Invariant cache hit.
[2024-05-31 21:12:38] [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 47 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 59ms 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 420 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 93 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 94 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 94 ms :[p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 23008 reset in 115 ms.
Product exploration explored 100000 steps with 22925 reset in 128 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-31 21:12:39] [INFO ] Invariant cache hit.
[2024-05-31 21:12:39] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 21:12:39] [INFO ] Invariant cache hit.
[2024-05-31 21:12:39] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 21:12:39] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-31 21:12:39] [INFO ] Redundant transitions in 0 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-31 21:12:39] [INFO ] Invariant cache hit.
[2024-05-31 21:12:39] [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 1973 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 4416 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 6489ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6490ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6742 ms. Remains : 88/88 places, 110/110 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-07 finished in 30587 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 15 ms. Remains 87 /164 variables (removed 77) and now considering 110/274 (removed 164) transitions.
// Phase 1: matrix 110 rows 87 cols
[2024-05-31 21:12:46] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 21:12:46] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 21:12:46] [INFO ] Invariant cache hit.
[2024-05-31 21:12:46] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-31 21:12:46] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-31 21:12:46] [INFO ] Redundant transitions in 0 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-31 21:12:46] [INFO ] Invariant cache hit.
[2024-05-31 21:12:46] [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 2081 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 3795 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 5963ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 5965ms
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 6192 ms. Remains : 87/164 places, 110/274 transitions.
Stuttering acceptance computed with spot in 171 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 10 steps with 1 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-08 finished in 6395 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 21 ms. Remains 92 /164 variables (removed 72) and now considering 119/274 (removed 155) transitions.
// Phase 1: matrix 119 rows 92 cols
[2024-05-31 21:12:52] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:12:52] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 21:12:52] [INFO ] Invariant cache hit.
[2024-05-31 21:12:52] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:12:52] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-31 21:12:52] [INFO ] Redundant transitions in 1 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-31 21:12:52] [INFO ] Invariant cache hit.
[2024-05-31 21:12:52] [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 2723 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 4814 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 7669ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 7672ms
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 7934 ms. Remains : 92/164 places, 119/274 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-10
Product exploration explored 100000 steps with 22985 reset in 122 ms.
Product exploration explored 100000 steps with 22914 reset in 129 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 93 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 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9111 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3939 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22065 steps, run visited all 1 properties in 46 ms. (steps per millisecond=479 )
Probabilistic random walk after 22065 steps, saw 10069 distinct states, run finished after 47 ms. (steps per millisecond=469 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
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 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 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-31 21:13:01] [INFO ] Invariant cache hit.
[2024-05-31 21:13:01] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-31 21:13:01] [INFO ] Invariant cache hit.
[2024-05-31 21:13:01] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:13:01] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-05-31 21:13:01] [INFO ] Redundant transitions in 1 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-31 21:13:01] [INFO ] Invariant cache hit.
[2024-05-31 21:13:01] [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 2576 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 5032 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 7774ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 7776ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8105 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 84 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9237 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3990 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22065 steps, run visited all 1 properties in 44 ms. (steps per millisecond=501 )
Probabilistic random walk after 22065 steps, saw 10069 distinct states, run finished after 45 ms. (steps per millisecond=490 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22907 reset in 132 ms.
Product exploration explored 100000 steps with 22884 reset in 133 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 2 ms. Remains 92 /92 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-31 21:13:10] [INFO ] Invariant cache hit.
[2024-05-31 21:13:10] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 21:13:10] [INFO ] Invariant cache hit.
[2024-05-31 21:13:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:13:10] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-31 21:13:10] [INFO ] Redundant transitions in 0 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-31 21:13:10] [INFO ] Invariant cache hit.
[2024-05-31 21:13:10] [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 2746 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 5193 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 8074ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 8076ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8360 ms. Remains : 92/92 places, 119/119 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-10 finished in 26180 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 6 ms. Remains 96 /164 variables (removed 68) and now considering 129/274 (removed 145) transitions.
// Phase 1: matrix 129 rows 96 cols
[2024-05-31 21:13:18] [INFO ] Computed 2 invariants in 4 ms
[2024-05-31 21:13:18] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 21:13:18] [INFO ] Invariant cache hit.
[2024-05-31 21:13:18] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:13:19] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-31 21:13:19] [INFO ] Invariant cache hit.
[2024-05-31 21:13:19] [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 2717 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 5491 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 8366ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 8367ms
Starting structural reductions in LTL mode, iteration 1 : 96/164 places, 129/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8612 ms. Remains : 96/164 places, 129/274 transitions.
Stuttering acceptance computed with spot in 253 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 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-11 finished in 8885 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 9 ms. Remains 92 /164 variables (removed 72) and now considering 120/274 (removed 154) transitions.
// Phase 1: matrix 120 rows 92 cols
[2024-05-31 21:13:27] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 21:13:27] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 21:13:27] [INFO ] Invariant cache hit.
[2024-05-31 21:13:27] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:13:27] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-31 21:13:27] [INFO ] Invariant cache hit.
[2024-05-31 21:13: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 2555 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 5276 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 7948ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 7950ms
Starting structural reductions in LTL mode, iteration 1 : 92/164 places, 120/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8185 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 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-12 finished in 8293 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-31 21:13:35] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:13:36] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 21:13:36] [INFO ] Invariant cache hit.
[2024-05-31 21:13:36] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-31 21:13:36] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-31 21:13:36] [INFO ] Invariant cache hit.
[2024-05-31 21:13:36] [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 1996 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 4798 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 6886ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6887ms
Starting structural reductions in LTL mode, iteration 1 : 89/164 places, 111/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7116 ms. Remains : 89/164 places, 111/274 transitions.
Stuttering acceptance computed with spot in 114 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 22990 reset in 181 ms.
Product exploration explored 100000 steps with 22952 reset in 182 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 301 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.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 103 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 98 ms :[true, (AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (9168 resets) in 228 ms. (174 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (1875 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1821 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
[2024-05-31 21:13:43] [INFO ] Invariant cache hit.
[2024-05-31 21:13:43] [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 125 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 200 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 332ms 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 8 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 8 ms. Remains : 88/89 places, 109/111 transitions.
RANDOM walk for 40000 steps (9159 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1919 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1871 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18613 steps, run visited all 2 properties in 74 ms. (steps per millisecond=251 )
Probabilistic random walk after 18613 steps, saw 8891 distinct states, run finished after 74 ms. (steps per millisecond=251 ) 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 197 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 117 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 101 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 0 ms. Remains 89 /89 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-31 21:13:44] [INFO ] Invariant cache hit.
[2024-05-31 21:13:45] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 21:13:45] [INFO ] Invariant cache hit.
[2024-05-31 21:13:45] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-31 21:13:45] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-31 21:13:45] [INFO ] Invariant cache hit.
[2024-05-31 21:13:45] [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 2029 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 4881 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 7018ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 7020ms
Finished structural reductions in LTL mode , in 1 iterations and 7230 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.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 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 83 ms :[true, (AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (9153 resets) in 200 ms. (199 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (1933 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1919 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
[2024-05-31 21:13:52] [INFO ] Invariant cache hit.
[2024-05-31 21:13:52] [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 122 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 229 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 371ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 133 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 2 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 2 ms. Remains : 88/89 places, 109/111 transitions.
RANDOM walk for 40000 steps (9113 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1909 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1857 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18613 steps, run visited all 2 properties in 77 ms. (steps per millisecond=241 )
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 217 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 94 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 23113 reset in 142 ms.
Product exploration explored 100000 steps with 22978 reset in 140 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-31 21:13:54] [INFO ] Invariant cache hit.
[2024-05-31 21:13:54] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 21:13:54] [INFO ] Invariant cache hit.
[2024-05-31 21:13:54] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-31 21:13:54] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-31 21:13:54] [INFO ] Invariant cache hit.
[2024-05-31 21:13:54] [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 2058 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 4716 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 6890ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6892ms
Finished structural reductions in LTL mode , in 1 iterations and 7089 ms. Remains : 89/89 places, 111/111 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-15 finished in 25349 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 88 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 22 ms. Remains 89 /164 variables (removed 75) and now considering 111/274 (removed 163) transitions.
[2024-05-31 21:14:01] [INFO ] Invariant cache hit.
[2024-05-31 21:14:01] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-31 21:14:01] [INFO ] Invariant cache hit.
[2024-05-31 21:14:02] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-31 21:14:02] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-31 21:14:02] [INFO ] Invariant cache hit.
[2024-05-31 21:14:02] [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 2030 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 4911 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 7048ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 7051ms
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 7338 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 23142 reset in 125 ms.
Product exploration explored 100000 steps with 23007 reset in 128 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 108 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 93 ms :[true, (AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (9249 resets) in 156 ms. (254 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (1964 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1899 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
[2024-05-31 21:14:09] [INFO ] Invariant cache hit.
[2024-05-31 21:14:09] [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 140 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 190 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 345ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 142 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 (9252 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1897 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1869 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18613 steps, run visited all 2 properties in 79 ms. (steps per millisecond=235 )
Probabilistic random walk after 18613 steps, saw 8891 distinct states, run finished after 79 ms. (steps per millisecond=235 ) 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 86 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 99 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-31 21:14:10] [INFO ] Invariant cache hit.
[2024-05-31 21:14:10] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 21:14:10] [INFO ] Invariant cache hit.
[2024-05-31 21:14:10] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-31 21:14:11] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-31 21:14:11] [INFO ] Invariant cache hit.
[2024-05-31 21:14:11] [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 2049 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 4686 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 6839ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6841ms
Finished structural reductions in LTL mode , in 1 iterations and 7060 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.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 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 83 ms :[true, (AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (9160 resets) in 164 ms. (242 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (1933 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1828 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
[2024-05-31 21:14:18] [INFO ] Invariant cache hit.
[2024-05-31 21:14:18] [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 121 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 193 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 320ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 77 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 2 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 4 ms. Remains : 88/89 places, 109/111 transitions.
RANDOM walk for 40000 steps (9172 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1954 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1942 resets) in 48 ms. (816 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 82 ms. (steps per millisecond=226 ) 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 238 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 83 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 22977 reset in 125 ms.
Product exploration explored 100000 steps with 23013 reset in 134 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-31 21:14:19] [INFO ] Invariant cache hit.
[2024-05-31 21:14:19] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 21:14:19] [INFO ] Invariant cache hit.
[2024-05-31 21:14:19] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-31 21:14:19] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-31 21:14:19] [INFO ] Invariant cache hit.
[2024-05-31 21:14:19] [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 1999 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 4684 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 6798ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6800ms
Finished structural reductions in LTL mode , in 1 iterations and 7020 ms. Remains : 89/89 places, 111/111 transitions.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-15 finished in 25053 ms.
[2024-05-31 21:14:26] [INFO ] Flatten gal took : 16 ms
[2024-05-31 21:14:26] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-31 21:14:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 164 places, 274 transitions and 1076 arcs took 4 ms.
Total runtime 239678 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DBSingleClientW-PT-d1m09-LTLFireability-10
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717190257018

--------------------
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
mcc2024
ltl formula name DBSingleClientW-PT-d1m09-LTLFireability-05
ltl formula formula --ltl=/tmp/1703/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 164 places, 274 transitions and 1076 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1703/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1703/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1703/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1703/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 166 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 279 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~40 levels ~10000 states ~20684 transitions
pnml2lts-mc( 0/ 4): ~40 levels ~20000 states ~42628 transitions
pnml2lts-mc( 0/ 4): ~41 levels ~40000 states ~88120 transitions
pnml2lts-mc( 0/ 4): ~41 levels ~80000 states ~171604 transitions
pnml2lts-mc( 3/ 4): ~530 levels ~160000 states ~342008 transitions
pnml2lts-mc( 3/ 4): ~1218 levels ~320000 states ~688880 transitions
pnml2lts-mc( 3/ 4): ~1510 levels ~640000 states ~1374884 transitions
pnml2lts-mc( 3/ 4): ~3284 levels ~1280000 states ~2871972 transitions
pnml2lts-mc( 1/ 4): ~1542 levels ~2560000 states ~5979780 transitions
pnml2lts-mc( 1/ 4): ~6908 levels ~5120000 states ~12666288 transitions
pnml2lts-mc( 1/ 4): ~7850 levels ~10240000 states ~28293360 transitions
pnml2lts-mc( 1/ 4): ~22286 levels ~20480000 states ~54579960 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 27368342
pnml2lts-mc( 0/ 4): unique states count: 30485693
pnml2lts-mc( 0/ 4): unique transitions count: 85451383
pnml2lts-mc( 0/ 4): - self-loop count: 22739167
pnml2lts-mc( 0/ 4): - claim dead count: 23867171
pnml2lts-mc( 0/ 4): - claim found count: 4283774
pnml2lts-mc( 0/ 4): - claim success count: 30497298
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1051633
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 30509478 states 85605523 transitions, fanout: 2.806
pnml2lts-mc( 0/ 4): Total exploration time 106.250 sec (106.190 sec minimum, 106.215 sec on average)
pnml2lts-mc( 0/ 4): States per second: 287148, Transitions per second: 805699
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 315.5MB, 9.9 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/93.0%
pnml2lts-mc( 0/ 4): Stored 277 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 315.5MB (~256.0MB paged-in)
ltl formula name DBSingleClientW-PT-d1m09-LTLFireability-07
ltl formula formula --ltl=/tmp/1703/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 164 places, 274 transitions and 1076 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1703/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1703/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1703/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1703/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 165 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 303 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~81 levels ~10000 states ~21728 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~442!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11833
pnml2lts-mc( 0/ 4): unique states count: 14856
pnml2lts-mc( 0/ 4): unique transitions count: 52591
pnml2lts-mc( 0/ 4): - self-loop count: 21675
pnml2lts-mc( 0/ 4): - claim dead count: 7885
pnml2lts-mc( 0/ 4): - claim found count: 4775
pnml2lts-mc( 0/ 4): - claim success count: 14919
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1116
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14974 states 53542 transitions, fanout: 3.576
pnml2lts-mc( 0/ 4): Total exploration time 0.120 sec (0.120 sec minimum, 0.120 sec on average)
pnml2lts-mc( 0/ 4): States per second: 124783, Transitions per second: 446183
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 12.9 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 277 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name DBSingleClientW-PT-d1m09-LTLFireability-10
ltl formula formula --ltl=/tmp/1703/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 164 places, 274 transitions and 1076 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1703/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1703/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1703/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1703/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 166 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 279 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~79 levels ~10000 states ~20708 transitions
pnml2lts-mc( 0/ 4): ~105 levels ~20000 states ~41028 transitions
pnml2lts-mc( 0/ 4): ~144 levels ~40000 states ~82520 transitions
pnml2lts-mc( 0/ 4): ~208 levels ~80000 states ~169688 transitions
pnml2lts-mc( 0/ 4): ~508 levels ~160000 states ~342304 transitions
pnml2lts-mc( 0/ 4): ~734 levels ~320000 states ~726324 transitions
pnml2lts-mc( 0/ 4): ~1293 levels ~640000 states ~1585488 transitions
pnml2lts-mc( 0/ 4): ~1304 levels ~1280000 states ~3264024 transitions
pnml2lts-mc( 0/ 4): ~2419 levels ~2560000 states ~6497928 transitions
pnml2lts-mc( 3/ 4): ~30685 levels ~5120000 states ~12320748 transitions
pnml2lts-mc( 3/ 4): ~312119 levels ~10240000 states ~28157952 transitions
pnml2lts-mc( 3/ 4): ~778466 levels ~20480000 states ~58863464 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 17196634
pnml2lts-mc( 0/ 4): unique states count: 21387089
pnml2lts-mc( 0/ 4): unique transitions count: 60209263
pnml2lts-mc( 0/ 4): - self-loop count: 15107603
pnml2lts-mc( 0/ 4): - claim dead count: 13647923
pnml2lts-mc( 0/ 4): - claim found count: 4879279
pnml2lts-mc( 0/ 4): - claim success count: 21393306
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1467151
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21405758 states 60307447 transitions, fanout: 2.817
pnml2lts-mc( 0/ 4): Total exploration time 77.150 sec (77.130 sec minimum, 77.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 277456, Transitions per second: 781691
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 255.0MB, 10.7 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 74.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 277 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 255.0MB (~256.0MB paged-in)
ltl formula name DBSingleClientW-PT-d1m09-LTLFireability-15
ltl formula formula --ltl=/tmp/1703/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 164 places, 274 transitions and 1076 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1703/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1703/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1703/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1703/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 166 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 165, there are 285 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~40 levels ~10000 states ~29920 transitions
pnml2lts-mc( 0/ 4): ~40 levels ~20000 states ~62308 transitions
pnml2lts-mc( 0/ 4): ~41 levels ~40000 states ~120548 transitions
pnml2lts-mc( 0/ 4): ~41 levels ~80000 states ~240036 transitions
pnml2lts-mc( 0/ 4): ~41 levels ~160000 states ~492208 transitions
pnml2lts-mc( 0/ 4): ~41 levels ~320000 states ~1007272 transitions
pnml2lts-mc( 0/ 4): ~41 levels ~640000 states ~2058648 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~37916!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1102894
pnml2lts-mc( 0/ 4): unique states count: 1203914
pnml2lts-mc( 0/ 4): unique transitions count: 3863445
pnml2lts-mc( 0/ 4): - self-loop count: 1802145
pnml2lts-mc( 0/ 4): - claim dead count: 618336
pnml2lts-mc( 0/ 4): - claim found count: 108688
pnml2lts-mc( 0/ 4): - claim success count: 1203959
pnml2lts-mc( 0/ 4): - cum. max stack depth: 42079
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1203959 states 3863622 transitions, fanout: 3.209
pnml2lts-mc( 0/ 4): Total exploration time 4.740 sec (4.740 sec minimum, 4.740 sec on average)
pnml2lts-mc( 0/ 4): States per second: 254000, Transitions per second: 815110
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 12.9MB, 10.5 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 3.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 277 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 12.9MB (~256.0MB paged-in)

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="ltsminxred"
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 ltsminxred"
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 r480-tall-171624189500532"
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 ;