Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 13K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:47 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-d0m08-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717189024844

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:57:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:57:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:57:06] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-31 20:57:06] [INFO ] Transformed 553 places.
[2024-05-31 20:57:06] [INFO ] Transformed 150 transitions.
[2024-05-31 20:57:06] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 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 115
Iterating global reduction 1 with 15 rules applied. Total rules applied 48 place count 87 transition count 115
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 112
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 82 transition count 107
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 82 transition count 107
Applied a total of 61 rules in 98 ms. Remains 82 /109 variables (removed 27) and now considering 107/150 (removed 43) transitions.
// Phase 1: matrix 107 rows 82 cols
[2024-05-31 20:57:06] [INFO ] Computed 2 invariants in 13 ms
[2024-05-31 20:57:07] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-31 20:57:07] [INFO ] Invariant cache hit.
[2024-05-31 20:57:07] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 20:57:07] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-31 20:57:07] [INFO ] Invariant cache hit.
[2024-05-31 20:57:07] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/189 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 39/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 123 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2425 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/189 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 39/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 106/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 229 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4088 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 6730ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 6746ms
Starting structural reductions in LTL mode, iteration 1 : 82/109 places, 107/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7320 ms. Remains : 82/109 places, 107/150 transitions.
Support contains 31 out of 82 places after structural reductions.
[2024-05-31 20:57:14] [INFO ] Flatten gal took : 28 ms
[2024-05-31 20:57:14] [INFO ] Flatten gal took : 11 ms
[2024-05-31 20:57:14] [INFO ] Input system was already deterministic with 107 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (9179 resets) in 2472 ms. (16 steps per ms) remains 10/24 properties
BEST_FIRST walk for 40004 steps (1914 resets) in 223 ms. (178 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1981 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1945 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4142 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1979 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4102 resets) in 148 ms. (268 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1918 resets) in 275 ms. (144 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1231 resets) in 207 ms. (192 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4108 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (2016 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
[2024-05-31 20:57:15] [INFO ] Invariant cache hit.
[2024-05-31 20:57:15] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/46 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 20/66 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 99/165 variables, 66/68 constraints. Problems are: Problem set: 2 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 31/99 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/99 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 8 (OVERLAPS) 24/189 variables, 16/115 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 8/123 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/123 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/123 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 123 constraints, problems are : Problem set: 3 solved, 7 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 28/39 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 23/62 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 87/149 variables, 62/64 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 19/83 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/83 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 40/189 variables, 20/103 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 20/123 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 7/130 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/130 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/189 variables, 0/130 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 130 constraints, problems are : Problem set: 3 solved, 7 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 7/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 606ms problems are : Problem set: 3 solved, 7 unsolved
Parikh walk visited 0 properties in 1442 ms.
Support contains 11 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 107/107 transitions.
Graph (complete) has 244 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 106
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 75 transition count 96
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 75 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 74 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 74 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 73 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 73 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 73 transition count 92
Applied a total of 19 rules in 23 ms. Remains 73 /82 variables (removed 9) and now considering 92/107 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 73/82 places, 92/107 transitions.
RANDOM walk for 40000 steps (9163 resets) in 345 ms. (115 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1922 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1995 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (4067 resets) in 69 ms. (571 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (2003 resets) in 48 ms. (816 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (4005 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1969 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
// Phase 1: matrix 92 rows 73 cols
[2024-05-31 20:57:17] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:57:17] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 80/135 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 30/165 variables, 18/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/165 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 105 constraints, problems are : Problem set: 0 solved, 5 unsolved in 157 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 48/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 80/135 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 18/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 30/165 variables, 18/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/165 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 110 constraints, problems are : Problem set: 0 solved, 5 unsolved in 220 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 391ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 680 ms.
Support contains 7 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 92/92 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 72 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 91
Applied a total of 2 rules in 8 ms. Remains 72 /73 variables (removed 1) and now considering 91/92 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 72/73 places, 91/92 transitions.
RANDOM walk for 40000 steps (9111 resets) in 184 ms. (216 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (1983 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2012 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4180 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1966 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
// Phase 1: matrix 91 rows 72 cols
[2024-05-31 20:57:19] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:57:19] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 79/133 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 30/163 variables, 18/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 104 constraints, problems are : Problem set: 0 solved, 4 unsolved in 112 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 42/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 79/133 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 30/163 variables, 18/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/163 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 108 constraints, problems are : Problem set: 0 solved, 4 unsolved in 203 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 326ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 175 ms.
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 91/91 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 69 transition count 86
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 69 transition count 86
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 67 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 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 12 place count 67 transition count 82
Applied a total of 12 rules in 21 ms. Remains 67 /72 variables (removed 5) and now considering 82/91 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 67/72 places, 82/91 transitions.
RANDOM walk for 40000 steps (9142 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (4065 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2029 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 9199 steps, run visited all 2 properties in 49 ms. (steps per millisecond=187 )
Probabilistic random walk after 9199 steps, saw 3965 distinct states, run finished after 53 ms. (steps per millisecond=173 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 13 stable transitions
Graph (complete) has 270 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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))&&(((!p0 U (p1||G(!p0))) U p2) U p3)))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 94
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 73 transition count 94
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 68 transition count 87
Iterating global reduction 0 with 5 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 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 65 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 65 transition count 81
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 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 63 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 63 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 62 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 62 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 61 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 61 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 48 place count 61 transition count 72
Applied a total of 48 rules in 10 ms. Remains 61 /82 variables (removed 21) and now considering 72/107 (removed 35) transitions.
// Phase 1: matrix 72 rows 61 cols
[2024-05-31 20:57:20] [INFO ] Computed 2 invariants in 4 ms
[2024-05-31 20:57:20] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 20:57:20] [INFO ] Invariant cache hit.
[2024-05-31 20:57:20] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-31 20:57:20] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2024-05-31 20:57:20] [INFO ] Invariant cache hit.
[2024-05-31 20:57:20] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/133 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 88 constraints, problems are : Problem set: 0 solved, 71 unsolved in 983 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/133 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 25/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 71/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 159 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1761 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2788ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2790ms
Starting structural reductions in LTL mode, iteration 1 : 61/82 places, 72/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2932 ms. Remains : 61/82 places, 72/107 transitions.
Stuttering acceptance computed with spot in 722 ms :[(OR (NOT p3) (NOT p0)), true, (NOT p0), (AND (NOT p1) p0), (NOT p2), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-00
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-00 finished in 3736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p1))))'
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 67 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 67 transition count 82
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 80
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 64 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 64 transition count 76
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 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 63 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 63 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 43 place count 63 transition count 72
Applied a total of 43 rules in 13 ms. Remains 63 /82 variables (removed 19) and now considering 72/107 (removed 35) transitions.
// Phase 1: matrix 72 rows 63 cols
[2024-05-31 20:57:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:57:24] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 20:57:24] [INFO ] Invariant cache hit.
[2024-05-31 20:57:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-31 20:57:24] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2024-05-31 20:57:24] [INFO ] Invariant cache hit.
[2024-05-31 20:57:24] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/135 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 87 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1092 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/135 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 71/158 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 158 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2869ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2870ms
Starting structural reductions in LTL mode, iteration 1 : 63/82 places, 72/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3026 ms. Remains : 63/82 places, 72/107 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-01 finished in 3179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0)||G((G(p1)&&(!p0 U G(p2))))))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 91
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 91
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 69 transition count 88
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 67 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 66 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 66 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 65 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 64 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 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 39 place count 64 transition count 78
Applied a total of 39 rules in 23 ms. Remains 64 /82 variables (removed 18) and now considering 78/107 (removed 29) transitions.
// Phase 1: matrix 78 rows 64 cols
[2024-05-31 20:57:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:57:27] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-31 20:57:27] [INFO ] Invariant cache hit.
[2024-05-31 20:57:27] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:57:27] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-31 20:57:27] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-31 20:57:27] [INFO ] Invariant cache hit.
[2024-05-31 20:57:27] [INFO ] State equation strengthened by 24 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, 24/90 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 20:57:28] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 10 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/142 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 91 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2244 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 1/1 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, 1/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 78/142 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 24/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 77/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 168 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2261 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 1/1 constraints]
After SMT, in 4567ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 4568ms
Starting structural reductions in SI_LTL mode, iteration 1 : 64/82 places, 78/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4745 ms. Remains : 64/82 places, 78/107 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-02
Product exploration explored 100000 steps with 22905 reset in 238 ms.
Product exploration explored 100000 steps with 22954 reset in 177 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 p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 111 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (9144 resets) in 559 ms. (71 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (4102 resets) in 228 ms. (174 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2003 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (2020 resets) in 251 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2003 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (2020 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
[2024-05-31 20:57:33] [INFO ] Invariant cache hit.
[2024-05-31 20:57:33] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 22/27 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 20/47 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 64/111 variables, 47/49 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 10/59 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 29/140 variables, 16/75 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 13/88 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/142 variables, 1/89 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/142 variables, 1/90 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/142 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/142 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 90 constraints, problems are : Problem set: 1 solved, 4 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 22/27 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 20/47 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 64/111 variables, 47/49 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 10/59 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 29/140 variables, 16/75 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 13/88 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 4/92 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/142 variables, 1/93 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/142 variables, 1/94 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/142 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/142 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 94 constraints, problems are : Problem set: 1 solved, 4 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 354ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 451 ms.
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 78/78 transitions.
Graph (complete) has 191 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 6 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 6 ms. Remains : 63/64 places, 77/78 transitions.
RANDOM walk for 40000 steps (9257 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (3984 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2027 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (2016 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2042 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 17222 steps, run visited all 4 properties in 80 ms. (steps per millisecond=215 )
Probabilistic random walk after 17222 steps, saw 7724 distinct states, run finished after 80 ms. (steps per millisecond=215 ) properties seen :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (OR (NOT p2) p0))]
False Knowledge obtained : [(F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p0 p1))), (F p1)]
Knowledge based reduction with 16 factoid took 380 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 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 7 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-31 20:57:34] [INFO ] Invariant cache hit.
[2024-05-31 20:57:34] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 20:57:34] [INFO ] Invariant cache hit.
[2024-05-31 20:57:34] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-31 20:57:34] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-31 20:57:34] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-31 20:57:34] [INFO ] Invariant cache hit.
[2024-05-31 20:57:34] [INFO ] State equation strengthened by 24 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, 24/90 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 20:57:36] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/142 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 91 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2087 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 1/1 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, 1/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 78/142 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 24/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 77/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 168 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2206 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 1/1 constraints]
After SMT, in 4349ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 4351ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4510 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.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 304 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32050 steps (7317 resets) in 101 ms. (314 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22767 reset in 215 ms.
Product exploration explored 100000 steps with 22896 reset in 197 ms.
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 78/78 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 62 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 74
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 60 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 58 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 58 transition count 64
Applied a total of 16 rules in 12 ms. Remains 58 /64 variables (removed 6) and now considering 64/78 (removed 14) transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-31 20:57:40] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:57:40] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 20:57:40] [INFO ] Invariant cache hit.
[2024-05-31 20:57:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-31 20:57:40] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-31 20:57:40] [INFO ] Redundant transitions in 0 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-31 20:57:40] [INFO ] Invariant cache hit.
[2024-05-31 20:57:40] [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
All remaining problems are real, not stopping.
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 1652 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 2557ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2558ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/64 places, 64/78 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2710 ms. Remains : 58/64 places, 64/78 transitions.
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-02 finished in 16238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(!p1) U !p2)))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 107/107 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 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 67 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 67 transition count 82
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 80
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 64 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 64 transition count 76
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 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 63 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 63 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 63 transition count 73
Applied a total of 42 rules in 3 ms. Remains 63 /82 variables (removed 19) and now considering 73/107 (removed 34) transitions.
// Phase 1: matrix 73 rows 63 cols
[2024-05-31 20:57:43] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 20:57:43] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-31 20:57:43] [INFO ] Invariant cache hit.
[2024-05-31 20:57:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-31 20:57:43] [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.
Running 72 sub problems to find dead transitions.
[2024-05-31 20:57:43] [INFO ] Invariant cache hit.
[2024-05-31 20:57:43] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 87 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1097 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 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/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 72/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 159 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1894 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 3048ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3049ms
Starting structural reductions in LTL mode, iteration 1 : 63/82 places, 73/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3184 ms. Remains : 63/82 places, 73/107 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) p2), (NOT p0), (OR p2 p1), true]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-05 finished in 3333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0&&(F(p1) U p2)))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 92
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 92
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 66 transition count 85
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 66 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 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 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 79
Applied a total of 39 rules in 8 ms. Remains 64 /82 variables (removed 18) and now considering 79/107 (removed 28) transitions.
// Phase 1: matrix 79 rows 64 cols
[2024-05-31 20:57:46] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:57:46] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-31 20:57:46] [INFO ] Invariant cache hit.
[2024-05-31 20:57:46] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-31 20:57:46] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-31 20:57:46] [INFO ] Invariant cache hit.
[2024-05-31 20:57:46] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/143 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 27/93 constraints. Problems are: Problem set: 0 solved, 78 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 93 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1181 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/143 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 27/93 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 78/171 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 171 constraints, problems are : Problem set: 0 solved, 78 unsolved in 2112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 3348ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3349ms
Starting structural reductions in LTL mode, iteration 1 : 64/82 places, 79/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3501 ms. Remains : 64/82 places, 79/107 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), true, (NOT p1), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-11 finished in 3729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 90
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 90
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 67 transition count 84
Iterating global reduction 0 with 4 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 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 65 transition count 82
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 63 transition count 79
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 63 transition count 77
Applied a total of 40 rules in 16 ms. Remains 63 /82 variables (removed 19) and now considering 77/107 (removed 30) transitions.
// Phase 1: matrix 77 rows 63 cols
[2024-05-31 20:57:50] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:57:50] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 20:57:50] [INFO ] Invariant cache hit.
[2024-05-31 20:57:50] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-31 20:57:50] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-31 20:57:50] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 20:57:50] [INFO ] Invariant cache hit.
[2024-05-31 20:57:50] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 90 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1149 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 166 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1978 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 3182ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3184ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/82 places, 77/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3338 ms. Remains : 63/82 places, 77/107 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-12
Product exploration explored 100000 steps with 22927 reset in 112 ms.
Product exploration explored 100000 steps with 22874 reset in 143 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 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) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 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 110 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
RANDOM walk for 40000 steps (9131 resets) in 182 ms. (218 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (2027 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
[2024-05-31 20:57:54] [INFO ] Invariant cache hit.
[2024-05-31 20:57:54] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/107 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/138 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/140 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/107 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/138 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 170ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 77/77 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 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 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 61 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 61 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 5 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 59 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 59 transition count 69
Applied a total of 11 rules in 7 ms. Remains 59 /63 variables (removed 4) and now considering 69/77 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 59/63 places, 69/77 transitions.
RANDOM walk for 40000 steps (9145 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2001 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4280 steps, run visited all 1 properties in 14 ms. (steps per millisecond=305 )
Probabilistic random walk after 4280 steps, saw 1938 distinct states, run finished after 14 ms. (steps per millisecond=305 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 242 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 111 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 77/77 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 20:57:55] [INFO ] Invariant cache hit.
[2024-05-31 20:57:55] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-31 20:57:55] [INFO ] Invariant cache hit.
[2024-05-31 20:57:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-31 20:57:55] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-31 20:57:55] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 20:57:55] [INFO ] Invariant cache hit.
[2024-05-31 20:57:55] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 90 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1079 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 166 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 3169ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3171ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3312 ms. Remains : 63/63 places, 77/77 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 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 p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 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 101 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
RANDOM walk for 40000 steps (9179 resets) in 151 ms. (263 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (2065 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
[2024-05-31 20:57:58] [INFO ] Invariant cache hit.
[2024-05-31 20:57:58] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/107 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/138 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/140 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/107 variables, 45/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 31/138 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 77/77 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 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 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 61 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 61 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 5 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 59 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 59 transition count 69
Applied a total of 11 rules in 11 ms. Remains 59 /63 variables (removed 4) and now considering 69/77 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 59/63 places, 69/77 transitions.
RANDOM walk for 40000 steps (9158 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (2034 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4280 steps, run visited all 1 properties in 11 ms. (steps per millisecond=389 )
Probabilistic random walk after 4280 steps, saw 1938 distinct states, run finished after 11 ms. (steps per millisecond=389 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 158 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 122 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Product exploration explored 100000 steps with 22870 reset in 147 ms.
Product exploration explored 100000 steps with 22814 reset in 167 ms.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 77/77 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 20:58:00] [INFO ] Invariant cache hit.
[2024-05-31 20:58:00] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 20:58:00] [INFO ] Invariant cache hit.
[2024-05-31 20:58:00] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-31 20:58:00] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-31 20:58:00] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 20:58:00] [INFO ] Invariant cache hit.
[2024-05-31 20:58:00] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 90 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1186 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 166 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 3278ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3279ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3425 ms. Remains : 63/63 places, 77/77 transitions.
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-12 finished in 13037 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((X(((!p0 U (p1||G(!p0))) U ((!p2&&(!p0 U (p1||G(!p0))))||G((!p0 U (p1||G(!p0)))))))&&p3))))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 93
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 93
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 68 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 68 transition count 89
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 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 66 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 66 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 65 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 64 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 63 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 63 transition count 77
Applied a total of 43 rules in 2 ms. Remains 63 /82 variables (removed 19) and now considering 77/107 (removed 30) transitions.
// Phase 1: matrix 77 rows 63 cols
[2024-05-31 20:58:03] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:58:03] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-31 20:58:03] [INFO ] Invariant cache hit.
[2024-05-31 20:58:03] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 20:58:03] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-31 20:58:03] [INFO ] Invariant cache hit.
[2024-05-31 20:58:03] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 167 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2199 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 3299ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3300ms
Starting structural reductions in LTL mode, iteration 1 : 63/82 places, 77/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3435 ms. Remains : 63/82 places, 77/107 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-14
Product exploration explored 100000 steps with 22844 reset in 134 ms.
Product exploration explored 100000 steps with 22896 reset in 134 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X p3), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 113 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9181 resets) in 259 ms. (153 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40002 steps (2074 resets) in 291 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4089 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
[2024-05-31 20:58:07] [INFO ] Invariant cache hit.
[2024-05-31 20:58:07] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 29/138 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 29/138 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/140 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 230ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 74 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 77/77 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 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 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 61 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 61 transition count 71
Applied a total of 4 rules in 4 ms. Remains 61 /63 variables (removed 2) and now considering 71/77 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 61/63 places, 71/77 transitions.
RANDOM walk for 40000 steps (9165 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4178 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5839 steps, run visited all 1 properties in 14 ms. (steps per millisecond=417 )
Probabilistic random walk after 5839 steps, saw 2564 distinct states, run finished after 15 ms. (steps per millisecond=389 ) properties seen :1
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X p3), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT p3)), (F p2), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p1) (NOT p2))))), (F p1), (F p0)]
Knowledge based reduction with 10 factoid took 371 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 20:58:09] [INFO ] Invariant cache hit.
[2024-05-31 20:58:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-31 20:58:09] [INFO ] Invariant cache hit.
[2024-05-31 20:58:09] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 20:58:09] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-31 20:58:09] [INFO ] Invariant cache hit.
[2024-05-31 20:58:09] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 167 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 3421ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3423ms
Finished structural reductions in LTL mode , in 1 iterations and 3564 ms. Remains : 63/63 places, 77/77 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 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 p3 (NOT p0) (NOT p1) (NOT p2)), (X p3), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p3)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 110 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9187 resets) in 161 ms. (246 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40001 steps (1986 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4042 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
[2024-05-31 20:58:13] [INFO ] Invariant cache hit.
[2024-05-31 20:58:13] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 29/138 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 29/138 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/140 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 217ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 106 ms.
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 77/77 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 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 62 transition count 76
Applied a total of 2 rules in 6 ms. Remains 62 /63 variables (removed 1) and now considering 76/77 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 62/63 places, 76/77 transitions.
RANDOM walk for 40000 steps (9139 resets) in 112 ms. (353 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2029 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4003 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 9592 steps, run visited all 2 properties in 35 ms. (steps per millisecond=274 )
Probabilistic random walk after 9592 steps, saw 4136 distinct states, run finished after 35 ms. (steps per millisecond=274 ) properties seen :2
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) (NOT p2)), (X p3), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p3)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT p3)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F p2), (F p1), (F p0)]
Knowledge based reduction with 10 factoid took 382 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22859 reset in 128 ms.
Product exploration explored 100000 steps with 22988 reset in 140 ms.
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 77/77 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 20:58:15] [INFO ] Invariant cache hit.
[2024-05-31 20:58:15] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 20:58:15] [INFO ] Invariant cache hit.
[2024-05-31 20:58:15] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 20:58:15] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-31 20:58:15] [INFO ] Invariant cache hit.
[2024-05-31 20:58:15] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1053 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 167 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2168 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 3277ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3278ms
Finished structural reductions in LTL mode , in 1 iterations and 3432 ms. Remains : 63/63 places, 77/77 transitions.
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-14 finished in 15003 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 71 transition count 90
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 71 transition count 90
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 67 transition count 84
Iterating global reduction 0 with 4 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 2 ms. Remains 64 /82 variables (removed 18) and now considering 75/107 (removed 32) transitions.
// Phase 1: matrix 75 rows 64 cols
[2024-05-31 20:58:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:58:18] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 20:58:18] [INFO ] Invariant cache hit.
[2024-05-31 20:58:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-31 20:58:18] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2024-05-31 20:58:18] [INFO ] Invariant cache hit.
[2024-05-31 20:58:18] [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
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 1189 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 2050 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 3282ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 3283ms
Starting structural reductions in LTL mode, iteration 1 : 64/82 places, 75/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3422 ms. Remains : 64/82 places, 75/107 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-15
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-15 finished in 3569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0)||G((G(p1)&&(!p0 U G(p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
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((X(((!p0 U (p1||G(!p0))) U ((!p2&&(!p0 U (p1||G(!p0))))||G((!p0 U (p1||G(!p0)))))))&&p3))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d0m08-LTLFireability-14
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 82/82 places, 107/107 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 72 transition count 93
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 72 transition count 93
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 68 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 68 transition count 89
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 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 66 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 66 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 65 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 64 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 63 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 63 transition count 77
Applied a total of 43 rules in 13 ms. Remains 63 /82 variables (removed 19) and now considering 77/107 (removed 30) transitions.
// Phase 1: matrix 77 rows 63 cols
[2024-05-31 20:58:22] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:58:22] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 20:58:22] [INFO ] Invariant cache hit.
[2024-05-31 20:58:22] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 20:58:22] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-31 20:58:22] [INFO ] Invariant cache hit.
[2024-05-31 20:58:22] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1129 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 167 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2223 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 3410ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3414ms
Starting structural reductions in LI_LTL mode, iteration 1 : 63/82 places, 77/107 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3573 ms. Remains : 63/82 places, 77/107 transitions.
Running random walk in product with property : DBSingleClientW-PT-d0m08-LTLFireability-14
Product exploration explored 100000 steps with 22950 reset in 127 ms.
Product exploration explored 100000 steps with 22927 reset in 132 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 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 p3 (NOT p1) (NOT p0) (NOT p2)), (X p3), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 109 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9145 resets) in 229 ms. (173 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (2047 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4088 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
[2024-05-31 20:58:26] [INFO ] Invariant cache hit.
[2024-05-31 20:58:26] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 29/138 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 29/138 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/140 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 229ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 124 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 77/77 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 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 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 61 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 61 transition count 71
Applied a total of 4 rules in 3 ms. Remains 61 /63 variables (removed 2) and now considering 71/77 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 61/63 places, 71/77 transitions.
RANDOM walk for 40000 steps (9263 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4004 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5839 steps, run visited all 1 properties in 14 ms. (steps per millisecond=417 )
Probabilistic random walk after 5839 steps, saw 2564 distinct states, run finished after 14 ms. (steps per millisecond=417 ) properties seen :1
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X p3), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (OR (AND p1 p2) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT p3)), (F p2), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p1) (NOT p2))))), (F p1), (F p0)]
Knowledge based reduction with 10 factoid took 453 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 20:58:28] [INFO ] Invariant cache hit.
[2024-05-31 20:58:28] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 20:58:28] [INFO ] Invariant cache hit.
[2024-05-31 20:58:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 20:58:28] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-31 20:58:28] [INFO ] Invariant cache hit.
[2024-05-31 20:58:28] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1107 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 167 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 3326ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3328ms
Finished structural reductions in LTL mode , in 1 iterations and 3474 ms. Remains : 63/63 places, 77/77 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 206 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) (NOT p2)), (X p3), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p3)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 76 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (9137 resets) in 327 ms. (121 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (2002 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4021 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
[2024-05-31 20:58:32] [INFO ] Invariant cache hit.
[2024-05-31 20:58:32] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 29/138 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 2 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 63/109 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 29/138 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/140 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 268ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 77/77 transitions.
Graph (complete) has 188 edges and 63 vertex of which 62 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 62 transition count 76
Applied a total of 2 rules in 3 ms. Remains 62 /63 variables (removed 1) and now considering 76/77 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 62/63 places, 76/77 transitions.
RANDOM walk for 40000 steps (9248 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2014 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4100 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 9592 steps, run visited all 2 properties in 29 ms. (steps per millisecond=330 )
Probabilistic random walk after 9592 steps, saw 4136 distinct states, run finished after 29 ms. (steps per millisecond=330 ) properties seen :2
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) (NOT p2)), (X p3), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p3)), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1 p3))), (F (NOT p3)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p0) p1 (NOT p3)))), (F p2), (F p1), (F p0)]
Knowledge based reduction with 10 factoid took 576 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p3) (AND p0 (NOT p1))), (OR (NOT p3) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 23043 reset in 126 ms.
Product exploration explored 100000 steps with 22932 reset in 131 ms.
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 77/77 transitions.
Applied a total of 0 rules in 0 ms. Remains 63 /63 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 20:58:34] [INFO ] Invariant cache hit.
[2024-05-31 20:58:34] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 20:58:34] [INFO ] Invariant cache hit.
[2024-05-31 20:58:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-31 20:58:34] [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.
Running 76 sub problems to find dead transitions.
[2024-05-31 20:58:34] [INFO ] Invariant cache hit.
[2024-05-31 20:58:34] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 167 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2238 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints]
After SMT, in 3408ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3410ms
Finished structural reductions in LTL mode , in 1 iterations and 3550 ms. Remains : 63/63 places, 77/77 transitions.
Treatment of property DBSingleClientW-PT-d0m08-LTLFireability-14 finished in 15457 ms.
[2024-05-31 20:58:37] [INFO ] Flatten gal took : 8 ms
[2024-05-31 20:58:37] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 20:58:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 107 transitions and 421 arcs took 4 ms.
Total runtime 91549 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d0m08-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717189172022

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name DBSingleClientW-PT-d0m08-LTLFireability-02
ltl formula formula --ltl=/tmp/1629/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 82 places, 107 transitions and 421 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1629/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1629/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1629/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1629/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 83 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 83, there are 128 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~91 levels ~10000 states ~18864 transitions
pnml2lts-mc( 0/ 4): ~99 levels ~20000 states ~37660 transitions
pnml2lts-mc( 0/ 4): ~99 levels ~40000 states ~78176 transitions
pnml2lts-mc( 3/ 4): ~97 levels ~80000 states ~167040 transitions
pnml2lts-mc( 3/ 4): ~388 levels ~160000 states ~350932 transitions
pnml2lts-mc( 3/ 4): ~540 levels ~320000 states ~725120 transitions
pnml2lts-mc( 3/ 4): ~1214 levels ~640000 states ~1536996 transitions
pnml2lts-mc( 3/ 4): ~1488 levels ~1280000 states ~3141040 transitions
pnml2lts-mc( 3/ 4): ~3439 levels ~2560000 states ~6471924 transitions
pnml2lts-mc( 3/ 4): ~3909 levels ~5120000 states ~13313852 transitions
pnml2lts-mc( 3/ 4): ~10328 levels ~10240000 states ~28014184 transitions
pnml2lts-mc( 3/ 4): ~34775 levels ~20480000 states ~56492208 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 28279843
pnml2lts-mc( 0/ 4): unique states count: 33112660
pnml2lts-mc( 0/ 4): unique transitions count: 85540424
pnml2lts-mc( 0/ 4): - self-loop count: 21378329
pnml2lts-mc( 0/ 4): - claim dead count: 24566471
pnml2lts-mc( 0/ 4): - claim found count: 8734637
pnml2lts-mc( 0/ 4): - claim success count: 33532431
pnml2lts-mc( 0/ 4): - cum. max stack depth: 312428
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 34165437 states 92002273 transitions, fanout: 2.693
pnml2lts-mc( 0/ 4): Total exploration time 53.370 sec (53.370 sec minimum, 53.370 sec on average)
pnml2lts-mc( 0/ 4): States per second: 640162, Transitions per second: 1723858
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 282.7MB, 9.0 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 98.0%/47.0%
pnml2lts-mc( 0/ 4): Stored 107 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 282.7MB (~256.0MB paged-in)
ltl formula name DBSingleClientW-PT-d0m08-LTLFireability-12
ltl formula formula --ltl=/tmp/1629/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 82 places, 107 transitions and 421 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1629/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1629/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1629/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1629/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 83 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 83, there are 117 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~103!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1669
pnml2lts-mc( 0/ 4): unique states count: 2017
pnml2lts-mc( 0/ 4): unique transitions count: 4553
pnml2lts-mc( 0/ 4): - self-loop count: 1610
pnml2lts-mc( 0/ 4): - claim dead count: 221
pnml2lts-mc( 0/ 4): - claim found count: 92
pnml2lts-mc( 0/ 4): - claim success count: 2044
pnml2lts-mc( 0/ 4): - cum. max stack depth: 273
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2051 states 4660 transitions, fanout: 2.272
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 102550, Transitions per second: 233000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 14.6 B/state, compr.: 4.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 107 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DBSingleClientW-PT-d0m08-LTLFireability-14
ltl formula formula --ltl=/tmp/1629/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 82 places, 107 transitions and 421 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1629/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1629/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1629/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1629/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 83 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 83, there are 134 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~51!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 728
pnml2lts-mc( 0/ 4): unique states count: 848
pnml2lts-mc( 0/ 4): unique transitions count: 3792
pnml2lts-mc( 0/ 4): - self-loop count: 1706
pnml2lts-mc( 0/ 4): - claim dead count: 793
pnml2lts-mc( 0/ 4): - claim found count: 3
pnml2lts-mc( 0/ 4): - claim success count: 923
pnml2lts-mc( 0/ 4): - cum. max stack depth: 165
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 923 states 4377 transitions, fanout: 4.742
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 15.2 B/state, compr.: 4.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 107 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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