Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 12 08:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 08:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 08:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 57K 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 DES-PT-20a-LTLCardinality-00
FORMULA_NAME DES-PT-20a-LTLCardinality-01
FORMULA_NAME DES-PT-20a-LTLCardinality-02
FORMULA_NAME DES-PT-20a-LTLCardinality-03
FORMULA_NAME DES-PT-20a-LTLCardinality-04
FORMULA_NAME DES-PT-20a-LTLCardinality-05
FORMULA_NAME DES-PT-20a-LTLCardinality-06
FORMULA_NAME DES-PT-20a-LTLCardinality-07
FORMULA_NAME DES-PT-20a-LTLCardinality-08
FORMULA_NAME DES-PT-20a-LTLCardinality-09
FORMULA_NAME DES-PT-20a-LTLCardinality-10
FORMULA_NAME DES-PT-20a-LTLCardinality-11
FORMULA_NAME DES-PT-20a-LTLCardinality-12
FORMULA_NAME DES-PT-20a-LTLCardinality-13
FORMULA_NAME DES-PT-20a-LTLCardinality-14
FORMULA_NAME DES-PT-20a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716317421177

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 18:50:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 18:50:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:50:22] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-21 18:50:22] [INFO ] Transformed 195 places.
[2024-05-21 18:50:22] [INFO ] Transformed 152 transitions.
[2024-05-21 18:50:22] [INFO ] Found NUPN structural information;
[2024-05-21 18:50:22] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-20a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 37 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2024-05-21 18:50:22] [INFO ] Computed 59 invariants in 25 ms
[2024-05-21 18:50:22] [INFO ] Implicit Places using invariants in 303 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 331 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 390 ms. Remains : 193/195 places, 137/138 transitions.
Support contains 23 out of 193 places after structural reductions.
[2024-05-21 18:50:23] [INFO ] Flatten gal took : 39 ms
[2024-05-21 18:50:23] [INFO ] Flatten gal took : 26 ms
[2024-05-21 18:50:23] [INFO ] Input system was already deterministic with 137 transitions.
RANDOM walk for 40000 steps (890 resets) in 1227 ms. (32 steps per ms) remains 8/14 properties
BEST_FIRST walk for 40004 steps (189 resets) in 234 ms. (170 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (181 resets) in 179 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (182 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (188 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (181 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (184 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (176 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (187 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 18:50:24] [INFO ] Computed 58 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 2/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 75/89 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 77/166 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 6/172 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 136/308 variables, 172/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 22/330 variables, 21/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 251 constraints, problems are : Problem set: 0 solved, 8 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 2/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 75/89 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 77/166 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 6/172 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 136/308 variables, 172/230 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 18:50:25] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 9 ms to minimize.
[2024-05-21 18:50:25] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
[2024-05-21 18:50:25] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-21 18:50:25] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:50:25] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 18:50:25] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 22/330 variables, 21/259 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 6/265 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/330 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 265 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1868 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 2473ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 2 properties in 7262 ms.
Support contains 8 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 193 transition count 135
Applied a total of 8 rules in 34 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 193/193 places, 135/137 transitions.
RANDOM walk for 40000 steps (535 resets) in 448 ms. (89 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (88 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (92 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (88 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (88 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (91 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (94 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1042914 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 6
Probabilistic random walk after 1042914 steps, saw 147011 distinct states, run finished after 3004 ms. (steps per millisecond=347 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-21 18:50:37] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 18:50:37] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 81/91 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 84/175 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 135/310 variables, 175/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 18/328 variables, 18/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 256 constraints, problems are : Problem set: 0 solved, 6 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 81/91 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 84/175 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 135/310 variables, 175/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 18:50:37] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 18:50:37] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 18:50:37] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 18/328 variables, 18/261 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/328 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/328 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 265 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1174 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 1483ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3866 ms.
Support contains 8 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-21 18:50:42] [INFO ] Invariant cache hit.
[2024-05-21 18:50:42] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 18:50:42] [INFO ] Invariant cache hit.
[2024-05-21 18:50:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:50:42] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-21 18:50:42] [INFO ] Redundant transitions in 2 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-21 18:50:42] [INFO ] Invariant cache hit.
[2024-05-21 18:50:42] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/328 variables, 193/253 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:50:45] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/328 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:50:47] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:50:47] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:50:48] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/328 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:50:48] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:50:48] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 262 constraints, problems are : Problem set: 0 solved, 134 unsolved in 9887 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:50:53] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-21 18:50:53] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:50:54] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-21 18:50:54] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 135/328 variables, 193/263 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 134/400 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:50:57] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 18:50:57] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-21 18:50:57] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:50:57] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-21 18:50:59] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:50:59] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:50:59] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 7/407 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:51:06] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 408 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 18/18 constraints]
After SMT, in 39997ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 40000ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40358 ms. Remains : 193/193 places, 135/135 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 15 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 135 rows 193 cols
[2024-05-21 18:51:22] [INFO ] Computed 60 invariants in 7 ms
[2024-05-21 18:51:22] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 18:51:23] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 18:51:23] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 18:51:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 18:51:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 18:51:23] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-21 18:51:23] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-21 18:51:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
TRAPS : Iteration 1
[2024-05-21 18:51:23] [INFO ] After 363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-21 18:51:23] [INFO ] After 529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 662 ms.
FORMULA DES-PT-20a-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 96 stabilizing places and 91 stable transitions
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))&&F((p1&&G(p2)))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 18:51:23] [INFO ] Computed 58 invariants in 4 ms
[2024-05-21 18:51:23] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 18:51:23] [INFO ] Invariant cache hit.
[2024-05-21 18:51:24] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-21 18:51:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:51:24] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:51:26] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:51:26] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-21 18:51:26] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:51:28] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6153 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:51:35] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29732 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 35936ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 35941ms
Finished structural reductions in LTL mode , in 1 iterations and 36227 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-04
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 3 ms.
FORMULA DES-PT-20a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-04 finished in 36574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 11 ms. Remains 192 /193 variables (removed 1) and now considering 136/137 (removed 1) transitions.
// Phase 1: matrix 136 rows 192 cols
[2024-05-21 18:52:00] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 18:52:00] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 18:52:00] [INFO ] Invariant cache hit.
[2024-05-21 18:52:00] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-05-21 18:52:00] [INFO ] Redundant transitions in 5 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-21 18:52:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 136/327 variables, 191/249 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-21 18:52:02] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 4 ms to minimize.
[2024-05-21 18:52:02] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 1/328 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 252 constraints, problems are : Problem set: 0 solved, 133 unsolved in 4986 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 136/327 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 133/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 1/328 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-21 18:52:16] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-21 18:52:16] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:52:16] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:52:16] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 389 constraints, problems are : Problem set: 0 solved, 133 unsolved in 26448 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 6/6 constraints]
After SMT, in 31479ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 31482ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31764 ms. Remains : 192/193 places, 136/137 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-05
Product exploration explored 100000 steps with 2450 reset in 253 ms.
Product exploration explored 100000 steps with 2449 reset in 244 ms.
Computed a total of 95 stabilizing places and 90 stable transitions
Computed a total of 95 stabilizing places and 90 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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)]
RANDOM walk for 353 steps (5 resets) in 10 ms. (32 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 95 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 136/136 transitions.
Applied a total of 0 rules in 13 ms. Remains 192 /192 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-21 18:52:33] [INFO ] Invariant cache hit.
[2024-05-21 18:52:33] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 18:52:33] [INFO ] Invariant cache hit.
[2024-05-21 18:52:33] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-05-21 18:52:33] [INFO ] Redundant transitions in 2 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-21 18:52:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 136/327 variables, 191/249 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-21 18:52:35] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:52:35] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 1/328 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 252 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5062 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 136/327 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 133/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 1/328 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-21 18:52:49] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 18:52:49] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-21 18:52:49] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:52:50] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 389 constraints, problems are : Problem set: 0 solved, 133 unsolved in 26980 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 6/6 constraints]
After SMT, in 32080ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 32082ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32372 ms. Remains : 192/192 places, 136/136 transitions.
Computed a total of 95 stabilizing places and 90 stable transitions
Computed a total of 95 stabilizing places and 90 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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)]
RANDOM walk for 746 steps (15 resets) in 8 ms. (82 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 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2455 reset in 175 ms.
Product exploration explored 100000 steps with 2451 reset in 202 ms.
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 136/136 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-21 18:53:06] [INFO ] Invariant cache hit.
[2024-05-21 18:53:06] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 18:53:06] [INFO ] Invariant cache hit.
[2024-05-21 18:53:06] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-05-21 18:53:06] [INFO ] Redundant transitions in 3 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-21 18:53:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 136/327 variables, 191/249 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-21 18:53:08] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:53:08] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 1/328 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 252 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5121 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 136/327 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 133/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 1/328 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-21 18:53:22] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-21 18:53:22] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-21 18:53:23] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2024-05-21 18:53:23] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 389 constraints, problems are : Problem set: 0 solved, 133 unsolved in 26510 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 6/6 constraints]
After SMT, in 31668ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 31670ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31953 ms. Remains : 192/192 places, 136/136 transitions.
Treatment of property DES-PT-20a-LTLCardinality-05 finished in 98042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 18:53:38] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 18:53:38] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 18:53:38] [INFO ] Invariant cache hit.
[2024-05-21 18:53:38] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-21 18:53:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:53:39] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:53:40] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 18:53:41] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-21 18:53:41] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:53:42] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6267 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:53:49] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29799 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36110ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36112ms
Finished structural reductions in LTL mode , in 1 iterations and 36402 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-06
Product exploration explored 100000 steps with 33333 reset in 213 ms.
Product exploration explored 100000 steps with 33333 reset in 224 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20a-LTLCardinality-06 finished in 36989 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)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 18:54:15] [INFO ] Invariant cache hit.
[2024-05-21 18:54:15] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 18:54:15] [INFO ] Invariant cache hit.
[2024-05-21 18:54:15] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-21 18:54:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:54:16] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:54:17] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:54:18] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:54:18] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:54:19] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6152 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:54:26] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36207ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36209ms
Finished structural reductions in LTL mode , in 1 iterations and 36496 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-07 finished in 36608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 9 ms. Remains 192 /193 variables (removed 1) and now considering 136/137 (removed 1) transitions.
// Phase 1: matrix 136 rows 192 cols
[2024-05-21 18:54:51] [INFO ] Computed 58 invariants in 5 ms
[2024-05-21 18:54:52] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 18:54:52] [INFO ] Invariant cache hit.
[2024-05-21 18:54:52] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-05-21 18:54:52] [INFO ] Redundant transitions in 1 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-21 18:54:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 136/327 variables, 191/249 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-21 18:54:53] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:54:53] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 1/328 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 252 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 136/327 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 133/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 1/328 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-21 18:55:08] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 18:55:08] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:55:08] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:55:08] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 389 constraints, problems are : Problem set: 0 solved, 133 unsolved in 26793 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 6/6 constraints]
After SMT, in 31845ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 31847ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32139 ms. Remains : 192/193 places, 136/137 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-09
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA DES-PT-20a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-09 finished in 32199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 18:55:24] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 18:55:24] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 18:55:24] [INFO ] Invariant cache hit.
[2024-05-21 18:55:24] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-21 18:55:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:55:25] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:55:26] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:55:26] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:55:26] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:55:28] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6459 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:55:35] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29747 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36245ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36246ms
Finished structural reductions in LTL mode , in 1 iterations and 36552 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-10
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-10 finished in 36641 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 U (G(p0)||(G(p2)&&p1))))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 18:56:00] [INFO ] Invariant cache hit.
[2024-05-21 18:56:00] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 18:56:00] [INFO ] Invariant cache hit.
[2024-05-21 18:56:01] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-05-21 18:56:01] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 18:56:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:56:01] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:56:03] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 18:56:03] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-21 18:56:03] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:56:05] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6239 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:56:12] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29505 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 35792ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 35793ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36075 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 165 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 p2))]
Running random walk in product with property : DES-PT-20a-LTLCardinality-12
Product exploration explored 100000 steps with 2220 reset in 257 ms.
Product exploration explored 100000 steps with 2237 reset in 270 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) p0))), (X (AND p1 p2 p0)), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 21 factoid took 338 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (892 resets) in 796 ms. (50 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40002 steps (183 resets) in 182 ms. (218 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (186 resets) in 304 ms. (131 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (177 resets) in 242 ms. (164 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (189 resets) in 233 ms. (170 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (193 resets) in 154 ms. (258 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (183 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (172 resets) in 156 ms. (254 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (178 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
[2024-05-21 18:56:38] [INFO ] Invariant cache hit.
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 75/81 variables, 32/33 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 83/164 variables, 23/56 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 6/170 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 136/306 variables, 170/228 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 24/330 variables, 23/251 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 251 constraints, problems are : Problem set: 1 solved, 7 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 75/81 variables, 32/33 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 83/164 variables, 23/56 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-05-21 18:56:39] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 1/57 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 6/170 variables, 2/59 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 136/306 variables, 170/229 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 1/230 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-21 18:56:39] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:56:39] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 18:56:39] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 3/233 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/233 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 24/330 variables, 23/256 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 5/261 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/261 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/330 variables, 0/261 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 261 constraints, problems are : Problem set: 2 solved, 6 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 1073ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2516 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 193 transition count 135
Applied a total of 8 rules in 11 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 193/193 places, 135/137 transitions.
RANDOM walk for 40000 steps (546 resets) in 361 ms. (110 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (89 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (84 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (88 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (77 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (94 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 735120 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 6
Probabilistic random walk after 735120 steps, saw 105644 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-21 18:56:45] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 18:56:45] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 81/87 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 86/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 20/328 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 256 constraints, problems are : Problem set: 0 solved, 6 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 81/87 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 86/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 20/328 variables, 20/257 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 262 constraints, problems are : Problem set: 0 solved, 6 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 781ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2420 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-21 18:56:49] [INFO ] Invariant cache hit.
[2024-05-21 18:56:49] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 18:56:49] [INFO ] Invariant cache hit.
[2024-05-21 18:56:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 18:56:49] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-21 18:56:49] [INFO ] Redundant transitions in 0 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-21 18:56:49] [INFO ] Invariant cache hit.
[2024-05-21 18:56:49] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 135/328 variables, 193/253 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/328 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:56:51] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/328 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:56:54] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-21 18:56:54] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:56:54] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/328 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:56:55] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:56:55] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (OVERLAPS) 0/328 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 262 constraints, problems are : Problem set: 0 solved, 134 unsolved in 9591 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:56:59] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-21 18:57:00] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:57:00] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-21 18:57:00] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 135/328 variables, 193/263 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 134/400 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:57:03] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-21 18:57:03] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-21 18:57:03] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 18:57:04] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-21 18:57:05] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 18:57:05] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:57:05] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 7/407 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-21 18:57:13] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/328 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/328 variables, and 408 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 18/18 constraints]
After SMT, in 39645ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 39647ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39959 ms. Remains : 193/193 places, 135/135 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 15 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 135 rows 193 cols
[2024-05-21 18:57:29] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 18:57:29] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 18:57:29] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 18:57:29] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 18:57:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 18:57:29] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 18:57:29] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-21 18:57:29] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-21 18:57:29] [INFO ] After 521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 621 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) p0))), (X (AND p1 p2 p0)), (X (AND p2 p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 (NOT p2) (NOT p1))), (G (OR p0 p2))]
False Knowledge obtained : [(X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p2 p1))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p0) p1)))), (F (NOT p1)), (F (NOT (AND p0 p2 p1)))]
Knowledge based reduction with 23 factoid took 545 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 18:57:30] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 18:57:30] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 18:57:30] [INFO ] Invariant cache hit.
[2024-05-21 18:57:30] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-05-21 18:57:30] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 18:57:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:57:31] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:57:32] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:57:33] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-21 18:57:33] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:57:35] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6158 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:57:42] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29711 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 35906ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 35908ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36200 ms. Remains : 193/193 places, 137/137 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (AND p0 p2 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 455 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (880 resets) in 199 ms. (200 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (170 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (188 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (167 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (183 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (183 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (181 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
[2024-05-21 18:58:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 75/80 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 84/164 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/170 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 136/306 variables, 170/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 24/330 variables, 23/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/330 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 251 constraints, problems are : Problem set: 0 solved, 6 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 75/80 variables, 32/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 84/164 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 18:58:08] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6/170 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 136/306 variables, 170/229 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 1/230 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-21 18:58:08] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 1/231 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 24/330 variables, 23/254 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 4/258 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/330 variables, 0/258 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 258 constraints, problems are : Problem set: 1 solved, 5 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 936ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2469 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 193 transition count 135
Applied a total of 8 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 193/193 places, 135/137 transitions.
RANDOM walk for 40000 steps (551 resets) in 394 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (91 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (84 resets) in 100 ms. (396 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (87 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (92 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (88 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 835735 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 5
Probabilistic random walk after 835735 steps, saw 118964 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
// Phase 1: matrix 135 rows 193 cols
[2024-05-21 18:58:14] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 18:58:14] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 81/86 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 87/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 20/328 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 256 constraints, problems are : Problem set: 0 solved, 5 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 81/86 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 87/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 18:58:14] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-21 18:58:14] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 135/308 variables, 173/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 18:58:15] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 20/328 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/328 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 264 constraints, problems are : Problem set: 0 solved, 5 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 893ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 1529 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 13 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 193/193 places, 135/135 transitions.
RANDOM walk for 40000 steps (551 resets) in 240 ms. (165 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (87 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (85 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1196562 steps, run timeout after 3012 ms. (steps per millisecond=397 ) properties seen :0 out of 2
Probabilistic random walk after 1196562 steps, saw 167481 distinct states, run finished after 3012 ms. (steps per millisecond=397 ) properties seen :0
[2024-05-21 18:58:20] [INFO ] Invariant cache hit.
[2024-05-21 18:58:20] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/86 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 87/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 135/308 variables, 173/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/328 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/328 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 256 constraints, problems are : Problem set: 0 solved, 2 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 81/86 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 87/173 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 18:58:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 18:58:20] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 135/308 variables, 173/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 18:58:20] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-21 18:58:20] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-21 18:58:20] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 20/328 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/328 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/328 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/328 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 263 constraints, problems are : Problem set: 0 solved, 2 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 634ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 54937 steps, including 335 resets, run visited all 2 properties in 570 ms. (steps per millisecond=96 )
Parikh walk visited 2 properties in 573 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (AND p0 p2 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p2))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p2 p1))), (F (NOT (AND (OR (NOT p0) p2) (OR (NOT p0) p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT p0)), (F (NOT (AND p0 p2 p1))), (F (NOT p1))]
Knowledge based reduction with 14 factoid took 622 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2254 reset in 212 ms.
Product exploration explored 100000 steps with 2223 reset in 235 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 18:58:22] [INFO ] Computed 58 invariants in 4 ms
[2024-05-21 18:58:22] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 18:58:22] [INFO ] Invariant cache hit.
[2024-05-21 18:58:23] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-05-21 18:58:23] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 18:58:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:58:23] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:58:25] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 18:58:25] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-21 18:58:25] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:58:27] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6265 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:58:34] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29726 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36028ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36030ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36324 ms. Remains : 193/193 places, 137/137 transitions.
Treatment of property DES-PT-20a-LTLCardinality-12 finished in 178425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 18:58:59] [INFO ] Invariant cache hit.
[2024-05-21 18:58:59] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 18:58:59] [INFO ] Invariant cache hit.
[2024-05-21 18:58:59] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-05-21 18:58:59] [INFO ] Redundant transitions in 1 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-21 18:58:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:00] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:01] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:59:01] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:59:01] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:03] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6227 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:10] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 36280ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 36282ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36566 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-13
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-13 finished in 36615 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)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 18:59:35] [INFO ] Invariant cache hit.
[2024-05-21 18:59:35] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 18:59:35] [INFO ] Invariant cache hit.
[2024-05-21 18:59:36] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-21 18:59:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:36] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/252 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:38] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-21 18:59:38] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-21 18:59:38] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:40] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/330 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 256 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6341 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/330 variables, 193/256 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 136/392 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-21 18:59:47] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 393 constraints, problems are : Problem set: 0 solved, 136 unsolved in 29369 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints]
After SMT, in 35751ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 35752ms
Finished structural reductions in LTL mode , in 1 iterations and 36031 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-15 finished in 36146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(G(p2)&&p1))))))'
[2024-05-21 19:00:12] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:00:12] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-21 19:00:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 137 transitions and 671 arcs took 4 ms.
Total runtime 589992 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DES-PT-20a

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1661
MODEL NAME: /home/mcc/execution/412/model
193 places, 137 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-20a-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-20a-LTLCardinality-12 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716318403885

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20a.tgz
mv DES-PT-20a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;