Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r091-tall-171624187800492.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DBSingleClientW-PT-d1m04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187800492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 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-d1m04-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716289372265

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:02:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 11:02:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:02:53] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-21 11:02:53] [INFO ] Transformed 1440 places.
[2024-05-21 11:02:53] [INFO ] Transformed 672 transitions.
[2024-05-21 11:02:53] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 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 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 183 place count 244 transition count 407
Iterating global reduction 1 with 82 rules applied. Total rules applied 265 place count 244 transition count 407
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 277 place count 244 transition count 395
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 339 place count 182 transition count 333
Iterating global reduction 2 with 62 rules applied. Total rules applied 401 place count 182 transition count 333
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 404 place count 182 transition count 330
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 436 place count 150 transition count 282
Iterating global reduction 3 with 32 rules applied. Total rules applied 468 place count 150 transition count 282
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 3 with 26 rules applied. Total rules applied 494 place count 150 transition count 256
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 497 place count 147 transition count 252
Iterating global reduction 4 with 3 rules applied. Total rules applied 500 place count 147 transition count 252
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 502 place count 145 transition count 250
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 145 transition count 250
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 506 place count 143 transition count 248
Iterating global reduction 4 with 2 rules applied. Total rules applied 508 place count 143 transition count 248
Applied a total of 508 rules in 83 ms. Remains 143 /347 variables (removed 204) and now considering 248/672 (removed 424) transitions.
// Phase 1: matrix 248 rows 143 cols
[2024-05-21 11:02:54] [INFO ] Computed 2 invariants in 21 ms
[2024-05-21 11:02:54] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-21 11:02:54] [INFO ] Invariant cache hit.
[2024-05-21 11:02:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-21 11:02:54] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-21 11:02:54] [INFO ] Invariant cache hit.
[2024-05-21 11:02:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/391 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 120/265 constraints. Problems are: Problem set: 0 solved, 247 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 0/391 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 265 constraints, problems are : Problem set: 0 solved, 247 unsolved in 10175 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/391 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 120/265 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 247/512 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 8 (OVERLAPS) 0/391 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 512 constraints, problems are : Problem set: 0 solved, 247 unsolved in 20695 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
After SMT, in 31432ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 31448ms
Starting structural reductions in LTL mode, iteration 1 : 143/347 places, 248/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32256 ms. Remains : 143/347 places, 248/672 transitions.
Support contains 32 out of 143 places after structural reductions.
[2024-05-21 11:03:26] [INFO ] Flatten gal took : 45 ms
[2024-05-21 11:03:26] [INFO ] Flatten gal took : 24 ms
[2024-05-21 11:03:26] [INFO ] Input system was already deterministic with 248 transitions.
Reduction of identical properties reduced properties to check from 28 to 24
RANDOM walk for 40000 steps (9107 resets) in 2501 ms. (15 steps per ms) remains 18/24 properties
BEST_FIRST walk for 4002 steps (365 resets) in 102 ms. (38 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (185 resets) in 49 ms. (80 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (174 resets) in 57 ms. (69 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (187 resets) in 32 ms. (121 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (194 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (386 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (182 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (186 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (197 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (618 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (179 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (197 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (169 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (413 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (200 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (800 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (181 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
[2024-05-21 11:03:27] [INFO ] Invariant cache hit.
[2024-05-21 11:03:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 48/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 36/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 208/317 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 80/191 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 8 (OVERLAPS) 74/391 variables, 34/225 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 40/265 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/391 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 265 constraints, problems are : Problem set: 1 solved, 16 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 48/71 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 36/107 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-05-21 11:03:28] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 203/310 variables, 107/110 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 75/185 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-05-21 11:03:28] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-21 11:03:28] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-21 11:03:28] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 11:03:28] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 5 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-21 11:03:29] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 20/205 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-05-21 11:03:30] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 11:03:30] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 2/207 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 81/391 variables, 36/243 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 45/288 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/391 variables, 16/304 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/391 variables, 0/304 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 0/391 variables, 0/304 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 304 constraints, problems are : Problem set: 1 solved, 16 unsolved in 3839 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 16/17 constraints, Known Traps: 23/23 constraints]
After SMT, in 4800ms problems are : Problem set: 1 solved, 16 unsolved
Parikh walk visited 2 properties in 3498 ms.
Support contains 21 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 228
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 228
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 133 transition count 224
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 133 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 129 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 129 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 129 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 127 transition count 213
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 127 transition count 213
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 126 transition count 212
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 126 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 38 place count 126 transition count 210
Applied a total of 38 rules in 37 ms. Remains 126 /143 variables (removed 17) and now considering 210/248 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 126/143 places, 210/248 transitions.
RANDOM walk for 40000 steps (9140 resets) in 341 ms. (116 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3962 resets) in 141 ms. (281 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1932 resets) in 109 ms. (363 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1882 resets) in 119 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1893 resets) in 85 ms. (465 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1850 resets) in 109 ms. (363 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3875 resets) in 131 ms. (303 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1943 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1906 resets) in 113 ms. (350 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (6158 resets) in 181 ms. (219 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1892 resets) in 86 ms. (459 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1903 resets) in 103 ms. (384 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (3979 resets) in 159 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1944 resets) in 80 ms. (493 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 194 ms. (205 steps per ms) remains 14/14 properties
Finished probabilistic random walk after 5417 steps, run visited all 14 properties in 48 ms. (steps per millisecond=112 )
Probabilistic random walk after 5417 steps, saw 2493 distinct states, run finished after 55 ms. (steps per millisecond=98 ) properties seen :14
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 23 stable transitions
Graph (complete) has 534 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 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(!p1)||(!p1&&F(!p2))||p0)))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 124 transition count 183
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 124 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 124 transition count 180
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 54 place count 111 transition count 167
Iterating global reduction 1 with 13 rules applied. Total rules applied 67 place count 111 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 71 place count 111 transition count 163
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 82 place count 100 transition count 138
Iterating global reduction 2 with 11 rules applied. Total rules applied 93 place count 100 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 96 place count 100 transition count 135
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 104 place count 92 transition count 121
Iterating global reduction 3 with 8 rules applied. Total rules applied 112 place count 92 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 114 place count 92 transition count 119
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 119 place count 87 transition count 114
Iterating global reduction 4 with 5 rules applied. Total rules applied 124 place count 87 transition count 114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 129 place count 87 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 130 place count 86 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 131 place count 86 transition count 108
Applied a total of 131 rules in 12 ms. Remains 86 /143 variables (removed 57) and now considering 108/248 (removed 140) transitions.
// Phase 1: matrix 108 rows 86 cols
[2024-05-21 11:03:37] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 11:03:37] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 11:03:37] [INFO ] Invariant cache hit.
[2024-05-21 11:03:37] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 11:03:37] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-21 11:03:37] [INFO ] Invariant cache hit.
[2024-05-21 11:03:37] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/194 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 120 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/194 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 107/227 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 227 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 6353ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 6354ms
Starting structural reductions in LTL mode, iteration 1 : 86/143 places, 108/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6547 ms. Remains : 86/143 places, 108/248 transitions.
Stuttering acceptance computed with spot in 299 ms :[true, p2, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 17 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-00 finished in 7395 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((X(X(F(p0)))&&G(p1)))))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 124 transition count 180
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 124 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 124 transition count 177
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 112 transition count 165
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 112 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 112 transition count 161
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 79 place count 102 transition count 141
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 102 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 93 place count 102 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 99 place count 96 transition count 126
Iterating global reduction 3 with 6 rules applied. Total rules applied 105 place count 96 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 96 transition count 125
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 110 place count 92 transition count 121
Iterating global reduction 4 with 4 rules applied. Total rules applied 114 place count 92 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 117 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 118 place count 91 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 119 place count 91 transition count 117
Applied a total of 119 rules in 11 ms. Remains 91 /143 variables (removed 52) and now considering 117/248 (removed 131) transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-21 11:03:44] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:03:44] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 11:03:44] [INFO ] Invariant cache hit.
[2024-05-21 11:03:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 11:03:44] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-21 11:03:44] [INFO ] Invariant cache hit.
[2024-05-21 11:03:44] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/208 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 36/129 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 129 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2376 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/208 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 36/129 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 116/245 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 245 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4518 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 7010ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7011ms
Starting structural reductions in LTL mode, iteration 1 : 91/143 places, 117/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7348 ms. Remains : 91/143 places, 117/248 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-01 finished in 7638 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((p0||X(X(G(p0))))))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 124 transition count 184
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 124 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 124 transition count 181
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 54 place count 111 transition count 168
Iterating global reduction 1 with 13 rules applied. Total rules applied 67 place count 111 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 71 place count 111 transition count 164
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 82 place count 100 transition count 139
Iterating global reduction 2 with 11 rules applied. Total rules applied 93 place count 100 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 97 place count 100 transition count 135
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 104 place count 93 transition count 125
Iterating global reduction 3 with 7 rules applied. Total rules applied 111 place count 93 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 93 transition count 123
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 117 place count 89 transition count 119
Iterating global reduction 4 with 4 rules applied. Total rules applied 121 place count 89 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 126 place count 89 transition count 114
Applied a total of 126 rules in 11 ms. Remains 89 /143 variables (removed 54) and now considering 114/248 (removed 134) transitions.
// Phase 1: matrix 114 rows 89 cols
[2024-05-21 11:03:52] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:03:52] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 11:03:52] [INFO ] Invariant cache hit.
[2024-05-21 11:03:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 11:03:52] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-21 11:03:52] [INFO ] Invariant cache hit.
[2024-05-21 11:03:52] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 38/129 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-21 11:03:53] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 130 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2736 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 114/203 variables, 89/92 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 113/243 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/203 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 243 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4513 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 1/1 constraints]
After SMT, in 7368ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 7370ms
Starting structural reductions in LTL mode, iteration 1 : 89/143 places, 114/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7609 ms. Remains : 89/143 places, 114/248 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-02 finished in 7802 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((p0||X(F(p1)))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 125 transition count 186
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 125 transition count 186
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 125 transition count 181
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 113 transition count 169
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 113 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 113 transition count 166
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 78 place count 103 transition count 148
Iterating global reduction 2 with 10 rules applied. Total rules applied 88 place count 103 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 92 place count 103 transition count 144
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 99 place count 96 transition count 131
Iterating global reduction 3 with 7 rules applied. Total rules applied 106 place count 96 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 110 place count 96 transition count 127
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 114 place count 92 transition count 123
Iterating global reduction 4 with 4 rules applied. Total rules applied 118 place count 92 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 122 place count 92 transition count 119
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 123 place count 91 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 91 transition count 118
Applied a total of 124 rules in 24 ms. Remains 91 /143 variables (removed 52) and now considering 118/248 (removed 130) transitions.
// Phase 1: matrix 118 rows 91 cols
[2024-05-21 11:03:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:03:59] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 11:03:59] [INFO ] Invariant cache hit.
[2024-05-21 11:03:59] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:04:00] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-21 11:04:00] [INFO ] Redundant transitions in 3 ms returned []
Running 117 sub problems to find dead transitions.
[2024-05-21 11:04:00] [INFO ] Invariant cache hit.
[2024-05-21 11:04:00] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/209 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 41/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-21 11:04:01] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 135 constraints, problems are : Problem set: 0 solved, 117 unsolved in 3062 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 118/209 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 41/135 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 117/252 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 252 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4594 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 1/1 constraints]
After SMT, in 7771ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7772ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/143 places, 118/248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8011 ms. Remains : 91/143 places, 118/248 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-05 finished in 8123 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)&&F((G(p1)||G(p0))))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 126 transition count 190
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 126 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 126 transition count 187
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 115 transition count 176
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 115 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 115 transition count 175
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 69 place count 106 transition count 154
Iterating global reduction 2 with 9 rules applied. Total rules applied 78 place count 106 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 106 transition count 151
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 86 place count 101 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 91 place count 101 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 97 transition count 138
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 97 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 97 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 96 transition count 133
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 96 transition count 133
Applied a total of 105 rules in 30 ms. Remains 96 /143 variables (removed 47) and now considering 133/248 (removed 115) transitions.
// Phase 1: matrix 133 rows 96 cols
[2024-05-21 11:04:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:04:08] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 11:04:08] [INFO ] Invariant cache hit.
[2024-05-21 11:04:08] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-21 11:04:08] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-21 11:04:08] [INFO ] Redundant transitions in 4 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-21 11:04:08] [INFO ] Invariant cache hit.
[2024-05-21 11:04:08] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/229 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 50/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 148 constraints, problems are : Problem set: 0 solved, 132 unsolved in 2821 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/229 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 50/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 132/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 280 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5624 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 8564ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 8566ms
Starting structural reductions in SI_LTL mode, iteration 1 : 96/143 places, 133/248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8810 ms. Remains : 96/143 places, 133/248 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-06
Product exploration explored 100000 steps with 23116 reset in 219 ms.
Product exploration explored 100000 steps with 22991 reset in 193 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 334 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 118 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (9245 resets) in 598 ms. (66 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1926 resets) in 241 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1897 resets) in 253 ms. (157 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1855 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1906 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1926 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1864 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
Probably explored full state space saw : 12248 states, properties seen :5
Probabilistic random walk after 29880 steps, saw 12248 distinct states, run finished after 101 ms. (steps per millisecond=295 ) properties seen :5
Explored full state space saw : 12310 states, properties seen :0
Exhaustive walk after 30001 steps, saw 12310 distinct states, run finished after 39 ms. (steps per millisecond=769 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 384 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-21 11:04:18] [INFO ] Invariant cache hit.
[2024-05-21 11:04:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 11:04:18] [INFO ] Invariant cache hit.
[2024-05-21 11:04:19] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-21 11:04:19] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-21 11:04:19] [INFO ] Redundant transitions in 7 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-21 11:04:19] [INFO ] Invariant cache hit.
[2024-05-21 11:04:19] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/229 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 50/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 148 constraints, problems are : Problem set: 0 solved, 132 unsolved in 2856 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/229 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 50/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 132/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 280 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5893 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 8894ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 8895ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9101 ms. Remains : 96/96 places, 133/133 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 334 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 138 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (9174 resets) in 288 ms. (138 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1951 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1964 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1853 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1924 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1888 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1925 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
Probably explored full state space saw : 12248 states, properties seen :5
Probabilistic random walk after 29880 steps, saw 12248 distinct states, run finished after 86 ms. (steps per millisecond=347 ) properties seen :5
Explored full state space saw : 12310 states, properties seen :0
Exhaustive walk after 30001 steps, saw 12310 distinct states, run finished after 36 ms. (steps per millisecond=833 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 362 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 23081 reset in 128 ms.
Product exploration explored 100000 steps with 22952 reset in 144 ms.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 133/133 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2024-05-21 11:04:29] [INFO ] Invariant cache hit.
[2024-05-21 11:04:29] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 11:04:29] [INFO ] Invariant cache hit.
[2024-05-21 11:04:29] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-21 11:04:30] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-21 11:04:30] [INFO ] Redundant transitions in 4 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-21 11:04:30] [INFO ] Invariant cache hit.
[2024-05-21 11:04:30] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/229 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 50/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 148 constraints, problems are : Problem set: 0 solved, 132 unsolved in 2945 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/229 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 50/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 132/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 280 constraints, problems are : Problem set: 0 solved, 132 unsolved in 5829 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 8889ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 8891ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9119 ms. Remains : 96/96 places, 133/133 transitions.
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-06 finished in 31064 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(p0))&&G(p1))))'
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 126 transition count 193
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 126 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 126 transition count 189
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 50 place count 114 transition count 177
Iterating global reduction 1 with 12 rules applied. Total rules applied 62 place count 114 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 66 place count 114 transition count 173
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 76 place count 104 transition count 151
Iterating global reduction 2 with 10 rules applied. Total rules applied 86 place count 104 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 89 place count 104 transition count 148
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 95 place count 98 transition count 136
Iterating global reduction 3 with 6 rules applied. Total rules applied 101 place count 98 transition count 136
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 107 place count 98 transition count 130
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 95 transition count 127
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 95 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 115 place count 95 transition count 125
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 116 place count 94 transition count 124
Iterating global reduction 5 with 1 rules applied. Total rules applied 117 place count 94 transition count 124
Applied a total of 117 rules in 6 ms. Remains 94 /143 variables (removed 49) and now considering 124/248 (removed 124) transitions.
// Phase 1: matrix 124 rows 94 cols
[2024-05-21 11:04:39] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 11:04:39] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 11:04:39] [INFO ] Invariant cache hit.
[2024-05-21 11:04:39] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 11:04:39] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-21 11:04:39] [INFO ] Invariant cache hit.
[2024-05-21 11:04:39] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/218 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 43/139 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-21 11:04:40] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-21 11:04:42] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/218 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/218 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 141 constraints, problems are : Problem set: 0 solved, 123 unsolved in 4844 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 124/218 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 43/141 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 123/264 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/218 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 264 constraints, problems are : Problem set: 0 solved, 123 unsolved in 5274 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 2/2 constraints]
After SMT, in 10219ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 10222ms
Starting structural reductions in LTL mode, iteration 1 : 94/143 places, 124/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10483 ms. Remains : 94/143 places, 124/248 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-07 finished in 10632 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 U G(p1))||G(F(p2)))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 125 transition count 181
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 125 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 125 transition count 178
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 112 transition count 165
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 112 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 112 transition count 161
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 80 place count 101 transition count 136
Iterating global reduction 2 with 11 rules applied. Total rules applied 91 place count 101 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 95 place count 101 transition count 132
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 102 place count 94 transition count 120
Iterating global reduction 3 with 7 rules applied. Total rules applied 109 place count 94 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 94 transition count 118
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 116 place count 89 transition count 113
Iterating global reduction 4 with 5 rules applied. Total rules applied 121 place count 89 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 125 place count 89 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 88 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 88 transition count 108
Applied a total of 127 rules in 61 ms. Remains 88 /143 variables (removed 55) and now considering 108/248 (removed 140) transitions.
// Phase 1: matrix 108 rows 88 cols
[2024-05-21 11:04:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:04:49] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 11:04:49] [INFO ] Invariant cache hit.
[2024-05-21 11:04:49] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 11:04:49] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-21 11:04:49] [INFO ] Redundant transitions in 1 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-21 11:04:49] [INFO ] Invariant cache hit.
[2024-05-21 11:04:49] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/196 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 34/124 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-21 11:04:51] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 125 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2686 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 108/196 variables, 88/91 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 34/125 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 107/232 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 232 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4092 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 1/1 constraints]
After SMT, in 6861ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 6862ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/143 places, 108/248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7140 ms. Remains : 88/143 places, 108/248 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-08
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-08 finished in 7225 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' '!((!p0 U ((p1 U p2)&&F(p0))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 125 transition count 186
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 125 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 125 transition count 182
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 53 place count 112 transition count 169
Iterating global reduction 1 with 13 rules applied. Total rules applied 66 place count 112 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 70 place count 112 transition count 165
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 79 place count 103 transition count 149
Iterating global reduction 2 with 9 rules applied. Total rules applied 88 place count 103 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 103 transition count 147
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 96 place count 97 transition count 135
Iterating global reduction 3 with 6 rules applied. Total rules applied 102 place count 97 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 106 place count 97 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 109 place count 94 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 112 place count 94 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 114 place count 94 transition count 126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 115 place count 93 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 116 place count 93 transition count 125
Applied a total of 116 rules in 32 ms. Remains 93 /143 variables (removed 50) and now considering 125/248 (removed 123) transitions.
// Phase 1: matrix 125 rows 93 cols
[2024-05-21 11:04:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:04:56] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 11:04:56] [INFO ] Invariant cache hit.
[2024-05-21 11:04:57] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 11:04:57] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-21 11:04:57] [INFO ] Redundant transitions in 1 ms returned []
Running 124 sub problems to find dead transitions.
[2024-05-21 11:04:57] [INFO ] Invariant cache hit.
[2024-05-21 11:04:57] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/218 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 44/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 139 constraints, problems are : Problem set: 0 solved, 124 unsolved in 2483 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 44/44 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/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/218 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 44/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 124/263 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 263 constraints, problems are : Problem set: 0 solved, 124 unsolved in 5070 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
After SMT, in 7679ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 7680ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/143 places, 125/248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7912 ms. Remains : 93/143 places, 125/248 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-09
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-09 finished in 8066 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 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 124 transition count 180
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 124 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 124 transition count 177
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 110 transition count 163
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 110 transition count 163
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 73 place count 110 transition count 159
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 84 place count 99 transition count 135
Iterating global reduction 2 with 11 rules applied. Total rules applied 95 place count 99 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 99 place count 99 transition count 131
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 106 place count 92 transition count 118
Iterating global reduction 3 with 7 rules applied. Total rules applied 113 place count 92 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 92 transition count 116
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 119 place count 88 transition count 112
Iterating global reduction 4 with 4 rules applied. Total rules applied 123 place count 88 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 127 place count 88 transition count 108
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 128 place count 87 transition count 107
Iterating global reduction 5 with 1 rules applied. Total rules applied 129 place count 87 transition count 107
Applied a total of 129 rules in 8 ms. Remains 87 /143 variables (removed 56) and now considering 107/248 (removed 141) transitions.
// Phase 1: matrix 107 rows 87 cols
[2024-05-21 11:05:04] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 11:05:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 11:05:05] [INFO ] Invariant cache hit.
[2024-05-21 11:05:05] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 11:05:05] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-21 11:05:05] [INFO ] Invariant cache hit.
[2024-05-21 11:05:05] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/194 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 121 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/194 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 106/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 227 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3995 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 6214ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 6216ms
Starting structural reductions in LTL mode, iteration 1 : 87/143 places, 107/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6425 ms. Remains : 87/143 places, 107/248 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-10 finished in 6563 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(p0)))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 124 transition count 186
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 124 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 124 transition count 182
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 110 transition count 168
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 110 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 110 transition count 164
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 86 place count 98 transition count 138
Iterating global reduction 2 with 12 rules applied. Total rules applied 98 place count 98 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 102 place count 98 transition count 134
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 110 place count 90 transition count 120
Iterating global reduction 3 with 8 rules applied. Total rules applied 118 place count 90 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 90 transition count 118
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 125 place count 85 transition count 113
Iterating global reduction 4 with 5 rules applied. Total rules applied 130 place count 85 transition count 113
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 135 place count 85 transition count 108
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 84 transition count 107
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 84 transition count 107
Applied a total of 137 rules in 10 ms. Remains 84 /143 variables (removed 59) and now considering 107/248 (removed 141) transitions.
// Phase 1: matrix 107 rows 84 cols
[2024-05-21 11:05:11] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 11:05:11] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 11:05:11] [INFO ] Invariant cache hit.
[2024-05-21 11:05:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:05:11] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-21 11:05:11] [INFO ] Redundant transitions in 1 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-21 11:05:11] [INFO ] Invariant cache hit.
[2024-05-21 11:05:11] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 11:05:13] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/191 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 124 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3565 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/191 variables, 84/87 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 37/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 106/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 230 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3955 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 1/1 constraints]
After SMT, in 7600ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 7601ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/143 places, 107/248 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7803 ms. Remains : 84/143 places, 107/248 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-11
Product exploration explored 100000 steps with 22974 reset in 106 ms.
Product exploration explored 100000 steps with 22883 reset in 112 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 285 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9230 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1899 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10420 steps, run visited all 1 properties in 17 ms. (steps per millisecond=612 )
Probabilistic random walk after 10420 steps, saw 4750 distinct states, run finished after 17 ms. (steps per millisecond=612 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-21 11:05:19] [INFO ] Invariant cache hit.
[2024-05-21 11:05:20] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 11:05:20] [INFO ] Invariant cache hit.
[2024-05-21 11:05:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:05:20] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-21 11:05:20] [INFO ] Redundant transitions in 0 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-21 11:05:20] [INFO ] Invariant cache hit.
[2024-05-21 11:05:20] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 11:05:22] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/191 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 124 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3511 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/191 variables, 84/87 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 37/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 106/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 230 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3951 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 1/1 constraints]
After SMT, in 7556ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 7557ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7779 ms. Remains : 84/84 places, 107/107 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 285 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9217 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1867 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10420 steps, run visited all 1 properties in 18 ms. (steps per millisecond=578 )
Probabilistic random walk after 10420 steps, saw 4750 distinct states, run finished after 18 ms. (steps per millisecond=578 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23073 reset in 107 ms.
Product exploration explored 100000 steps with 23013 reset in 114 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-21 11:05:28] [INFO ] Invariant cache hit.
[2024-05-21 11:05:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 11:05:28] [INFO ] Invariant cache hit.
[2024-05-21 11:05:28] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:05:28] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-21 11:05:28] [INFO ] Redundant transitions in 1 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-21 11:05:28] [INFO ] Invariant cache hit.
[2024-05-21 11:05:28] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 11:05:30] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/191 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 124 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3523 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/191 variables, 84/87 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 37/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 106/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 230 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3850 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 1/1 constraints]
After SMT, in 7450ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 7451ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7678 ms. Remains : 84/84 places, 107/107 transitions.
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-11 finished in 24519 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((F(p1)&&F(p2)))||p0)))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 123 transition count 179
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 123 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 123 transition count 176
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 57 place count 109 transition count 162
Iterating global reduction 1 with 14 rules applied. Total rules applied 71 place count 109 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 75 place count 109 transition count 158
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 86 place count 98 transition count 134
Iterating global reduction 2 with 11 rules applied. Total rules applied 97 place count 98 transition count 134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 98 transition count 130
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 108 place count 91 transition count 118
Iterating global reduction 3 with 7 rules applied. Total rules applied 115 place count 91 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 91 transition count 117
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 121 place count 86 transition count 112
Iterating global reduction 4 with 5 rules applied. Total rules applied 126 place count 86 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 131 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 85 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 85 transition count 106
Applied a total of 133 rules in 4 ms. Remains 85 /143 variables (removed 58) and now considering 106/248 (removed 142) transitions.
// Phase 1: matrix 106 rows 85 cols
[2024-05-21 11:05:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:05:36] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 11:05:36] [INFO ] Invariant cache hit.
[2024-05-21 11:05:36] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 11:05:36] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-21 11:05:36] [INFO ] Invariant cache hit.
[2024-05-21 11:05:36] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/191 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 34/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 11:05:37] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 122 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2630 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/191 variables, 85/88 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 34/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 105/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 227 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3849 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints]
After SMT, in 6554ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 6556ms
Starting structural reductions in LTL mode, iteration 1 : 85/143 places, 106/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6755 ms. Remains : 85/143 places, 106/248 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 288 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 12 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-12 finished in 7234 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(X((p0 U ((p1 U G(p0))&&G(p1)))))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 248/248 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 125 transition count 183
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 125 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 125 transition count 181
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 111 transition count 167
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 111 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 70 place count 111 transition count 163
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 82 place count 99 transition count 137
Iterating global reduction 2 with 12 rules applied. Total rules applied 94 place count 99 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 98 place count 99 transition count 133
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 106 place count 91 transition count 119
Iterating global reduction 3 with 8 rules applied. Total rules applied 114 place count 91 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 116 place count 91 transition count 117
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 121 place count 86 transition count 112
Iterating global reduction 4 with 5 rules applied. Total rules applied 126 place count 86 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 131 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 85 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 85 transition count 106
Applied a total of 133 rules in 9 ms. Remains 85 /143 variables (removed 58) and now considering 106/248 (removed 142) transitions.
// Phase 1: matrix 106 rows 85 cols
[2024-05-21 11:05:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:05:43] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 11:05:43] [INFO ] Invariant cache hit.
[2024-05-21 11:05:43] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 11:05:43] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-21 11:05:43] [INFO ] Invariant cache hit.
[2024-05-21 11:05:43] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/191 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/123 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-21 11:05:44] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-21 11:05:44] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 2 ms to minimize.
[2024-05-21 11:05:44] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 126 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2604 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 106/191 variables, 85/90 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 105/231 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 231 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3651 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 3/3 constraints]
After SMT, in 6343ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 6344ms
Starting structural reductions in LTL mode, iteration 1 : 85/143 places, 106/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6553 ms. Remains : 85/143 places, 106/248 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (AND p0 (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m04-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m04-LTLFireability-13 finished in 6849 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)&&F((G(p1)||G(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' '!(F(G(p0)))'
[2024-05-21 11:05:50] [INFO ] Flatten gal took : 15 ms
[2024-05-21 11:05:50] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-21 11:05:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 143 places, 248 transitions and 974 arcs took 6 ms.
Total runtime 177074 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d1m04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 143
TRANSITIONS: 248
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.003s]


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


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

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

Process ID: 1346
MODEL NAME: /home/mcc/execution/406/model
143 places, 248 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m04-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716289554629

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d1m04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DBSingleClientW-PT-d1m04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624187800492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.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 ;