Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716289940135

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:12:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 11:12:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:12:21] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-05-21 11:12:21] [INFO ] Transformed 1440 places.
[2024-05-21 11:12:21] [INFO ] Transformed 672 transitions.
[2024-05-21 11:12:21] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 188 place count 239 transition count 400
Iterating global reduction 1 with 87 rules applied. Total rules applied 275 place count 239 transition count 400
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 287 place count 239 transition count 388
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 353 place count 173 transition count 322
Iterating global reduction 2 with 66 rules applied. Total rules applied 419 place count 173 transition count 322
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 423 place count 173 transition count 318
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 457 place count 139 transition count 267
Iterating global reduction 3 with 34 rules applied. Total rules applied 491 place count 139 transition count 267
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 524 place count 139 transition count 234
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 532 place count 131 transition count 222
Iterating global reduction 4 with 8 rules applied. Total rules applied 540 place count 131 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 544 place count 131 transition count 218
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 549 place count 126 transition count 213
Iterating global reduction 5 with 5 rules applied. Total rules applied 554 place count 126 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 556 place count 126 transition count 211
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 559 place count 123 transition count 208
Iterating global reduction 6 with 3 rules applied. Total rules applied 562 place count 123 transition count 208
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 563 place count 122 transition count 206
Iterating global reduction 6 with 1 rules applied. Total rules applied 564 place count 122 transition count 206
Applied a total of 564 rules in 96 ms. Remains 122 /347 variables (removed 225) and now considering 206/672 (removed 466) transitions.
// Phase 1: matrix 206 rows 122 cols
[2024-05-21 11:12:21] [INFO ] Computed 2 invariants in 19 ms
[2024-05-21 11:12:22] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-21 11:12:22] [INFO ] Invariant cache hit.
[2024-05-21 11:12:22] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-21 11:12:22] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-05-21 11:12:22] [INFO ] Invariant cache hit.
[2024-05-21 11:12:22] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/328 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 94/218 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/328 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 218 constraints, problems are : Problem set: 0 solved, 205 unsolved in 7079 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/328 variables, 122/124 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 94/218 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 205/423 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 423 constraints, problems are : Problem set: 0 solved, 205 unsolved in 14777 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 22345ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 22368ms
Starting structural reductions in LTL mode, iteration 1 : 122/347 places, 206/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23032 ms. Remains : 122/347 places, 206/672 transitions.
Support contains 22 out of 122 places after structural reductions.
[2024-05-21 11:12:44] [INFO ] Flatten gal took : 42 ms
[2024-05-21 11:12:44] [INFO ] Flatten gal took : 28 ms
[2024-05-21 11:12:45] [INFO ] Input system was already deterministic with 206 transitions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (9257 resets) in 2474 ms. (16 steps per ms) remains 15/20 properties
BEST_FIRST walk for 4002 steps (192 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (203 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (161 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (186 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (200 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (193 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (191 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (198 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (202 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (372 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (200 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (378 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (210 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (301 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (192 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
[2024-05-21 11:12:46] [INFO ] Invariant cache hit.
[2024-05-21 11:12:46] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/58 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 32/90 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 168/258 variables, 90/92 constraints. Problems are: Problem set: 1 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 56/148 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 70/328 variables, 32/180 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 38/218 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/328 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 218 constraints, problems are : Problem set: 1 solved, 14 unsolved in 630 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 41/57 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 33/90 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 168/258 variables, 90/92 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 56/148 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 70/328 variables, 32/180 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 38/218 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 14/232 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 232 constraints, problems are : Problem set: 1 solved, 14 unsolved in 1302 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 1974ms problems are : Problem set: 1 solved, 14 unsolved
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 3643 ms.
Support contains 16 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 192
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 192
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 116 transition count 190
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 116 transition count 190
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 114 transition count 188
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 114 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 114 transition count 187
Applied a total of 17 rules in 23 ms. Remains 114 /122 variables (removed 8) and now considering 187/206 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 114/122 places, 187/206 transitions.
RANDOM walk for 40000 steps (9207 resets) in 285 ms. (139 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1839 resets) in 119 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1891 resets) in 134 ms. (296 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1928 resets) in 125 ms. (317 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1950 resets) in 111 ms. (357 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1864 resets) in 126 ms. (314 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1862 resets) in 109 ms. (363 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40004 steps (1799 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3956 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1885 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3869 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1872 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1912 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
// Phase 1: matrix 187 rows 114 cols
[2024-05-21 11:12:52] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 11:12:52] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 38/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 29/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 146/227 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 46/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 74/301 variables, 33/162 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 41/203 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/301 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 203 constraints, problems are : Problem set: 0 solved, 12 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 38/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 29/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 146/227 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 46/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 74/301 variables, 33/162 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 41/203 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 12/215 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/301 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 215 constraints, problems are : Problem set: 0 solved, 12 unsolved in 981 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 1542ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 3 properties in 1781 ms.
Support contains 11 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 187/187 transitions.
Graph (complete) has 381 edges and 114 vertex of which 113 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 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 113 transition count 183
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 109 transition count 172
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 109 transition count 172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 109 transition count 169
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 106 transition count 165
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 106 transition count 165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 106 transition count 162
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 27 place count 104 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 104 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 104 transition count 157
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 32 place count 102 transition count 155
Iterating global reduction 4 with 2 rules applied. Total rules applied 34 place count 102 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 37 place count 102 transition count 152
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 38 place count 101 transition count 151
Iterating global reduction 5 with 1 rules applied. Total rules applied 39 place count 101 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 41 place count 101 transition count 149
Applied a total of 41 rules in 43 ms. Remains 101 /114 variables (removed 13) and now considering 149/187 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 101/114 places, 149/187 transitions.
RANDOM walk for 40000 steps (9150 resets) in 136 ms. (291 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1894 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (1889 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1831 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1910 resets) in 58 ms. (678 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1888 resets) in 196 ms. (203 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1911 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1908 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (3946 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1873 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
Finished probabilistic random walk after 20959 steps, run visited all 9 properties in 187 ms. (steps per millisecond=112 )
Probabilistic random walk after 20959 steps, saw 9894 distinct states, run finished after 206 ms. (steps per millisecond=101 ) properties seen :9
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 5 stabilizing places and 20 stable transitions
Graph (complete) has 451 edges and 122 vertex of which 121 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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((X(p1)&&p0))||G(p2)))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 108 transition count 161
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 108 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 108 transition count 158
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 99 transition count 142
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 99 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 53 place count 99 transition count 138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 93 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 93 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 93 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 90 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 90 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 90 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 89 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 89 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 89 transition count 116
Applied a total of 80 rules in 10 ms. Remains 89 /122 variables (removed 33) and now considering 116/206 (removed 90) transitions.
// Phase 1: matrix 116 rows 89 cols
[2024-05-21 11:12:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:12:56] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 11:12:56] [INFO ] Invariant cache hit.
[2024-05-21 11:12:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:12:56] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-21 11:12:56] [INFO ] Invariant cache hit.
[2024-05-21 11:12:56] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-21 11:12:58] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 14 ms to minimize.
[2024-05-21 11:12:58] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 134 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3140 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 116/205 variables, 89/93 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 41/134 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 115/249 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 249 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 2/2 constraints]
After SMT, in 7553ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 7557ms
Starting structural reductions in LTL mode, iteration 1 : 89/122 places, 116/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7781 ms. Remains : 89/122 places, 116/206 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-02
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 3 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-02 finished in 8121 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 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 107 transition count 158
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 107 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 107 transition count 155
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 43 place count 97 transition count 138
Iterating global reduction 1 with 10 rules applied. Total rules applied 53 place count 97 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 57 place count 97 transition count 134
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 90 transition count 123
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 90 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 90 transition count 119
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 78 place count 87 transition count 114
Iterating global reduction 3 with 3 rules applied. Total rules applied 81 place count 87 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 87 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 84 place count 85 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 85 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 85 transition count 109
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 89 place count 84 transition count 108
Iterating global reduction 5 with 1 rules applied. Total rules applied 90 place count 84 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 91 place count 84 transition count 107
Applied a total of 91 rules in 26 ms. Remains 84 /122 variables (removed 38) and now considering 107/206 (removed 99) transitions.
// Phase 1: matrix 107 rows 84 cols
[2024-05-21 11:13:04] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:13:04] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 11:13:04] [INFO ] Invariant cache hit.
[2024-05-21 11:13:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 11:13:05] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-21 11:13:05] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-21 11:13:05] [INFO ] Invariant cache hit.
[2024-05-21 11:13:05] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 123 constraints, problems are : Problem set: 0 solved, 106 unsolved in 1939 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 106/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 229 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3508 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 5529ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 5530ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/122 places, 107/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5759 ms. Remains : 84/122 places, 107/206 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-04
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-04 finished in 5845 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((G(p0)||F(((X(!p0)&&F(p1))||G(!p0)))))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 108 transition count 162
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 108 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 108 transition count 158
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 99 transition count 142
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 99 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 99 transition count 138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 93 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 93 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 93 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 72 place count 90 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 75 place count 90 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 90 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 89 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 89 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 89 transition count 116
Applied a total of 81 rules in 14 ms. Remains 89 /122 variables (removed 33) and now considering 116/206 (removed 90) transitions.
// Phase 1: matrix 116 rows 89 cols
[2024-05-21 11:13:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:13:10] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 11:13:10] [INFO ] Invariant cache hit.
[2024-05-21 11:13:10] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:13:10] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-21 11:13:10] [INFO ] Invariant cache hit.
[2024-05-21 11:13:10] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 115 unsolved in 1992 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 115/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 247 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4197 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 6307ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6308ms
Starting structural reductions in LTL mode, iteration 1 : 89/122 places, 116/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6595 ms. Remains : 89/122 places, 116/206 transitions.
Stuttering acceptance computed with spot in 149 ms :[false, false, p0, (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-05
Product exploration explored 100000 steps with 26510 reset in 204 ms.
Product exploration explored 100000 steps with 26470 reset in 184 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 89 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[false, p0, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9207 resets) in 562 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1906 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1878 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1886 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1887 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 18487 steps, run visited all 4 properties in 67 ms. (steps per millisecond=275 )
Probabilistic random walk after 18487 steps, saw 8773 distinct states, run finished after 67 ms. (steps per millisecond=275 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 325 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[false, p0, (AND p0 (NOT p1))]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 116/116 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-21 11:13:19] [INFO ] Invariant cache hit.
[2024-05-21 11:13:19] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 11:13:19] [INFO ] Invariant cache hit.
[2024-05-21 11:13:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:13:19] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-21 11:13:19] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-21 11:13:19] [INFO ] Invariant cache hit.
[2024-05-21 11:13:19] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2081 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 115/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 247 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4234 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 6424ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6425ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6615 ms. Remains : 89/89 places, 116/116 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[false, p0, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9173 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1962 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (1861 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1891 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1877 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 18487 steps, run visited all 4 properties in 61 ms. (steps per millisecond=303 )
Probabilistic random walk after 18487 steps, saw 8773 distinct states, run finished after 62 ms. (steps per millisecond=298 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 217 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[false, p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 29576 reset in 130 ms.
Product exploration explored 100000 steps with 29539 reset in 134 ms.
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 116/116 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-21 11:13:27] [INFO ] Invariant cache hit.
[2024-05-21 11:13:27] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 11:13:27] [INFO ] Invariant cache hit.
[2024-05-21 11:13:27] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:13:27] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-21 11:13:27] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-21 11:13:27] [INFO ] Invariant cache hit.
[2024-05-21 11:13:27] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 115/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 247 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4264 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 6379ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6380ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6600 ms. Remains : 89/89 places, 116/116 transitions.
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-05 finished in 22978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||F(p1))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 108 transition count 162
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 108 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 108 transition count 160
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 99 transition count 144
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 99 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 52 place count 99 transition count 140
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 93 transition count 130
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 93 transition count 130
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 68 place count 93 transition count 126
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 91 transition count 123
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 91 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 91 transition count 122
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 74 place count 90 transition count 121
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 90 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 77 place count 90 transition count 119
Applied a total of 77 rules in 6 ms. Remains 90 /122 variables (removed 32) and now considering 119/206 (removed 87) transitions.
// Phase 1: matrix 119 rows 90 cols
[2024-05-21 11:13:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:13:33] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 11:13:33] [INFO ] Invariant cache hit.
[2024-05-21 11:13:33] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 11:13:33] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-05-21 11:13:33] [INFO ] Invariant cache hit.
[2024-05-21 11:13:33] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/209 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 44/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-21 11:13:35] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-21 11:13:35] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 138 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3204 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 119/209 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 44/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 118/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 256 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4633 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
After SMT, in 7932ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 7934ms
Starting structural reductions in LTL mode, iteration 1 : 90/122 places, 119/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8121 ms. Remains : 90/122 places, 119/206 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-07
Product exploration explored 100000 steps with 22923 reset in 120 ms.
Product exploration explored 100000 steps with 22993 reset in 121 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
RANDOM walk for 40000 steps (9235 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1923 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1907 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1906 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1864 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1896 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1870 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 24728 steps, run visited all 6 properties in 90 ms. (steps per millisecond=274 )
Probabilistic random walk after 24728 steps, saw 11555 distinct states, run finished after 91 ms. (steps per millisecond=271 ) properties seen :6
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 265 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 119/119 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-21 11:13:43] [INFO ] Invariant cache hit.
[2024-05-21 11:13:43] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 11:13:43] [INFO ] Invariant cache hit.
[2024-05-21 11:13:43] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 11:13:43] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-21 11:13:43] [INFO ] Redundant transitions in 2 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-21 11:13:43] [INFO ] Invariant cache hit.
[2024-05-21 11:13:43] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/209 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 44/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-21 11:13:45] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-21 11:13:45] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 138 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 119/209 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 44/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 118/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 256 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4677 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
After SMT, in 7971ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 7973ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8155 ms. Remains : 90/90 places, 119/119 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 124 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
RANDOM walk for 40000 steps (9180 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1888 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1914 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1846 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1928 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1913 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1887 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 24728 steps, run visited all 6 properties in 92 ms. (steps per millisecond=268 )
Probabilistic random walk after 24728 steps, saw 11555 distinct states, run finished after 93 ms. (steps per millisecond=265 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 281 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Product exploration explored 100000 steps with 22897 reset in 122 ms.
Product exploration explored 100000 steps with 22992 reset in 139 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 119/119 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-21 11:13:53] [INFO ] Invariant cache hit.
[2024-05-21 11:13:53] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 11:13:53] [INFO ] Invariant cache hit.
[2024-05-21 11:13:53] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 11:13:53] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-21 11:13:53] [INFO ] Redundant transitions in 3 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-21 11:13:53] [INFO ] Invariant cache hit.
[2024-05-21 11:13:53] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/209 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 44/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-21 11:13:54] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-21 11:13:54] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/209 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 138 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 119/209 variables, 90/94 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 44/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 118/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 256 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4898 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 2/2 constraints]
After SMT, in 8184ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 8186ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8369 ms. Remains : 90/90 places, 119/119 transitions.
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-07 finished in 28016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(X(p0))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 107 transition count 156
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 107 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 107 transition count 154
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 42 place count 97 transition count 137
Iterating global reduction 1 with 10 rules applied. Total rules applied 52 place count 97 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 56 place count 97 transition count 133
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 63 place count 90 transition count 122
Iterating global reduction 2 with 7 rules applied. Total rules applied 70 place count 90 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 74 place count 90 transition count 118
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 87 transition count 113
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 87 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 87 transition count 112
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 83 place count 85 transition count 110
Iterating global reduction 4 with 2 rules applied. Total rules applied 85 place count 85 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 87 place count 85 transition count 108
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 88 place count 84 transition count 107
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 84 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 90 place count 84 transition count 106
Applied a total of 90 rules in 8 ms. Remains 84 /122 variables (removed 38) and now considering 106/206 (removed 100) transitions.
// Phase 1: matrix 106 rows 84 cols
[2024-05-21 11:14:01] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 11:14:01] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 11:14:01] [INFO ] Invariant cache hit.
[2024-05-21 11:14:01] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 11:14:01] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-21 11:14:01] [INFO ] Invariant cache hit.
[2024-05-21 11:14:01] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/190 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 122 constraints, problems are : Problem set: 0 solved, 105 unsolved in 1865 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/190 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 105/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 227 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3884 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 5836ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 5838ms
Starting structural reductions in LTL mode, iteration 1 : 84/122 places, 106/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6016 ms. Remains : 84/122 places, 106/206 transitions.
Stuttering acceptance computed with spot in 325 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-09 finished in 6359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 107 transition count 155
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 107 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 107 transition count 152
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 98 transition count 136
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 98 transition count 136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 98 transition count 132
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 61 place count 92 transition count 123
Iterating global reduction 2 with 6 rules applied. Total rules applied 67 place count 92 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 92 transition count 120
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 90 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 90 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 90 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 89 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 88 transition count 112
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 88 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 88 transition count 111
Applied a total of 81 rules in 19 ms. Remains 88 /122 variables (removed 34) and now considering 111/206 (removed 95) transitions.
// Phase 1: matrix 111 rows 88 cols
[2024-05-21 11:14:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:14:08] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 11:14:08] [INFO ] Invariant cache hit.
[2024-05-21 11:14:08] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 11:14:08] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-21 11:14:08] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 11:14:08] [INFO ] Invariant cache hit.
[2024-05-21 11:14:08] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4494 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6728ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6729ms
Starting structural reductions in SI_LTL mode, iteration 1 : 88/122 places, 111/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6945 ms. Remains : 88/122 places, 111/206 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-10
Product exploration explored 100000 steps with 22896 reset in 205 ms.
Product exploration explored 100000 steps with 22892 reset in 156 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9196 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1902 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16730 steps, run visited all 1 properties in 22 ms. (steps per millisecond=760 )
Probabilistic random walk after 16730 steps, saw 7970 distinct states, run finished after 22 ms. (steps per millisecond=760 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 111/111 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-21 11:14:15] [INFO ] Invariant cache hit.
[2024-05-21 11:14:15] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 11:14:15] [INFO ] Invariant cache hit.
[2024-05-21 11:14:15] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 11:14:15] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-21 11:14:15] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 11:14:15] [INFO ] Invariant cache hit.
[2024-05-21 11:14:15] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4352 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6602ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6604ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6816 ms. Remains : 88/88 places, 111/111 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9184 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1877 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16730 steps, run visited all 1 properties in 22 ms. (steps per millisecond=760 )
Probabilistic random walk after 16730 steps, saw 7970 distinct states, run finished after 22 ms. (steps per millisecond=760 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22956 reset in 110 ms.
Product exploration explored 100000 steps with 22927 reset in 120 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-21 11:14:23] [INFO ] Invariant cache hit.
[2024-05-21 11:14:23] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 11:14:23] [INFO ] Invariant cache hit.
[2024-05-21 11:14:23] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 11:14:23] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-21 11:14:23] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-21 11:14:23] [INFO ] Invariant cache hit.
[2024-05-21 11:14:23] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 125 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/199 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 110/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 235 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4517 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 6788ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6789ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7012 ms. Remains : 88/88 places, 111/111 transitions.
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-10 finished in 22137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 108 transition count 156
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 108 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 108 transition count 154
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 100 transition count 144
Iterating global reduction 1 with 8 rules applied. Total rules applied 46 place count 100 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 100 transition count 140
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 94 transition count 130
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 94 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 94 transition count 127
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 68 place count 91 transition count 122
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 91 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 91 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 74 place count 89 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 89 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 79 place count 88 transition count 116
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 88 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 88 transition count 115
Applied a total of 81 rules in 4 ms. Remains 88 /122 variables (removed 34) and now considering 115/206 (removed 91) transitions.
// Phase 1: matrix 115 rows 88 cols
[2024-05-21 11:14:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:14:30] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 11:14:30] [INFO ] Invariant cache hit.
[2024-05-21 11:14:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 11:14:30] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-21 11:14:30] [INFO ] Invariant cache hit.
[2024-05-21 11:14:30] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/203 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 38/128 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-21 11:14:31] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 11:14:31] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 11:14:31] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-21 11:14:33] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/203 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 132 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4340 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/203 variables, 88/94 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 38/132 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 114/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 246 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4650 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 4/4 constraints]
After SMT, in 9097ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 9100ms
Starting structural reductions in LTL mode, iteration 1 : 88/122 places, 115/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9269 ms. Remains : 88/122 places, 115/206 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-11 finished in 9368 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((X(X(X(G(p0))))&&(G(p1)||G(p2)))))'
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 161
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 109 transition count 159
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 102 transition count 146
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 102 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 102 transition count 145
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 48 place count 97 transition count 137
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 97 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 97 transition count 134
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 95 transition count 131
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 95 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 94 transition count 130
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 94 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 94 transition count 128
Applied a total of 64 rules in 17 ms. Remains 94 /122 variables (removed 28) and now considering 128/206 (removed 78) transitions.
// Phase 1: matrix 128 rows 94 cols
[2024-05-21 11:14:39] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:14:39] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 11:14:39] [INFO ] Invariant cache hit.
[2024-05-21 11:14:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:14:39] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-21 11:14:39] [INFO ] Redundant transitions in 1 ms returned []
Running 127 sub problems to find dead transitions.
[2024-05-21 11:14:39] [INFO ] Invariant cache hit.
[2024-05-21 11:14:39] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/222 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 42/138 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 0/222 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 138 constraints, problems are : Problem set: 0 solved, 127 unsolved in 2742 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 128/222 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 42/138 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 127/265 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 265 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5235 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
After SMT, in 8099ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 8101ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/122 places, 128/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8315 ms. Remains : 94/122 places, 128/206 transitions.
Stuttering acceptance computed with spot in 1592 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-12 finished in 9942 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 U (F((!p2&&F(!p3)))&&p1))))'
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 109 transition count 157
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 109 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 109 transition count 155
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 102 transition count 147
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 102 transition count 147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 45 place count 102 transition count 144
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 51 place count 96 transition count 135
Iterating global reduction 2 with 6 rules applied. Total rules applied 57 place count 96 transition count 135
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 96 transition count 132
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 62 place count 94 transition count 128
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 94 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 66 place count 94 transition count 126
Applied a total of 66 rules in 8 ms. Remains 94 /122 variables (removed 28) and now considering 126/206 (removed 80) transitions.
// Phase 1: matrix 126 rows 94 cols
[2024-05-21 11:14:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:14:49] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 11:14:49] [INFO ] Invariant cache hit.
[2024-05-21 11:14:49] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 11:14:49] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-21 11:14:49] [INFO ] Invariant cache hit.
[2024-05-21 11:14:49] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 126/220 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 44/140 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-21 11:14:51] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-21 11:14:51] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 142 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3403 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 126/220 variables, 94/98 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 44/142 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 125/267 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 0/220 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 267 constraints, problems are : Problem set: 0 solved, 125 unsolved in 5488 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 2/2 constraints]
After SMT, in 9011ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 9013ms
Starting structural reductions in LTL mode, iteration 1 : 94/122 places, 126/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9235 ms. Remains : 94/122 places, 126/206 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) p2 p3), (OR (NOT p1) p2 p3), true, p3, (OR p2 p3)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-13 finished in 9449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 106 transition count 151
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 106 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 106 transition count 149
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 44 place count 96 transition count 132
Iterating global reduction 1 with 10 rules applied. Total rules applied 54 place count 96 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 96 transition count 128
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 65 place count 89 transition count 117
Iterating global reduction 2 with 7 rules applied. Total rules applied 72 place count 89 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 89 transition count 113
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 79 place count 86 transition count 108
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 86 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 86 transition count 107
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 85 place count 84 transition count 105
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 84 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 89 place count 84 transition count 103
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 83 transition count 102
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 83 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 83 transition count 101
Applied a total of 92 rules in 16 ms. Remains 83 /122 variables (removed 39) and now considering 101/206 (removed 105) transitions.
// Phase 1: matrix 101 rows 83 cols
[2024-05-21 11:14:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:14:59] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 11:14:59] [INFO ] Invariant cache hit.
[2024-05-21 11:14:59] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 11:14:59] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-21 11:14:59] [INFO ] Redundant transitions in 1 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-21 11:14:59] [INFO ] Invariant cache hit.
[2024-05-21 11:14:59] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 116 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2078 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 101/184 variables, 83/85 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 100/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 216 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3403 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints]
After SMT, in 5555ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 5557ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/122 places, 101/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5754 ms. Remains : 83/122 places, 101/206 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 279 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-14 finished in 6128 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(p0))||F((p1||G(p0)))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 107 transition count 153
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 107 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 107 transition count 152
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 41 place count 97 transition count 135
Iterating global reduction 1 with 10 rules applied. Total rules applied 51 place count 97 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 97 transition count 131
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 90 transition count 120
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 90 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 73 place count 90 transition count 116
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 76 place count 87 transition count 111
Iterating global reduction 3 with 3 rules applied. Total rules applied 79 place count 87 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 87 transition count 110
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 82 place count 85 transition count 108
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 85 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 86 place count 85 transition count 106
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 87 place count 84 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 88 place count 84 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 89 place count 84 transition count 104
Applied a total of 89 rules in 9 ms. Remains 84 /122 variables (removed 38) and now considering 104/206 (removed 102) transitions.
// Phase 1: matrix 104 rows 84 cols
[2024-05-21 11:15:05] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 11:15:05] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 11:15:05] [INFO ] Invariant cache hit.
[2024-05-21 11:15:05] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 11:15:05] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-21 11:15:05] [INFO ] Invariant cache hit.
[2024-05-21 11:15:05] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/188 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 34/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 120 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2194 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/188 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 34/120 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 103/223 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 223 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3627 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 5924ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5925ms
Starting structural reductions in LTL mode, iteration 1 : 84/122 places, 104/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6113 ms. Remains : 84/122 places, 104/206 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-15
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-15 finished in 6261 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((G(p0)||F(((X(!p0)&&F(p1))||G(!p0)))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m05-LTLFireability-05
Stuttering acceptance computed with spot in 140 ms :[false, false, p0, (AND p0 (NOT p1))]
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 122/122 places, 206/206 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 108 transition count 162
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 108 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 108 transition count 158
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 41 place count 99 transition count 142
Iterating global reduction 1 with 9 rules applied. Total rules applied 50 place count 99 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 99 transition count 138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 93 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 93 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 69 place count 93 transition count 126
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 72 place count 90 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 75 place count 90 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 90 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 89 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 89 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 89 transition count 116
Applied a total of 81 rules in 19 ms. Remains 89 /122 variables (removed 33) and now considering 116/206 (removed 90) transitions.
// Phase 1: matrix 116 rows 89 cols
[2024-05-21 11:15:11] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 11:15:11] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 11:15:11] [INFO ] Invariant cache hit.
[2024-05-21 11:15:11] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:15:11] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-21 11:15:11] [INFO ] Invariant cache hit.
[2024-05-21 11:15:11] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 115/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 247 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4442 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 6675ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6676ms
Starting structural reductions in LI_LTL mode, iteration 1 : 89/122 places, 116/206 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6879 ms. Remains : 89/122 places, 116/206 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m05-LTLFireability-05
Product exploration explored 100000 steps with 26494 reset in 125 ms.
Product exploration explored 100000 steps with 26563 reset in 132 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 81 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[false, p0, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9190 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1891 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1859 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1899 resets) in 41 ms. (952 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1961 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 18487 steps, run visited all 4 properties in 42 ms. (steps per millisecond=440 )
Probabilistic random walk after 18487 steps, saw 8773 distinct states, run finished after 42 ms. (steps per millisecond=440 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 8 factoid took 221 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[false, p0, (AND p0 (NOT p1))]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-21 11:15:19] [INFO ] Invariant cache hit.
[2024-05-21 11:15:19] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 11:15:19] [INFO ] Invariant cache hit.
[2024-05-21 11:15:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:15:19] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-21 11:15:19] [INFO ] Redundant transitions in 1 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-21 11:15:19] [INFO ] Invariant cache hit.
[2024-05-21 11:15:19] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 115/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 247 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4416 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 6630ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6631ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6850 ms. Remains : 89/89 places, 116/116 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 124 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[false, p0, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9166 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1872 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1944 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (1904 resets) in 41 ms. (952 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 18487 steps, run visited all 4 properties in 41 ms. (steps per millisecond=450 )
Probabilistic random walk after 18487 steps, saw 8773 distinct states, run finished after 41 ms. (steps per millisecond=450 ) properties seen :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 222 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[false, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[false, p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 29613 reset in 143 ms.
Product exploration explored 100000 steps with 29690 reset in 138 ms.
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-21 11:15:27] [INFO ] Invariant cache hit.
[2024-05-21 11:15:27] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 11:15:27] [INFO ] Invariant cache hit.
[2024-05-21 11:15:27] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:15:27] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-21 11:15:27] [INFO ] Redundant transitions in 0 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-21 11:15:27] [INFO ] Invariant cache hit.
[2024-05-21 11:15:27] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 132 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2109 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/205 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 115/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 247 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4325 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 6529ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6531ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6745 ms. Remains : 89/89 places, 116/116 transitions.
Treatment of property DBSingleClientW-PT-d1m05-LTLFireability-05 finished in 23162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-21 11:15:34] [INFO ] Flatten gal took : 17 ms
[2024-05-21 11:15:34] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 11:15:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 122 places, 206 transitions and 809 arcs took 4 ms.
Total runtime 193459 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d1m05

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1753
MODEL NAME: /home/mcc/execution/409/model
122 places, 206 transitions.

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

BK_STOP 1716290144164

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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