Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 11 21:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 21:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 21:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 48K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-004B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717275305130

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:55:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:55:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:55:06] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-06-01 20:55:06] [INFO ] Transformed 203 places.
[2024-06-01 20:55:06] [INFO ] Transformed 203 transitions.
[2024-06-01 20:55:06] [INFO ] Found NUPN structural information;
[2024-06-01 20:55:06] [INFO ] Parsed PT model containing 203 places and 203 transitions and 478 arcs in 168 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 2 formulas.
FORMULA ShieldRVt-PT-004B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-004B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 170 transition count 170
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 170 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 169 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 169 transition count 169
Applied a total of 68 rules in 50 ms. Remains 169 /203 variables (removed 34) and now considering 169/203 (removed 34) transitions.
// Phase 1: matrix 169 rows 169 cols
[2024-06-01 20:55:06] [INFO ] Computed 17 invariants in 14 ms
[2024-06-01 20:55:06] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-06-01 20:55:06] [INFO ] Invariant cache hit.
[2024-06-01 20:55:07] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-06-01 20:55:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 20:55:08] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 9 ms to minimize.
[2024-06-01 20:55:08] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 2 ms to minimize.
[2024-06-01 20:55:08] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:55:08] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:55:08] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-06-01 20:55:08] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:55:08] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:55:08] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 20:55:09] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 20:55:09] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 20:55:09] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2024-06-01 20:55:09] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-06-01 20:55:09] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 169/338 variables, 169/199 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 20:55:10] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:55:11] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:55:11] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 202 constraints, problems are : Problem set: 0 solved, 168 unsolved in 6974 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/338 variables, 169/202 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 168/370 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 20:55:15] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-01 20:55:15] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-06-01 20:55:15] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:55:15] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:55:15] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 2 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 2 ms to minimize.
[2024-06-01 20:55:17] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-06-01 20:55:17] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 5 ms to minimize.
[2024-06-01 20:55:17] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 20/390 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 20:55:17] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-06-01 20:55:17] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 2 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:55:19] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:55:19] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-06-01 20:55:19] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
[2024-06-01 20:55:19] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 13/403 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 20:55:20] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2024-06-01 20:55:20] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
[2024-06-01 20:55:20] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:55:21] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 20:55:24] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (OVERLAPS) 0/338 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 408 constraints, problems are : Problem set: 0 solved, 168 unsolved in 16439 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 54/54 constraints]
After SMT, in 23473ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 23495ms
Starting structural reductions in LTL mode, iteration 1 : 169/203 places, 169/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23956 ms. Remains : 169/203 places, 169/203 transitions.
Support contains 32 out of 169 places after structural reductions.
[2024-06-01 20:55:30] [INFO ] Flatten gal took : 31 ms
[2024-06-01 20:55:30] [INFO ] Flatten gal took : 14 ms
[2024-06-01 20:55:30] [INFO ] Input system was already deterministic with 169 transitions.
RANDOM walk for 40000 steps (8 resets) in 944 ms. (42 steps per ms) remains 1/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
[2024-06-01 20:55:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/169 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:55:31] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:55:31] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 169/338 variables, 169/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 137/169 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:55:31] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:55:31] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:55:31] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 169/338 variables, 169/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:55:31] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:55:31] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:55:31] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:55:31] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/338 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 554ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 169/169 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 169 transition count 127
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 127 transition count 127
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 84 place count 127 transition count 101
Deduced a syphon composed of 26 places in 5 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 136 place count 101 transition count 101
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 144 place count 93 transition count 93
Iterating global reduction 2 with 8 rules applied. Total rules applied 152 place count 93 transition count 93
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 152 place count 93 transition count 86
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 166 place count 86 transition count 86
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 236 place count 51 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 51 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 50 transition count 49
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -10
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 261 place count 39 transition count 59
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 262 place count 39 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 263 place count 38 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 264 place count 37 transition count 57
Applied a total of 264 rules in 61 ms. Remains 37 /169 variables (removed 132) and now considering 57/169 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 37/169 places, 57/169 transitions.
RANDOM walk for 40000 steps (49 resets) in 731 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Probably explored full state space saw : 149968 states, properties seen :0
Probabilistic random walk after 1423332 steps, saw 149968 distinct states, run finished after 1338 ms. (steps per millisecond=1063 ) properties seen :0
Explored full state space saw : 150016 states, properties seen :0
Exhaustive walk after 1424000 steps, saw 150016 distinct states, run finished after 1096 ms. (steps per millisecond=1299 ) properties seen :0
FORMULA ShieldRVt-PT-004B-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA ShieldRVt-PT-004B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 50 stabilizing places and 50 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' '!(F(G(p0)))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 168 transition count 127
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 127 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 126 transition count 126
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 84 place count 126 transition count 100
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 136 place count 100 transition count 100
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 145 place count 91 transition count 91
Iterating global reduction 3 with 9 rules applied. Total rules applied 154 place count 91 transition count 91
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 154 place count 91 transition count 83
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 170 place count 83 transition count 83
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 238 place count 49 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 239 place count 49 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 48 transition count 47
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 259 place count 39 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 261 place count 37 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 262 place count 36 transition count 51
Applied a total of 262 rules in 28 ms. Remains 36 /169 variables (removed 133) and now considering 51/169 (removed 118) transitions.
// Phase 1: matrix 51 rows 36 cols
[2024-06-01 20:55:34] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 20:55:34] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 20:55:34] [INFO ] Invariant cache hit.
[2024-06-01 20:55:34] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-06-01 20:55:34] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2024-06-01 20:55:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 50/86 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 0/86 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/87 variables, and 52 constraints, problems are : Problem set: 0 solved, 47 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 50/86 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 47/99 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 0/86 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/87 variables, and 99 constraints, problems are : Problem set: 0 solved, 47 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 925ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 926ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/169 places, 51/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1032 ms. Remains : 36/169 places, 51/169 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-00
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 3 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-00 finished in 1251 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(p1)||p0)))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 160 transition count 160
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 160 transition count 160
Applied a total of 18 rules in 7 ms. Remains 160 /169 variables (removed 9) and now considering 160/169 (removed 9) transitions.
// Phase 1: matrix 160 rows 160 cols
[2024-06-01 20:55:36] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 20:55:36] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 20:55:36] [INFO ] Invariant cache hit.
[2024-06-01 20:55:36] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-06-01 20:55:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:55:37] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:55:37] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:55:37] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-06-01 20:55:37] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-06-01 20:55:37] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-01 20:55:37] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:55:37] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-06-01 20:55:37] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:55:37] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-06-01 20:55:37] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 20:55:38] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/320 variables, 160/188 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 0/320 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 188 constraints, problems are : Problem set: 0 solved, 159 unsolved in 4889 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/320 variables, 160/188 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 159/347 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:55:42] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-06-01 20:55:42] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:55:42] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-06-01 20:55:42] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-06-01 20:55:42] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:55:42] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:55:42] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:55:43] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:55:43] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:55:43] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:55:43] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:55:43] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-06-01 20:55:43] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:55:43] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:55:43] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:55:43] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:55:43] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:55:43] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:55:44] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-06-01 20:55:44] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 20/367 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:55:44] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 20:55:44] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:55:44] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:55:45] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:55:45] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:55:45] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-06-01 20:55:45] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 20:55:45] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:55:45] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 9/376 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:55:46] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-06-01 20:55:47] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:55:48] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-06-01 20:55:48] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:55:48] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:55:49] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 4/382 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:55:51] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:55:51] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-01 20:55:51] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:55:51] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 4/386 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:55:52] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:55:53] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:55:55] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:55:55] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 14 (OVERLAPS) 0/320 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 390 constraints, problems are : Problem set: 0 solved, 159 unsolved in 20499 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 54/54 constraints]
After SMT, in 25404ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 25406ms
Starting structural reductions in LTL mode, iteration 1 : 160/169 places, 160/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25556 ms. Remains : 160/169 places, 160/169 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-01
Entered a terminal (fully accepting) state of product in 871 steps with 0 reset in 8 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-01 finished in 25696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||(X(p0)&&F(p1)))) U G(p2)))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 160 transition count 160
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 160 transition count 160
Applied a total of 18 rules in 8 ms. Remains 160 /169 variables (removed 9) and now considering 160/169 (removed 9) transitions.
// Phase 1: matrix 160 rows 160 cols
[2024-06-01 20:56:01] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 20:56:01] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 20:56:01] [INFO ] Invariant cache hit.
[2024-06-01 20:56:01] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-06-01 20:56:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:02] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:56:02] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 20:56:02] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:56:03] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:56:03] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 20:56:03] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/320 variables, 160/183 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:04] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/320 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 184 constraints, problems are : Problem set: 0 solved, 159 unsolved in 5311 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/320 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 159/343 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:08] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-06-01 20:56:08] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:56:08] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:56:08] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:56:08] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:56:09] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:56:09] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 20:56:09] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-06-01 20:56:09] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:56:09] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:56:09] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:56:09] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:56:10] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:56:10] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:56:10] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:56:10] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 16/359 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:10] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:56:11] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:56:11] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:56:11] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:56:11] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:56:11] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 6/365 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:12] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:56:12] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:56:13] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:56:13] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:56:13] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:56:13] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:56:13] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:56:13] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:56:13] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:56:14] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-06-01 20:56:14] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 11/376 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:15] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:17] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:56:18] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:20] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-06-01 20:56:23] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:56:23] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/320 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/320 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 15 (OVERLAPS) 0/320 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 382 constraints, problems are : Problem set: 0 solved, 159 unsolved in 22626 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 46/46 constraints]
After SMT, in 27955ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 27957ms
Starting structural reductions in LTL mode, iteration 1 : 160/169 places, 160/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28112 ms. Remains : 160/169 places, 160/169 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p2), (NOT p0), (NOT p1), (AND (NOT p0) p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) p0), true, (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-03
Entered a terminal (fully accepting) state of product in 162 steps with 2 reset in 2 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-03 finished in 28412 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) U p1) U p2)))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 158 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 158 transition count 158
Applied a total of 22 rules in 8 ms. Remains 158 /169 variables (removed 11) and now considering 158/169 (removed 11) transitions.
// Phase 1: matrix 158 rows 158 cols
[2024-06-01 20:56:30] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 20:56:30] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 20:56:30] [INFO ] Invariant cache hit.
[2024-06-01 20:56:30] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-06-01 20:56:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:56:31] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 20:56:31] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 20:56:31] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:56:31] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:56:31] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/316 variables, 158/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 180 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4376 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/316 variables, 158/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 157/337 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:56:36] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:56:36] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 3 ms to minimize.
[2024-06-01 20:56:36] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:56:36] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:56:36] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:56:36] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:56:36] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:56:36] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:56:36] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:56:36] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:56:36] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:56:36] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:56:36] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:56:37] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:56:37] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:56:37] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:56:37] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:56:37] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:56:37] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 19/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:56:38] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:56:38] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:56:38] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:56:38] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:56:38] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:56:39] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:56:39] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:56:39] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:56:39] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:56:39] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 10/366 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-06-01 20:56:40] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:56:40] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 0/316 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 368 constraints, problems are : Problem set: 0 solved, 157 unsolved in 11168 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 36/36 constraints]
After SMT, in 15566ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 15571ms
Starting structural reductions in LTL mode, iteration 1 : 158/169 places, 158/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15762 ms. Remains : 158/169 places, 158/169 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-04 finished in 15969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G((F(p2)&&p1))))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 157 transition count 157
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 157 transition count 157
Applied a total of 24 rules in 8 ms. Remains 157 /169 variables (removed 12) and now considering 157/169 (removed 12) transitions.
// Phase 1: matrix 157 rows 157 cols
[2024-06-01 20:56:46] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 20:56:46] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 20:56:46] [INFO ] Invariant cache hit.
[2024-06-01 20:56:46] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-06-01 20:56:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:56:47] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-06-01 20:56:47] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 20:56:47] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:56:47] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 20:56:47] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/314 variables, 157/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/314 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 179 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4356 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/314 variables, 157/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 156/335 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:56:51] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:56:52] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:56:52] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-06-01 20:56:52] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:56:52] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:56:52] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:56:52] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:56:52] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:56:52] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:56:52] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:56:53] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:56:53] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 12/347 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:56:53] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:56:53] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:56:54] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-06-01 20:56:54] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:56:54] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-06-01 20:56:54] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:56:54] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:56:54] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:56:54] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:56:54] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:56:55] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 11/358 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:56:55] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-01 20:56:56] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:56:56] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2024-06-01 20:56:56] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:56:56] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2024-06-01 20:56:57] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:56:57] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 7/365 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:56:58] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:56:58] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:01] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:57:02] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:57:02] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/314 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:03] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:07] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:57:07] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/314 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 16 (OVERLAPS) 0/314 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 373 constraints, problems are : Problem set: 0 solved, 156 unsolved in 21527 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 43/43 constraints]
After SMT, in 25901ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 25903ms
Starting structural reductions in LTL mode, iteration 1 : 157/169 places, 157/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26094 ms. Remains : 157/169 places, 157/169 transitions.
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-06 finished in 26460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 168 transition count 124
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 124 transition count 124
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 88 place count 124 transition count 98
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 140 place count 98 transition count 98
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 148 place count 90 transition count 90
Iterating global reduction 2 with 8 rules applied. Total rules applied 156 place count 90 transition count 90
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 156 place count 90 transition count 83
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 170 place count 83 transition count 83
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 236 place count 50 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 50 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 49 transition count 48
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 261 place count 38 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 263 place count 36 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 264 place count 35 transition count 55
Applied a total of 264 rules in 24 ms. Remains 35 /169 variables (removed 134) and now considering 55/169 (removed 114) transitions.
// Phase 1: matrix 55 rows 35 cols
[2024-06-01 20:57:12] [INFO ] Computed 16 invariants in 0 ms
[2024-06-01 20:57:12] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 20:57:12] [INFO ] Invariant cache hit.
[2024-06-01 20:57:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 20:57:12] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-06-01 20:57:12] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2024-06-01 20:57:12] [INFO ] Invariant cache hit.
[2024-06-01 20:57:12] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 54/89 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/89 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/90 variables, and 57 constraints, problems are : Problem set: 0 solved, 50 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 35/35 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 54/89 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 50/107 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 0/89 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/90 variables, and 107 constraints, problems are : Problem set: 0 solved, 50 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 35/35 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 909ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 910ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/169 places, 55/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1045 ms. Remains : 35/169 places, 55/169 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-07 finished in 1140 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 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 168 transition count 125
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 125 transition count 125
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 86 place count 125 transition count 99
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 138 place count 99 transition count 99
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 147 place count 90 transition count 90
Iterating global reduction 2 with 9 rules applied. Total rules applied 156 place count 90 transition count 90
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 156 place count 90 transition count 82
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 172 place count 82 transition count 82
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 240 place count 48 transition count 48
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -10
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 262 place count 37 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 264 place count 35 transition count 56
Applied a total of 264 rules in 13 ms. Remains 35 /169 variables (removed 134) and now considering 56/169 (removed 113) transitions.
// Phase 1: matrix 56 rows 35 cols
[2024-06-01 20:57:13] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 20:57:13] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 20:57:13] [INFO ] Invariant cache hit.
[2024-06-01 20:57:13] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-06-01 20:57:13] [INFO ] Redundant transitions in 0 ms returned []
Running 52 sub problems to find dead transitions.
[2024-06-01 20:57:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 55/90 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 0/90 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/91 variables, and 52 constraints, problems are : Problem set: 0 solved, 52 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 55/90 variables, 35/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 52/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 0/90 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/91 variables, and 104 constraints, problems are : Problem set: 0 solved, 52 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 868ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 868ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/169 places, 56/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 958 ms. Remains : 35/169 places, 56/169 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-08 finished in 1016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 168 transition count 125
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 125 transition count 125
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 86 place count 125 transition count 100
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 136 place count 100 transition count 100
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 143 place count 93 transition count 93
Iterating global reduction 2 with 7 rules applied. Total rules applied 150 place count 93 transition count 93
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 150 place count 93 transition count 87
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 162 place count 87 transition count 87
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 236 place count 50 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 50 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 49 transition count 48
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 259 place count 39 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 261 place count 37 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 262 place count 36 transition count 53
Applied a total of 262 rules in 21 ms. Remains 36 /169 variables (removed 133) and now considering 53/169 (removed 116) transitions.
// Phase 1: matrix 53 rows 36 cols
[2024-06-01 20:57:14] [INFO ] Computed 16 invariants in 0 ms
[2024-06-01 20:57:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 20:57:14] [INFO ] Invariant cache hit.
[2024-06-01 20:57:14] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-01 20:57:14] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 20:57:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 52/88 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 0/88 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/89 variables, and 52 constraints, problems are : Problem set: 0 solved, 49 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 52/88 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 49/101 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 0/88 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/89 variables, and 101 constraints, problems are : Problem set: 0 solved, 49 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 786ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 787ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/169 places, 53/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 889 ms. Remains : 36/169 places, 53/169 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-10 finished in 973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 168 transition count 124
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 124 transition count 124
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 88 place count 124 transition count 98
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 140 place count 98 transition count 98
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 148 place count 90 transition count 90
Iterating global reduction 2 with 8 rules applied. Total rules applied 156 place count 90 transition count 90
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 156 place count 90 transition count 83
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 170 place count 83 transition count 83
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 240 place count 48 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 241 place count 48 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 243 place count 47 transition count 46
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 265 place count 36 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 267 place count 34 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 268 place count 33 transition count 53
Applied a total of 268 rules in 18 ms. Remains 33 /169 variables (removed 136) and now considering 53/169 (removed 116) transitions.
// Phase 1: matrix 53 rows 33 cols
[2024-06-01 20:57:15] [INFO ] Computed 16 invariants in 0 ms
[2024-06-01 20:57:15] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 20:57:15] [INFO ] Invariant cache hit.
[2024-06-01 20:57:15] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-01 20:57:15] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-01 20:57:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 52/85 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 0/85 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/86 variables, and 49 constraints, problems are : Problem set: 0 solved, 49 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 52/85 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 49/98 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 0/85 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/86 variables, and 98 constraints, problems are : Problem set: 0 solved, 49 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 762ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 762ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/169 places, 53/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 871 ms. Remains : 33/169 places, 53/169 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-12 finished in 915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 157 transition count 157
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 157 transition count 157
Applied a total of 24 rules in 2 ms. Remains 157 /169 variables (removed 12) and now considering 157/169 (removed 12) transitions.
// Phase 1: matrix 157 rows 157 cols
[2024-06-01 20:57:16] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 20:57:16] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 20:57:16] [INFO ] Invariant cache hit.
[2024-06-01 20:57:16] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-06-01 20:57:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:17] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:57:17] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:57:17] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:57:18] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:57:18] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/314 variables, 157/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/314 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 179 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4283 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/314 variables, 157/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 156/335 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:22] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:57:22] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:57:22] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-01 20:57:22] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 2 ms to minimize.
[2024-06-01 20:57:22] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:57:22] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 20:57:23] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:57:23] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:57:23] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:57:23] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:57:23] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:57:23] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 12/347 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:24] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 20:57:24] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:57:24] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 2 ms to minimize.
[2024-06-01 20:57:24] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:57:24] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2024-06-01 20:57:24] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:57:24] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-06-01 20:57:25] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:57:25] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:57:25] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:57:25] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 11/358 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:26] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:57:26] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:57:26] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:57:26] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:57:26] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:57:27] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2024-06-01 20:57:27] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 7/365 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:28] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:57:28] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:32] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:57:32] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:57:32] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/314 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:34] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:37] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:57:37] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/314 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 16 (OVERLAPS) 0/314 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 373 constraints, problems are : Problem set: 0 solved, 156 unsolved in 21526 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 43/43 constraints]
After SMT, in 25821ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 25822ms
Starting structural reductions in LTL mode, iteration 1 : 157/169 places, 157/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25976 ms. Remains : 157/169 places, 157/169 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 175 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-13 finished in 26141 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((X(X(F(p1)))&&p0)))'
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 157 transition count 157
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 157 transition count 157
Applied a total of 24 rules in 4 ms. Remains 157 /169 variables (removed 12) and now considering 157/169 (removed 12) transitions.
[2024-06-01 20:57:42] [INFO ] Invariant cache hit.
[2024-06-01 20:57:42] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 20:57:42] [INFO ] Invariant cache hit.
[2024-06-01 20:57:42] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-06-01 20:57:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:43] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:57:43] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:57:44] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:57:44] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:57:44] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/314 variables, 157/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/314 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 179 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4141 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/314 variables, 157/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 156/335 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:48] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 2 ms to minimize.
[2024-06-01 20:57:48] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:57:48] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:57:48] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:57:48] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:57:48] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:57:48] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:57:49] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-01 20:57:49] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 20:57:49] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:57:49] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:57:49] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 12/347 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:50] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 20:57:50] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:57:50] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-06-01 20:57:50] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:57:50] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:57:50] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:57:50] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:57:51] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 20:57:51] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:57:51] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:57:51] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 11/358 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:52] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-06-01 20:57:52] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:57:52] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 20:57:52] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 20:57:52] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 20:57:53] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 20:57:53] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 7/365 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:54] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-06-01 20:57:54] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:57:58] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:57:58] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:57:58] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/314 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:58:00] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-01 20:58:03] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2024-06-01 20:58:03] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/314 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 16 (OVERLAPS) 0/314 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 373 constraints, problems are : Problem set: 0 solved, 156 unsolved in 21505 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 43/43 constraints]
After SMT, in 25664ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 25666ms
Starting structural reductions in LTL mode, iteration 1 : 157/169 places, 157/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25804 ms. Remains : 157/169 places, 157/169 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-14
Stuttering criterion allowed to conclude after 1188 steps with 0 reset in 6 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-14 finished in 25951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U G(p1))||F(G(!p2))))'
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 168 transition count 127
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 127 transition count 127
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 82 place count 127 transition count 102
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 132 place count 102 transition count 102
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 141 place count 93 transition count 93
Iterating global reduction 2 with 9 rules applied. Total rules applied 150 place count 93 transition count 93
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 150 place count 93 transition count 86
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 164 place count 86 transition count 86
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 234 place count 51 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 235 place count 51 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 237 place count 50 transition count 49
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 257 place count 40 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 259 place count 38 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 260 place count 37 transition count 55
Applied a total of 260 rules in 18 ms. Remains 37 /169 variables (removed 132) and now considering 55/169 (removed 114) transitions.
// Phase 1: matrix 55 rows 37 cols
[2024-06-01 20:58:08] [INFO ] Computed 16 invariants in 1 ms
[2024-06-01 20:58:08] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 20:58:08] [INFO ] Invariant cache hit.
[2024-06-01 20:58:08] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-06-01 20:58:08] [INFO ] Redundant transitions in 0 ms returned []
Running 50 sub problems to find dead transitions.
[2024-06-01 20:58:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 54/91 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/92 variables, and 53 constraints, problems are : Problem set: 0 solved, 50 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 54/91 variables, 37/53 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 50/103 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/92 variables, and 103 constraints, problems are : Problem set: 0 solved, 50 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 1003ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 1004ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/169 places, 55/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1110 ms. Remains : 37/169 places, 55/169 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) p2), p2, (AND p2 (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-004B-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-004B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-004B-LTLFireability-15 finished in 1255 ms.
All properties solved by simple procedures.
Total runtime 183702 ms.
ITS solved all properties within timeout

BK_STOP 1717275490051

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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