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.r356-tall-171683761700732.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 itstools
Input is ShieldRVs-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761700732
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 17:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 17:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 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 24K 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 ShieldRVs-PT-002B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717032824090

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-002B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-30 01:33:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 01:33:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:33:45] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-05-30 01:33:45] [INFO ] Transformed 83 places.
[2024-05-30 01:33:45] [INFO ] Transformed 93 transitions.
[2024-05-30 01:33:45] [INFO ] Found NUPN structural information;
[2024-05-30 01:33:45] [INFO ] Parsed PT model containing 83 places and 93 transitions and 288 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
FORMULA ShieldRVs-PT-002B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 93/93 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 74 transition count 84
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 74 transition count 84
Applied a total of 18 rules in 28 ms. Remains 74 /83 variables (removed 9) and now considering 84/93 (removed 9) transitions.
// Phase 1: matrix 84 rows 74 cols
[2024-05-30 01:33:45] [INFO ] Computed 9 invariants in 10 ms
[2024-05-30 01:33:45] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-30 01:33:45] [INFO ] Invariant cache hit.
[2024-05-30 01:33:45] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-30 01:33:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:46] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 12 ms to minimize.
[2024-05-30 01:33:46] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 2 ms to minimize.
[2024-05-30 01:33:46] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:33:46] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:33:46] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:46] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:46] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:33:46] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2024-05-30 01:33:46] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:46] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:33:47] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:33:48] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2024-05-30 01:33:48] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-30 01:33:48] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 3 ms to minimize.
[2024-05-30 01:33:48] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:48] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:48] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2024-05-30 01:33:48] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-30 01:33:48] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:48] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:33:48] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:33:48] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:33:48] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:33:48] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:33:48] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:33:49] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:33:49] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:49] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
[2024-05-30 01:33:49] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:33:49] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:33:49] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:33:49] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 84/158 variables, 74/139 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:49] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 4 ms to minimize.
[2024-05-30 01:33:49] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:33:49] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:33:49] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:50] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:33:50] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:50] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:50] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:33:50] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:50] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:50] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:50] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:33:50] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:33:50] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:50] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:50] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:50] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:51] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/158 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:52] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 6 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/158 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:52] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/158 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 16 (OVERLAPS) 0/158 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 159 constraints, problems are : Problem set: 0 solved, 83 unsolved in 7304 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:53] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:53] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:53] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 7/94 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 84/158 variables, 74/168 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 83/251 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:56] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:56] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:57] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:57] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:57] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:33:57] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:58] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:33:59] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:33:59] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:59] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:59] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:33:59] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:59] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:59] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 7/268 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/158 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 15 (OVERLAPS) 0/158 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 269 constraints, problems are : Problem set: 0 solved, 83 unsolved in 10478 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 103/103 constraints]
After SMT, in 17836ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 17852ms
Starting structural reductions in LTL mode, iteration 1 : 74/83 places, 84/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18184 ms. Remains : 74/83 places, 84/93 transitions.
Support contains 24 out of 74 places after structural reductions.
[2024-05-30 01:34:03] [INFO ] Flatten gal took : 26 ms
[2024-05-30 01:34:03] [INFO ] Flatten gal took : 25 ms
[2024-05-30 01:34:03] [INFO ] Input system was already deterministic with 84 transitions.
Support contains 23 out of 74 places (down from 24) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (358 resets) in 884 ms. (45 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40003 steps (89 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (89 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
[2024-05-30 01:34:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 52/61 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 01:34:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:34:04] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:34:04] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:34:04] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 13/74 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 01:34:04] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 84/158 variables, 74/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/158 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 88 constraints, problems are : Problem set: 1 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/74 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 5/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-30 01:34:04] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:34:04] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:04] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:34:04] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 84/158 variables, 74/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 1/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 93 constraints, problems are : Problem set: 1 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 420ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 84/84 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 74 transition count 78
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 68 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 67 transition count 77
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 14 place count 67 transition count 66
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 36 place count 56 transition count 66
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 41 place count 51 transition count 61
Iterating global reduction 3 with 5 rules applied. Total rules applied 46 place count 51 transition count 61
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 46 place count 51 transition count 59
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 50 place count 49 transition count 59
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 78 place count 35 transition count 45
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 35 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 34 transition count 44
Applied a total of 83 rules in 25 ms. Remains 34 /74 variables (removed 40) and now considering 44/84 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 34/74 places, 44/84 transitions.
RANDOM walk for 40000 steps (859 resets) in 299 ms. (133 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (347 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Probably explored full state space saw : 19911 states, properties seen :0
Probabilistic random walk after 102826 steps, saw 19911 distinct states, run finished after 139 ms. (steps per millisecond=739 ) properties seen :0
Explored full state space saw : 19911 states, properties seen :0
Exhaustive walk after 102826 steps, saw 19911 distinct states, run finished after 65 ms. (steps per millisecond=1581 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA ShieldRVs-PT-002B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 20 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(G((p0 U X((p1||X(p2)||(G(p4)&&p3)))))))'
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 84/84 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 70 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 70 transition count 80
Applied a total of 8 rules in 3 ms. Remains 70 /74 variables (removed 4) and now considering 80/84 (removed 4) transitions.
// Phase 1: matrix 80 rows 70 cols
[2024-05-30 01:34:05] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:34:05] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 01:34:05] [INFO ] Invariant cache hit.
[2024-05-30 01:34:05] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-30 01:34:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:05] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:34:05] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:05] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:34:05] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:05] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:07] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:34:07] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:34:07] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:34:07] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:34:07] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:34:07] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:34:07] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:07] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 80/150 variables, 70/117 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:08] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:34:08] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:34:08] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:08] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:34:08] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:08] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:09] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:34:09] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:34:09] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:34:09] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:09] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:34:09] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:34:09] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:34:09] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:09] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:34:09] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:10] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/150 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:10] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/150 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/150 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:11] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:34:11] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:34:11] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/150 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/150 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:11] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/150 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/150 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/150 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 21 (OVERLAPS) 0/150 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 140 constraints, problems are : Problem set: 0 solved, 79 unsolved in 7215 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 6/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 80/150 variables, 70/153 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 79/232 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:14] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:34:14] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:34:14] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:34:14] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/150 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 236 constraints, problems are : Problem set: 0 solved, 79 unsolved in 4402 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 78/78 constraints]
After SMT, in 11645ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 11647ms
Starting structural reductions in LTL mode, iteration 1 : 70/74 places, 80/84 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11754 ms. Remains : 70/74 places, 80/84 transitions.
Stuttering acceptance computed with spot in 600 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p4) (NOT p2)), true, (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p4) (NOT p1)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p1) (NOT p2) (NOT p4)), (NOT p4)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-01
Entered a terminal (fully accepting) state of product in 35 steps with 8 reset in 3 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-01 finished in 12425 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) U (p0&&G(p1)))))))'
Support contains 1 out of 74 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 84/84 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 73 transition count 75
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 65 transition count 75
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 16 place count 65 transition count 66
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 34 place count 56 transition count 66
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 52 transition count 62
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 52 transition count 62
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 42 place count 52 transition count 60
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 50 transition count 60
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 78 place count 34 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 32 transition count 42
Applied a total of 80 rules in 16 ms. Remains 32 /74 variables (removed 42) and now considering 42/84 (removed 42) transitions.
// Phase 1: matrix 42 rows 32 cols
[2024-05-30 01:34:17] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 01:34:17] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 01:34:17] [INFO ] Invariant cache hit.
[2024-05-30 01:34:17] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-30 01:34:17] [INFO ] Redundant transitions in 18 ms returned [41]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 39 sub problems to find dead transitions.
// Phase 1: matrix 41 rows 32 cols
[2024-05-30 01:34:17] [INFO ] Computed 9 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 3 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 1/32 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 0 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:34:18] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 41/73 variables, 32/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/73 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 64 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1115 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/32 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 41/73 variables, 32/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 39/103 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:34:19] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2024-05-30 01:34:19] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/73 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 105 constraints, problems are : Problem set: 0 solved, 39 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 25/25 constraints]
After SMT, in 1838ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1839ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/74 places, 41/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1951 ms. Remains : 32/74 places, 41/84 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-02
Stuttering criterion allowed to conclude after 29 steps with 1 reset in 1 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-02 finished in 2032 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((G(p0)||(p0&&F((G(p1)||X(F(p2)))))))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 84/84 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 73 transition count 78
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 68 transition count 78
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 10 place count 68 transition count 67
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 32 place count 57 transition count 67
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 38 place count 51 transition count 61
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 51 transition count 61
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 44 place count 51 transition count 59
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 49 transition count 59
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 74 place count 36 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 35 transition count 45
Applied a total of 75 rules in 16 ms. Remains 35 /74 variables (removed 39) and now considering 45/84 (removed 39) transitions.
// Phase 1: matrix 45 rows 35 cols
[2024-05-30 01:34:19] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:34:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:34:19] [INFO ] Invariant cache hit.
[2024-05-30 01:34:19] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-30 01:34:19] [INFO ] Redundant transitions in 14 ms returned [44]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 42 sub problems to find dead transitions.
// Phase 1: matrix 44 rows 35 cols
[2024-05-30 01:34:19] [INFO ] Computed 9 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 2/35 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 1 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 44/79 variables, 35/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 0 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:20] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/79 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:34:21] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:21] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:34:21] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:34:21] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (OVERLAPS) 0/79 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 71 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1523 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 2/35 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 44/79 variables, 35/71 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 42/113 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:34:21] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 114 constraints, problems are : Problem set: 0 solved, 42 unsolved in 868 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 28/28 constraints]
After SMT, in 2408ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 2409ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/74 places, 44/84 transitions.
Applied a total of 0 rules in 6 ms. Remains 35 /35 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2528 ms. Remains : 35/74 places, 44/84 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-06
Product exploration explored 100000 steps with 12064 reset in 230 ms.
Product exploration explored 100000 steps with 12089 reset in 136 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/35 stabilizing places and 4/44 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 1079 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (886 resets) in 105 ms. (377 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (309 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (311 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
[2024-05-30 01:34:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 29/79 variables, and 7 constraints, problems are : Problem set: 2 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 7/9 constraints, State Equation: 0/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 25ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) p1 p2)), (G (OR p0 p1 p2))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (NOT p0)), (X p0), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 1814 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 35 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 44/44 transitions.
Applied a total of 0 rules in 4 ms. Remains 35 /35 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2024-05-30 01:34:26] [INFO ] Invariant cache hit.
[2024-05-30 01:34:26] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-30 01:34:26] [INFO ] Invariant cache hit.
[2024-05-30 01:34:26] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-30 01:34:26] [INFO ] Redundant transitions in 15 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-30 01:34:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 2/35 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 2 ms to minimize.
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 2 ms to minimize.
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 3 ms to minimize.
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:34:26] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 44/79 variables, 35/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:34:27] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:34:27] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:27] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:34:27] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 65 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1120 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 2/35 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 44/79 variables, 35/65 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 42/107 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:34:27] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:34:27] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:34:27] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 110 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 24/24 constraints]
After SMT, in 2154ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 2155ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2250 ms. Remains : 35/35 places, 44/44 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/35 stabilizing places and 4/44 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 221 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5519 reset in 134 ms.
Product exploration explored 100000 steps with 5640 reset in 105 ms.
Built C files in :
/tmp/ltsmin10304653189731331259
[2024-05-30 01:34:29] [INFO ] Computing symmetric may disable matrix : 44 transitions.
[2024-05-30 01:34:29] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:34:29] [INFO ] Computing symmetric may enable matrix : 44 transitions.
[2024-05-30 01:34:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:34:29] [INFO ] Computing Do-Not-Accords matrix : 44 transitions.
[2024-05-30 01:34:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:34:29] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10304653189731331259
Running compilation step : cd /tmp/ltsmin10304653189731331259;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 272 ms.
Running link step : cd /tmp/ltsmin10304653189731331259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10304653189731331259;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9416269779003330668.hoa' '--buchi-type=spotba'
LTSmin run took 904 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-002B-LTLFireability-06 finished in 10779 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 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 84/84 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 73 transition count 75
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 65 transition count 75
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 65 transition count 65
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 36 place count 55 transition count 65
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 41 place count 50 transition count 60
Iterating global reduction 2 with 5 rules applied. Total rules applied 46 place count 50 transition count 60
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 46 place count 50 transition count 57
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 47 transition count 57
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 82 place count 32 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 30 transition count 40
Applied a total of 84 rules in 14 ms. Remains 30 /74 variables (removed 44) and now considering 40/84 (removed 44) transitions.
// Phase 1: matrix 40 rows 30 cols
[2024-05-30 01:34:30] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 01:34:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-30 01:34:30] [INFO ] Invariant cache hit.
[2024-05-30 01:34:30] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-30 01:34:30] [INFO ] Redundant transitions in 16 ms returned [39]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 38 sub problems to find dead transitions.
// Phase 1: matrix 39 rows 30 cols
[2024-05-30 01:34:30] [INFO ] Computed 9 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:30] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:34:30] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:34:30] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:34:30] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:34:30] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:34:30] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:34:30] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:34:30] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:34:30] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:34:31] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:31] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:34:31] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:31] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:31] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:31] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:31] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/69 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:31] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:34:31] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:31] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:31] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/69 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:31] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:34:31] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/69 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:31] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:34:32] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:32] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/69 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/69 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 16 (OVERLAPS) 0/69 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 64 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1552 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 39/69 variables, 30/64 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 38/102 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:32] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:32] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:32] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:32] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 106 constraints, problems are : Problem set: 0 solved, 38 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 29/29 constraints]
After SMT, in 2351ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2352ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/74 places, 39/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2444 ms. Remains : 30/74 places, 39/84 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-10
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-10 finished in 2488 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 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 84/84 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 68 transition count 78
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 68 transition count 78
Applied a total of 12 rules in 9 ms. Remains 68 /74 variables (removed 6) and now considering 78/84 (removed 6) transitions.
// Phase 1: matrix 78 rows 68 cols
[2024-05-30 01:34:33] [INFO ] Computed 9 invariants in 3 ms
[2024-05-30 01:34:33] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-30 01:34:33] [INFO ] Invariant cache hit.
[2024-05-30 01:34:33] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-30 01:34:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:34:33] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:34:33] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:33] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:34:33] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:34:33] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:34:33] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:34:33] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:34:33] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:34:33] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:34:33] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:34:33] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:33] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:34:33] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:34:33] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:34:33] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:34:34] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:34] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:34:34] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:34:34] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:34] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:34] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:34:34] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:34:34] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:34:34] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:34:34] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:34] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:34:34] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 78/146 variables, 68/104 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:34:35] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:34:35] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:34:35] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:34:35] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/146 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:34:35] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/146 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:34:36] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:34:36] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:34:36] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:36] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:36] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:34:36] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:34:36] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:34:36] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:34:37] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:34:37] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:37] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:34:37] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:34:37] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:34:37] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/146 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/146 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 18 (OVERLAPS) 0/146 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 123 constraints, problems are : Problem set: 0 solved, 77 unsolved in 5335 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:34:38] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:34:38] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:34:38] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:34:39] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:34:39] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:34:39] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:34:39] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:34:39] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:34:39] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:34:39] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:39] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:34:39] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:34:39] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 78/146 variables, 68/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 77/213 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:34:40] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:34:40] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/146 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/146 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 215 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4249 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 61/61 constraints]
After SMT, in 9597ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 9598ms
Starting structural reductions in LTL mode, iteration 1 : 68/74 places, 78/84 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9692 ms. Remains : 68/74 places, 78/84 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-11 finished in 9774 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)&&X((p1&&X(F(p2)))))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 84/84 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 69 transition count 79
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 69 transition count 79
Applied a total of 10 rules in 6 ms. Remains 69 /74 variables (removed 5) and now considering 79/84 (removed 5) transitions.
// Phase 1: matrix 79 rows 69 cols
[2024-05-30 01:34:42] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 01:34:42] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:34:42] [INFO ] Invariant cache hit.
[2024-05-30 01:34:42] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 01:34:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:34:43] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 28 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:34:44] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:34:45] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:34:45] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:34:45] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:34:45] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:34:45] [INFO ] Deduced a trap composed of 17 places in 15 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:45] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:45] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:34:45] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:34:45] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 79/148 variables, 69/132 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:46] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:34:46] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:46] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:46] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:46] [INFO ] Deduced a trap composed of 19 places in 15 ms of which 0 ms to minimize.
[2024-05-30 01:34:46] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:46] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:34:46] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:34:46] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:47] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:47] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:47] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:34:47] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:34:47] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/148 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:47] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/148 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:48] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:34:48] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/148 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:48] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/148 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:48] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:34:48] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:34:48] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/148 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:49] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:34:49] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:34:49] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:49] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/148 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:49] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/148 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/148 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:50] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/148 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/148 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 24 (OVERLAPS) 0/148 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 159 constraints, problems are : Problem set: 0 solved, 78 unsolved in 7994 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 81/90 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:51] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:51] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 79/148 variables, 69/161 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 78/239 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:52] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/148 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:34:53] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 241 constraints, problems are : Problem set: 0 solved, 78 unsolved in 5494 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 85/85 constraints]
After SMT, in 13502ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 13503ms
Starting structural reductions in LTL mode, iteration 1 : 69/74 places, 79/84 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13595 ms. Remains : 69/74 places, 79/84 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-13 finished in 13815 ms.
All properties solved by simple procedures.
Total runtime 71438 ms.

BK_STOP 1717032896743

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldRVs-PT-002B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldRVs-PT-002B, 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 r356-tall-171683761700732"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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