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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 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 119K 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-d0m06-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716285482129

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-d0m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:58:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 09:58:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:58:03] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-21 09:58:03] [INFO ] Transformed 553 places.
[2024-05-21 09:58:03] [INFO ] Transformed 150 transitions.
[2024-05-21 09:58:03] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 33 place count 87 transition count 121
Iterating global reduction 1 with 15 rules applied. Total rules applied 48 place count 87 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 87 transition count 118
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 82 transition count 113
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 82 transition count 113
Applied a total of 61 rules in 36 ms. Remains 82 /109 variables (removed 27) and now considering 113/150 (removed 37) transitions.
// Phase 1: matrix 113 rows 82 cols
[2024-05-21 09:58:03] [INFO ] Computed 2 invariants in 13 ms
[2024-05-21 09:58:04] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-21 09:58:04] [INFO ] Invariant cache hit.
[2024-05-21 09:58:04] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 09:58:04] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-21 09:58:04] [INFO ] Invariant cache hit.
[2024-05-21 09:58:04] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 113/195 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 49/133 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-21 09:58:05] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 13 ms to minimize.
[2024-05-21 09:58:06] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 09:58:06] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 136 constraints, problems are : Problem set: 0 solved, 112 unsolved in 3318 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/195 variables, 82/87 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 49/136 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 112/248 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 248 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4978 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 3/3 constraints]
After SMT, in 8495ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 8509ms
Starting structural reductions in LTL mode, iteration 1 : 82/109 places, 113/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8925 ms. Remains : 82/109 places, 113/150 transitions.
Support contains 26 out of 82 places after structural reductions.
[2024-05-21 09:58:12] [INFO ] Flatten gal took : 27 ms
[2024-05-21 09:58:12] [INFO ] Flatten gal took : 11 ms
[2024-05-21 09:58:12] [INFO ] Input system was already deterministic with 113 transitions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (9236 resets) in 1875 ms. (21 steps per ms) remains 13/26 properties
BEST_FIRST walk for 40003 steps (1968 resets) in 313 ms. (127 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1997 resets) in 95 ms. (416 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (4065 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (2021 resets) in 173 ms. (229 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1910 resets) in 186 ms. (213 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1965 resets) in 114 ms. (347 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (1988 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1936 resets) in 138 ms. (287 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1961 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (2015 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (2032 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (4101 resets) in 158 ms. (251 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1318 resets) in 66 ms. (597 steps per ms) remains 13/13 properties
[2024-05-21 09:58:14] [INFO ] Invariant cache hit.
[2024-05-21 09:58:14] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/40 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/61 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 90/151 variables, 61/63 constraints. Problems are: Problem set: 1 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 26/89 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 8 (OVERLAPS) 42/193 variables, 20/109 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 22/131 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/131 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 2/195 variables, 1/132 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 1/133 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/195 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 133 constraints, problems are : Problem set: 2 solved, 11 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 25/38 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 23/61 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 90/151 variables, 61/63 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 26/89 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/89 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 42/193 variables, 20/109 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 22/131 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 11/142 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 2/195 variables, 1/143 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 1/144 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 0/144 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/195 variables, 0/144 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 144 constraints, problems are : Problem set: 2 solved, 11 unsolved in 659 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 11/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 1083ms problems are : Problem set: 2 solved, 11 unsolved
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 1 properties in 2899 ms.
Support contains 11 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 113/113 transitions.
Graph (complete) has 239 edges and 82 vertex of which 81 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 112
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 77 transition count 102
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 77 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 75 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 75 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 74 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 74 transition count 97
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 73 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 73 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 73 transition count 94
Applied a total of 20 rules in 24 ms. Remains 73 /82 variables (removed 9) and now considering 94/113 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 73/82 places, 94/113 transitions.
RANDOM walk for 40000 steps (9232 resets) in 197 ms. (202 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (2073 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1973 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1987 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (2052 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1973 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (2062 resets) in 45 ms. (869 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1978 resets) in 43 ms. (909 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (2032 resets) in 36 ms. (1081 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2020 resets) in 37 ms. (1052 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (4017 resets) in 49 ms. (800 steps per ms) remains 8/8 properties
// Phase 1: matrix 94 rows 73 cols
[2024-05-21 09:58:18] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 09:58:18] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 43/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 78/131 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 21/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 34/165 variables, 19/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/167 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/167 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 112 constraints, problems are : Problem set: 0 solved, 8 unsolved in 254 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 43/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 78/131 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 21/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 34/165 variables, 19/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 15/110 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 2/167 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/167 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 120 constraints, problems are : Problem set: 0 solved, 8 unsolved in 441 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 726ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 1071 ms.
Support contains 9 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 94/94 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 88
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 69 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 69 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 68 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 68 transition count 85
Applied a total of 10 rules in 11 ms. Remains 68 /73 variables (removed 5) and now considering 85/94 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 68/73 places, 85/94 transitions.
RANDOM walk for 40000 steps (9228 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1976 resets) in 39 ms. (1000 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1985 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1959 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1975 resets) in 33 ms. (1176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1982 resets) in 38 ms. (1025 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (2009 resets) in 34 ms. (1142 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (4095 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 17653 steps, run visited all 7 properties in 56 ms. (steps per millisecond=315 )
Probabilistic random walk after 17653 steps, saw 7942 distinct states, run finished after 59 ms. (steps per millisecond=299 ) properties seen :7
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 269 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0 U p1)))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 74 transition count 91
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 74 transition count 91
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 69 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 69 transition count 86
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 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 68 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 67 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 67 transition count 81
Applied a total of 32 rules in 14 ms. Remains 67 /82 variables (removed 15) and now considering 81/113 (removed 32) transitions.
// Phase 1: matrix 81 rows 67 cols
[2024-05-21 09:58:21] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 09:58:21] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 09:58:21] [INFO ] Invariant cache hit.
[2024-05-21 09:58:21] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 09:58:21] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-21 09:58:21] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-21 09:58:21] [INFO ] Invariant cache hit.
[2024-05-21 09:58:21] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/148 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 24/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/148 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 93 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/148 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 24/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 80/173 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/148 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 173 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2395 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 3601ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3603ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/82 places, 81/113 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3763 ms. Remains : 67/82 places, 81/113 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-00 finished in 4073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G((F(p1)&&F(G(p2))))))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 73 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 67 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 67 transition count 84
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 64 transition count 80
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 62 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 62 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 61 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 60 transition count 70
Applied a total of 49 rules in 18 ms. Remains 60 /82 variables (removed 22) and now considering 70/113 (removed 43) transitions.
// Phase 1: matrix 70 rows 60 cols
[2024-05-21 09:58:25] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 09:58:25] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 09:58:25] [INFO ] Invariant cache hit.
[2024-05-21 09:58:25] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 09:58:25] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2024-05-21 09:58:25] [INFO ] Invariant cache hit.
[2024-05-21 09:58:25] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 85 constraints, problems are : Problem set: 0 solved, 69 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/154 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 154 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1874 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 2859ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2860ms
Starting structural reductions in LTL mode, iteration 1 : 60/82 places, 70/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3011 ms. Remains : 60/82 places, 70/113 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-01
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-01 finished in 3275 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 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 73 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 67 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 67 transition count 84
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 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 65 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 64 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 64 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 64 transition count 75
Applied a total of 41 rules in 25 ms. Remains 64 /82 variables (removed 18) and now considering 75/113 (removed 38) transitions.
// Phase 1: matrix 75 rows 64 cols
[2024-05-21 09:58:28] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 09:58:28] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 09:58:28] [INFO ] Invariant cache hit.
[2024-05-21 09:58:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 09:58:28] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-21 09:58:28] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-21 09:58:28] [INFO ] Invariant cache hit.
[2024-05-21 09:58:28] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 91 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1095 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/139 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 74/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 165 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 3160ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3161ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/82 places, 75/113 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3332 ms. Remains : 64/82 places, 75/113 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-02
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-02 finished in 3397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||((!p0 U (G(!p0)||(!p0&&G((!p1||G(!p2))))))&&X(F(!p3)))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 74 transition count 95
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 74 transition count 95
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 68 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 68 transition count 87
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 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 66 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 64 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 64 transition count 78
Applied a total of 40 rules in 9 ms. Remains 64 /82 variables (removed 18) and now considering 78/113 (removed 35) transitions.
// Phase 1: matrix 78 rows 64 cols
[2024-05-21 09:58:31] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 09:58:31] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 09:58:31] [INFO ] Invariant cache hit.
[2024-05-21 09:58:31] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 09:58:32] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-21 09:58:32] [INFO ] Invariant cache hit.
[2024-05-21 09:58:32] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 94 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 77/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 171 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1878 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 3109ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3111ms
Starting structural reductions in LTL mode, iteration 1 : 64/82 places, 78/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3255 ms. Remains : 64/82 places, 78/113 transitions.
Stuttering acceptance computed with spot in 426 ms :[p0, true, (AND p3 p0), (AND p2 p1 p0), (AND p0 p2), p0, p3, p2, (AND p2 p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-03
Product exploration explored 100000 steps with 31098 reset in 237 ms.
Product exploration explored 100000 steps with 31572 reset in 178 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 209 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p3))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 31 factoid took 135 ms. Reduced automaton from 9 states, 29 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (AND p2 p1), p2]
RANDOM walk for 40000 steps (9277 resets) in 348 ms. (114 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (1934 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2082 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1968 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
[2024-05-21 09:58:36] [INFO ] Invariant cache hit.
[2024-05-21 09:58:36] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 8 (OVERLAPS) 33/142 variables, 18/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 15/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/142 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 94 constraints, problems are : Problem set: 1 solved, 2 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/46 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 13/61 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 33/142 variables, 18/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 15/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 2/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/142 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 96 constraints, problems are : Problem set: 1 solved, 2 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 222ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1762 steps, including 162 resets, run visited all 2 properties in 27 ms. (steps per millisecond=65 )
Parikh walk visited 2 properties in 35 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p3))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 32 factoid took 260 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 92 ms :[true, p2, (AND p2 p1)]
Support contains 3 out of 64 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 9 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-21 09:58:37] [INFO ] Invariant cache hit.
[2024-05-21 09:58:37] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 09:58:37] [INFO ] Invariant cache hit.
[2024-05-21 09:58:37] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 09:58:37] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-21 09:58:37] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-21 09:58:37] [INFO ] Invariant cache hit.
[2024-05-21 09:58:37] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 94 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 77/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 171 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1860 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 3096ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3097ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3234 ms. Remains : 64/64 places, 78/78 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 209 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[true, p2, (AND p2 p1)]
RANDOM walk for 40000 steps (9172 resets) in 105 ms. (377 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (1990 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1992 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1990 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
[2024-05-21 09:58:40] [INFO ] Invariant cache hit.
[2024-05-21 09:58:40] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 8 (OVERLAPS) 33/142 variables, 18/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 15/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/142 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 94 constraints, problems are : Problem set: 1 solved, 2 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/46 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 13/61 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 33/142 variables, 18/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 15/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 2/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/142 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 96 constraints, problems are : Problem set: 1 solved, 2 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 187ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 78/78 transitions.
Graph (complete) has 190 edges and 64 vertex of which 63 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 77
Applied a total of 2 rules in 5 ms. Remains 63 /64 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 63/64 places, 77/78 transitions.
RANDOM walk for 40000 steps (9114 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2026 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1996 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 7061 steps, run visited all 2 properties in 30 ms. (steps per millisecond=235 )
Probabilistic random walk after 7061 steps, saw 3138 distinct states, run finished after 30 ms. (steps per millisecond=235 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (G (OR (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 10 factoid took 355 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (AND p2 p1), p2]
Stuttering acceptance computed with spot in 100 ms :[true, (AND p2 p1), p2]
Stuttering acceptance computed with spot in 93 ms :[true, (AND p2 p1), p2]
Product exploration explored 100000 steps with 22879 reset in 105 ms.
Product exploration explored 100000 steps with 22924 reset in 171 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-21 09:58:42] [INFO ] Invariant cache hit.
[2024-05-21 09:58:42] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 09:58:42] [INFO ] Invariant cache hit.
[2024-05-21 09:58:42] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 09:58:42] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-21 09:58:42] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-21 09:58:42] [INFO ] Invariant cache hit.
[2024-05-21 09:58:42] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 94 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 77/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 171 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1988 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 3234ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3235ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3372 ms. Remains : 64/64 places, 78/78 transitions.
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-03 finished in 13768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((F(p1) U p2)&&p0) U p3)))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 75 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 75 transition count 96
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 71 transition count 90
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 71 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 68 transition count 86
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 68 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 67 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 67 transition count 82
Applied a total of 33 rules in 3 ms. Remains 67 /82 variables (removed 15) and now considering 82/113 (removed 31) transitions.
// Phase 1: matrix 82 rows 67 cols
[2024-05-21 09:58:45] [INFO ] Computed 2 invariants in 8 ms
[2024-05-21 09:58:45] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 09:58:45] [INFO ] Invariant cache hit.
[2024-05-21 09:58:45] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 09:58:45] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-21 09:58:45] [INFO ] Invariant cache hit.
[2024-05-21 09:58:45] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/149 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 29/98 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/149 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 98 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1275 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/149 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 29/98 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 81/179 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 179 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2369 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 3702ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3703ms
Starting structural reductions in LTL mode, iteration 1 : 67/82 places, 82/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3853 ms. Remains : 67/82 places, 82/113 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p3), (NOT p3), true, (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-09 finished in 4095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 73 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 67 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 67 transition count 84
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 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 64 transition count 78
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 64 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 64 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 62 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 61 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 60 transition count 70
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 60 transition count 68
Applied a total of 51 rules in 4 ms. Remains 60 /82 variables (removed 22) and now considering 68/113 (removed 45) transitions.
// Phase 1: matrix 68 rows 60 cols
[2024-05-21 09:58:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 09:58:49] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 09:58:49] [INFO ] Invariant cache hit.
[2024-05-21 09:58:49] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 09:58:49] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-05-21 09:58:49] [INFO ] Invariant cache hit.
[2024-05-21 09:58:49] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 24/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 67 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 24/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 67/153 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 153 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1564 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 2467ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 2468ms
Starting structural reductions in LTL mode, iteration 1 : 60/82 places, 68/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2604 ms. Remains : 60/82 places, 68/113 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 192 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-10 finished in 2912 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(p2))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 89
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 65 transition count 80
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 63 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 62 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 62 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 62 transition count 73
Applied a total of 44 rules in 4 ms. Remains 62 /82 variables (removed 20) and now considering 73/113 (removed 40) transitions.
// Phase 1: matrix 73 rows 62 cols
[2024-05-21 09:58:52] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 09:58:52] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 09:58:52] [INFO ] Invariant cache hit.
[2024-05-21 09:58:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 09:58:52] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-21 09:58:52] [INFO ] Invariant cache hit.
[2024-05-21 09:58:52] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/135 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 86 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/135 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 72/158 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 158 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1764 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 2816ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2817ms
Starting structural reductions in LTL mode, iteration 1 : 62/82 places, 73/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2954 ms. Remains : 62/82 places, 73/113 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-11 finished in 3144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U G(((p2||F(p3))&&p1))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 74 transition count 97
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 74 transition count 97
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 69 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 69 transition count 92
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 69 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 68 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 68 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 68 transition count 87
Applied a total of 31 rules in 13 ms. Remains 68 /82 variables (removed 14) and now considering 87/113 (removed 26) transitions.
// Phase 1: matrix 87 rows 68 cols
[2024-05-21 09:58:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 09:58:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 09:58:55] [INFO ] Invariant cache hit.
[2024-05-21 09:58:55] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 09:58:55] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-21 09:58:55] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-21 09:58:55] [INFO ] Invariant cache hit.
[2024-05-21 09:58:55] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/155 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 31/101 constraints. Problems are: Problem set: 0 solved, 86 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/155 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 101 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1348 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 87/155 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 31/101 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 86/187 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/155 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 187 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2634 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
After SMT, in 4052ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 4054ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/82 places, 87/113 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4210 ms. Remains : 68/82 places, 87/113 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (AND p1 p0), (NOT p3), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p3) p1 p0 p2), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-12
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-12 finished in 4606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X((G(F(p2))||p1))))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 89
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 65 transition count 80
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 62 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 62 transition count 74
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 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 60 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 58 transition count 64
Applied a total of 55 rules in 9 ms. Remains 58 /82 variables (removed 24) and now considering 64/113 (removed 49) transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-21 09:59:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 09:59:00] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-21 09:59:00] [INFO ] Invariant cache hit.
[2024-05-21 09:59:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 09:59:00] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-21 09:59:00] [INFO ] Invariant cache hit.
[2024-05-21 09:59:00] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1511 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2402ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2404ms
Starting structural reductions in LTL mode, iteration 1 : 58/82 places, 64/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2525 ms. Remains : 58/82 places, 64/113 transitions.
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-13
Product exploration explored 100000 steps with 28540 reset in 77 ms.
Product exploration explored 100000 steps with 28560 reset in 84 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 186 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (9214 resets) in 437 ms. (91 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40001 steps (3961 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (2067 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (2061 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4032 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
[2024-05-21 09:59:04] [INFO ] Invariant cache hit.
[2024-05-21 09:59:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 19/24 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/43 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 51/94 variables, 43/45 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 7/52 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/52 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 26/120 variables, 14/66 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 12/78 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/78 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/122 variables, 1/79 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 1/80 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 2 solved, 2 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/23 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/42 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/92 variables, 42/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 6/50 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/120 variables, 15/65 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 13/78 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 2/80 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 0/80 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/122 variables, 1/81 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 1/82 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 0/82 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/122 variables, 0/82 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 82 constraints, problems are : Problem set: 2 solved, 2 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 169ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 73 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 64/64 transitions.
Graph (complete) has 170 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 63
Applied a total of 2 rules in 3 ms. Remains 57 /58 variables (removed 1) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 57/58 places, 63/64 transitions.
RANDOM walk for 40000 steps (9140 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4040 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4132 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 3995 steps, run visited all 2 properties in 17 ms. (steps per millisecond=235 )
Probabilistic random walk after 3995 steps, saw 1811 distinct states, run finished after 18 ms. (steps per millisecond=221 ) properties seen :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X p0)), (G (OR p1 p0)), (G (OR p1 p0 p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F p2), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 4 factoid took 255 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-21 09:59:05] [INFO ] Invariant cache hit.
[2024-05-21 09:59:05] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 09:59:05] [INFO ] Invariant cache hit.
[2024-05-21 09:59:05] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 09:59:05] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-21 09:59:05] [INFO ] Invariant cache hit.
[2024-05-21 09:59:05] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 900 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1469 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2405ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2406ms
Finished structural reductions in LTL mode , in 1 iterations and 2522 ms. Remains : 58/58 places, 64/64 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 186 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (9118 resets) in 77 ms. (512 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (4058 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4089 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
[2024-05-21 09:59:08] [INFO ] Invariant cache hit.
[2024-05-21 09:59:08] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/92 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/120 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 13/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/122 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 2 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/92 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/120 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 13/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/122 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/122 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 82 constraints, problems are : Problem set: 0 solved, 2 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 169ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 64/64 transitions.
Graph (complete) has 170 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 63
Applied a total of 2 rules in 8 ms. Remains 57 /58 variables (removed 1) and now considering 63/64 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 57/58 places, 63/64 transitions.
RANDOM walk for 40000 steps (9156 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4210 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3991 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 3995 steps, run visited all 2 properties in 17 ms. (steps per millisecond=235 )
Probabilistic random walk after 3995 steps, saw 1811 distinct states, run finished after 17 ms. (steps per millisecond=235 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p2) p0)]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (NOT p1)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 208 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 28574 reset in 92 ms.
Product exploration explored 100000 steps with 28595 reset in 81 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0))]
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 58 /58 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-21 09:59:10] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-21 09:59:10] [INFO ] Invariant cache hit.
[2024-05-21 09:59:10] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 895 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1504 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2438ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2439ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2451 ms. Remains : 58/58 places, 64/64 transitions.
Support contains 5 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-21 09:59:12] [INFO ] Invariant cache hit.
[2024-05-21 09:59:12] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 09:59:12] [INFO ] Invariant cache hit.
[2024-05-21 09:59:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 09:59:12] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-21 09:59:12] [INFO ] Invariant cache hit.
[2024-05-21 09:59:12] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 861 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1437 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2334ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2335ms
Finished structural reductions in LTL mode , in 1 iterations and 2447 ms. Remains : 58/58 places, 64/64 transitions.
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-13 finished in 14845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(G(p0)) U (p1 U G(p2)))&&X(X(p2)))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 73 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 67 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 67 transition count 84
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 65 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 65 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 64 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 63 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 63 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 62 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 62 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 62 transition count 74
Applied a total of 43 rules in 14 ms. Remains 62 /82 variables (removed 20) and now considering 74/113 (removed 39) transitions.
// Phase 1: matrix 74 rows 62 cols
[2024-05-21 09:59:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 09:59:15] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 09:59:15] [INFO ] Invariant cache hit.
[2024-05-21 09:59:15] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 09:59:15] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-21 09:59:15] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2024-05-21 09:59:15] [INFO ] Invariant cache hit.
[2024-05-21 09:59:15] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/136 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 88 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/136 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 73/161 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 161 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1646 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 2721ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2722ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/82 places, 74/113 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2855 ms. Remains : 62/82 places, 74/113 transitions.
Stuttering acceptance computed with spot in 475 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-14 finished in 3362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 89
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 65 transition count 80
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 65 transition count 78
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 62 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 62 transition count 74
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 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 60 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 59 transition count 67
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 58 transition count 64
Applied a total of 55 rules in 8 ms. Remains 58 /82 variables (removed 24) and now considering 64/113 (removed 49) transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-21 09:59:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 09:59:18] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 09:59:18] [INFO ] Invariant cache hit.
[2024-05-21 09:59:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 09:59:18] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-21 09:59:18] [INFO ] Invariant cache hit.
[2024-05-21 09:59:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 863 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1483 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 2380ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2381ms
Starting structural reductions in LTL mode, iteration 1 : 58/82 places, 64/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2505 ms. Remains : 58/82 places, 64/113 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, p0, p0, p0]
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-15
Entered a terminal (fully accepting) state of product in 54 steps with 13 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-15 finished in 2660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||((!p0 U (G(!p0)||(!p0&&G((!p1||G(!p2))))))&&X(F(!p3)))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d0m06-LTLFireability-03
Stuttering acceptance computed with spot in 388 ms :[p0, true, (AND p3 p0), (AND p2 p1 p0), (AND p0 p2), p0, p3, p2, (AND p2 p1)]
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 82/82 places, 113/113 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 74 transition count 95
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 74 transition count 95
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 68 transition count 87
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 68 transition count 87
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 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 66 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 66 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 64 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 64 transition count 78
Applied a total of 40 rules in 13 ms. Remains 64 /82 variables (removed 18) and now considering 78/113 (removed 35) transitions.
// Phase 1: matrix 78 rows 64 cols
[2024-05-21 09:59:21] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 09:59:21] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 09:59:21] [INFO ] Invariant cache hit.
[2024-05-21 09:59:21] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 09:59:21] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-21 09:59:21] [INFO ] Invariant cache hit.
[2024-05-21 09:59:21] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 94 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 77/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 171 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1909 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 3127ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3128ms
Starting structural reductions in LI_LTL mode, iteration 1 : 64/82 places, 78/113 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3270 ms. Remains : 64/82 places, 78/113 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m06-LTLFireability-03
Product exploration explored 100000 steps with 31381 reset in 116 ms.
Product exploration explored 100000 steps with 31600 reset in 125 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 209 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p3))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 31 factoid took 147 ms. Reduced automaton from 9 states, 29 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (AND p2 p1), p2]
RANDOM walk for 40000 steps (9125 resets) in 93 ms. (425 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (2016 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1932 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1934 resets) in 27 ms. (1428 steps per ms) remains 3/3 properties
[2024-05-21 09:59:25] [INFO ] Invariant cache hit.
[2024-05-21 09:59:25] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 8 (OVERLAPS) 33/142 variables, 18/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 15/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/142 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 94 constraints, problems are : Problem set: 1 solved, 2 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/46 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 13/61 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 33/142 variables, 18/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 15/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 2/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/142 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 96 constraints, problems are : Problem set: 1 solved, 2 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1714 steps, including 159 resets, run visited all 2 properties in 25 ms. (steps per millisecond=68 )
Parikh walk visited 2 properties in 24 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p3))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 32 factoid took 270 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[true, p2, (AND p2 p1)]
Stuttering acceptance computed with spot in 81 ms :[true, p2, (AND p2 p1)]
Support contains 3 out of 64 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 6 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-21 09:59:26] [INFO ] Invariant cache hit.
[2024-05-21 09:59:26] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 09:59:26] [INFO ] Invariant cache hit.
[2024-05-21 09:59:26] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 09:59:26] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-21 09:59:26] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-21 09:59:26] [INFO ] Invariant cache hit.
[2024-05-21 09:59:26] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 94 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 77/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 171 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1910 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 3138ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3139ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3340 ms. Remains : 64/64 places, 78/78 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 209 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[true, p2, (AND p2 p1)]
RANDOM walk for 40000 steps (9222 resets) in 115 ms. (344 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (1930 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2035 resets) in 31 ms. (1250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1976 resets) in 28 ms. (1379 steps per ms) remains 3/3 properties
[2024-05-21 09:59:29] [INFO ] Invariant cache hit.
[2024-05-21 09:59:29] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 8 (OVERLAPS) 33/142 variables, 18/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 15/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/142 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 94 constraints, problems are : Problem set: 1 solved, 2 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/46 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 13/61 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 33/142 variables, 18/79 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 15/94 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 2/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/142 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 96 constraints, problems are : Problem set: 1 solved, 2 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 182ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 181 steps, including 15 resets, run visited all 2 properties in 4 ms. (steps per millisecond=45 )
Parikh walk visited 2 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (G (OR (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p2), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 10 factoid took 183 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (AND p2 p1), p2]
Stuttering acceptance computed with spot in 107 ms :[true, (AND p2 p1), p2]
Stuttering acceptance computed with spot in 102 ms :[true, (AND p2 p1), p2]
Product exploration explored 100000 steps with 22878 reset in 104 ms.
Product exploration explored 100000 steps with 22821 reset in 111 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-21 09:59:30] [INFO ] Invariant cache hit.
[2024-05-21 09:59:30] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 09:59:30] [INFO ] Invariant cache hit.
[2024-05-21 09:59:30] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-21 09:59:30] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-21 09:59:30] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-21 09:59:30] [INFO ] Invariant cache hit.
[2024-05-21 09:59:30] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 94 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1140 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 77/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 171 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1851 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 3046ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3047ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3185 ms. Remains : 64/64 places, 78/78 transitions.
Treatment of property DBSingleClientW-PT-d0m06-LTLFireability-03 finished in 12761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X((G(F(p2))||p1))))))'
[2024-05-21 09:59:34] [INFO ] Flatten gal took : 8 ms
[2024-05-21 09:59:34] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 09:59:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 113 transitions and 442 arcs took 3 ms.
Total runtime 90845 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d0m06

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/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: 1693
MODEL NAME: /home/mcc/execution/412/model
82 places, 113 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-d0m06-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d0m06-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716285584114

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

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