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.r528-tall-171683762200972.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldRVt-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762200972
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 21:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 21:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 21:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:43 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 ShieldRVt-PT-010B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717275993145

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:06:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:06:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:06:34] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-01 21:06:34] [INFO ] Transformed 503 places.
[2024-06-01 21:06:34] [INFO ] Transformed 503 transitions.
[2024-06-01 21:06:34] [INFO ] Found NUPN structural information;
[2024-06-01 21:06:34] [INFO ] Parsed PT model containing 503 places and 503 transitions and 1186 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-010B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 503/503 transitions.
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 97 place count 406 transition count 406
Iterating global reduction 0 with 97 rules applied. Total rules applied 194 place count 406 transition count 406
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 195 place count 405 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 196 place count 405 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 197 place count 404 transition count 404
Iterating global reduction 0 with 1 rules applied. Total rules applied 198 place count 404 transition count 404
Applied a total of 198 rules in 109 ms. Remains 404 /503 variables (removed 99) and now considering 404/503 (removed 99) transitions.
// Phase 1: matrix 404 rows 404 cols
[2024-06-01 21:06:34] [INFO ] Computed 41 invariants in 23 ms
[2024-06-01 21:06:35] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-06-01 21:06:35] [INFO ] Invariant cache hit.
[2024-06-01 21:06:35] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 403 sub problems to find dead transitions.
[2024-06-01 21:06:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 21:06:40] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 13 ms to minimize.
[2024-06-01 21:06:40] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 21:06:40] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 21:06:40] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 21:06:41] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 21:06:41] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 21:06:41] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 21:06:41] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 21:06:41] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 21:06:41] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 21:06:41] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-06-01 21:06:42] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:06:42] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-06-01 21:06:42] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 21:06:42] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 21:06:42] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-06-01 21:06:42] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-01 21:06:43] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:06:43] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:06:43] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 21:06:45] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:06:45] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 21:06:49] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 21:06:52] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (OVERLAPS) 404/808 variables, 404/469 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 21:06:58] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/808 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 808/808 variables, and 470 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (OVERLAPS) 1/404 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/404 variables, 25/66 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 21:07:08] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 21:07:08] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-06-01 21:07:08] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 3 ms to minimize.
[2024-06-01 21:07:08] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:07:08] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 21:07:09] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-06-01 21:07:09] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-06-01 21:07:09] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:07:09] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
[2024-06-01 21:07:09] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 6 ms to minimize.
[2024-06-01 21:07:10] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2024-06-01 21:07:10] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-06-01 21:07:10] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:07:10] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:07:10] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:07:10] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (OVERLAPS) 404/808 variables, 404/486 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/808 variables, 403/889 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 21:07:15] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-06-01 21:07:15] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-06-01 21:07:15] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-06-01 21:07:16] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-06-01 21:07:16] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-06-01 21:07:16] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:07:16] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-06-01 21:07:16] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-06-01 21:07:17] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-06-01 21:07:17] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 3 ms to minimize.
[2024-06-01 21:07:17] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-06-01 21:07:17] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 2 ms to minimize.
[2024-06-01 21:07:17] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
[2024-06-01 21:07:17] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-06-01 21:07:17] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 4 ms to minimize.
[2024-06-01 21:07:17] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 3 ms to minimize.
[2024-06-01 21:07:18] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 3 ms to minimize.
[2024-06-01 21:07:18] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-06-01 21:07:18] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-06-01 21:07:18] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/808 variables, 20/909 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 21:07:20] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 3 ms to minimize.
[2024-06-01 21:07:21] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2024-06-01 21:07:22] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 3 ms to minimize.
[2024-06-01 21:07:22] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-06-01 21:07:22] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2024-06-01 21:07:22] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-06-01 21:07:22] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-06-01 21:07:22] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-06-01 21:07:22] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-06-01 21:07:23] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-06-01 21:07:23] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-06-01 21:07:23] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-06-01 21:07:23] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-06-01 21:07:23] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-06-01 21:07:24] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-06-01 21:07:24] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-06-01 21:07:24] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-06-01 21:07:24] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-06-01 21:07:25] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-06-01 21:07:26] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/808 variables, 20/929 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-01 21:07:29] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2024-06-01 21:07:30] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-06-01 21:07:31] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-06-01 21:07:31] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-06-01 21:07:31] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 2 ms to minimize.
[2024-06-01 21:07:33] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-06-01 21:07:33] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-06-01 21:07:33] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 2 ms to minimize.
[2024-06-01 21:07:34] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-06-01 21:07:34] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-06-01 21:07:34] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-06-01 21:07:34] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-06-01 21:07:34] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-06-01 21:07:34] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
[2024-06-01 21:07:34] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-06-01 21:07:34] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 21:07:34] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-06-01 21:07:34] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-06-01 21:07:35] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
SMT process timed out in 60163ms, After SMT, problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LTL mode, iteration 1 : 404/503 places, 404/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60876 ms. Remains : 404/503 places, 404/503 transitions.
Support contains 30 out of 404 places after structural reductions.
[2024-06-01 21:07:35] [INFO ] Flatten gal took : 69 ms
[2024-06-01 21:07:35] [INFO ] Flatten gal took : 27 ms
[2024-06-01 21:07:35] [INFO ] Input system was already deterministic with 404 transitions.
Support contains 28 out of 404 places (down from 30) after GAL structural reductions.
RANDOM walk for 40000 steps (9 resets) in 964 ms. (41 steps per ms) remains 2/27 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
[2024-06-01 21:07:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 55/59 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 345/404 variables, 37/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 21:07:36] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:07:36] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:07:36] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 3/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 404/808 variables, 404/448 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 21:07:36] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 21:07:36] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-01 21:07:36] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/808 variables, 3/451 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/808 variables, 0/451 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/808 variables, 0/451 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 808/808 variables, and 451 constraints, problems are : Problem set: 1 solved, 1 unsolved in 600 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 367/404 variables, 39/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 6/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 21:07:37] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 21:07:37] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:07:37] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:07:37] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 4/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 404/808 variables, 404/455 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/808 variables, 1/456 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 21:07:37] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 21:07:37] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 2 ms to minimize.
[2024-06-01 21:07:37] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/808 variables, 3/459 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/808 variables, 0/459 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/808 variables, 0/459 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 808/808 variables, and 459 constraints, problems are : Problem set: 1 solved, 1 unsolved in 600 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 404/404 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 1210ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 127 ms.
Support contains 2 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 404/404 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 404 transition count 300
Reduce places removed 104 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 105 rules applied. Total rules applied 209 place count 300 transition count 299
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 210 place count 299 transition count 299
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 210 place count 299 transition count 225
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 358 place count 225 transition count 225
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 368 place count 215 transition count 215
Iterating global reduction 3 with 10 rules applied. Total rules applied 378 place count 215 transition count 215
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 378 place count 215 transition count 206
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 396 place count 206 transition count 206
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 580 place count 114 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 581 place count 114 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 583 place count 113 transition count 112
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 639 place count 85 transition count 138
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 640 place count 85 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 641 place count 84 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 642 place count 83 transition count 136
Applied a total of 642 rules in 79 ms. Remains 83 /404 variables (removed 321) and now considering 136/404 (removed 268) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 83/404 places, 136/404 transitions.
RANDOM walk for 6291 steps (0 resets) in 194 ms. (32 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-010B-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 119 stabilizing places and 119 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(p0)&&(F((F(p1)&&(p0||X((G(p2) U (p0&&G(p2))))))) U p3)))'
Support contains 4 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 404/404 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 392 transition count 392
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 392 transition count 392
Applied a total of 24 rules in 12 ms. Remains 392 /404 variables (removed 12) and now considering 392/404 (removed 12) transitions.
// Phase 1: matrix 392 rows 392 cols
[2024-06-01 21:07:38] [INFO ] Computed 41 invariants in 3 ms
[2024-06-01 21:07:38] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 21:07:38] [INFO ] Invariant cache hit.
[2024-06-01 21:07:38] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2024-06-01 21:07:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-01 21:07:43] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 21:07:43] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:07:43] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 21:07:43] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 21:07:44] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 21:07:44] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 21:07:44] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-01 21:07:44] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 21:07:45] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:07:45] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:07:45] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 392/784 variables, 392/444 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/784 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 0/784 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 444 constraints, problems are : Problem set: 0 solved, 391 unsolved in 23570 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 392/392 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-01 21:08:06] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 392/784 variables, 392/445 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 391/836 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-01 21:08:10] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 3 ms to minimize.
[2024-06-01 21:08:10] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 3 ms to minimize.
[2024-06-01 21:08:10] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 3 ms to minimize.
[2024-06-01 21:08:11] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-06-01 21:08:11] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 4 ms to minimize.
[2024-06-01 21:08:11] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-01 21:08:11] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-06-01 21:08:11] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-06-01 21:08:12] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 3 ms to minimize.
[2024-06-01 21:08:12] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-06-01 21:08:12] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2024-06-01 21:08:12] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-06-01 21:08:12] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-06-01 21:08:12] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 3 ms to minimize.
[2024-06-01 21:08:12] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-06-01 21:08:12] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-06-01 21:08:13] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-06-01 21:08:13] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 3 ms to minimize.
[2024-06-01 21:08:14] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 3 ms to minimize.
[2024-06-01 21:08:14] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 20/856 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-01 21:08:16] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-06-01 21:08:16] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 3 ms to minimize.
[2024-06-01 21:08:17] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-06-01 21:08:17] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-06-01 21:08:17] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:08:17] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-01 21:08:17] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-06-01 21:08:18] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 3 ms to minimize.
[2024-06-01 21:08:19] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-06-01 21:08:19] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-06-01 21:08:19] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-06-01 21:08:19] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-06-01 21:08:20] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:08:20] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-06-01 21:08:20] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-06-01 21:08:20] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-06-01 21:08:20] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-06-01 21:08:21] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 1 ms to minimize.
[2024-06-01 21:08:21] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-06-01 21:08:21] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 20/876 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-01 21:08:23] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 3 ms to minimize.
[2024-06-01 21:08:23] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-06-01 21:08:24] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-06-01 21:08:25] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 21:08:26] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-06-01 21:08:27] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-06-01 21:08:27] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-06-01 21:08:27] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-06-01 21:08:27] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-06-01 21:08:27] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-06-01 21:08:27] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 2 ms to minimize.
[2024-06-01 21:08:27] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-06-01 21:08:28] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-06-01 21:08:28] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-06-01 21:08:28] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-06-01 21:08:28] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 2 ms to minimize.
[2024-06-01 21:08:29] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-06-01 21:08:29] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-06-01 21:08:29] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-06-01 21:08:29] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 20/896 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-01 21:08:32] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
SMT process timed out in 53681ms, After SMT, problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 53687ms
Starting structural reductions in LTL mode, iteration 1 : 392/404 places, 392/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54060 ms. Remains : 392/404 places, 392/404 transitions.
Stuttering acceptance computed with spot in 402 ms :[(OR (NOT p3) (NOT p0)), (NOT p0), (NOT p3), (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-00 finished in 54547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&G(p1)) U p2))'
Support contains 2 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 404/404 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 403 transition count 299
Reduce places removed 104 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 105 rules applied. Total rules applied 209 place count 299 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 210 place count 298 transition count 298
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 210 place count 298 transition count 224
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 358 place count 224 transition count 224
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 368 place count 214 transition count 214
Iterating global reduction 3 with 10 rules applied. Total rules applied 378 place count 214 transition count 214
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 378 place count 214 transition count 205
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 396 place count 205 transition count 205
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 576 place count 115 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 577 place count 115 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 579 place count 114 transition count 113
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 635 place count 86 transition count 138
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 637 place count 84 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 638 place count 83 transition count 136
Applied a total of 638 rules in 66 ms. Remains 83 /404 variables (removed 321) and now considering 136/404 (removed 268) transitions.
// Phase 1: matrix 136 rows 83 cols
[2024-06-01 21:08:32] [INFO ] Computed 40 invariants in 1 ms
[2024-06-01 21:08:32] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 21:08:32] [INFO ] Invariant cache hit.
[2024-06-01 21:08:33] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-06-01 21:08:33] [INFO ] Redundant transitions in 2 ms returned []
Running 132 sub problems to find dead transitions.
[2024-06-01 21:08:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 135/218 variables, 83/123 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 0/218 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/219 variables, and 123 constraints, problems are : Problem set: 0 solved, 132 unsolved in 1737 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 135/218 variables, 83/123 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 132/255 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 0/218 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/219 variables, and 255 constraints, problems are : Problem set: 0 solved, 132 unsolved in 1733 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 3511ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 3512ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/404 places, 136/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3854 ms. Remains : 83/404 places, 136/404 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-01 finished in 3999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 404/404 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 403 transition count 298
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 298 transition count 298
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 210 place count 298 transition count 225
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 356 place count 225 transition count 225
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 367 place count 214 transition count 214
Iterating global reduction 2 with 11 rules applied. Total rules applied 378 place count 214 transition count 214
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 378 place count 214 transition count 204
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 398 place count 204 transition count 204
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 574 place count 116 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 575 place count 116 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 577 place count 115 transition count 114
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 633 place count 87 transition count 140
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 635 place count 85 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 636 place count 84 transition count 138
Applied a total of 636 rules in 40 ms. Remains 84 /404 variables (removed 320) and now considering 138/404 (removed 266) transitions.
// Phase 1: matrix 138 rows 84 cols
[2024-06-01 21:08:36] [INFO ] Computed 40 invariants in 1 ms
[2024-06-01 21:08:36] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-01 21:08:36] [INFO ] Invariant cache hit.
[2024-06-01 21:08:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 21:08:36] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-06-01 21:08:36] [INFO ] Redundant transitions in 2 ms returned []
Running 133 sub problems to find dead transitions.
[2024-06-01 21:08:36] [INFO ] Invariant cache hit.
[2024-06-01 21:08:36] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 137/221 variables, 84/124 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/221 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/222 variables, and 132 constraints, problems are : Problem set: 0 solved, 133 unsolved in 1942 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 84/84 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 137/221 variables, 84/124 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 8/132 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 133/265 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/221 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/222 variables, and 265 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2047 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 84/84 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
After SMT, in 4026ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 4028ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/404 places, 138/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4233 ms. Remains : 84/404 places, 138/404 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-05 finished in 4364 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||G(p1)))))'
Support contains 2 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 404/404 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 403 transition count 298
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 298 transition count 298
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 210 place count 298 transition count 225
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 356 place count 225 transition count 225
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 367 place count 214 transition count 214
Iterating global reduction 2 with 11 rules applied. Total rules applied 378 place count 214 transition count 214
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 378 place count 214 transition count 205
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 396 place count 205 transition count 205
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 574 place count 116 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 575 place count 116 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 577 place count 115 transition count 114
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 633 place count 87 transition count 140
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 635 place count 85 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 636 place count 84 transition count 138
Applied a total of 636 rules in 32 ms. Remains 84 /404 variables (removed 320) and now considering 138/404 (removed 266) transitions.
// Phase 1: matrix 138 rows 84 cols
[2024-06-01 21:08:41] [INFO ] Computed 40 invariants in 1 ms
[2024-06-01 21:08:41] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 21:08:41] [INFO ] Invariant cache hit.
[2024-06-01 21:08:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 21:08:41] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-06-01 21:08:41] [INFO ] Redundant transitions in 3 ms returned []
Running 133 sub problems to find dead transitions.
[2024-06-01 21:08:41] [INFO ] Invariant cache hit.
[2024-06-01 21:08:41] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 137/221 variables, 84/124 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/221 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/222 variables, and 128 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2251 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 84/84 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 137/221 variables, 84/124 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 133/261 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/221 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/222 variables, and 261 constraints, problems are : Problem set: 0 solved, 133 unsolved in 2150 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 84/84 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
After SMT, in 4447ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 4448ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/404 places, 138/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4654 ms. Remains : 84/404 places, 138/404 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-06
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-06 finished in 4767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((G(p1)||G(p2))))))'
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 404/404 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 394 transition count 394
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 394 transition count 394
Applied a total of 20 rules in 8 ms. Remains 394 /404 variables (removed 10) and now considering 394/404 (removed 10) transitions.
// Phase 1: matrix 394 rows 394 cols
[2024-06-01 21:08:45] [INFO ] Computed 41 invariants in 2 ms
[2024-06-01 21:08:45] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 21:08:45] [INFO ] Invariant cache hit.
[2024-06-01 21:08:46] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-06-01 21:08:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (OVERLAPS) 1/394 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-01 21:08:50] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 21:08:50] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-06-01 21:08:51] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 21:08:51] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 21:08:51] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 21:08:51] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 21:08:51] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 1 ms to minimize.
[2024-06-01 21:08:52] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 21:08:52] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-06-01 21:08:52] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:08:52] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-06-01 21:08:52] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-06-01 21:08:52] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 21:08:53] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 21:08:53] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-01 21:08:55] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-01 21:08:55] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:08:55] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/788 variables, 394/453 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/788 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-01 21:09:09] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:09:10] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/788 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 788/788 variables, and 455 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (OVERLAPS) 1/394 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-01 21:09:20] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/788 variables, 394/456 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/788 variables, 393/849 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-01 21:09:24] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-06-01 21:09:24] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-06-01 21:09:24] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-06-01 21:09:24] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-06-01 21:09:25] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:09:25] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-06-01 21:09:25] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-06-01 21:09:25] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:09:25] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-06-01 21:09:25] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-06-01 21:09:26] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-06-01 21:09:26] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-06-01 21:09:26] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-06-01 21:09:26] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:09:26] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-06-01 21:09:27] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:09:27] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:09:27] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-06-01 21:09:27] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 3 ms to minimize.
[2024-06-01 21:09:27] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/788 variables, 20/869 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-01 21:09:29] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-06-01 21:09:29] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-06-01 21:09:29] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-06-01 21:09:30] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-06-01 21:09:30] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-06-01 21:09:30] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-06-01 21:09:31] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-06-01 21:09:31] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 3 ms to minimize.
[2024-06-01 21:09:31] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 3 ms to minimize.
[2024-06-01 21:09:31] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-06-01 21:09:31] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-06-01 21:09:32] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-06-01 21:09:32] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 3 ms to minimize.
[2024-06-01 21:09:32] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-06-01 21:09:33] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:09:33] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:09:33] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-06-01 21:09:33] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-06-01 21:09:33] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-06-01 21:09:34] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/788 variables, 20/889 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-01 21:09:36] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 3 ms to minimize.
[2024-06-01 21:09:36] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 4 ms to minimize.
[2024-06-01 21:09:36] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-06-01 21:09:37] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 21:09:37] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-06-01 21:09:37] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-06-01 21:09:38] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-06-01 21:09:39] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 3 ms to minimize.
[2024-06-01 21:09:39] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 4 ms to minimize.
[2024-06-01 21:09:39] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-06-01 21:09:40] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-06-01 21:09:40] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-06-01 21:09:40] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:09:40] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-06-01 21:09:40] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-06-01 21:09:40] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-06-01 21:09:41] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-06-01 21:09:41] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2024-06-01 21:09:41] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 1 ms to minimize.
[2024-06-01 21:09:41] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/788 variables, 20/909 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-06-01 21:09:45] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 788/788 variables, and 910 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 82/82 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in LTL mode, iteration 1 : 394/404 places, 394/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60405 ms. Remains : 394/404 places, 394/404 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-07 finished in 60572 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)) U G(p1)))'
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 404/404 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 403 transition count 297
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 212 place count 297 transition count 297
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 212 place count 297 transition count 226
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 354 place count 226 transition count 226
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 364 place count 216 transition count 216
Iterating global reduction 2 with 10 rules applied. Total rules applied 374 place count 216 transition count 216
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 374 place count 216 transition count 206
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 394 place count 206 transition count 206
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 574 place count 116 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 575 place count 116 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 577 place count 115 transition count 114
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 635 place count 86 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 637 place count 84 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 638 place count 83 transition count 140
Applied a total of 638 rules in 27 ms. Remains 83 /404 variables (removed 321) and now considering 140/404 (removed 264) transitions.
// Phase 1: matrix 140 rows 83 cols
[2024-06-01 21:09:46] [INFO ] Computed 40 invariants in 1 ms
[2024-06-01 21:09:46] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 21:09:46] [INFO ] Invariant cache hit.
[2024-06-01 21:09:46] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-06-01 21:09:46] [INFO ] Redundant transitions in 3 ms returned []
Running 138 sub problems to find dead transitions.
[2024-06-01 21:09:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 2/83 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 140/223 variables, 83/123 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 0/223 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 123 constraints, problems are : Problem set: 0 solved, 138 unsolved in 2175 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 2/83 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 140/223 variables, 83/123 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 138/261 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 261 constraints, problems are : Problem set: 0 solved, 138 unsolved in 2108 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 4327ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 4329ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/404 places, 140/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4514 ms. Remains : 83/404 places, 140/404 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), p0]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-08
Product exploration explored 100000 steps with 27916 reset in 286 ms.
Stack based approach found an accepted trace after 8 steps with 1 reset with depth 4 and stack size 4 in 1 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-08 finished in 4892 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 1 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 404/404 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 392 transition count 392
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 392 transition count 392
Applied a total of 24 rules in 12 ms. Remains 392 /404 variables (removed 12) and now considering 392/404 (removed 12) transitions.
// Phase 1: matrix 392 rows 392 cols
[2024-06-01 21:09:51] [INFO ] Computed 41 invariants in 2 ms
[2024-06-01 21:09:51] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 21:09:51] [INFO ] Invariant cache hit.
[2024-06-01 21:09:51] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2024-06-01 21:09:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-01 21:09:56] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:09:56] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:09:56] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 21:09:56] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 21:09:56] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 21:09:56] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 21:09:57] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:09:57] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 21:09:57] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-01 21:09:58] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-06-01 21:09:58] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 21:09:58] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-06-01 21:09:58] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-01 21:10:01] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 392/784 variables, 392/447 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 0/784 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 447 constraints, problems are : Problem set: 0 solved, 391 unsolved in 26383 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 392/392 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 392/784 variables, 392/447 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/784 variables, 391/838 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-01 21:10:24] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 3 ms to minimize.
[2024-06-01 21:10:24] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-06-01 21:10:24] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 3 ms to minimize.
[2024-06-01 21:10:24] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-06-01 21:10:24] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 3 ms to minimize.
[2024-06-01 21:10:24] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-06-01 21:10:24] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 3 ms to minimize.
[2024-06-01 21:10:25] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-06-01 21:10:25] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-06-01 21:10:25] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 3 ms to minimize.
[2024-06-01 21:10:25] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-06-01 21:10:26] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 3 ms to minimize.
[2024-06-01 21:10:26] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 3 ms to minimize.
[2024-06-01 21:10:27] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 3 ms to minimize.
[2024-06-01 21:10:27] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-06-01 21:10:27] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2024-06-01 21:10:27] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 3 ms to minimize.
[2024-06-01 21:10:27] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-06-01 21:10:27] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-06-01 21:10:27] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 20/858 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-01 21:10:29] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2024-06-01 21:10:30] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-06-01 21:10:31] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-06-01 21:10:31] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-06-01 21:10:31] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-06-01 21:10:31] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-06-01 21:10:32] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-06-01 21:10:32] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:10:32] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 3 ms to minimize.
[2024-06-01 21:10:32] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-06-01 21:10:32] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:10:33] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-06-01 21:10:33] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2024-06-01 21:10:33] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 3 ms to minimize.
[2024-06-01 21:10:33] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:10:34] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:10:34] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-06-01 21:10:34] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-01 21:10:34] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:10:34] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 20/878 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-01 21:10:37] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-06-01 21:10:38] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-06-01 21:10:39] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-06-01 21:10:39] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 3 ms to minimize.
[2024-06-01 21:10:39] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:10:39] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-06-01 21:10:39] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 3 ms to minimize.
[2024-06-01 21:10:40] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-06-01 21:10:40] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 3 ms to minimize.
[2024-06-01 21:10:40] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 3 ms to minimize.
[2024-06-01 21:10:40] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-06-01 21:10:41] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-06-01 21:10:41] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 3 ms to minimize.
[2024-06-01 21:10:41] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-06-01 21:10:42] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 2 ms to minimize.
[2024-06-01 21:10:42] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-06-01 21:10:42] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:10:42] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-06-01 21:10:43] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-06-01 21:10:43] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 20/898 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-06-01 21:10:46] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-06-01 21:10:46] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-06-01 21:10:47] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-06-01 21:10:47] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/784 variables, and 902 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 392/392 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 78/78 constraints]
After SMT, in 56438ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 56442ms
Starting structural reductions in LTL mode, iteration 1 : 392/404 places, 392/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56771 ms. Remains : 392/404 places, 392/404 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-09 finished in 56876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 1 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 404/404 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 403 transition count 297
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 212 place count 297 transition count 297
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 212 place count 297 transition count 223
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 360 place count 223 transition count 223
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 370 place count 213 transition count 213
Iterating global reduction 2 with 10 rules applied. Total rules applied 380 place count 213 transition count 213
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 380 place count 213 transition count 204
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 398 place count 204 transition count 204
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 578 place count 114 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 579 place count 114 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 581 place count 113 transition count 112
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 639 place count 84 transition count 139
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 641 place count 82 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 642 place count 81 transition count 137
Applied a total of 642 rules in 28 ms. Remains 81 /404 variables (removed 323) and now considering 137/404 (removed 267) transitions.
// Phase 1: matrix 137 rows 81 cols
[2024-06-01 21:10:48] [INFO ] Computed 40 invariants in 0 ms
[2024-06-01 21:10:48] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 21:10:48] [INFO ] Invariant cache hit.
[2024-06-01 21:10:48] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-06-01 21:10:48] [INFO ] Redundant transitions in 1 ms returned []
Running 133 sub problems to find dead transitions.
[2024-06-01 21:10:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 136/217 variables, 81/121 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 0/217 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/218 variables, and 121 constraints, problems are : Problem set: 0 solved, 133 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 136/217 variables, 81/121 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 133/254 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 0/217 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/218 variables, and 254 constraints, problems are : Problem set: 0 solved, 133 unsolved in 1784 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints]
After SMT, in 3415ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 3416ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/404 places, 137/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3588 ms. Remains : 81/404 places, 137/404 transitions.
Stuttering acceptance computed with spot in 74 ms :[p0, true, p0]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-10 finished in 3674 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 1 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 404/404 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 391 transition count 391
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 391 transition count 391
Applied a total of 26 rules in 7 ms. Remains 391 /404 variables (removed 13) and now considering 391/404 (removed 13) transitions.
// Phase 1: matrix 391 rows 391 cols
[2024-06-01 21:10:51] [INFO ] Computed 41 invariants in 2 ms
[2024-06-01 21:10:51] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 21:10:51] [INFO ] Invariant cache hit.
[2024-06-01 21:10:52] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 390 sub problems to find dead transitions.
[2024-06-01 21:10:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (OVERLAPS) 1/391 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-06-01 21:10:56] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 21:10:56] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-06-01 21:10:57] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:10:57] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 21:10:57] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-06-01 21:10:57] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-06-01 21:10:58] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:10:58] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-06-01 21:10:58] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:10:58] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-06-01 21:10:58] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 391/782 variables, 391/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (OVERLAPS) 0/782 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 782/782 variables, and 443 constraints, problems are : Problem set: 0 solved, 390 unsolved in 23455 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (OVERLAPS) 1/391 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 391/782 variables, 391/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 390/833 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-06-01 21:11:21] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-06-01 21:11:21] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:11:21] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:11:21] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-06-01 21:11:21] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-06-01 21:11:21] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-06-01 21:11:21] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 2 ms to minimize.
[2024-06-01 21:11:21] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 2 ms to minimize.
[2024-06-01 21:11:21] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2024-06-01 21:11:22] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-06-01 21:11:22] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-06-01 21:11:22] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 3 ms to minimize.
[2024-06-01 21:11:22] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-06-01 21:11:23] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 3 ms to minimize.
[2024-06-01 21:11:23] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:11:23] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-06-01 21:11:23] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 3 ms to minimize.
[2024-06-01 21:11:23] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 3 ms to minimize.
[2024-06-01 21:11:24] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-06-01 21:11:24] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/782 variables, 20/853 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-06-01 21:11:26] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 3 ms to minimize.
[2024-06-01 21:11:26] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-06-01 21:11:26] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-06-01 21:11:27] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-01 21:11:27] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 3 ms to minimize.
[2024-06-01 21:11:27] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-06-01 21:11:27] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-01 21:11:28] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-06-01 21:11:28] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-06-01 21:11:28] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-06-01 21:11:28] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 3 ms to minimize.
[2024-06-01 21:11:28] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-06-01 21:11:29] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-06-01 21:11:29] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-06-01 21:11:29] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 3 ms to minimize.
[2024-06-01 21:11:29] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-06-01 21:11:29] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-01 21:11:29] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-06-01 21:11:30] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-06-01 21:11:30] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 20/873 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-06-01 21:11:32] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-06-01 21:11:33] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 3 ms to minimize.
[2024-06-01 21:11:33] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-06-01 21:11:33] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-06-01 21:11:33] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-06-01 21:11:34] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-06-01 21:11:34] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:11:34] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
[2024-06-01 21:11:34] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-06-01 21:11:35] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-06-01 21:11:35] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 3 ms to minimize.
[2024-06-01 21:11:35] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 3 ms to minimize.
[2024-06-01 21:11:35] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:11:36] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-06-01 21:11:36] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-06-01 21:11:36] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-06-01 21:11:36] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:11:36] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:11:36] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-06-01 21:11:36] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 20/893 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-06-01 21:11:40] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-06-01 21:11:41] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-06-01 21:11:41] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 3 ms to minimize.
[2024-06-01 21:11:42] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-06-01 21:11:42] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 3 ms to minimize.
[2024-06-01 21:11:42] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 3 ms to minimize.
[2024-06-01 21:11:43] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-06-01 21:11:43] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-06-01 21:11:44] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-06-01 21:11:44] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-01 21:11:44] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-06-01 21:11:44] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-06-01 21:11:44] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-06-01 21:11:44] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:11:44] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-06-01 21:11:45] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-06-01 21:11:45] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
SMT process timed out in 53495ms, After SMT, problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 53499ms
Starting structural reductions in LTL mode, iteration 1 : 391/404 places, 391/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53832 ms. Remains : 391/404 places, 391/404 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 133 ms.
Product exploration explored 100000 steps with 33333 reset in 157 ms.
Computed a total of 118 stabilizing places and 118 stable transitions
Computed a total of 118 stabilizing places and 118 stable transitions
Detected a total of 118/391 stabilizing places and 118/391 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-010B-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-010B-LTLFireability-11 finished in 54291 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 1 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 404/404 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 403 transition count 298
Reduce places removed 105 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 106 rules applied. Total rules applied 211 place count 298 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 297 transition count 297
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 73 Pre rules applied. Total rules applied 212 place count 297 transition count 224
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 358 place count 224 transition count 224
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 369 place count 213 transition count 213
Iterating global reduction 3 with 11 rules applied. Total rules applied 380 place count 213 transition count 213
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 380 place count 213 transition count 203
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 400 place count 203 transition count 203
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 576 place count 115 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 577 place count 115 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 579 place count 114 transition count 113
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 637 place count 85 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 639 place count 83 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 640 place count 82 transition count 139
Applied a total of 640 rules in 47 ms. Remains 82 /404 variables (removed 322) and now considering 139/404 (removed 265) transitions.
// Phase 1: matrix 139 rows 82 cols
[2024-06-01 21:11:46] [INFO ] Computed 40 invariants in 1 ms
[2024-06-01 21:11:46] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 21:11:46] [INFO ] Invariant cache hit.
[2024-06-01 21:11:46] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-06-01 21:11:46] [INFO ] Redundant transitions in 1 ms returned []
Running 135 sub problems to find dead transitions.
[2024-06-01 21:11:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 138/220 variables, 82/122 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 0/220 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/221 variables, and 122 constraints, problems are : Problem set: 0 solved, 135 unsolved in 1666 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 138/220 variables, 82/122 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 135/257 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 0/220 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/221 variables, and 257 constraints, problems are : Problem set: 0 solved, 135 unsolved in 1788 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
After SMT, in 3487ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 3489ms
Starting structural reductions in SI_LTL mode, iteration 1 : 82/404 places, 139/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3691 ms. Remains : 82/404 places, 139/404 transitions.
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-12
Stuttering criterion allowed to conclude after 845 steps with 3 reset in 12 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-12 finished in 3787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!p1&&G(F(p2)))))'
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 404/404 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 104 place count 403 transition count 299
Reduce places removed 104 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 105 rules applied. Total rules applied 209 place count 299 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 210 place count 298 transition count 298
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 210 place count 298 transition count 224
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 358 place count 224 transition count 224
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 367 place count 215 transition count 215
Iterating global reduction 3 with 9 rules applied. Total rules applied 376 place count 215 transition count 215
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 376 place count 215 transition count 207
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 392 place count 207 transition count 207
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 574 place count 116 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 575 place count 116 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 577 place count 115 transition count 114
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 633 place count 87 transition count 139
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 635 place count 85 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 636 place count 84 transition count 137
Applied a total of 636 rules in 35 ms. Remains 84 /404 variables (removed 320) and now considering 137/404 (removed 267) transitions.
// Phase 1: matrix 137 rows 84 cols
[2024-06-01 21:11:49] [INFO ] Computed 40 invariants in 0 ms
[2024-06-01 21:11:49] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 21:11:49] [INFO ] Invariant cache hit.
[2024-06-01 21:11:50] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-06-01 21:11:50] [INFO ] Redundant transitions in 1 ms returned []
Running 135 sub problems to find dead transitions.
[2024-06-01 21:11:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 137/221 variables, 84/124 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 0/221 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 124 constraints, problems are : Problem set: 0 solved, 135 unsolved in 1700 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 137/221 variables, 84/124 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 135/259 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 0/221 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 259 constraints, problems are : Problem set: 0 solved, 135 unsolved in 1922 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
After SMT, in 3652ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 3653ms
Starting structural reductions in SI_LTL mode, iteration 1 : 84/404 places, 137/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3825 ms. Remains : 84/404 places, 137/404 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p2) p1), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-13 finished in 3967 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 1 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 404/404 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 403 transition count 298
Reduce places removed 105 places and 0 transitions.
Iterating post reduction 1 with 105 rules applied. Total rules applied 210 place count 298 transition count 298
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 210 place count 298 transition count 224
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 358 place count 224 transition count 224
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 369 place count 213 transition count 213
Iterating global reduction 2 with 11 rules applied. Total rules applied 380 place count 213 transition count 213
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 380 place count 213 transition count 203
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 400 place count 203 transition count 203
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 576 place count 115 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 577 place count 115 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 579 place count 114 transition count 113
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 637 place count 85 transition count 141
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 638 place count 85 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 640 place count 83 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 641 place count 82 transition count 139
Applied a total of 641 rules in 27 ms. Remains 82 /404 variables (removed 322) and now considering 139/404 (removed 265) transitions.
// Phase 1: matrix 139 rows 82 cols
[2024-06-01 21:11:53] [INFO ] Computed 40 invariants in 1 ms
[2024-06-01 21:11:53] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 21:11:53] [INFO ] Invariant cache hit.
[2024-06-01 21:11:54] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-06-01 21:11:54] [INFO ] Redundant transitions in 1 ms returned []
Running 135 sub problems to find dead transitions.
[2024-06-01 21:11:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 138/220 variables, 82/122 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 0/220 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/221 variables, and 122 constraints, problems are : Problem set: 0 solved, 135 unsolved in 1684 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 138/220 variables, 82/122 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 135/257 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 0/220 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/221 variables, and 257 constraints, problems are : Problem set: 0 solved, 135 unsolved in 1793 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints]
After SMT, in 3514ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 3516ms
Starting structural reductions in SI_LTL mode, iteration 1 : 82/404 places, 139/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3696 ms. Remains : 82/404 places, 139/404 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-14
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-14 finished in 3755 ms.
All properties solved by simple procedures.
Total runtime 323296 ms.
ITS solved all properties within timeout

BK_STOP 1717276317683

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-010B.tgz
mv ShieldRVt-PT-010B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;