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-171624187900508.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-d1m06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187900508
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 12:47 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-d1m06-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716290586048

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-d1m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:23:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 11:23:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:23:07] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-05-21 11:23:07] [INFO ] Transformed 1440 places.
[2024-05-21 11:23:07] [INFO ] Transformed 672 transitions.
[2024-05-21 11:23:07] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 222 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 4 formulas.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 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 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 178 place count 249 transition count 428
Iterating global reduction 1 with 77 rules applied. Total rules applied 255 place count 249 transition count 428
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 273 place count 249 transition count 410
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 330 place count 192 transition count 353
Iterating global reduction 2 with 57 rules applied. Total rules applied 387 place count 192 transition count 353
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 390 place count 192 transition count 350
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 418 place count 164 transition count 309
Iterating global reduction 3 with 28 rules applied. Total rules applied 446 place count 164 transition count 309
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 475 place count 164 transition count 280
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 479 place count 160 transition count 273
Iterating global reduction 4 with 4 rules applied. Total rules applied 483 place count 160 transition count 273
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 489 place count 160 transition count 267
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 490 place count 159 transition count 266
Iterating global reduction 5 with 1 rules applied. Total rules applied 491 place count 159 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 492 place count 159 transition count 265
Applied a total of 492 rules in 86 ms. Remains 159 /347 variables (removed 188) and now considering 265/672 (removed 407) transitions.
// Phase 1: matrix 265 rows 159 cols
[2024-05-21 11:23:07] [INFO ] Computed 2 invariants in 21 ms
[2024-05-21 11:23:08] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-21 11:23:08] [INFO ] Invariant cache hit.
[2024-05-21 11:23:08] [INFO ] State equation strengthened by 125 read => feed constraints.
[2024-05-21 11:23:08] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2024-05-21 11:23:08] [INFO ] Invariant cache hit.
[2024-05-21 11:23:08] [INFO ] State equation strengthened by 125 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 265/424 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 125/286 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 0/424 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 286 constraints, problems are : Problem set: 0 solved, 264 unsolved in 10953 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (OVERLAPS) 265/424 variables, 159/161 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 125/286 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 264/550 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (OVERLAPS) 0/424 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 550 constraints, problems are : Problem set: 0 solved, 264 unsolved in 23962 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 159/159 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
After SMT, in 35571ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 35590ms
Starting structural reductions in LTL mode, iteration 1 : 159/347 places, 265/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36397 ms. Remains : 159/347 places, 265/672 transitions.
Support contains 29 out of 159 places after structural reductions.
[2024-05-21 11:23:44] [INFO ] Flatten gal took : 57 ms
[2024-05-21 11:23:44] [INFO ] Flatten gal took : 20 ms
[2024-05-21 11:23:44] [INFO ] Input system was already deterministic with 265 transitions.
RANDOM walk for 40000 steps (9133 resets) in 2249 ms. (17 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4000 steps (191 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (179 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (200 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (192 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (187 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (176 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (184 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (393 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (395 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (168 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (173 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (191 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (199 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (197 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (194 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (177 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (395 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (198 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (180 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (384 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (180 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 842957 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :19 out of 21
Probabilistic random walk after 842957 steps, saw 312187 distinct states, run finished after 3004 ms. (steps per millisecond=280 ) properties seen :19
[2024-05-21 11:23:48] [INFO ] Invariant cache hit.
[2024-05-21 11:23:48] [INFO ] State equation strengthened by 125 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 63/424 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/159 constraints, ReadFeed: 0/125 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 23 stable transitions
Graph (complete) has 581 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 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((G(p0) U X(p1)))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 138 transition count 202
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 138 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 138 transition count 199
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 61 place count 122 transition count 180
Iterating global reduction 1 with 16 rules applied. Total rules applied 77 place count 122 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 81 place count 122 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 94 place count 109 transition count 153
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 109 transition count 153
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 111 place count 109 transition count 149
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 119 place count 101 transition count 136
Iterating global reduction 3 with 8 rules applied. Total rules applied 127 place count 101 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 101 transition count 134
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 135 place count 95 transition count 128
Iterating global reduction 4 with 6 rules applied. Total rules applied 141 place count 95 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 145 place count 95 transition count 124
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 148 place count 92 transition count 120
Iterating global reduction 5 with 3 rules applied. Total rules applied 151 place count 92 transition count 120
Applied a total of 151 rules in 45 ms. Remains 92 /159 variables (removed 67) and now considering 120/265 (removed 145) transitions.
// Phase 1: matrix 120 rows 92 cols
[2024-05-21 11:23:48] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 11:23:48] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 11:23:48] [INFO ] Invariant cache hit.
[2024-05-21 11:23:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 11:23:48] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-21 11:23:48] [INFO ] Redundant transitions in 2 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-21 11:23:48] [INFO ] Invariant cache hit.
[2024-05-21 11:23:48] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/212 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 43/137 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-21 11:23:50] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 138 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/212 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 43/138 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 119/257 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/212 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 257 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5067 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 1/1 constraints]
After SMT, in 8191ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 8193ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/159 places, 120/265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8435 ms. Remains : 92/159 places, 120/265 transitions.
Stuttering acceptance computed with spot in 481 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 4 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-00 finished in 8981 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(!(!p0 U G((F(G(F(p0))) U X(p1)))))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 138 transition count 199
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 138 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 138 transition count 197
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 122 transition count 178
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 122 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 122 transition count 174
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 93 place count 109 transition count 153
Iterating global reduction 2 with 13 rules applied. Total rules applied 106 place count 109 transition count 153
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 111 place count 109 transition count 148
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 118 place count 102 transition count 137
Iterating global reduction 3 with 7 rules applied. Total rules applied 125 place count 102 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 102 transition count 136
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 132 place count 96 transition count 130
Iterating global reduction 4 with 6 rules applied. Total rules applied 138 place count 96 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 141 place count 96 transition count 127
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 144 place count 93 transition count 123
Iterating global reduction 5 with 3 rules applied. Total rules applied 147 place count 93 transition count 123
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 92 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 92 transition count 117
Applied a total of 149 rules in 27 ms. Remains 92 /159 variables (removed 67) and now considering 117/265 (removed 148) transitions.
// Phase 1: matrix 117 rows 92 cols
[2024-05-21 11:23:57] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 11:23:57] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-21 11:23:57] [INFO ] Invariant cache hit.
[2024-05-21 11:23:57] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:23:57] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-21 11:23:57] [INFO ] Invariant cache hit.
[2024-05-21 11:23:57] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/209 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 37/131 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 11:23:59] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 132 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/209 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 37/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 116/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 248 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4522 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
After SMT, in 7675ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7677ms
Starting structural reductions in LTL mode, iteration 1 : 92/159 places, 117/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8003 ms. Remains : 92/159 places, 117/265 transitions.
Stuttering acceptance computed with spot in 159 ms :[p1, p1, p1, (AND p0 p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-01
Product exploration explored 100000 steps with 22981 reset in 245 ms.
Product exploration explored 100000 steps with 22951 reset in 183 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 310 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[p1, p1, p1, (AND p0 p1)]
RANDOM walk for 40000 steps (9135 resets) in 740 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1894 resets) in 192 ms. (207 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1911 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1896 resets) in 218 ms. (182 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1905 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1904 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1961 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 44993 steps, run visited all 6 properties in 117 ms. (steps per millisecond=384 )
Probabilistic random walk after 44993 steps, saw 19262 distinct states, run finished after 121 ms. (steps per millisecond=371 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 341 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 166 ms :[p1, p1, p1, (AND p0 p1)]
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 117/117 transitions.
Applied a total of 0 rules in 1 ms. Remains 92 /92 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 11:24:07] [INFO ] Invariant cache hit.
[2024-05-21 11:24:07] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 11:24:07] [INFO ] Invariant cache hit.
[2024-05-21 11:24:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:24:08] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-21 11:24:08] [INFO ] Invariant cache hit.
[2024-05-21 11:24:08] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/209 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 37/131 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 11:24:09] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 132 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/209 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 37/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 116/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 248 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4545 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
After SMT, in 7665ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7667ms
Finished structural reductions in LTL mode , in 1 iterations and 7945 ms. Remains : 92/92 places, 117/117 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 310 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[p1, p1, p1, (AND p0 p1)]
RANDOM walk for 40000 steps (9177 resets) in 316 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1904 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1900 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1909 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1915 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1904 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1863 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 44993 steps, run visited all 6 properties in 73 ms. (steps per millisecond=616 )
Probabilistic random walk after 44993 steps, saw 19262 distinct states, run finished after 73 ms. (steps per millisecond=616 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 151 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 158 ms :[p1, p1, p1, (AND p0 p1)]
Product exploration explored 100000 steps with 23086 reset in 123 ms.
Product exploration explored 100000 steps with 22769 reset in 144 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 178 ms :[p1, p1, p1, (AND p0 p1)]
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 117/117 transitions.
Applied a total of 0 rules in 14 ms. Remains 92 /92 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 11:24:17] [INFO ] Redundant transitions in 2 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-21 11:24:17] [INFO ] Invariant cache hit.
[2024-05-21 11:24:17] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/209 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 37/131 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 11:24:19] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 132 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3104 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/209 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 37/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 116/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 248 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4461 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
After SMT, in 7671ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7672ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7693 ms. Remains : 92/92 places, 117/117 transitions.
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 117/117 transitions.
Applied a total of 0 rules in 0 ms. Remains 92 /92 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 11:24:25] [INFO ] Invariant cache hit.
[2024-05-21 11:24:25] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 11:24:25] [INFO ] Invariant cache hit.
[2024-05-21 11:24:25] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:24:25] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-21 11:24:25] [INFO ] Invariant cache hit.
[2024-05-21 11:24:25] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/209 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 37/131 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 11:24:27] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 132 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3093 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/209 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 37/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 116/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 248 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4502 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
After SMT, in 7697ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7701ms
Finished structural reductions in LTL mode , in 1 iterations and 7883 ms. Remains : 92/92 places, 117/117 transitions.
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-01 finished in 35907 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((G(F(p0))&&(p1||X(p2))))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 139 transition count 213
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 139 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 139 transition count 212
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 58 place count 122 transition count 192
Iterating global reduction 1 with 17 rules applied. Total rules applied 75 place count 122 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 122 transition count 188
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 93 place count 108 transition count 164
Iterating global reduction 2 with 14 rules applied. Total rules applied 107 place count 108 transition count 164
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 114 place count 108 transition count 157
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 122 place count 100 transition count 145
Iterating global reduction 3 with 8 rules applied. Total rules applied 130 place count 100 transition count 145
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 137 place count 93 transition count 138
Iterating global reduction 3 with 7 rules applied. Total rules applied 144 place count 93 transition count 138
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 149 place count 93 transition count 133
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 152 place count 90 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 155 place count 90 transition count 129
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 156 place count 89 transition count 123
Iterating global reduction 4 with 1 rules applied. Total rules applied 157 place count 89 transition count 123
Applied a total of 157 rules in 10 ms. Remains 89 /159 variables (removed 70) and now considering 123/265 (removed 142) transitions.
// Phase 1: matrix 123 rows 89 cols
[2024-05-21 11:24:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:24:33] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 11:24:33] [INFO ] Invariant cache hit.
[2024-05-21 11:24:33] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 11:24:33] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-21 11:24:33] [INFO ] Invariant cache hit.
[2024-05-21 11:24:33] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-21 11:24:34] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/212 variables, 89/92 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 48/140 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-21 11:24:36] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/212 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 141 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3918 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/212 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 48/141 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 122/263 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 263 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4731 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 2/2 constraints]
After SMT, in 8751ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8752ms
Starting structural reductions in LTL mode, iteration 1 : 89/159 places, 123/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9004 ms. Remains : 89/159 places, 123/265 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p2), true]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-02 finished in 9304 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 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 136 transition count 197
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 136 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 136 transition count 195
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 66 place count 118 transition count 174
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 118 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 118 transition count 170
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 102 place count 104 transition count 148
Iterating global reduction 2 with 14 rules applied. Total rules applied 116 place count 104 transition count 148
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 122 place count 104 transition count 142
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 130 place count 96 transition count 129
Iterating global reduction 3 with 8 rules applied. Total rules applied 138 place count 96 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 96 transition count 128
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 145 place count 90 transition count 122
Iterating global reduction 4 with 6 rules applied. Total rules applied 151 place count 90 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 154 place count 90 transition count 119
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 157 place count 87 transition count 115
Iterating global reduction 5 with 3 rules applied. Total rules applied 160 place count 87 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 161 place count 86 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 86 transition count 109
Applied a total of 162 rules in 27 ms. Remains 86 /159 variables (removed 73) and now considering 109/265 (removed 156) transitions.
// Phase 1: matrix 109 rows 86 cols
[2024-05-21 11:24:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:24:42] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 11:24:42] [INFO ] Invariant cache hit.
[2024-05-21 11:24:42] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 11:24:42] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-21 11:24:42] [INFO ] Redundant transitions in 3 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-21 11:24:42] [INFO ] Invariant cache hit.
[2024-05-21 11:24:42] [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, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 120 constraints, problems are : Problem set: 0 solved, 108 unsolved in 1932 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: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 108/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 228 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4896 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: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 6933ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6935ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/159 places, 109/265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7127 ms. Remains : 86/159 places, 109/265 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-04
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-04 finished in 7185 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 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 137 transition count 198
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 137 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 137 transition count 196
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 63 place count 120 transition count 176
Iterating global reduction 1 with 17 rules applied. Total rules applied 80 place count 120 transition count 176
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 83 place count 120 transition count 173
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 98 place count 105 transition count 147
Iterating global reduction 2 with 15 rules applied. Total rules applied 113 place count 105 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 119 place count 105 transition count 141
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 128 place count 96 transition count 127
Iterating global reduction 3 with 9 rules applied. Total rules applied 137 place count 96 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 96 transition count 126
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 145 place count 89 transition count 119
Iterating global reduction 4 with 7 rules applied. Total rules applied 152 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 157 place count 89 transition count 114
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 160 place count 86 transition count 110
Iterating global reduction 5 with 3 rules applied. Total rules applied 163 place count 86 transition count 110
Applied a total of 163 rules in 24 ms. Remains 86 /159 variables (removed 73) and now considering 110/265 (removed 155) transitions.
// Phase 1: matrix 110 rows 86 cols
[2024-05-21 11:24:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:24:49] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 11:24:49] [INFO ] Invariant cache hit.
[2024-05-21 11:24:49] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 11:24:50] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-21 11:24:50] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 11:24:50] [INFO ] Invariant cache hit.
[2024-05-21 11:24:50] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/196 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 11:24:51] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 11:24:52] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/196 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 128 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3707 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/196 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 38/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 109/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 237 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3954 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
After SMT, in 7747ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 7748ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/159 places, 110/265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7958 ms. Remains : 86/159 places, 110/265 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-05
Product exploration explored 100000 steps with 22959 reset in 133 ms.
Product exploration explored 100000 steps with 22882 reset in 148 ms.
Computed a total of 5 stabilizing places and 13 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 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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 (9163 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3941 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9128 steps, run visited all 1 properties in 13 ms. (steps per millisecond=702 )
Probabilistic random walk after 9128 steps, saw 4231 distinct states, run finished after 13 ms. (steps per millisecond=702 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 110/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 11:24:58] [INFO ] Invariant cache hit.
[2024-05-21 11:24:58] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 11:24:58] [INFO ] Invariant cache hit.
[2024-05-21 11:24:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 11:24:58] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-21 11:24:58] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 11:24:58] [INFO ] Invariant cache hit.
[2024-05-21 11:24:58] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/196 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 11:24:59] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 11:25:01] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/196 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 128 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3815 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/196 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 38/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 109/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 237 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3936 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
After SMT, in 7844ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 7845ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8027 ms. Remains : 86/86 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 13 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.3 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 63 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 31 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9140 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3972 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9128 steps, run visited all 1 properties in 14 ms. (steps per millisecond=652 )
Probabilistic random walk after 9128 steps, saw 4231 distinct states, run finished after 14 ms. (steps per millisecond=652 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 80 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 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23049 reset in 98 ms.
Product exploration explored 100000 steps with 22996 reset in 106 ms.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 11:25:07] [INFO ] Invariant cache hit.
[2024-05-21 11:25:07] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 11:25:07] [INFO ] Invariant cache hit.
[2024-05-21 11:25:07] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 11:25:07] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-21 11:25:07] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 11:25:07] [INFO ] Invariant cache hit.
[2024-05-21 11:25:07] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/196 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 38/126 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 11:25:08] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-21 11:25:09] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/196 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 128 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3861 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 110/196 variables, 86/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 38/128 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 109/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 237 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3710 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 2/2 constraints]
After SMT, in 7656ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 7657ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7872 ms. Remains : 86/86 places, 110/110 transitions.
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-05 finished in 25110 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(G(p0))))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 137 transition count 201
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 137 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 137 transition count 198
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 64 place count 120 transition count 178
Iterating global reduction 1 with 17 rules applied. Total rules applied 81 place count 120 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 85 place count 120 transition count 174
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 99 place count 106 transition count 150
Iterating global reduction 2 with 14 rules applied. Total rules applied 113 place count 106 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 118 place count 106 transition count 145
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 126 place count 98 transition count 132
Iterating global reduction 3 with 8 rules applied. Total rules applied 134 place count 98 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 98 transition count 130
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 142 place count 92 transition count 124
Iterating global reduction 4 with 6 rules applied. Total rules applied 148 place count 92 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 152 place count 92 transition count 120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 155 place count 89 transition count 116
Iterating global reduction 5 with 3 rules applied. Total rules applied 158 place count 89 transition count 116
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 88 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 88 transition count 110
Applied a total of 160 rules in 10 ms. Remains 88 /159 variables (removed 71) and now considering 110/265 (removed 155) transitions.
// Phase 1: matrix 110 rows 88 cols
[2024-05-21 11:25:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:25:15] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 11:25:15] [INFO ] Invariant cache hit.
[2024-05-21 11:25:15] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 11:25:15] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-21 11:25:15] [INFO ] Invariant cache hit.
[2024-05-21 11:25:15] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1960 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4457 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6503ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6504ms
Starting structural reductions in LTL mode, iteration 1 : 88/159 places, 110/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6711 ms. Remains : 88/159 places, 110/265 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-08
Product exploration explored 100000 steps with 22842 reset in 94 ms.
Product exploration explored 100000 steps with 22882 reset in 108 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9168 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1924 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17377 steps, run visited all 1 properties in 25 ms. (steps per millisecond=695 )
Probabilistic random walk after 17377 steps, saw 8260 distinct states, run finished after 25 ms. (steps per millisecond=695 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 11:25:22] [INFO ] Invariant cache hit.
[2024-05-21 11:25:22] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 11:25:22] [INFO ] Invariant cache hit.
[2024-05-21 11:25:22] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 11:25:22] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-21 11:25:22] [INFO ] Invariant cache hit.
[2024-05-21 11:25:22] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1987 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4568 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6654ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6656ms
Finished structural reductions in LTL mode , in 1 iterations and 6850 ms. Remains : 88/88 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9278 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1903 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17377 steps, run visited all 1 properties in 23 ms. (steps per millisecond=755 )
Probabilistic random walk after 17377 steps, saw 8260 distinct states, run finished after 23 ms. (steps per millisecond=755 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23020 reset in 100 ms.
Product exploration explored 100000 steps with 22949 reset in 105 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 7 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 11:25:30] [INFO ] Redundant transitions in 0 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-21 11:25:30] [INFO ] Invariant cache hit.
[2024-05-21 11:25:30] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1951 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4531 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6591ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6592ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6611 ms. Remains : 88/88 places, 110/110 transitions.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 11:25:37] [INFO ] Invariant cache hit.
[2024-05-21 11:25:37] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 11:25:37] [INFO ] Invariant cache hit.
[2024-05-21 11:25:37] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 11:25:37] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-21 11:25:37] [INFO ] Invariant cache hit.
[2024-05-21 11:25:37] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1834 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4358 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6287ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6288ms
Finished structural reductions in LTL mode , in 1 iterations and 6457 ms. Remains : 88/88 places, 110/110 transitions.
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-08 finished in 28698 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)||X((!p1 U ((F(p2) U p0)||G(!p1))))))'
Support contains 3 out of 159 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 139 transition count 212
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 139 transition count 212
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 139 transition count 209
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 59 place count 123 transition count 190
Iterating global reduction 1 with 16 rules applied. Total rules applied 75 place count 123 transition count 190
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 123 transition count 186
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 91 place count 111 transition count 164
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 111 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 108 place count 111 transition count 159
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 115 place count 104 transition count 150
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 104 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 104 transition count 148
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 129 place count 99 transition count 143
Iterating global reduction 4 with 5 rules applied. Total rules applied 134 place count 99 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 137 place count 99 transition count 140
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 139 place count 97 transition count 137
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 97 transition count 137
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 96 transition count 131
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 96 transition count 131
Applied a total of 143 rules in 6 ms. Remains 96 /159 variables (removed 63) and now considering 131/265 (removed 134) transitions.
// Phase 1: matrix 131 rows 96 cols
[2024-05-21 11:25:43] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 11:25:43] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 11:25:43] [INFO ] Invariant cache hit.
[2024-05-21 11:25:43] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 11:25:43] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-21 11:25:43] [INFO ] Invariant cache hit.
[2024-05-21 11:25:43] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/227 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 48/146 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 11:25:45] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-21 11:25:45] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 148 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3447 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/227 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 48/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/227 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 278 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5226 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 8797ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 8799ms
Starting structural reductions in LTL mode, iteration 1 : 96/159 places, 131/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9022 ms. Remains : 96/159 places, 131/265 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-10
Product exploration explored 100000 steps with 22952 reset in 131 ms.
Product exploration explored 100000 steps with 22946 reset in 144 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 332 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (9204 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1837 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1923 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1934 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1905 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1859 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1919 resets) in 33 ms. (1176 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 44022 steps, run visited all 6 properties in 98 ms. (steps per millisecond=449 )
Probabilistic random walk after 44022 steps, saw 18863 distinct states, run finished after 98 ms. (steps per millisecond=449 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 280 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Support contains 3 out of 96 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 : 96/96 places, 131/131 transitions.
Applied a total of 0 rules in 7 ms. Remains 96 /96 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-21 11:25:54] [INFO ] Invariant cache hit.
[2024-05-21 11:25:54] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 11:25:54] [INFO ] Invariant cache hit.
[2024-05-21 11:25:54] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 11:25:54] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-21 11:25:54] [INFO ] Redundant transitions in 2 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-21 11:25:54] [INFO ] Invariant cache hit.
[2024-05-21 11:25:54] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/227 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 48/146 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 11:25:56] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-21 11:25:56] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 148 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3629 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/227 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 48/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/227 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 278 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5312 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 9076ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 9079ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9314 ms. Remains : 96/96 places, 131/131 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 332 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 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 119 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (9209 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1909 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1919 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1841 resets) in 38 ms. (1025 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1931 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1976 resets) in 35 ms. (1111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1889 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 44022 steps, run visited all 6 properties in 100 ms. (steps per millisecond=440 )
Probabilistic random walk after 44022 steps, saw 18863 distinct states, run finished after 101 ms. (steps per millisecond=435 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 367 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 23076 reset in 136 ms.
Product exploration explored 100000 steps with 22890 reset in 159 ms.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 131/131 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 125
Applied a total of 2 rules in 4 ms. Remains 95 /96 variables (removed 1) and now considering 125/131 (removed 6) transitions.
// Phase 1: matrix 125 rows 95 cols
[2024-05-21 11:26:05] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 11:26:05] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 11:26:05] [INFO ] Invariant cache hit.
[2024-05-21 11:26:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:26:05] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-21 11:26:05] [INFO ] Redundant transitions in 1 ms returned []
Running 124 sub problems to find dead transitions.
[2024-05-21 11:26:05] [INFO ] Invariant cache hit.
[2024-05-21 11:26:05] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/220 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 42/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 139 constraints, problems are : Problem set: 0 solved, 124 unsolved in 2393 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/220 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 42/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 124/263 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 263 constraints, problems are : Problem set: 0 solved, 124 unsolved in 5911 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
After SMT, in 8414ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 8416ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/96 places, 125/131 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8626 ms. Remains : 95/96 places, 125/131 transitions.
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-10 finished in 30471 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 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 138 transition count 206
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 138 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 138 transition count 203
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 61 place count 122 transition count 184
Iterating global reduction 1 with 16 rules applied. Total rules applied 77 place count 122 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 81 place count 122 transition count 180
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 93 place count 110 transition count 158
Iterating global reduction 2 with 12 rules applied. Total rules applied 105 place count 110 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 111 place count 110 transition count 152
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 118 place count 103 transition count 143
Iterating global reduction 3 with 7 rules applied. Total rules applied 125 place count 103 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 127 place count 103 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 132 place count 98 transition count 136
Iterating global reduction 4 with 5 rules applied. Total rules applied 137 place count 98 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 141 place count 98 transition count 132
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 143 place count 96 transition count 129
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 96 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 95 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 95 transition count 123
Applied a total of 147 rules in 13 ms. Remains 95 /159 variables (removed 64) and now considering 123/265 (removed 142) transitions.
// Phase 1: matrix 123 rows 95 cols
[2024-05-21 11:26:14] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 11:26:14] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 11:26:14] [INFO ] Invariant cache hit.
[2024-05-21 11:26:14] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:26:14] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-21 11:26:14] [INFO ] Invariant cache hit.
[2024-05-21 11:26:14] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 138 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2337 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 122/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 260 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5866 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 8317ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8319ms
Starting structural reductions in LTL mode, iteration 1 : 95/159 places, 123/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8533 ms. Remains : 95/159 places, 123/265 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-12
Product exploration explored 100000 steps with 23069 reset in 100 ms.
Product exploration explored 100000 steps with 22866 reset in 121 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 325 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (9142 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1961 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1897 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 20248 steps, run visited all 2 properties in 80 ms. (steps per millisecond=253 )
Probabilistic random walk after 20248 steps, saw 9385 distinct states, run finished after 80 ms. (steps per millisecond=253 ) properties seen :2
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-21 11:26:23] [INFO ] Invariant cache hit.
[2024-05-21 11:26:23] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 11:26:23] [INFO ] Invariant cache hit.
[2024-05-21 11:26:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:26:23] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-21 11:26:23] [INFO ] Redundant transitions in 0 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-21 11:26:23] [INFO ] Invariant cache hit.
[2024-05-21 11:26:23] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 138 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2357 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 122/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 260 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5878 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 8372ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8373ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8574 ms. Remains : 95/95 places, 123/123 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 325 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (9141 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1840 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1896 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 20248 steps, run visited all 2 properties in 68 ms. (steps per millisecond=297 )
Probabilistic random walk after 20248 steps, saw 9385 distinct states, run finished after 68 ms. (steps per millisecond=297 ) properties seen :2
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 23066 reset in 117 ms.
Product exploration explored 100000 steps with 22998 reset in 119 ms.
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-21 11:26:33] [INFO ] Invariant cache hit.
[2024-05-21 11:26:33] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 11:26:33] [INFO ] Invariant cache hit.
[2024-05-21 11:26:33] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:26:33] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-21 11:26:33] [INFO ] Redundant transitions in 0 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-21 11:26:33] [INFO ] Invariant cache hit.
[2024-05-21 11:26:33] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 138 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2379 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 122/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 260 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5793 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 8287ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8289ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8516 ms. Remains : 95/95 places, 123/123 transitions.
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-12 finished in 27510 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((F(p1)&&p0)))'
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 138 transition count 203
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 138 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 138 transition count 202
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 59 place count 122 transition count 185
Iterating global reduction 1 with 16 rules applied. Total rules applied 75 place count 122 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 122 transition count 181
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 91 place count 110 transition count 159
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 110 transition count 159
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 109 place count 110 transition count 153
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 115 place count 104 transition count 146
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 104 transition count 146
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 126 place count 99 transition count 141
Iterating global reduction 3 with 5 rules applied. Total rules applied 131 place count 99 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 136 place count 99 transition count 136
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 98 transition count 135
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 98 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 97 transition count 129
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 97 transition count 129
Applied a total of 140 rules in 20 ms. Remains 97 /159 variables (removed 62) and now considering 129/265 (removed 136) transitions.
// Phase 1: matrix 129 rows 97 cols
[2024-05-21 11:26:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:26:41] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 11:26:41] [INFO ] Invariant cache hit.
[2024-05-21 11:26:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 11:26:41] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-21 11:26:41] [INFO ] Redundant transitions in 0 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-21 11:26:41] [INFO ] Invariant cache hit.
[2024-05-21 11:26:41] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/226 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 44/143 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/226 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 143 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3121 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/226 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 44/143 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 128/271 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/226 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 271 constraints, problems are : Problem set: 0 solved, 128 unsolved in 6014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 9249ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 9251ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/159 places, 129/265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9500 ms. Remains : 97/159 places, 129/265 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-13 finished in 9592 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))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 136 transition count 197
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 136 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 136 transition count 195
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 66 place count 118 transition count 174
Iterating global reduction 1 with 18 rules applied. Total rules applied 84 place count 118 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 118 transition count 170
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 102 place count 104 transition count 148
Iterating global reduction 2 with 14 rules applied. Total rules applied 116 place count 104 transition count 148
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 122 place count 104 transition count 142
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 130 place count 96 transition count 129
Iterating global reduction 3 with 8 rules applied. Total rules applied 138 place count 96 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 96 transition count 128
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 145 place count 90 transition count 122
Iterating global reduction 4 with 6 rules applied. Total rules applied 151 place count 90 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 154 place count 90 transition count 119
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 157 place count 87 transition count 115
Iterating global reduction 5 with 3 rules applied. Total rules applied 160 place count 87 transition count 115
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 161 place count 86 transition count 109
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 86 transition count 109
Applied a total of 162 rules in 26 ms. Remains 86 /159 variables (removed 73) and now considering 109/265 (removed 156) transitions.
// Phase 1: matrix 109 rows 86 cols
[2024-05-21 11:26:51] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 11:26:51] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 11:26:51] [INFO ] Invariant cache hit.
[2024-05-21 11:26:51] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 11:26:51] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-21 11:26:51] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-21 11:26:51] [INFO ] Invariant cache hit.
[2024-05-21 11:26:51] [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, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 120 constraints, problems are : Problem set: 0 solved, 108 unsolved in 1927 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: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 108/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 228 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4969 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: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 7003ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 7005ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/159 places, 109/265 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7225 ms. Remains : 86/159 places, 109/265 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-14
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-14 finished in 7271 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||(p0 U p1)||X(F((F(!p3)&&p2))))))'
Support contains 6 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 140 transition count 205
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 140 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 140 transition count 203
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 53 place count 127 transition count 189
Iterating global reduction 1 with 13 rules applied. Total rules applied 66 place count 127 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 68 place count 127 transition count 187
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 79 place count 116 transition count 168
Iterating global reduction 2 with 11 rules applied. Total rules applied 90 place count 116 transition count 168
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 116 transition count 162
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 102 place count 110 transition count 152
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 110 transition count 152
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 113 place count 105 transition count 147
Iterating global reduction 3 with 5 rules applied. Total rules applied 118 place count 105 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 123 place count 105 transition count 142
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 104 transition count 141
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 104 transition count 141
Applied a total of 125 rules in 9 ms. Remains 104 /159 variables (removed 55) and now considering 141/265 (removed 124) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-05-21 11:26:58] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 11:26:58] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 11:26:58] [INFO ] Invariant cache hit.
[2024-05-21 11:26:58] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 11:26:58] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-05-21 11:26:58] [INFO ] Invariant cache hit.
[2024-05-21 11:26:58] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/245 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 51/157 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 0/245 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 157 constraints, problems are : Problem set: 0 solved, 140 unsolved in 3154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 141/245 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 51/157 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 140/297 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 297 constraints, problems are : Problem set: 0 solved, 140 unsolved in 6435 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 9737ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 9739ms
Starting structural reductions in LTL mode, iteration 1 : 104/159 places, 141/265 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9973 ms. Remains : 104/159 places, 141/265 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) (NOT p1) p3)]
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-15 finished in 10126 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(!(!p0 U G((F(G(F(p0))) U X(p1)))))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d1m06-LTLFireability-01
Stuttering acceptance computed with spot in 173 ms :[p1, p1, p1, (AND p0 p1)]
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 138 transition count 199
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 138 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 138 transition count 197
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 122 transition count 178
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 122 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 122 transition count 174
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 93 place count 109 transition count 153
Iterating global reduction 2 with 13 rules applied. Total rules applied 106 place count 109 transition count 153
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 111 place count 109 transition count 148
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 118 place count 102 transition count 137
Iterating global reduction 3 with 7 rules applied. Total rules applied 125 place count 102 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 102 transition count 136
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 132 place count 96 transition count 130
Iterating global reduction 4 with 6 rules applied. Total rules applied 138 place count 96 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 141 place count 96 transition count 127
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 144 place count 93 transition count 123
Iterating global reduction 5 with 3 rules applied. Total rules applied 147 place count 93 transition count 123
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 92 transition count 117
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 92 transition count 117
Applied a total of 149 rules in 22 ms. Remains 92 /159 variables (removed 67) and now considering 117/265 (removed 148) transitions.
// Phase 1: matrix 117 rows 92 cols
[2024-05-21 11:27:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:27:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 11:27:09] [INFO ] Invariant cache hit.
[2024-05-21 11:27:09] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:27:09] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-21 11:27:09] [INFO ] Invariant cache hit.
[2024-05-21 11:27:09] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/209 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 37/131 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 11:27:10] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 132 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3142 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/209 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 37/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 116/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 248 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4657 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
After SMT, in 7918ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7919ms
Starting structural reductions in LI_LTL mode, iteration 1 : 92/159 places, 117/265 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8146 ms. Remains : 92/159 places, 117/265 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-01
Product exploration explored 100000 steps with 23027 reset in 116 ms.
Product exploration explored 100000 steps with 22987 reset in 131 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 310 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[p1, p1, p1, (AND p0 p1)]
RANDOM walk for 40000 steps (9127 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1880 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1861 resets) in 50 ms. (784 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (1797 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1930 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
[2024-05-21 11:27:17] [INFO ] Invariant cache hit.
[2024-05-21 11:27:17] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 89/152 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 53/205 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 26/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/209 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/209 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 131 constraints, problems are : Problem set: 0 solved, 3 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 89/152 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 9/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 53/205 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 26/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/209 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/209 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 134 constraints, problems are : Problem set: 0 solved, 3 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 435ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 281 ms.
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 117/117 transitions.
Graph (complete) has 285 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 91 transition count 115
Applied a total of 3 rules in 10 ms. Remains 91 /92 variables (removed 1) and now considering 115/117 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 91/92 places, 115/117 transitions.
RANDOM walk for 40000 steps (9143 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1919 resets) in 27 ms. (1428 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1941 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1928 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 44946 steps, run visited all 3 properties in 57 ms. (steps per millisecond=788 )
Probabilistic random walk after 44946 steps, saw 19246 distinct states, run finished after 58 ms. (steps per millisecond=774 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 137 ms :[p1, p1, p1, (AND p0 p1)]
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 117/117 transitions.
Applied a total of 0 rules in 0 ms. Remains 92 /92 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 11:27:19] [INFO ] Invariant cache hit.
[2024-05-21 11:27:19] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 11:27:19] [INFO ] Invariant cache hit.
[2024-05-21 11:27:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:27:19] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-21 11:27:19] [INFO ] Invariant cache hit.
[2024-05-21 11:27:19] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/209 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 37/131 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 11:27:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 132 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3181 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/209 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 37/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 116/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 248 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4623 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
After SMT, in 7919ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7921ms
Finished structural reductions in LTL mode , in 1 iterations and 8093 ms. Remains : 92/92 places, 117/117 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 310 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[p1, p1, p1, (AND p0 p1)]
RANDOM walk for 40000 steps (9191 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1940 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1853 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1908 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1920 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1961 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 44993 steps, run visited all 6 properties in 71 ms. (steps per millisecond=633 )
Probabilistic random walk after 44993 steps, saw 19262 distinct states, run finished after 71 ms. (steps per millisecond=633 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 243 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 154 ms :[p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 148 ms :[p1, p1, p1, (AND p0 p1)]
Product exploration explored 100000 steps with 23031 reset in 110 ms.
Product exploration explored 100000 steps with 22880 reset in 122 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 152 ms :[p1, p1, p1, (AND p0 p1)]
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 117/117 transitions.
Applied a total of 0 rules in 5 ms. Remains 92 /92 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 11:27:29] [INFO ] Redundant transitions in 1 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-21 11:27:29] [INFO ] Invariant cache hit.
[2024-05-21 11:27:29] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/209 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 37/131 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 11:27:30] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 132 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/209 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 37/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 116/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 248 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4705 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
After SMT, in 8037ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 8038ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8048 ms. Remains : 92/92 places, 117/117 transitions.
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 117/117 transitions.
Applied a total of 0 rules in 1 ms. Remains 92 /92 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 11:27:37] [INFO ] Invariant cache hit.
[2024-05-21 11:27:37] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 11:27:37] [INFO ] Invariant cache hit.
[2024-05-21 11:27:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:27:37] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-21 11:27:37] [INFO ] Invariant cache hit.
[2024-05-21 11:27:37] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 117/209 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 37/131 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 11:27:38] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 132 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3086 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (OVERLAPS) 117/209 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 37/132 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 116/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 248 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4727 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 1/1 constraints]
After SMT, in 7922ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 7925ms
Finished structural reductions in LTL mode , in 1 iterations and 8105 ms. Remains : 92/92 places, 117/117 transitions.
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-01 finished in 36550 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)))'
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(G(p0))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m06-LTLFireability-08
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 137 transition count 201
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 137 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 137 transition count 198
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 64 place count 120 transition count 178
Iterating global reduction 1 with 17 rules applied. Total rules applied 81 place count 120 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 85 place count 120 transition count 174
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 99 place count 106 transition count 150
Iterating global reduction 2 with 14 rules applied. Total rules applied 113 place count 106 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 118 place count 106 transition count 145
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 126 place count 98 transition count 132
Iterating global reduction 3 with 8 rules applied. Total rules applied 134 place count 98 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 136 place count 98 transition count 130
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 142 place count 92 transition count 124
Iterating global reduction 4 with 6 rules applied. Total rules applied 148 place count 92 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 152 place count 92 transition count 120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 155 place count 89 transition count 116
Iterating global reduction 5 with 3 rules applied. Total rules applied 158 place count 89 transition count 116
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 159 place count 88 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 88 transition count 110
Applied a total of 160 rules in 15 ms. Remains 88 /159 variables (removed 71) and now considering 110/265 (removed 155) transitions.
// Phase 1: matrix 110 rows 88 cols
[2024-05-21 11:27:45] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 11:27:45] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 11:27:45] [INFO ] Invariant cache hit.
[2024-05-21 11:27:45] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 11:27:45] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-21 11:27:45] [INFO ] Invariant cache hit.
[2024-05-21 11:27:45] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1946 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4618 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6667ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6668ms
Starting structural reductions in LI_LTL mode, iteration 1 : 88/159 places, 110/265 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6859 ms. Remains : 88/159 places, 110/265 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-08
Product exploration explored 100000 steps with 22934 reset in 106 ms.
Product exploration explored 100000 steps with 22987 reset in 106 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9229 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1889 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17377 steps, run visited all 1 properties in 23 ms. (steps per millisecond=755 )
Probabilistic random walk after 17377 steps, saw 8260 distinct states, run finished after 23 ms. (steps per millisecond=755 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 11:27:53] [INFO ] Invariant cache hit.
[2024-05-21 11:27:53] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 11:27:53] [INFO ] Invariant cache hit.
[2024-05-21 11:27:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 11:27:53] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-21 11:27:53] [INFO ] Invariant cache hit.
[2024-05-21 11:27:53] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 1988 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4699 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 6777ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6779ms
Finished structural reductions in LTL mode , in 1 iterations and 6999 ms. Remains : 88/88 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9178 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1907 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17377 steps, run visited all 1 properties in 25 ms. (steps per millisecond=695 )
Probabilistic random walk after 17377 steps, saw 8260 distinct states, run finished after 25 ms. (steps per millisecond=695 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 86199 steps with 19667 reset in 83 ms.
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-08 finished in 15713 ms.
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-08 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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)||X((!p1 U ((F(p2) U p0)||G(!p1))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m06-LTLFireability-10
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 3 out of 159 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 139 transition count 212
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 139 transition count 212
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 139 transition count 209
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 59 place count 123 transition count 190
Iterating global reduction 1 with 16 rules applied. Total rules applied 75 place count 123 transition count 190
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 123 transition count 186
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 91 place count 111 transition count 164
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 111 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 108 place count 111 transition count 159
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 115 place count 104 transition count 150
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 104 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 104 transition count 148
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 129 place count 99 transition count 143
Iterating global reduction 4 with 5 rules applied. Total rules applied 134 place count 99 transition count 143
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 137 place count 99 transition count 140
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 139 place count 97 transition count 137
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 97 transition count 137
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 96 transition count 131
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 96 transition count 131
Applied a total of 143 rules in 26 ms. Remains 96 /159 variables (removed 63) and now considering 131/265 (removed 134) transitions.
// Phase 1: matrix 131 rows 96 cols
[2024-05-21 11:28:01] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 11:28:01] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 11:28:01] [INFO ] Invariant cache hit.
[2024-05-21 11:28:01] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 11:28:01] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-21 11:28:01] [INFO ] Invariant cache hit.
[2024-05-21 11:28:01] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/227 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 48/146 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 11:28:03] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-21 11:28:03] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 148 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3697 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/227 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 48/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/227 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 278 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5516 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 9345ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 9346ms
Starting structural reductions in LI_LTL mode, iteration 1 : 96/159 places, 131/265 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9632 ms. Remains : 96/159 places, 131/265 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-10
Product exploration explored 100000 steps with 22866 reset in 136 ms.
Product exploration explored 100000 steps with 22890 reset in 150 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 332 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (9180 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1894 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1920 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1889 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1905 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1897 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1897 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 44022 steps, run visited all 6 properties in 84 ms. (steps per millisecond=524 )
Probabilistic random walk after 44022 steps, saw 18863 distinct states, run finished after 84 ms. (steps per millisecond=524 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 280 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Support contains 3 out of 96 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 : 96/96 places, 131/131 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-21 11:28:12] [INFO ] Invariant cache hit.
[2024-05-21 11:28:12] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 11:28:12] [INFO ] Invariant cache hit.
[2024-05-21 11:28:12] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 11:28:12] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-21 11:28:12] [INFO ] Redundant transitions in 0 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-21 11:28:12] [INFO ] Invariant cache hit.
[2024-05-21 11:28:12] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/227 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 48/146 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-21 11:28:14] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-21 11:28:14] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 148 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3796 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/227 variables, 96/100 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 48/148 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 130/278 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/227 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 278 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 2/2 constraints]
After SMT, in 9194ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 9195ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9416 ms. Remains : 96/96 places, 131/131 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 332 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 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 105 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (9243 resets) in 166 ms. (239 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1880 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1841 resets) in 35 ms. (1111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1938 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1938 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1899 resets) in 34 ms. (1142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1909 resets) in 35 ms. (1111 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 44022 steps, run visited all 6 properties in 99 ms. (steps per millisecond=444 )
Probabilistic random walk after 44022 steps, saw 18863 distinct states, run finished after 99 ms. (steps per millisecond=444 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 335 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 22956 reset in 136 ms.
Product exploration explored 100000 steps with 22985 reset in 147 ms.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 131/131 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 125
Applied a total of 2 rules in 2 ms. Remains 95 /96 variables (removed 1) and now considering 125/131 (removed 6) transitions.
// Phase 1: matrix 125 rows 95 cols
[2024-05-21 11:28:23] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 11:28:23] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 11:28:23] [INFO ] Invariant cache hit.
[2024-05-21 11:28:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:28:23] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-21 11:28:23] [INFO ] Redundant transitions in 0 ms returned []
Running 124 sub problems to find dead transitions.
[2024-05-21 11:28:23] [INFO ] Invariant cache hit.
[2024-05-21 11:28:23] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/220 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 42/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 139 constraints, problems are : Problem set: 0 solved, 124 unsolved in 2293 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/220 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 42/139 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 124/263 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 263 constraints, problems are : Problem set: 0 solved, 124 unsolved in 5759 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
After SMT, in 8156ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 8159ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/96 places, 125/131 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8365 ms. Remains : 95/96 places, 125/131 transitions.
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-10 finished in 30891 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))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m06-LTLFireability-12
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 159/159 places, 265/265 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 138 transition count 206
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 138 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 138 transition count 203
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 61 place count 122 transition count 184
Iterating global reduction 1 with 16 rules applied. Total rules applied 77 place count 122 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 81 place count 122 transition count 180
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 93 place count 110 transition count 158
Iterating global reduction 2 with 12 rules applied. Total rules applied 105 place count 110 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 111 place count 110 transition count 152
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 118 place count 103 transition count 143
Iterating global reduction 3 with 7 rules applied. Total rules applied 125 place count 103 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 127 place count 103 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 132 place count 98 transition count 136
Iterating global reduction 4 with 5 rules applied. Total rules applied 137 place count 98 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 141 place count 98 transition count 132
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 143 place count 96 transition count 129
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 96 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 95 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 95 transition count 123
Applied a total of 147 rules in 15 ms. Remains 95 /159 variables (removed 64) and now considering 123/265 (removed 142) transitions.
// Phase 1: matrix 123 rows 95 cols
[2024-05-21 11:28:32] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 11:28:32] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 11:28:32] [INFO ] Invariant cache hit.
[2024-05-21 11:28:32] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:28:32] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-21 11:28:32] [INFO ] Invariant cache hit.
[2024-05-21 11:28:32] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 138 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2403 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 122/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 260 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5821 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 8328ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8330ms
Starting structural reductions in LI_LTL mode, iteration 1 : 95/159 places, 123/265 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8542 ms. Remains : 95/159 places, 123/265 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m06-LTLFireability-12
Product exploration explored 100000 steps with 22801 reset in 105 ms.
Product exploration explored 100000 steps with 22957 reset in 112 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 325 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (9142 resets) in 108 ms. (366 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1923 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1871 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 20248 steps, run visited all 2 properties in 59 ms. (steps per millisecond=343 )
Probabilistic random walk after 20248 steps, saw 9385 distinct states, run finished after 59 ms. (steps per millisecond=343 ) properties seen :2
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 123/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 95 /95 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-21 11:28:41] [INFO ] Invariant cache hit.
[2024-05-21 11:28:41] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 11:28:41] [INFO ] Invariant cache hit.
[2024-05-21 11:28:41] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:28:41] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-21 11:28:41] [INFO ] Redundant transitions in 0 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-21 11:28:41] [INFO ] Invariant cache hit.
[2024-05-21 11:28:41] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 138 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2264 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 122/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 260 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5816 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 8185ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8187ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8395 ms. Remains : 95/95 places, 123/123 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 325 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (9159 resets) in 108 ms. (366 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1923 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1891 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 20248 steps, run visited all 2 properties in 62 ms. (steps per millisecond=326 )
Probabilistic random walk after 20248 steps, saw 9385 distinct states, run finished after 62 ms. (steps per millisecond=326 ) properties seen :2
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 125 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 23095 reset in 109 ms.
Product exploration explored 100000 steps with 23114 reset in 120 ms.
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 95 /95 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-21 11:28:50] [INFO ] Invariant cache hit.
[2024-05-21 11:28:50] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 11:28:50] [INFO ] Invariant cache hit.
[2024-05-21 11:28:50] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:28:51] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-21 11:28:51] [INFO ] Redundant transitions in 0 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-21 11:28:51] [INFO ] Invariant cache hit.
[2024-05-21 11:28:51] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 138 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2303 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/218 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 122/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 260 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5837 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 8250ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8252ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8472 ms. Remains : 95/95 places, 123/123 transitions.
Treatment of property DBSingleClientW-PT-d1m06-LTLFireability-12 finished in 27419 ms.
[2024-05-21 11:28:59] [INFO ] Flatten gal took : 16 ms
[2024-05-21 11:28:59] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-21 11:28:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 159 places, 265 transitions and 1042 arcs took 8 ms.
Total runtime 352175 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d1m06

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 2668
MODEL NAME: /home/mcc/execution/413/model
159 places, 265 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-d1m06-LTLFireability-01 CANNOT_COMPUTE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-05 CANNOT_COMPUTE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-08 CANNOT_COMPUTE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-10 CANNOT_COMPUTE
FORMULA DBSingleClientW-PT-d1m06-LTLFireability-12 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716291362026

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 1767154756 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1767154756 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1767154756 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1767154756 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1767154756 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

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

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m06.tgz
mv DBSingleClientW-PT-d1m06 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 ;