Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M 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-d2m07-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717190823897

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:27:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:27:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:27:05] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2024-05-31 21:27:05] [INFO ] Transformed 4763 places.
[2024-05-31 21:27:05] [INFO ] Transformed 2478 transitions.
[2024-05-31 21:27:05] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 331 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 3580 places in 25 ms
Reduce places removed 3580 places and 0 transitions.
Support contains 41 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 368 places :
Symmetric choice reduction at 1 with 368 rule applications. Total rules 613 place count 769 transition count 1412
Iterating global reduction 1 with 368 rules applied. Total rules applied 981 place count 769 transition count 1412
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 1026 place count 769 transition count 1367
Discarding 293 places :
Symmetric choice reduction at 2 with 293 rule applications. Total rules 1319 place count 476 transition count 1074
Iterating global reduction 2 with 293 rules applied. Total rules applied 1612 place count 476 transition count 1074
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1617 place count 476 transition count 1069
Discarding 211 places :
Symmetric choice reduction at 3 with 211 rule applications. Total rules 1828 place count 265 transition count 773
Iterating global reduction 3 with 211 rules applied. Total rules applied 2039 place count 265 transition count 773
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 3 with 240 rules applied. Total rules applied 2279 place count 265 transition count 533
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 2292 place count 252 transition count 512
Iterating global reduction 4 with 13 rules applied. Total rules applied 2305 place count 252 transition count 512
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 2315 place count 242 transition count 502
Iterating global reduction 4 with 10 rules applied. Total rules applied 2325 place count 242 transition count 502
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2329 place count 242 transition count 498
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2336 place count 235 transition count 491
Iterating global reduction 5 with 7 rules applied. Total rules applied 2343 place count 235 transition count 491
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 2354 place count 235 transition count 480
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2355 place count 234 transition count 473
Iterating global reduction 6 with 1 rules applied. Total rules applied 2356 place count 234 transition count 473
Applied a total of 2356 rules in 199 ms. Remains 234 /1183 variables (removed 949) and now considering 473/2478 (removed 2005) transitions.
// Phase 1: matrix 473 rows 234 cols
[2024-05-31 21:27:06] [INFO ] Computed 2 invariants in 28 ms
[2024-05-31 21:27:06] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-31 21:27:06] [INFO ] Invariant cache hit.
[2024-05-31 21:27:06] [INFO ] State equation strengthened by 254 read => feed constraints.
[2024-05-31 21:27:07] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2024-05-31 21:27:07] [INFO ] Invariant cache hit.
[2024-05-31 21:27:07] [INFO ] State equation strengthened by 254 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 473/707 variables, 234/236 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/707 variables, 254/490 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 7 (OVERLAPS) 0/707 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 472 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 490 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 473/707 variables, 234/236 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/707 variables, 254/490 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/707 variables, 472/962 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 707/707 variables, and 962 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 234/234 constraints, ReadFeed: 254/254 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
After SMT, in 61572ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 61596ms
Starting structural reductions in LTL mode, iteration 1 : 234/1183 places, 473/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63115 ms. Remains : 234/1183 places, 473/2478 transitions.
Support contains 41 out of 234 places after structural reductions.
[2024-05-31 21:28:09] [INFO ] Flatten gal took : 58 ms
[2024-05-31 21:28:09] [INFO ] Flatten gal took : 31 ms
[2024-05-31 21:28:09] [INFO ] Input system was already deterministic with 473 transitions.
Reduction of identical properties reduced properties to check from 38 to 37
RANDOM walk for 40000 steps (9126 resets) in 2624 ms. (15 steps per ms) remains 34/37 properties
BEST_FIRST walk for 4002 steps (178 resets) in 78 ms. (50 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (202 resets) in 55 ms. (71 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (167 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (162 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (167 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (171 resets) in 42 ms. (93 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (168 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (183 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (173 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (179 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (189 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (381 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (391 resets) in 47 ms. (83 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (168 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (173 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (177 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (194 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (165 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (170 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (169 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (178 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (404 resets) in 40 ms. (97 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (176 resets) in 25 ms. (154 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (175 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (166 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (187 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (174 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (175 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (153 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (180 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (195 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (369 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (376 resets) in 70 ms. (56 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (170 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
Interrupted probabilistic random walk after 783990 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :33 out of 34
Probabilistic random walk after 783990 steps, saw 306415 distinct states, run finished after 3013 ms. (steps per millisecond=260 ) properties seen :33
[2024-05-31 21:28:13] [INFO ] Invariant cache hit.
[2024-05-31 21:28:13] [INFO ] State equation strengthened by 254 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp34 is UNSAT
After SMT solving in domain Real declared 86/707 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/234 constraints, ReadFeed: 0/254 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 37 stable transitions
Graph (complete) has 940 edges and 234 vertex of which 233 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 200 transition count 341
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 200 transition count 341
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 78 place count 200 transition count 331
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 103 place count 175 transition count 301
Iterating global reduction 1 with 25 rules applied. Total rules applied 128 place count 175 transition count 301
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 136 place count 175 transition count 293
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 159 place count 152 transition count 256
Iterating global reduction 2 with 23 rules applied. Total rules applied 182 place count 152 transition count 256
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 195 place count 152 transition count 243
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 208 place count 139 transition count 208
Iterating global reduction 3 with 13 rules applied. Total rules applied 221 place count 139 transition count 208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 225 place count 139 transition count 204
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 232 place count 132 transition count 197
Iterating global reduction 4 with 7 rules applied. Total rules applied 239 place count 132 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 242 place count 132 transition count 194
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 246 place count 128 transition count 189
Iterating global reduction 5 with 4 rules applied. Total rules applied 250 place count 128 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 251 place count 128 transition count 188
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 252 place count 127 transition count 186
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 127 transition count 186
Applied a total of 253 rules in 54 ms. Remains 127 /234 variables (removed 107) and now considering 186/473 (removed 287) transitions.
// Phase 1: matrix 186 rows 127 cols
[2024-05-31 21:28:14] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:28:14] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-31 21:28:14] [INFO ] Invariant cache hit.
[2024-05-31 21:28:14] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:28:14] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-05-31 21:28:14] [INFO ] Redundant transitions in 5 ms returned []
Running 185 sub problems to find dead transitions.
[2024-05-31 21:28:14] [INFO ] Invariant cache hit.
[2024-05-31 21:28:14] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/313 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 66/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/313 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 195 constraints, problems are : Problem set: 0 solved, 185 unsolved in 4969 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/313 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 66/195 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 185/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/313 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 380 constraints, problems are : Problem set: 0 solved, 185 unsolved in 11991 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 17202ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 17204ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/234 places, 186/473 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17674 ms. Remains : 127/234 places, 186/473 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-00
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-00 finished in 17965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 200 transition count 347
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 200 transition count 347
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 79 place count 200 transition count 336
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 104 place count 175 transition count 302
Iterating global reduction 1 with 25 rules applied. Total rules applied 129 place count 175 transition count 302
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 137 place count 175 transition count 294
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 159 place count 153 transition count 258
Iterating global reduction 2 with 22 rules applied. Total rules applied 181 place count 153 transition count 258
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 194 place count 153 transition count 245
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 207 place count 140 transition count 207
Iterating global reduction 3 with 13 rules applied. Total rules applied 220 place count 140 transition count 207
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 224 place count 140 transition count 203
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 230 place count 134 transition count 197
Iterating global reduction 4 with 6 rules applied. Total rules applied 236 place count 134 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 239 place count 134 transition count 194
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 242 place count 131 transition count 190
Iterating global reduction 5 with 3 rules applied. Total rules applied 245 place count 131 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 246 place count 131 transition count 189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 247 place count 130 transition count 187
Iterating global reduction 6 with 1 rules applied. Total rules applied 248 place count 130 transition count 187
Applied a total of 248 rules in 50 ms. Remains 130 /234 variables (removed 104) and now considering 187/473 (removed 286) transitions.
// Phase 1: matrix 187 rows 130 cols
[2024-05-31 21:28:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:28:32] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 21:28:32] [INFO ] Invariant cache hit.
[2024-05-31 21:28:32] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-31 21:28:32] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-31 21:28:32] [INFO ] Redundant transitions in 10 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-31 21:28:32] [INFO ] Invariant cache hit.
[2024-05-31 21:28:32] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 193 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4764 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 186/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 379 constraints, problems are : Problem set: 0 solved, 186 unsolved in 11685 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 16702ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 16704ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/234 places, 187/473 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17101 ms. Remains : 130/234 places, 187/473 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-01
Product exploration explored 100000 steps with 22953 reset in 275 ms.
Product exploration explored 100000 steps with 22965 reset in 224 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 472 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9187 resets) in 326 ms. (122 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1829 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16977 steps, run visited all 1 properties in 49 ms. (steps per millisecond=346 )
Probabilistic random walk after 16977 steps, saw 7979 distinct states, run finished after 55 ms. (steps per millisecond=308 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 187/187 transitions.
Applied a total of 0 rules in 11 ms. Remains 130 /130 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-05-31 21:28:50] [INFO ] Invariant cache hit.
[2024-05-31 21:28:50] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 21:28:50] [INFO ] Invariant cache hit.
[2024-05-31 21:28:50] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-31 21:28:50] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-05-31 21:28:50] [INFO ] Redundant transitions in 2 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-31 21:28:50] [INFO ] Invariant cache hit.
[2024-05-31 21:28:50] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 193 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4720 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 186/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 379 constraints, problems are : Problem set: 0 solved, 186 unsolved in 11663 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 16644ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 16646ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17042 ms. Remains : 130/130 places, 187/187 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 472 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9125 resets) in 346 ms. (115 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1757 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16977 steps, run visited all 1 properties in 34 ms. (steps per millisecond=499 )
Probabilistic random walk after 16977 steps, saw 7979 distinct states, run finished after 34 ms. (steps per millisecond=499 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22974 reset in 172 ms.
Product exploration explored 100000 steps with 23061 reset in 166 ms.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 187/187 transitions.
Applied a total of 0 rules in 6 ms. Remains 130 /130 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-05-31 21:29:08] [INFO ] Invariant cache hit.
[2024-05-31 21:29:08] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-31 21:29:08] [INFO ] Invariant cache hit.
[2024-05-31 21:29:08] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-31 21:29:08] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-05-31 21:29:08] [INFO ] Redundant transitions in 2 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-31 21:29:08] [INFO ] Invariant cache hit.
[2024-05-31 21:29:08] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 193 constraints, problems are : Problem set: 0 solved, 186 unsolved in 4848 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 186/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 379 constraints, problems are : Problem set: 0 solved, 186 unsolved in 11691 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 16777ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 16779ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17176 ms. Remains : 130/130 places, 187/187 transitions.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-01 finished in 53542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X(X(G(p2)))&&p1)))))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 202 transition count 349
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 202 transition count 349
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 75 place count 202 transition count 338
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 98 place count 179 transition count 306
Iterating global reduction 1 with 23 rules applied. Total rules applied 121 place count 179 transition count 306
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 128 place count 179 transition count 299
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 148 place count 159 transition count 267
Iterating global reduction 2 with 20 rules applied. Total rules applied 168 place count 159 transition count 267
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 179 place count 159 transition count 256
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 190 place count 148 transition count 230
Iterating global reduction 3 with 11 rules applied. Total rules applied 201 place count 148 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 204 place count 148 transition count 227
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 211 place count 141 transition count 220
Iterating global reduction 4 with 7 rules applied. Total rules applied 218 place count 141 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 221 place count 141 transition count 217
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 225 place count 137 transition count 212
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 137 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 230 place count 137 transition count 211
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 231 place count 136 transition count 209
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 136 transition count 209
Applied a total of 232 rules in 12 ms. Remains 136 /234 variables (removed 98) and now considering 209/473 (removed 264) transitions.
// Phase 1: matrix 209 rows 136 cols
[2024-05-31 21:29:25] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:29:25] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-31 21:29:25] [INFO ] Invariant cache hit.
[2024-05-31 21:29:25] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-31 21:29:26] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2024-05-31 21:29:26] [INFO ] Invariant cache hit.
[2024-05-31 21:29:26] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/345 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 81/219 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/345 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 219 constraints, problems are : Problem set: 0 solved, 208 unsolved in 7044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 209/345 variables, 136/138 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 81/219 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 208/427 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 0/345 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 427 constraints, problems are : Problem set: 0 solved, 208 unsolved in 13043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 136/136 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints]
After SMT, in 20354ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 20360ms
Starting structural reductions in LTL mode, iteration 1 : 136/234 places, 209/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20847 ms. Remains : 136/234 places, 209/473 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-02 finished in 21088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 200 transition count 341
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 200 transition count 341
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 78 place count 200 transition count 331
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 104 place count 174 transition count 296
Iterating global reduction 1 with 26 rules applied. Total rules applied 130 place count 174 transition count 296
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 138 place count 174 transition count 288
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 161 place count 151 transition count 251
Iterating global reduction 2 with 23 rules applied. Total rules applied 184 place count 151 transition count 251
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 197 place count 151 transition count 238
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 210 place count 138 transition count 203
Iterating global reduction 3 with 13 rules applied. Total rules applied 223 place count 138 transition count 203
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 227 place count 138 transition count 199
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 234 place count 131 transition count 192
Iterating global reduction 4 with 7 rules applied. Total rules applied 241 place count 131 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 244 place count 131 transition count 189
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 248 place count 127 transition count 184
Iterating global reduction 5 with 4 rules applied. Total rules applied 252 place count 127 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 253 place count 127 transition count 183
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 254 place count 126 transition count 181
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 126 transition count 181
Applied a total of 255 rules in 15 ms. Remains 126 /234 variables (removed 108) and now considering 181/473 (removed 292) transitions.
// Phase 1: matrix 181 rows 126 cols
[2024-05-31 21:29:46] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:29:46] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 21:29:46] [INFO ] Invariant cache hit.
[2024-05-31 21:29:46] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-31 21:29:46] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-31 21:29:46] [INFO ] Invariant cache hit.
[2024-05-31 21:29:46] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 181/307 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 61/189 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-31 21:29:50] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 190 constraints, problems are : Problem set: 0 solved, 180 unsolved in 7626 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/307 variables, 126/129 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 61/190 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 180/370 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 0/307 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 370 constraints, problems are : Problem set: 0 solved, 180 unsolved in 12167 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 1/1 constraints]
After SMT, in 20014ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 20015ms
Starting structural reductions in LTL mode, iteration 1 : 126/234 places, 181/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20355 ms. Remains : 126/234 places, 181/473 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-03 finished in 20468 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(((p1 U p2)&&p0))))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 356
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 356
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 77 place count 201 transition count 345
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 101 place count 177 transition count 312
Iterating global reduction 1 with 24 rules applied. Total rules applied 125 place count 177 transition count 312
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 132 place count 177 transition count 305
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 153 place count 156 transition count 271
Iterating global reduction 2 with 21 rules applied. Total rules applied 174 place count 156 transition count 271
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 188 place count 156 transition count 257
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 200 place count 144 transition count 217
Iterating global reduction 3 with 12 rules applied. Total rules applied 212 place count 144 transition count 217
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 218 place count 144 transition count 211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 224 place count 138 transition count 205
Iterating global reduction 4 with 6 rules applied. Total rules applied 230 place count 138 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 231 place count 138 transition count 204
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 235 place count 134 transition count 199
Iterating global reduction 5 with 4 rules applied. Total rules applied 239 place count 134 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 240 place count 134 transition count 198
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 241 place count 133 transition count 196
Iterating global reduction 6 with 1 rules applied. Total rules applied 242 place count 133 transition count 196
Applied a total of 242 rules in 15 ms. Remains 133 /234 variables (removed 101) and now considering 196/473 (removed 277) transitions.
// Phase 1: matrix 196 rows 133 cols
[2024-05-31 21:30:07] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:30:07] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 21:30:07] [INFO ] Invariant cache hit.
[2024-05-31 21:30:07] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-31 21:30:07] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-31 21:30:07] [INFO ] Invariant cache hit.
[2024-05-31 21:30:07] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/329 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 68/203 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/329 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 203 constraints, problems are : Problem set: 0 solved, 195 unsolved in 4921 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/329 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 68/203 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 195/398 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/329 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 398 constraints, problems are : Problem set: 0 solved, 195 unsolved in 12272 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 17469ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 17472ms
Starting structural reductions in LTL mode, iteration 1 : 133/234 places, 196/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17856 ms. Remains : 133/234 places, 196/473 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-04 finished in 18010 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)))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 200 transition count 347
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 200 transition count 347
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 79 place count 200 transition count 336
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 104 place count 175 transition count 302
Iterating global reduction 1 with 25 rules applied. Total rules applied 129 place count 175 transition count 302
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 136 place count 175 transition count 295
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 158 place count 153 transition count 259
Iterating global reduction 2 with 22 rules applied. Total rules applied 180 place count 153 transition count 259
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 193 place count 153 transition count 246
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 206 place count 140 transition count 205
Iterating global reduction 3 with 13 rules applied. Total rules applied 219 place count 140 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 222 place count 140 transition count 202
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 229 place count 133 transition count 195
Iterating global reduction 4 with 7 rules applied. Total rules applied 236 place count 133 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 239 place count 133 transition count 192
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 243 place count 129 transition count 187
Iterating global reduction 5 with 4 rules applied. Total rules applied 247 place count 129 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 248 place count 129 transition count 186
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 249 place count 128 transition count 184
Iterating global reduction 6 with 1 rules applied. Total rules applied 250 place count 128 transition count 184
Applied a total of 250 rules in 15 ms. Remains 128 /234 variables (removed 106) and now considering 184/473 (removed 289) transitions.
// Phase 1: matrix 184 rows 128 cols
[2024-05-31 21:30:25] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:30:25] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 21:30:25] [INFO ] Invariant cache hit.
[2024-05-31 21:30:25] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-31 21:30:25] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-31 21:30:25] [INFO ] Invariant cache hit.
[2024-05-31 21:30:25] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-31 21:30:26] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/312 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 62/193 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (OVERLAPS) 0/312 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 193 constraints, problems are : Problem set: 0 solved, 183 unsolved in 5991 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (OVERLAPS) 184/312 variables, 128/131 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 62/193 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 183/376 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 0/312 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 376 constraints, problems are : Problem set: 0 solved, 183 unsolved in 12360 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 1/1 constraints]
After SMT, in 18584ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 18587ms
Starting structural reductions in LTL mode, iteration 1 : 128/234 places, 184/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18925 ms. Remains : 128/234 places, 184/473 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-05 finished in 19020 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(p1))&&p0)))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 353
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 353
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 80 place count 201 transition count 339
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 105 place count 176 transition count 305
Iterating global reduction 1 with 25 rules applied. Total rules applied 130 place count 176 transition count 305
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 138 place count 176 transition count 297
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 160 place count 154 transition count 261
Iterating global reduction 2 with 22 rules applied. Total rules applied 182 place count 154 transition count 261
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 195 place count 154 transition count 248
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 208 place count 141 transition count 213
Iterating global reduction 3 with 13 rules applied. Total rules applied 221 place count 141 transition count 213
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 225 place count 141 transition count 209
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 232 place count 134 transition count 202
Iterating global reduction 4 with 7 rules applied. Total rules applied 239 place count 134 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 242 place count 134 transition count 199
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 246 place count 130 transition count 194
Iterating global reduction 5 with 4 rules applied. Total rules applied 250 place count 130 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 251 place count 130 transition count 193
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 252 place count 129 transition count 191
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 129 transition count 191
Applied a total of 253 rules in 21 ms. Remains 129 /234 variables (removed 105) and now considering 191/473 (removed 282) transitions.
// Phase 1: matrix 191 rows 129 cols
[2024-05-31 21:30:44] [INFO ] Computed 2 invariants in 5 ms
[2024-05-31 21:30:44] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-31 21:30:44] [INFO ] Invariant cache hit.
[2024-05-31 21:30:44] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-31 21:30:44] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-31 21:30:44] [INFO ] Invariant cache hit.
[2024-05-31 21:30:44] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/320 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 70/201 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/320 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 201 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6647 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 191/320 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 70/201 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 190/391 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 0/320 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 391 constraints, problems are : Problem set: 0 solved, 190 unsolved in 11117 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 17992ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 17995ms
Starting structural reductions in LTL mode, iteration 1 : 129/234 places, 191/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18391 ms. Remains : 129/234 places, 191/473 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-06 finished in 18533 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(p1) U G((p1 U !p2)))||X(p2)||p0)))'
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 202 transition count 343
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 202 transition count 343
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 74 place count 202 transition count 333
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 97 place count 179 transition count 305
Iterating global reduction 1 with 23 rules applied. Total rules applied 120 place count 179 transition count 305
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 128 place count 179 transition count 297
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 148 place count 159 transition count 267
Iterating global reduction 2 with 20 rules applied. Total rules applied 168 place count 159 transition count 267
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 180 place count 159 transition count 255
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 192 place count 147 transition count 214
Iterating global reduction 3 with 12 rules applied. Total rules applied 204 place count 147 transition count 214
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 208 place count 147 transition count 210
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 213 place count 142 transition count 205
Iterating global reduction 4 with 5 rules applied. Total rules applied 218 place count 142 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 221 place count 142 transition count 202
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 223 place count 140 transition count 200
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 140 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 226 place count 140 transition count 199
Applied a total of 226 rules in 16 ms. Remains 140 /234 variables (removed 94) and now considering 199/473 (removed 274) transitions.
// Phase 1: matrix 199 rows 140 cols
[2024-05-31 21:31:02] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:31:02] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 21:31:02] [INFO ] Invariant cache hit.
[2024-05-31 21:31:02] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-31 21:31:03] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-31 21:31:03] [INFO ] Invariant cache hit.
[2024-05-31 21:31:03] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/339 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 62/204 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 204 constraints, problems are : Problem set: 0 solved, 198 unsolved in 6005 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/339 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 62/204 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 198/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 402 constraints, problems are : Problem set: 0 solved, 198 unsolved in 13557 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 19915ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 19917ms
Starting structural reductions in LTL mode, iteration 1 : 140/234 places, 199/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20345 ms. Remains : 140/234 places, 199/473 transitions.
Stuttering acceptance computed with spot in 242 ms :[false, false, false, (AND (NOT p1) (NOT p2)), p2, (NOT p1), p2]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 501 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 15 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-07 finished in 21191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&G(!p1)) U (G((!p0&&G(!p1)))||p2)))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 202 transition count 351
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 202 transition count 351
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 74 place count 202 transition count 341
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 98 place count 178 transition count 308
Iterating global reduction 1 with 24 rules applied. Total rules applied 122 place count 178 transition count 308
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 130 place count 178 transition count 300
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 151 place count 157 transition count 266
Iterating global reduction 2 with 21 rules applied. Total rules applied 172 place count 157 transition count 266
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 185 place count 157 transition count 253
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 196 place count 146 transition count 227
Iterating global reduction 3 with 11 rules applied. Total rules applied 207 place count 146 transition count 227
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 215 place count 146 transition count 219
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 221 place count 140 transition count 213
Iterating global reduction 4 with 6 rules applied. Total rules applied 227 place count 140 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 229 place count 140 transition count 211
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 233 place count 136 transition count 206
Iterating global reduction 5 with 4 rules applied. Total rules applied 237 place count 136 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 238 place count 136 transition count 205
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 239 place count 135 transition count 203
Iterating global reduction 6 with 1 rules applied. Total rules applied 240 place count 135 transition count 203
Applied a total of 240 rules in 31 ms. Remains 135 /234 variables (removed 99) and now considering 203/473 (removed 270) transitions.
// Phase 1: matrix 203 rows 135 cols
[2024-05-31 21:31:23] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:31:23] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-31 21:31:23] [INFO ] Invariant cache hit.
[2024-05-31 21:31:24] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-31 21:31:24] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-31 21:31:24] [INFO ] Redundant transitions in 1 ms returned []
Running 202 sub problems to find dead transitions.
[2024-05-31 21:31:24] [INFO ] Invariant cache hit.
[2024-05-31 21:31:24] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/338 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 76/213 constraints. Problems are: Problem set: 0 solved, 202 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/338 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 213 constraints, problems are : Problem set: 0 solved, 202 unsolved in 5891 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/338 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 76/213 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 202/415 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 415 constraints, problems are : Problem set: 0 solved, 202 unsolved in 13597 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints]
After SMT, in 19787ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 19790ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/234 places, 203/473 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20247 ms. Remains : 135/234 places, 203/473 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), true, p1]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-08
Product exploration explored 100000 steps with 23011 reset in 316 ms.
Product exploration explored 100000 steps with 22948 reset in 268 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 495 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 106 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), true, p1]
RANDOM walk for 40000 steps (9163 resets) in 413 ms. (96 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1807 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1739 resets) in 345 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1752 resets) in 395 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1806 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1827 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 23672 steps, run visited all 5 properties in 108 ms. (steps per millisecond=219 )
Probabilistic random walk after 23672 steps, saw 11687 distinct states, run finished after 108 ms. (steps per millisecond=219 ) properties seen :5
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p1) p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 11 factoid took 153 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-08 finished in 21963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0)) U G(p1))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 348
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 348
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 76 place count 201 transition count 338
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 176 transition count 304
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 176 transition count 304
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 132 place count 176 transition count 298
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 154 place count 154 transition count 263
Iterating global reduction 2 with 22 rules applied. Total rules applied 176 place count 154 transition count 263
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 189 place count 154 transition count 250
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 201 place count 142 transition count 217
Iterating global reduction 3 with 12 rules applied. Total rules applied 213 place count 142 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 216 place count 142 transition count 214
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 223 place count 135 transition count 207
Iterating global reduction 4 with 7 rules applied. Total rules applied 230 place count 135 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 233 place count 135 transition count 204
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 237 place count 131 transition count 199
Iterating global reduction 5 with 4 rules applied. Total rules applied 241 place count 131 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 131 transition count 198
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 243 place count 130 transition count 196
Iterating global reduction 6 with 1 rules applied. Total rules applied 244 place count 130 transition count 196
Applied a total of 244 rules in 18 ms. Remains 130 /234 variables (removed 104) and now considering 196/473 (removed 277) transitions.
// Phase 1: matrix 196 rows 130 cols
[2024-05-31 21:31:45] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 21:31:45] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-31 21:31:45] [INFO ] Invariant cache hit.
[2024-05-31 21:31:45] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-31 21:31:46] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-31 21:31:46] [INFO ] Invariant cache hit.
[2024-05-31 21:31:46] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/326 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 71/203 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-31 21:31:49] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/326 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 204 constraints, problems are : Problem set: 0 solved, 195 unsolved in 8115 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/326 variables, 130/133 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 71/204 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 195/399 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/326 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 399 constraints, problems are : Problem set: 0 solved, 195 unsolved in 15070 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 1/1 constraints]
After SMT, in 23452ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 23455ms
Starting structural reductions in LTL mode, iteration 1 : 130/234 places, 196/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23847 ms. Remains : 130/234 places, 196/473 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-09
Stuttering criterion allowed to conclude after 21 steps with 5 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-09 finished in 24021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&X((F(p3)&&p2))&&p0)))'
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 203 transition count 344
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 203 transition count 344
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 69 place count 203 transition count 337
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 91 place count 181 transition count 310
Iterating global reduction 1 with 22 rules applied. Total rules applied 113 place count 181 transition count 310
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 121 place count 181 transition count 302
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 141 place count 161 transition count 270
Iterating global reduction 2 with 20 rules applied. Total rules applied 161 place count 161 transition count 270
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 171 place count 161 transition count 260
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 182 place count 150 transition count 240
Iterating global reduction 3 with 11 rules applied. Total rules applied 193 place count 150 transition count 240
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 150 transition count 236
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 204 place count 143 transition count 229
Iterating global reduction 4 with 7 rules applied. Total rules applied 211 place count 143 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 214 place count 143 transition count 226
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 218 place count 139 transition count 221
Iterating global reduction 5 with 4 rules applied. Total rules applied 222 place count 139 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 223 place count 139 transition count 220
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 224 place count 138 transition count 218
Iterating global reduction 6 with 1 rules applied. Total rules applied 225 place count 138 transition count 218
Applied a total of 225 rules in 22 ms. Remains 138 /234 variables (removed 96) and now considering 218/473 (removed 255) transitions.
// Phase 1: matrix 218 rows 138 cols
[2024-05-31 21:32:09] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:32:09] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-31 21:32:09] [INFO ] Invariant cache hit.
[2024-05-31 21:32:10] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-31 21:32:10] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-31 21:32:10] [INFO ] Invariant cache hit.
[2024-05-31 21:32:10] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/356 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 90/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/356 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 230 constraints, problems are : Problem set: 0 solved, 217 unsolved in 6362 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/356 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 90/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 217/447 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/356 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 447 constraints, problems are : Problem set: 0 solved, 217 unsolved in 15573 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 22271ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 22274ms
Starting structural reductions in LTL mode, iteration 1 : 138/234 places, 218/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22710 ms. Remains : 138/234 places, 218/473 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p3) (NOT p0)), true]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-10 finished in 22950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(((!G((p1 U p2)) U !F(p1))||p0)))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 350
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 350
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 77 place count 201 transition count 339
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 101 place count 177 transition count 306
Iterating global reduction 1 with 24 rules applied. Total rules applied 125 place count 177 transition count 306
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 133 place count 177 transition count 298
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 154 place count 156 transition count 264
Iterating global reduction 2 with 21 rules applied. Total rules applied 175 place count 156 transition count 264
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 189 place count 156 transition count 250
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 201 place count 144 transition count 216
Iterating global reduction 3 with 12 rules applied. Total rules applied 213 place count 144 transition count 216
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 221 place count 144 transition count 208
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 227 place count 138 transition count 202
Iterating global reduction 4 with 6 rules applied. Total rules applied 233 place count 138 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 236 place count 138 transition count 199
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 240 place count 134 transition count 194
Iterating global reduction 5 with 4 rules applied. Total rules applied 244 place count 134 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 245 place count 133 transition count 192
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 133 transition count 192
Applied a total of 246 rules in 20 ms. Remains 133 /234 variables (removed 101) and now considering 192/473 (removed 281) transitions.
// Phase 1: matrix 192 rows 133 cols
[2024-05-31 21:32:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:32:32] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 21:32:32] [INFO ] Invariant cache hit.
[2024-05-31 21:32:32] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:32:33] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-31 21:32:33] [INFO ] Invariant cache hit.
[2024-05-31 21:32:33] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 201 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5633 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 191/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 392 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12394 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 18308ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 18310ms
Starting structural reductions in LTL mode, iteration 1 : 133/234 places, 192/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18664 ms. Remains : 133/234 places, 192/473 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-11
Product exploration explored 100000 steps with 23058 reset in 168 ms.
Product exploration explored 100000 steps with 22965 reset in 194 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 482 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 40000 steps (9200 resets) in 194 ms. (205 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1732 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1769 resets) in 180 ms. (221 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1807 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 21803 steps, run visited all 3 properties in 160 ms. (steps per millisecond=136 )
Probabilistic random walk after 21803 steps, saw 10751 distinct states, run finished after 160 ms. (steps per millisecond=136 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p2)]
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 192/192 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 21:32:53] [INFO ] Invariant cache hit.
[2024-05-31 21:32:53] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 21:32:53] [INFO ] Invariant cache hit.
[2024-05-31 21:32:53] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:32:53] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-31 21:32:53] [INFO ] Invariant cache hit.
[2024-05-31 21:32:53] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 201 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5285 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 191/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 392 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12594 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 18115ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 18117ms
Finished structural reductions in LTL mode , in 1 iterations and 18482 ms. Remains : 133/133 places, 192/192 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 482 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 40000 steps (9100 resets) in 358 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1803 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1772 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1702 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 21803 steps, run visited all 3 properties in 101 ms. (steps per millisecond=215 )
Probabilistic random walk after 21803 steps, saw 10751 distinct states, run finished after 101 ms. (steps per millisecond=215 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p2)]
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Product exploration explored 100000 steps with 23062 reset in 169 ms.
Product exploration explored 100000 steps with 23045 reset in 175 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 192/192 transitions.
Applied a total of 0 rules in 8 ms. Remains 133 /133 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 21:33:14] [INFO ] Redundant transitions in 2 ms returned []
Running 191 sub problems to find dead transitions.
[2024-05-31 21:33:14] [INFO ] Invariant cache hit.
[2024-05-31 21:33:14] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 201 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5449 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 191/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 392 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12636 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 18326ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 18328ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18345 ms. Remains : 133/133 places, 192/192 transitions.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 21:33:32] [INFO ] Invariant cache hit.
[2024-05-31 21:33:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 21:33:32] [INFO ] Invariant cache hit.
[2024-05-31 21:33:32] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:33:32] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-31 21:33:32] [INFO ] Invariant cache hit.
[2024-05-31 21:33:32] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 201 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5496 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 191/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 392 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12454 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 18187ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 18189ms
Finished structural reductions in LTL mode , in 1 iterations and 18525 ms. Remains : 133/133 places, 192/192 transitions.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-11 finished in 78191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((p1||G(F(p2)))))))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 202 transition count 363
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 202 transition count 363
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 76 place count 202 transition count 351
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 177 transition count 317
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 177 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 136 place count 177 transition count 307
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 158 place count 155 transition count 271
Iterating global reduction 2 with 22 rules applied. Total rules applied 180 place count 155 transition count 271
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 195 place count 155 transition count 256
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 207 place count 143 transition count 223
Iterating global reduction 3 with 12 rules applied. Total rules applied 219 place count 143 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 223 place count 143 transition count 219
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 229 place count 137 transition count 213
Iterating global reduction 4 with 6 rules applied. Total rules applied 235 place count 137 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 238 place count 137 transition count 210
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 241 place count 134 transition count 206
Iterating global reduction 5 with 3 rules applied. Total rules applied 244 place count 134 transition count 206
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 245 place count 133 transition count 204
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 133 transition count 204
Applied a total of 246 rules in 31 ms. Remains 133 /234 variables (removed 101) and now considering 204/473 (removed 269) transitions.
// Phase 1: matrix 204 rows 133 cols
[2024-05-31 21:33:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:33:51] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 21:33:51] [INFO ] Invariant cache hit.
[2024-05-31 21:33:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 21:33:51] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-31 21:33:51] [INFO ] Invariant cache hit.
[2024-05-31 21:33:51] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5653 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18237 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 24152ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 24154ms
Starting structural reductions in LTL mode, iteration 1 : 133/234 places, 204/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24562 ms. Remains : 133/234 places, 204/473 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-12
Product exploration explored 100000 steps with 29792 reset in 190 ms.
Product exploration explored 100000 steps with 29797 reset in 193 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 128 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9178 resets) in 367 ms. (108 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1805 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1820 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1796 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1819 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1777 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1762 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1763 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1754 resets) in 230 ms. (173 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 73712 steps, run visited all 8 properties in 356 ms. (steps per millisecond=207 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 356 ms. (steps per millisecond=207 ) properties seen :8
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR (NOT p1) p2 p0))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 12 factoid took 430 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-31 21:34:18] [INFO ] Invariant cache hit.
[2024-05-31 21:34:18] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-31 21:34:18] [INFO ] Invariant cache hit.
[2024-05-31 21:34:18] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 21:34:18] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-31 21:34:18] [INFO ] Invariant cache hit.
[2024-05-31 21:34:18] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5663 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 23935ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 23938ms
Finished structural reductions in LTL mode , in 1 iterations and 24325 ms. Remains : 133/133 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 123 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9190 resets) in 605 ms. (66 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1818 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1866 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1830 resets) in 220 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1849 resets) in 192 ms. (207 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1791 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1754 resets) in 183 ms. (217 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1766 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1754 resets) in 178 ms. (223 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 73712 steps, run visited all 8 properties in 350 ms. (steps per millisecond=210 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 350 ms. (steps per millisecond=210 ) properties seen :8
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 12 factoid took 419 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 29879 reset in 190 ms.
Product exploration explored 100000 steps with 29776 reset in 194 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-31 21:34:45] [INFO ] Redundant transitions in 1 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-31 21:34:45] [INFO ] Invariant cache hit.
[2024-05-31 21:34:45] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5567 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18766 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 24615ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 24617ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24632 ms. Remains : 133/133 places, 204/204 transitions.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-31 21:35:09] [INFO ] Invariant cache hit.
[2024-05-31 21:35:10] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 21:35:10] [INFO ] Invariant cache hit.
[2024-05-31 21:35:10] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 21:35:10] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-31 21:35:10] [INFO ] Invariant cache hit.
[2024-05-31 21:35:10] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5711 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18695 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 24696ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 24698ms
Finished structural reductions in LTL mode , in 1 iterations and 25053 ms. Remains : 133/133 places, 204/204 transitions.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-12 finished in 104065 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||G(p1)||X(F(p2))))))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 343
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 343
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 76 place count 201 transition count 333
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 176 transition count 299
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 176 transition count 299
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 134 place count 176 transition count 291
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 156 place count 154 transition count 255
Iterating global reduction 2 with 22 rules applied. Total rules applied 178 place count 154 transition count 255
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 190 place count 154 transition count 243
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 202 place count 142 transition count 215
Iterating global reduction 3 with 12 rules applied. Total rules applied 214 place count 142 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 218 place count 142 transition count 211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 224 place count 136 transition count 205
Iterating global reduction 4 with 6 rules applied. Total rules applied 230 place count 136 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 233 place count 136 transition count 202
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 236 place count 133 transition count 198
Iterating global reduction 5 with 3 rules applied. Total rules applied 239 place count 133 transition count 198
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 240 place count 132 transition count 196
Iterating global reduction 5 with 1 rules applied. Total rules applied 241 place count 132 transition count 196
Applied a total of 241 rules in 9 ms. Remains 132 /234 variables (removed 102) and now considering 196/473 (removed 277) transitions.
// Phase 1: matrix 196 rows 132 cols
[2024-05-31 21:35:35] [INFO ] Computed 2 invariants in 4 ms
[2024-05-31 21:35:35] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-31 21:35:35] [INFO ] Invariant cache hit.
[2024-05-31 21:35:35] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-31 21:35:35] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-31 21:35:35] [INFO ] Invariant cache hit.
[2024-05-31 21:35:35] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 195 unsolved in 5298 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 195/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 400 constraints, problems are : Problem set: 0 solved, 195 unsolved in 14118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 19677ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 19679ms
Starting structural reductions in LTL mode, iteration 1 : 132/234 places, 196/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20164 ms. Remains : 132/234 places, 196/473 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-13
Product exploration explored 100000 steps with 23027 reset in 198 ms.
Product exploration explored 100000 steps with 23068 reset in 235 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 482 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9135 resets) in 700 ms. (57 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (1781 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1779 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
[2024-05-31 21:35:56] [INFO ] Invariant cache hit.
[2024-05-31 21:35:56] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/328 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/328 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 207 constraints, problems are : Problem set: 0 solved, 2 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 592ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 322 ms.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 196/196 transitions.
Graph (complete) has 451 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 130 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 130 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 129 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 129 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 129 transition count 190
Applied a total of 9 rules in 15 ms. Remains 129 /132 variables (removed 3) and now considering 190/196 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 129/132 places, 190/196 transitions.
RANDOM walk for 40000 steps (9270 resets) in 424 ms. (94 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1816 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1801 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18052 steps, run visited all 2 properties in 131 ms. (steps per millisecond=137 )
Probabilistic random walk after 18052 steps, saw 8856 distinct states, run finished after 131 ms. (steps per millisecond=137 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F p2), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (NOT (OR p1 p0 p2)))]
Knowledge based reduction with 7 factoid took 299 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-31 21:35:58] [INFO ] Invariant cache hit.
[2024-05-31 21:35:58] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 21:35:58] [INFO ] Invariant cache hit.
[2024-05-31 21:35:58] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-31 21:35:58] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-31 21:35:58] [INFO ] Invariant cache hit.
[2024-05-31 21:35:58] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 195 unsolved in 5391 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 195/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 400 constraints, problems are : Problem set: 0 solved, 195 unsolved in 14047 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 19689ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 19692ms
Finished structural reductions in LTL mode , in 1 iterations and 20143 ms. Remains : 132/132 places, 196/196 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 482 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (9119 resets) in 394 ms. (101 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (1723 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1745 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
[2024-05-31 21:36:18] [INFO ] Invariant cache hit.
[2024-05-31 21:36:18] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/328 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/328 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 207 constraints, problems are : Problem set: 0 solved, 2 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 589ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 376 ms.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 196/196 transitions.
Graph (complete) has 451 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 130 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 130 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 129 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 129 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 129 transition count 190
Applied a total of 9 rules in 7 ms. Remains 129 /132 variables (removed 3) and now considering 190/196 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 129/132 places, 190/196 transitions.
RANDOM walk for 40000 steps (9167 resets) in 292 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1771 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1815 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18052 steps, run visited all 2 properties in 86 ms. (steps per millisecond=209 )
Probabilistic random walk after 18052 steps, saw 8856 distinct states, run finished after 86 ms. (steps per millisecond=209 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT p1)), (F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 6 factoid took 270 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 22835 reset in 203 ms.
Product exploration explored 100000 steps with 23008 reset in 217 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 196/196 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-31 21:36:21] [INFO ] Redundant transitions in 1 ms returned []
Running 195 sub problems to find dead transitions.
[2024-05-31 21:36:21] [INFO ] Invariant cache hit.
[2024-05-31 21:36:21] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 195 unsolved in 5530 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 195/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 400 constraints, problems are : Problem set: 0 solved, 195 unsolved in 14081 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 19878ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 19881ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19902 ms. Remains : 132/132 places, 196/196 transitions.
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-31 21:36:41] [INFO ] Invariant cache hit.
[2024-05-31 21:36:41] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 21:36:41] [INFO ] Invariant cache hit.
[2024-05-31 21:36:41] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-31 21:36:41] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-31 21:36:41] [INFO ] Invariant cache hit.
[2024-05-31 21:36:41] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 195 unsolved in 5297 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 195/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 400 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13815 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 19389ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 19392ms
Finished structural reductions in LTL mode , in 1 iterations and 19837 ms. Remains : 132/132 places, 196/196 transitions.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-13 finished in 85928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 350
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 350
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 77 place count 201 transition count 339
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 101 place count 177 transition count 306
Iterating global reduction 1 with 24 rules applied. Total rules applied 125 place count 177 transition count 306
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 132 place count 177 transition count 299
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 153 place count 156 transition count 266
Iterating global reduction 2 with 21 rules applied. Total rules applied 174 place count 156 transition count 266
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 188 place count 156 transition count 252
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 201 place count 143 transition count 210
Iterating global reduction 3 with 13 rules applied. Total rules applied 214 place count 143 transition count 210
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 222 place count 143 transition count 202
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 228 place count 137 transition count 196
Iterating global reduction 4 with 6 rules applied. Total rules applied 234 place count 137 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 235 place count 137 transition count 195
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 239 place count 133 transition count 190
Iterating global reduction 5 with 4 rules applied. Total rules applied 243 place count 133 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 133 transition count 189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 245 place count 132 transition count 187
Iterating global reduction 6 with 1 rules applied. Total rules applied 246 place count 132 transition count 187
Applied a total of 246 rules in 22 ms. Remains 132 /234 variables (removed 102) and now considering 187/473 (removed 286) transitions.
// Phase 1: matrix 187 rows 132 cols
[2024-05-31 21:37:00] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:37:01] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 21:37:01] [INFO ] Invariant cache hit.
[2024-05-31 21:37:01] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-31 21:37:01] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-31 21:37:01] [INFO ] Redundant transitions in 1 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-31 21:37:01] [INFO ] Invariant cache hit.
[2024-05-31 21:37:01] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/319 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 60/194 constraints. Problems are: Problem set: 0 solved, 186 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 194 constraints, problems are : Problem set: 0 solved, 186 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/319 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 60/194 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 186/380 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 380 constraints, problems are : Problem set: 0 solved, 186 unsolved in 11156 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
After SMT, in 16423ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 16426ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/234 places, 187/473 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16787 ms. Remains : 132/234 places, 187/473 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-15 finished in 16885 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(((!G((p1 U p2)) U !F(p1))||p0)))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d2m07-LTLFireability-11
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 350
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 350
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 77 place count 201 transition count 339
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 101 place count 177 transition count 306
Iterating global reduction 1 with 24 rules applied. Total rules applied 125 place count 177 transition count 306
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 133 place count 177 transition count 298
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 154 place count 156 transition count 264
Iterating global reduction 2 with 21 rules applied. Total rules applied 175 place count 156 transition count 264
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 189 place count 156 transition count 250
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 201 place count 144 transition count 216
Iterating global reduction 3 with 12 rules applied. Total rules applied 213 place count 144 transition count 216
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 221 place count 144 transition count 208
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 227 place count 138 transition count 202
Iterating global reduction 4 with 6 rules applied. Total rules applied 233 place count 138 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 236 place count 138 transition count 199
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 240 place count 134 transition count 194
Iterating global reduction 5 with 4 rules applied. Total rules applied 244 place count 134 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 245 place count 133 transition count 192
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 133 transition count 192
Applied a total of 246 rules in 21 ms. Remains 133 /234 variables (removed 101) and now considering 192/473 (removed 281) transitions.
// Phase 1: matrix 192 rows 133 cols
[2024-05-31 21:37:18] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:37:18] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 21:37:18] [INFO ] Invariant cache hit.
[2024-05-31 21:37:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:37:18] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-31 21:37:18] [INFO ] Invariant cache hit.
[2024-05-31 21:37:18] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 201 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5311 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 191/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 392 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12508 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 18078ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 18081ms
Starting structural reductions in LI_LTL mode, iteration 1 : 133/234 places, 192/473 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 18466 ms. Remains : 133/234 places, 192/473 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-11
Product exploration explored 100000 steps with 22805 reset in 165 ms.
Product exploration explored 100000 steps with 23010 reset in 170 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 482 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 40000 steps (9209 resets) in 550 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1698 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1727 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1775 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 21803 steps, run visited all 3 properties in 103 ms. (steps per millisecond=211 )
Probabilistic random walk after 21803 steps, saw 10751 distinct states, run finished after 103 ms. (steps per millisecond=211 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p2)]
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 21:37:38] [INFO ] Invariant cache hit.
[2024-05-31 21:37:38] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 21:37:38] [INFO ] Invariant cache hit.
[2024-05-31 21:37:38] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:37:38] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-31 21:37:38] [INFO ] Invariant cache hit.
[2024-05-31 21:37:38] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 201 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5196 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 191/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 392 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12751 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 18181ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 18183ms
Finished structural reductions in LTL mode , in 1 iterations and 18507 ms. Remains : 133/133 places, 192/192 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 482 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 40000 steps (9176 resets) in 372 ms. (107 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1741 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1830 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1829 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 21803 steps, run visited all 3 properties in 108 ms. (steps per millisecond=201 )
Probabilistic random walk after 21803 steps, saw 10751 distinct states, run finished after 108 ms. (steps per millisecond=201 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p2)]
Knowledge based reduction with 4 factoid took 231 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Product exploration explored 100000 steps with 23102 reset in 167 ms.
Product exploration explored 100000 steps with 23012 reset in 176 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p2, p1]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 192/192 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 21:37:59] [INFO ] Redundant transitions in 1 ms returned []
Running 191 sub problems to find dead transitions.
[2024-05-31 21:37:59] [INFO ] Invariant cache hit.
[2024-05-31 21:37:59] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 201 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5344 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 191/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 392 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12602 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 18188ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 18191ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18214 ms. Remains : 133/133 places, 192/192 transitions.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-05-31 21:38:17] [INFO ] Invariant cache hit.
[2024-05-31 21:38:17] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 21:38:17] [INFO ] Invariant cache hit.
[2024-05-31 21:38:17] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-31 21:38:17] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-31 21:38:17] [INFO ] Invariant cache hit.
[2024-05-31 21:38:17] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 201 constraints, problems are : Problem set: 0 solved, 191 unsolved in 5427 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 192/325 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 66/201 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 191/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/325 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 392 constraints, problems are : Problem set: 0 solved, 191 unsolved in 12499 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints]
After SMT, in 18173ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 18175ms
Finished structural reductions in LTL mode , in 1 iterations and 18551 ms. Remains : 133/133 places, 192/192 transitions.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-11 finished in 78070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X((p1||G(F(p2)))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d2m07-LTLFireability-12
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 202 transition count 363
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 202 transition count 363
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 76 place count 202 transition count 351
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 177 transition count 317
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 177 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 136 place count 177 transition count 307
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 158 place count 155 transition count 271
Iterating global reduction 2 with 22 rules applied. Total rules applied 180 place count 155 transition count 271
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 195 place count 155 transition count 256
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 207 place count 143 transition count 223
Iterating global reduction 3 with 12 rules applied. Total rules applied 219 place count 143 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 223 place count 143 transition count 219
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 229 place count 137 transition count 213
Iterating global reduction 4 with 6 rules applied. Total rules applied 235 place count 137 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 238 place count 137 transition count 210
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 241 place count 134 transition count 206
Iterating global reduction 5 with 3 rules applied. Total rules applied 244 place count 134 transition count 206
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 245 place count 133 transition count 204
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 133 transition count 204
Applied a total of 246 rules in 25 ms. Remains 133 /234 variables (removed 101) and now considering 204/473 (removed 269) transitions.
// Phase 1: matrix 204 rows 133 cols
[2024-05-31 21:38:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:38:36] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-31 21:38:36] [INFO ] Invariant cache hit.
[2024-05-31 21:38:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 21:38:36] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-31 21:38:36] [INFO ] Invariant cache hit.
[2024-05-31 21:38:36] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5849 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18518 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 24629ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 24632ms
Starting structural reductions in LI_LTL mode, iteration 1 : 133/234 places, 204/473 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 25034 ms. Remains : 133/234 places, 204/473 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-12
Product exploration explored 100000 steps with 29873 reset in 189 ms.
Product exploration explored 100000 steps with 29802 reset in 197 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 128 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9144 resets) in 431 ms. (92 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1832 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1785 resets) in 134 ms. (296 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1767 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1758 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1755 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1773 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1812 resets) in 196 ms. (203 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1872 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 73712 steps, run visited all 8 properties in 275 ms. (steps per millisecond=268 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 275 ms. (steps per millisecond=268 ) properties seen :8
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR (NOT p1) p2 p0))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR p1 p2 p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 12 factoid took 406 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-31 21:39:03] [INFO ] Invariant cache hit.
[2024-05-31 21:39:03] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 21:39:03] [INFO ] Invariant cache hit.
[2024-05-31 21:39:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 21:39:03] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-31 21:39:03] [INFO ] Invariant cache hit.
[2024-05-31 21:39:03] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5786 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18810 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 24857ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 24860ms
Finished structural reductions in LTL mode , in 1 iterations and 25221 ms. Remains : 133/133 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 491 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 108 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9193 resets) in 435 ms. (91 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1769 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1780 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1871 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1823 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1803 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1782 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1732 resets) in 170 ms. (233 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1825 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 73712 steps, run visited all 8 properties in 353 ms. (steps per millisecond=208 )
Probabilistic random walk after 73712 steps, saw 32576 distinct states, run finished after 354 ms. (steps per millisecond=208 ) properties seen :8
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p2 p1)))]
Knowledge based reduction with 12 factoid took 400 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 29821 reset in 190 ms.
Product exploration explored 100000 steps with 29835 reset in 194 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-31 21:39:31] [INFO ] Redundant transitions in 1 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-31 21:39:31] [INFO ] Invariant cache hit.
[2024-05-31 21:39:31] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5794 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18859 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 24916ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 24918ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24929 ms. Remains : 133/133 places, 204/204 transitions.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 133 /133 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-31 21:39:56] [INFO ] Invariant cache hit.
[2024-05-31 21:39:56] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 21:39:56] [INFO ] Invariant cache hit.
[2024-05-31 21:39:56] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 21:39:56] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-31 21:39:56] [INFO ] Invariant cache hit.
[2024-05-31 21:39:56] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 213 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5815 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/337 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 78/213 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 203/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/337 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 416 constraints, problems are : Problem set: 0 solved, 203 unsolved in 18984 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 25096ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 25098ms
Finished structural reductions in LTL mode , in 1 iterations and 25447 ms. Remains : 133/133 places, 204/204 transitions.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-12 finished in 106061 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||G(p1)||X(F(p2))))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d2m07-LTLFireability-13
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 234/234 places, 473/473 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 201 transition count 343
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 201 transition count 343
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 76 place count 201 transition count 333
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 101 place count 176 transition count 299
Iterating global reduction 1 with 25 rules applied. Total rules applied 126 place count 176 transition count 299
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 134 place count 176 transition count 291
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 156 place count 154 transition count 255
Iterating global reduction 2 with 22 rules applied. Total rules applied 178 place count 154 transition count 255
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 190 place count 154 transition count 243
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 202 place count 142 transition count 215
Iterating global reduction 3 with 12 rules applied. Total rules applied 214 place count 142 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 218 place count 142 transition count 211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 224 place count 136 transition count 205
Iterating global reduction 4 with 6 rules applied. Total rules applied 230 place count 136 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 233 place count 136 transition count 202
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 236 place count 133 transition count 198
Iterating global reduction 5 with 3 rules applied. Total rules applied 239 place count 133 transition count 198
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 240 place count 132 transition count 196
Iterating global reduction 5 with 1 rules applied. Total rules applied 241 place count 132 transition count 196
Applied a total of 241 rules in 21 ms. Remains 132 /234 variables (removed 102) and now considering 196/473 (removed 277) transitions.
// Phase 1: matrix 196 rows 132 cols
[2024-05-31 21:40:22] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:40:22] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 21:40:22] [INFO ] Invariant cache hit.
[2024-05-31 21:40:22] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-31 21:40:22] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-31 21:40:22] [INFO ] Invariant cache hit.
[2024-05-31 21:40:22] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 195 unsolved in 5327 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 195/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 400 constraints, problems are : Problem set: 0 solved, 195 unsolved in 14019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 19621ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 19623ms
Starting structural reductions in LI_LTL mode, iteration 1 : 132/234 places, 196/473 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 20067 ms. Remains : 132/234 places, 196/473 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m07-LTLFireability-13
Product exploration explored 100000 steps with 22961 reset in 168 ms.
Product exploration explored 100000 steps with 22837 reset in 178 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 482 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9201 resets) in 324 ms. (123 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (1781 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1808 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
[2024-05-31 21:40:43] [INFO ] Invariant cache hit.
[2024-05-31 21:40:43] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/328 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/328 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 207 constraints, problems are : Problem set: 0 solved, 2 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 623ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 383 ms.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 196/196 transitions.
Graph (complete) has 451 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 130 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 130 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 129 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 129 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 129 transition count 190
Applied a total of 9 rules in 7 ms. Remains 129 /132 variables (removed 3) and now considering 190/196 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 129/132 places, 190/196 transitions.
RANDOM walk for 40000 steps (9149 resets) in 397 ms. (100 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (1722 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1771 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18052 steps, run visited all 2 properties in 74 ms. (steps per millisecond=243 )
Probabilistic random walk after 18052 steps, saw 8856 distinct states, run finished after 74 ms. (steps per millisecond=243 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F p2), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (NOT (OR p1 p0 p2)))]
Knowledge based reduction with 7 factoid took 244 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-31 21:40:44] [INFO ] Invariant cache hit.
[2024-05-31 21:40:44] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 21:40:44] [INFO ] Invariant cache hit.
[2024-05-31 21:40:45] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-31 21:40:45] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-31 21:40:45] [INFO ] Invariant cache hit.
[2024-05-31 21:40:45] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 195 unsolved in 5296 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 195/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 400 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13904 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 19455ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 19458ms
Finished structural reductions in LTL mode , in 1 iterations and 19887 ms. Remains : 132/132 places, 196/196 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 482 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 76 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (9170 resets) in 386 ms. (103 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (1811 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1822 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
[2024-05-31 21:41:05] [INFO ] Invariant cache hit.
[2024-05-31 21:41:05] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/328 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 136/224 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 98/322 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 57/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/328 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/328 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 207 constraints, problems are : Problem set: 0 solved, 2 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 582ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 260 ms.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 196/196 transitions.
Graph (complete) has 451 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 130 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 130 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 129 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 129 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 129 transition count 190
Applied a total of 9 rules in 7 ms. Remains 129 /132 variables (removed 3) and now considering 190/196 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 129/132 places, 190/196 transitions.
RANDOM walk for 40000 steps (9093 resets) in 307 ms. (129 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1741 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1817 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 18052 steps, run visited all 2 properties in 63 ms. (steps per millisecond=286 )
Probabilistic random walk after 18052 steps, saw 8856 distinct states, run finished after 63 ms. (steps per millisecond=286 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT p1)), (F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 6 factoid took 299 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 23017 reset in 189 ms.
Product exploration explored 100000 steps with 22931 reset in 194 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 196/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-31 21:41:07] [INFO ] Redundant transitions in 1 ms returned []
Running 195 sub problems to find dead transitions.
[2024-05-31 21:41:07] [INFO ] Invariant cache hit.
[2024-05-31 21:41:07] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 195 unsolved in 5417 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 195/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 400 constraints, problems are : Problem set: 0 solved, 195 unsolved in 14148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 19844ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 19846ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19859 ms. Remains : 132/132 places, 196/196 transitions.
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-31 21:41:27] [INFO ] Invariant cache hit.
[2024-05-31 21:41:27] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 21:41:27] [INFO ] Invariant cache hit.
[2024-05-31 21:41:27] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-05-31 21:41:27] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-31 21:41:27] [INFO ] Invariant cache hit.
[2024-05-31 21:41:27] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 205 constraints, problems are : Problem set: 0 solved, 195 unsolved in 5320 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/328 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 71/205 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 195/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 400 constraints, problems are : Problem set: 0 solved, 195 unsolved in 14114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 0/0 constraints]
After SMT, in 19710ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 19713ms
Finished structural reductions in LTL mode , in 1 iterations and 20147 ms. Remains : 132/132 places, 196/196 transitions.
Treatment of property DBSingleClientW-PT-d2m07-LTLFireability-13 finished in 85522 ms.
[2024-05-31 21:41:47] [INFO ] Flatten gal took : 26 ms
[2024-05-31 21:41:47] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 21:41:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 234 places, 473 transitions and 1860 arcs took 6 ms.
Total runtime 882416 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m07-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717192079403

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name DBSingleClientW-PT-d2m07-LTLFireability-01
ltl formula formula --ltl=/tmp/2655/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 234 places, 473 transitions and 1860 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.000 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2655/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2655/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2655/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2655/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 236 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 235, there are 476 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~28 levels ~10000 states ~20836 transitions
pnml2lts-mc( 0/ 4): ~240 levels ~20000 states ~40596 transitions
pnml2lts-mc( 0/ 4): ~240 levels ~40000 states ~81700 transitions
pnml2lts-mc( 0/ 4): ~240 levels ~80000 states ~163112 transitions
pnml2lts-mc( 0/ 4): ~240 levels ~160000 states ~328360 transitions
pnml2lts-mc( 2/ 4): ~10660 levels ~320000 states ~814552 transitions
pnml2lts-mc( 2/ 4): ~19064 levels ~640000 states ~1618792 transitions
pnml2lts-mc( 2/ 4): ~26560 levels ~1280000 states ~3207960 transitions
pnml2lts-mc( 2/ 4): ~26862 levels ~2560000 states ~6502892 transitions
pnml2lts-mc( 0/ 4): ~29400 levels ~5120000 states ~12596524 transitions
pnml2lts-mc( 3/ 4): ~7739 levels ~10240000 states ~27844092 transitions
pnml2lts-mc( 3/ 4): ~16602 levels ~20480000 states ~61698912 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 26022595
pnml2lts-mc( 0/ 4): unique states count: 31566682
pnml2lts-mc( 0/ 4): unique transitions count: 93911273
pnml2lts-mc( 0/ 4): - self-loop count: 19599538
pnml2lts-mc( 0/ 4): - claim dead count: 25158220
pnml2lts-mc( 0/ 4): - claim found count: 12969302
pnml2lts-mc( 0/ 4): - claim success count: 31606643
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1061282
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 31675819 states 94493937 transitions, fanout: 2.983
pnml2lts-mc( 0/ 4): Total exploration time 175.150 sec (175.130 sec minimum, 175.143 sec on average)
pnml2lts-mc( 0/ 4): States per second: 180850, Transitions per second: 539503
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 290.0MB, 9.1 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/53.0%
pnml2lts-mc( 0/ 4): Stored 482 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 290.0MB (~256.0MB paged-in)
ltl formula name DBSingleClientW-PT-d2m07-LTLFireability-11
ltl formula formula --ltl=/tmp/2655/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 234 places, 473 transitions and 1860 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2655/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2655/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2655/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2655/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 235 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 235, there are 491 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~139!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2933
pnml2lts-mc( 0/ 4): unique states count: 3163
pnml2lts-mc( 0/ 4): unique transitions count: 9636
pnml2lts-mc( 0/ 4): - self-loop count: 5114
pnml2lts-mc( 0/ 4): - claim dead count: 339
pnml2lts-mc( 0/ 4): - claim found count: 36
pnml2lts-mc( 0/ 4): - claim success count: 3193
pnml2lts-mc( 0/ 4): - cum. max stack depth: 239
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3193 states 9781 transitions, fanout: 3.063
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 106433, Transitions per second: 326033
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 14.0 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 482 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name DBSingleClientW-PT-d2m07-LTLFireability-12
ltl formula formula --ltl=/tmp/2655/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 234 places, 473 transitions and 1860 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2655/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2655/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2655/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2655/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 236 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 235, there are 484 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~33 levels ~10000 states ~25236 transitions
pnml2lts-mc( 1/ 4): ~33 levels ~20000 states ~51168 transitions
pnml2lts-mc( 1/ 4): ~33 levels ~40000 states ~104856 transitions
pnml2lts-mc( 1/ 4): ~33 levels ~80000 states ~211524 transitions
pnml2lts-mc( 1/ 4): ~34 levels ~160000 states ~425332 transitions
pnml2lts-mc( 3/ 4): ~28 levels ~320000 states ~865732 transitions
pnml2lts-mc( 3/ 4): ~92 levels ~640000 states ~1726160 transitions
pnml2lts-mc( 3/ 4): ~163 levels ~1280000 states ~3465484 transitions
pnml2lts-mc( 3/ 4): ~520 levels ~2560000 states ~7026528 transitions
pnml2lts-mc( 3/ 4): ~1409 levels ~5120000 states ~15160664 transitions
pnml2lts-mc( 3/ 4): ~1898 levels ~10240000 states ~32600412 transitions
pnml2lts-mc( 3/ 4): ~5014 levels ~20480000 states ~66121128 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 31572086
pnml2lts-mc( 0/ 4): unique states count: 32717948
pnml2lts-mc( 0/ 4): unique transitions count: 105968640
pnml2lts-mc( 0/ 4): - self-loop count: 7950982
pnml2lts-mc( 0/ 4): - claim dead count: 62242978
pnml2lts-mc( 0/ 4): - claim found count: 2023438
pnml2lts-mc( 0/ 4): - claim success count: 32735293
pnml2lts-mc( 0/ 4): - cum. max stack depth: 151942
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32752000 states 106274062 transitions, fanout: 3.245
pnml2lts-mc( 0/ 4): Total exploration time 194.880 sec (194.840 sec minimum, 194.855 sec on average)
pnml2lts-mc( 0/ 4): States per second: 168062, Transitions per second: 545331
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 278.0MB, 8.7 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/34.0%
pnml2lts-mc( 0/ 4): Stored 482 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 278.0MB (~256.0MB paged-in)
ltl formula name DBSingleClientW-PT-d2m07-LTLFireability-13
ltl formula formula --ltl=/tmp/2655/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 234 places, 473 transitions and 1860 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2655/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2655/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2655/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2655/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 235 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 235, there are 488 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~93!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2092
pnml2lts-mc( 0/ 4): unique states count: 2380
pnml2lts-mc( 0/ 4): unique transitions count: 11647
pnml2lts-mc( 0/ 4): - self-loop count: 7578
pnml2lts-mc( 0/ 4): - claim dead count: 274
pnml2lts-mc( 0/ 4): - claim found count: 41
pnml2lts-mc( 0/ 4): - claim success count: 2430
pnml2lts-mc( 0/ 4): - cum. max stack depth: 312
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2430 states 11937 transitions, fanout: 4.912
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 81000, Transitions per second: 397900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 15.4 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 482 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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