Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K 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 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 21:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 21:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 21:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 21:13 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 60K 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-005B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-005B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717076193108

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-005B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 13:36:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 13:36:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:36:34] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-30 13:36:34] [INFO ] Transformed 253 places.
[2024-05-30 13:36:34] [INFO ] Transformed 253 transitions.
[2024-05-30 13:36:34] [INFO ] Found NUPN structural information;
[2024-05-30 13:36:34] [INFO ] Parsed PT model containing 253 places and 253 transitions and 596 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-005B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-005B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 253/253 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 206 transition count 206
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 206 transition count 206
Applied a total of 94 rules in 44 ms. Remains 206 /253 variables (removed 47) and now considering 206/253 (removed 47) transitions.
// Phase 1: matrix 206 rows 206 cols
[2024-05-30 13:36:34] [INFO ] Computed 21 invariants in 16 ms
[2024-05-30 13:36:34] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-30 13:36:34] [INFO ] Invariant cache hit.
[2024-05-30 13:36:35] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-05-30 13:36:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:36:36] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 9 ms to minimize.
[2024-05-30 13:36:36] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:36:36] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:36:37] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:36:37] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:36:37] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:36:37] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:36:37] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:36:37] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:36:37] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 1 ms to minimize.
[2024-05-30 13:36:37] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/412 variables, 206/238 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:36:40] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:36:40] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:36:40] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/412 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 241 constraints, problems are : Problem set: 0 solved, 205 unsolved in 9191 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:36:45] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (OVERLAPS) 206/412 variables, 206/242 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 205/447 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:36:47] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-30 13:36:47] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:36:47] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:36:47] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:36:47] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:36:47] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:36:47] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:36:48] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:36:49] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:36:49] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 20/467 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:36:50] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:36:50] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-05-30 13:36:50] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:36:51] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:36:51] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:36:51] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:36:51] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:36:51] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:36:51] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:36:52] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:36:52] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 11/478 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:36:54] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-30 13:36:54] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-05-30 13:36:55] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:36:55] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:36:55] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 5/483 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-30 13:37:02] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:37:02] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/412 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 13 (OVERLAPS) 0/412 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 485 constraints, problems are : Problem set: 0 solved, 205 unsolved in 28644 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 53/53 constraints]
After SMT, in 37906ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 37926ms
Starting structural reductions in LTL mode, iteration 1 : 206/253 places, 206/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38419 ms. Remains : 206/253 places, 206/253 transitions.
Support contains 28 out of 206 places after structural reductions.
[2024-05-30 13:37:13] [INFO ] Flatten gal took : 38 ms
[2024-05-30 13:37:13] [INFO ] Flatten gal took : 17 ms
[2024-05-30 13:37:13] [INFO ] Input system was already deterministic with 206 transitions.
Support contains 27 out of 206 places (down from 28) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 2296 steps (0 resets) in 144 ms. (15 steps per ms) remains 0/14 properties
Computed a total of 61 stabilizing places and 61 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 198 transition count 198
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 198 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 197 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 197 transition count 197
Applied a total of 18 rules in 22 ms. Remains 197 /206 variables (removed 9) and now considering 197/206 (removed 9) transitions.
// Phase 1: matrix 197 rows 197 cols
[2024-05-30 13:37:13] [INFO ] Computed 21 invariants in 4 ms
[2024-05-30 13:37:13] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-30 13:37:13] [INFO ] Invariant cache hit.
[2024-05-30 13:37:13] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 13:37:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:37:15] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:37:15] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:37:15] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 8 ms to minimize.
[2024-05-30 13:37:15] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:37:15] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:37:15] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:37:15] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:37:16] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/394 variables, 197/226 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 226 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7226 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/226 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 196/422 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:37:22] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-30 13:37:22] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-30 13:37:22] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-05-30 13:37:23] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:37:23] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:37:23] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:37:23] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:37:23] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:37:23] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:37:23] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:37:23] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:37:23] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:37:23] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:37:24] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:37:25] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:37:25] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:37:25] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:37:26] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-30 13:37:26] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:37:26] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:37:26] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:37:26] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:37:26] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:37:27] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 10/452 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:37:28] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:37:28] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:37:28] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:37:28] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:37:29] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:37:29] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:37:29] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 7/459 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:37:31] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:37:32] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:37:34] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:37:34] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:37:34] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 3/464 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:37:37] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:37:37] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:37:37] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:37:37] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:37:38] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:37:38] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
[2024-05-30 13:37:38] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:37:38] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 8/472 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:37:40] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:37:40] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:37:41] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:37:41] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:37:43] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:37:43] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:37:46] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:37:47] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:37:47] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:37:47] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:37:50] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 483 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 69/69 constraints]
After SMT, in 37270ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 37273ms
Starting structural reductions in LTL mode, iteration 1 : 197/206 places, 197/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37496 ms. Remains : 197/206 places, 197/206 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 3 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-01 finished in 37759 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(F((p1||G(p2))))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 199 transition count 199
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 199 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 198 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 198 transition count 198
Applied a total of 16 rules in 14 ms. Remains 198 /206 variables (removed 8) and now considering 198/206 (removed 8) transitions.
// Phase 1: matrix 198 rows 198 cols
[2024-05-30 13:37:51] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 13:37:51] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-30 13:37:51] [INFO ] Invariant cache hit.
[2024-05-30 13:37:51] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 13:37:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:37:52] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:37:52] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:37:53] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:37:53] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:37:53] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 224 constraints, problems are : Problem set: 0 solved, 197 unsolved in 6505 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:37:59] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:37:59] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/396 variables, 198/226 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 197/423 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:38:00] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:38:00] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:38:00] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:38:00] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:38:00] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:38:01] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:38:02] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:38:02] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:38:02] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-05-30 13:38:02] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:38:02] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 20/443 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:38:03] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:38:03] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:38:03] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:38:03] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:38:04] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:38:04] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:38:04] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:38:04] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:38:04] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:38:04] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:38:04] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:38:05] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:38:05] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:38:05] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:38:05] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:38:05] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:38:05] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 17/460 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:38:06] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:38:06] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:38:10] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:38:12] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:38:17] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:38:17] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:38:17] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:38:18] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/396 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:38:22] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:38:22] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:38:23] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/396 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 471 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 55/55 constraints]
After SMT, in 36534ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 36536ms
Starting structural reductions in LTL mode, iteration 1 : 198/206 places, 198/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36757 ms. Remains : 198/206 places, 198/206 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-02
Product exploration explored 100000 steps with 377 reset in 382 ms.
Stack based approach found an accepted trace after 1436 steps with 5 reset with depth 581 and stack size 570 in 4 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-02 finished in 37312 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((F(p0) U p1)) U !F(X((X(p0)||p2)))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 198 transition count 198
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 198 transition count 198
Applied a total of 16 rules in 5 ms. Remains 198 /206 variables (removed 8) and now considering 198/206 (removed 8) transitions.
// Phase 1: matrix 198 rows 198 cols
[2024-05-30 13:38:28] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:38:28] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-30 13:38:28] [INFO ] Invariant cache hit.
[2024-05-30 13:38:28] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 13:38:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:38:30] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:38:30] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:38:30] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:38:30] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:38:30] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 224 constraints, problems are : Problem set: 0 solved, 197 unsolved in 6499 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 197/421 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:38:37] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:38:37] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:38:37] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:38:37] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:38:37] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:38:37] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:38:37] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:38:38] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:38:38] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:38:38] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 2 ms to minimize.
[2024-05-30 13:38:38] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:38:38] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:38:38] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:38:38] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:38:38] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2024-05-30 13:38:39] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:38:39] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:38:39] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:38:39] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:38:39] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:38:40] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-30 13:38:40] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:38:40] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:38:40] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:38:41] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:38:41] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:38:41] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:38:41] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:38:41] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:38:41] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:38:41] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:38:42] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:38:42] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:38:42] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 14/455 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:38:43] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-30 13:38:43] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:38:43] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:38:44] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:38:45] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:38:46] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:38:46] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:38:46] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:38:46] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:38:46] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:38:47] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 7/466 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:38:49] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:38:49] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:38:49] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:38:50] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:38:50] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 5/471 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:38:52] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:38:54] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:38:55] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:38:55] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:01] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/396 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/396 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 476 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 60/60 constraints]
After SMT, in 36533ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 36535ms
Starting structural reductions in LTL mode, iteration 1 : 198/206 places, 198/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36790 ms. Remains : 198/206 places, 198/206 transitions.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-03
Product exploration explored 100000 steps with 33351 reset in 106 ms.
Product exploration explored 100000 steps with 33321 reset in 137 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 127 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 524 steps (0 resets) in 12 ms. (40 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 8 factoid took 266 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-30 13:39:06] [INFO ] Invariant cache hit.
[2024-05-30 13:39:07] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 13:39:07] [INFO ] Invariant cache hit.
[2024-05-30 13:39:07] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 13:39:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:08] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:39:08] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:39:08] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:39:08] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:39:09] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 224 constraints, problems are : Problem set: 0 solved, 197 unsolved in 6414 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 197/421 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:15] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:39:15] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:39:15] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:39:15] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:39:15] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:39:15] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:39:16] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:39:16] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:39:16] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:39:16] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:39:16] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:39:16] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:39:16] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
[2024-05-30 13:39:16] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:39:16] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:39:17] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:39:17] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:39:17] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:39:17] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:39:17] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:18] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:39:18] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:39:18] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:39:19] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:39:19] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:39:19] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:39:19] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:39:19] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:39:19] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:39:19] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:39:20] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:39:20] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:39:20] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-30 13:39:20] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 14/455 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:21] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:39:21] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:39:22] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:39:23] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:23] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:39:25] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 7/466 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:27] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:39:27] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:39:27] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:39:28] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:39:29] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 5/471 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:30] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:32] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:39:33] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:39:34] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:40] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/396 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/396 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 476 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 60/60 constraints]
After SMT, in 36446ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 36448ms
Finished structural reductions in LTL mode , in 1 iterations and 36622 ms. Remains : 198/198 places, 198/198 transitions.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 122 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 695 steps (0 resets) in 14 ms. (46 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 8 factoid took 266 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Product exploration explored 100000 steps with 33398 reset in 93 ms.
Product exploration explored 100000 steps with 33317 reset in 98 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 198 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 198 transition count 197
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 53 place count 198 transition count 217
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 74 place count 198 transition count 217
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 195 transition count 214
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 195 transition count 214
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 138 place count 195 transition count 214
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 176 place count 157 transition count 176
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 214 place count 157 transition count 176
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -132
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 233 place count 157 transition count 308
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 252 place count 138 transition count 270
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 271 place count 138 transition count 270
Deduced a syphon composed of 90 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 274 place count 138 transition count 267
Deduced a syphon composed of 90 places in 0 ms
Applied a total of 274 rules in 83 ms. Remains 138 /198 variables (removed 60) and now considering 267/198 (removed -69) transitions.
[2024-05-30 13:39:45] [INFO ] Redundant transitions in 12 ms returned []
Running 266 sub problems to find dead transitions.
// Phase 1: matrix 267 rows 138 cols
[2024-05-30 13:39:45] [INFO ] Computed 21 invariants in 6 ms
[2024-05-30 13:39:45] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 266 unsolved
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 20/41 constraints. Problems are: Problem set: 190 solved, 76 unsolved
[2024-05-30 13:39:47] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 1/42 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/42 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 266/404 variables, 138/180 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 84/264 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/264 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/405 variables, 1/265 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 0/265 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/405 variables, 0/265 constraints. Problems are: Problem set: 193 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 265 constraints, problems are : Problem set: 193 solved, 73 unsolved in 4209 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 138/138 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 193 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 91/138 variables, 21/21 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 21/42 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/42 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 266/404 variables, 138/180 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 84/264 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 73/337 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/337 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/405 variables, 1/338 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 0/338 constraints. Problems are: Problem set: 193 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/405 variables, 0/338 constraints. Problems are: Problem set: 193 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 338 constraints, problems are : Problem set: 193 solved, 73 unsolved in 4095 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 138/138 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 73/266 constraints, Known Traps: 21/21 constraints]
After SMT, in 8482ms problems are : Problem set: 193 solved, 73 unsolved
Search for dead transitions found 193 dead transitions in 8488ms
Found 193 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 193 transitions
Dead transitions reduction (with SMT) removed 193 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 138/198 places, 74/198 transitions.
Graph (complete) has 244 edges and 138 vertex of which 48 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.3 ms
Discarding 90 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 48 /138 variables (removed 90) and now considering 74/74 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/198 places, 74/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8610 ms. Remains : 48/198 places, 74/198 transitions.
Built C files in :
/tmp/ltsmin18185157353647723842
[2024-05-30 13:39:54] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18185157353647723842
Running compilation step : cd /tmp/ltsmin18185157353647723842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 463 ms.
Running link step : cd /tmp/ltsmin18185157353647723842;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin18185157353647723842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2002195395091959428.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Applied a total of 0 rules in 13 ms. Remains 198 /198 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 198 cols
[2024-05-30 13:40:09] [INFO ] Computed 21 invariants in 3 ms
[2024-05-30 13:40:09] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 13:40:09] [INFO ] Invariant cache hit.
[2024-05-30 13:40:09] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 13:40:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:40:10] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:40:10] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:40:11] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:40:11] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:40:11] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 224 constraints, problems are : Problem set: 0 solved, 197 unsolved in 6384 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/224 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 197/421 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:40:17] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:40:17] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:40:17] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:40:18] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:40:18] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:40:18] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:40:18] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:40:18] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:40:18] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:40:18] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:40:18] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:40:18] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:40:19] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:40:19] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:40:19] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:40:19] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:40:19] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-30 13:40:19] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2024-05-30 13:40:19] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:40:20] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:40:20] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:40:20] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:40:21] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:40:21] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:40:21] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:40:21] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:40:21] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:40:22] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:40:22] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
[2024-05-30 13:40:22] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:40:22] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:40:22] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:40:22] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:40:22] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 14/455 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:40:24] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:40:24] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:40:24] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:40:25] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:40:26] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:40:26] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:40:26] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:40:27] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:40:27] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:40:27] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:40:28] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 7/466 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:40:30] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:40:30] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:40:30] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:40:30] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:40:31] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 5/471 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:40:32] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:40:35] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-30 13:40:36] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:40:36] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:40:42] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/396 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/396 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 476 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 60/60 constraints]
After SMT, in 36423ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 36425ms
Finished structural reductions in LTL mode , in 1 iterations and 36616 ms. Remains : 198/198 places, 198/198 transitions.
Built C files in :
/tmp/ltsmin18008342941025538163
[2024-05-30 13:40:45] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18008342941025538163
Running compilation step : cd /tmp/ltsmin18008342941025538163;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 341 ms.
Running link step : cd /tmp/ltsmin18008342941025538163;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18008342941025538163;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16625948045632655594.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 13:41:01] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:41:01] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:41:01] [INFO ] Time to serialize gal into /tmp/LTL6025517871309147850.gal : 3 ms
[2024-05-30 13:41:01] [INFO ] Time to serialize properties into /tmp/LTL15351786275105025255.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6025517871309147850.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17475882481580818651.hoa' '-atoms' '/tmp/LTL15351786275105025255.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15351786275105025255.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17475882481580818651.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t17, t22, t26, t33, t39, t44, t49, t53, t58, t62, t65, t69, t75, t79, t84, t88, ...403
Computing Next relation with stutter on 2025 deadlock states
Detected timeout of ITS tools.
[2024-05-30 13:41:16] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:41:16] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:41:16] [INFO ] Time to serialize gal into /tmp/LTL5766246581236988330.gal : 2 ms
[2024-05-30 13:41:16] [INFO ] Time to serialize properties into /tmp/LTL13715493251442697304.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5766246581236988330.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13715493251442697304.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((!((F((F("((p197==0)||(p219==1))"))U("((p131==0)||(p99==1))")))U(!(F(X(((X("((p197==0)||(p219==1))"))||("(p197==0)"))||("(p219==1)")...162
Formula 0 simplified : F"((p131==0)||(p99==1))" U XG(!"(p197==0)" & !"(p219==1)" & X!"((p197==0)||(p219==1))")
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t17, t22, t26, t33, t39, t44, t49, t53, t58, t62, t65, t69, t75, t79, t84, t88, ...403
Computing Next relation with stutter on 2025 deadlock states
Detected timeout of ITS tools.
[2024-05-30 13:41:31] [INFO ] Flatten gal took : 16 ms
[2024-05-30 13:41:31] [INFO ] Applying decomposition
[2024-05-30 13:41:31] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1117595034366748814.txt' '-o' '/tmp/graph1117595034366748814.bin' '-w' '/tmp/graph1117595034366748814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1117595034366748814.bin' '-l' '-1' '-v' '-w' '/tmp/graph1117595034366748814.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:41:31] [INFO ] Decomposing Gal with order
[2024-05-30 13:41:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:41:31] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-30 13:41:31] [INFO ] Flatten gal took : 44 ms
[2024-05-30 13:41:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 13:41:31] [INFO ] Time to serialize gal into /tmp/LTL16415101857333737375.gal : 5 ms
[2024-05-30 13:41:31] [INFO ] Time to serialize properties into /tmp/LTL6101725402856891958.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16415101857333737375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6101725402856891958.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((!((F((F("((i13.i2.u61.p197==0)||(i14.u65.p219==1))"))U("((i8.u38.p131==0)||(i5.i2.u31.p99==1))")))U(!(F(X(((X("((i13.i2.u61.p197==0...236
Formula 0 simplified : F"((i8.u38.p131==0)||(i5.i2.u31.p99==1))" U XG(!"(i13.i2.u61.p197==0)" & !"(i14.u65.p219==1)" & X!"((i13.i2.u61.p197==0)||(i14.u65.p...165
Reverse transition relation is NOT exact ! Due to transitions t187, t189, t192, t194, i0.i0.u2.t183, i1.t174, i1.u6.t180, i2.i0.t171, i2.i2.t151, i2.i2.u16...647
Computing Next relation with stutter on 2025 deadlock states
81 unique states visited
81 strongly connected components in search stack
82 transitions explored
81 items max in DFS search stack
104 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.06289,65760,1,0,127116,379,2508,140551,194,1216,188951
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-005B-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-005B-LTLCardinality-03 finished in 184219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 198 transition count 198
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 198 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 197 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 197 transition count 197
Applied a total of 18 rules in 5 ms. Remains 197 /206 variables (removed 9) and now considering 197/206 (removed 9) transitions.
// Phase 1: matrix 197 rows 197 cols
[2024-05-30 13:41:32] [INFO ] Computed 21 invariants in 3 ms
[2024-05-30 13:41:32] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 13:41:32] [INFO ] Invariant cache hit.
[2024-05-30 13:41:33] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 13:41:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:41:34] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:41:34] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:41:34] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:41:34] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:41:34] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:41:35] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/224 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 224 constraints, problems are : Problem set: 0 solved, 196 unsolved in 6537 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/224 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 196/420 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:41:41] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:41:41] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:41:41] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:41:41] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:41:41] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:41:41] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:41:41] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:41:41] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:41:41] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:41:43] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:41:43] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:41:44] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:41:44] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:41:44] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:41:44] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:41:44] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:41:45] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:41:45] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:41:45] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:41:45] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:41:45] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:41:45] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 12/452 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:41:47] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:41:47] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:41:47] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:41:47] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:41:47] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:41:47] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 6/458 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:41:50] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:41:50] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:41:50] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:41:50] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:41:51] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 5/463 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:41:53] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:41:53] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:41:53] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 3/466 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:41:59] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/394 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:01] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-30 13:42:02] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 15 (OVERLAPS) 0/394 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 469 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 55/55 constraints]
After SMT, in 36568ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 36570ms
Starting structural reductions in LTL mode, iteration 1 : 197/206 places, 197/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36764 ms. Remains : 197/206 places, 197/206 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-04
Stuttering criterion allowed to conclude after 53396 steps with 59 reset in 80 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-04 finished in 36954 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(F(p0)))))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 198 transition count 198
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 198 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 197 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 197 transition count 197
Applied a total of 18 rules in 10 ms. Remains 197 /206 variables (removed 9) and now considering 197/206 (removed 9) transitions.
// Phase 1: matrix 197 rows 197 cols
[2024-05-30 13:42:09] [INFO ] Computed 21 invariants in 4 ms
[2024-05-30 13:42:09] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 13:42:09] [INFO ] Invariant cache hit.
[2024-05-30 13:42:09] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 13:42:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:11] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:42:11] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:42:11] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:42:11] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:42:11] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:12] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:42:12] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/394 variables, 197/225 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 225 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7297 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/225 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 196/421 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:18] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:42:19] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:42:19] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:42:19] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:42:19] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-30 13:42:19] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:42:19] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:42:19] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:42:19] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:42:19] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:42:20] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:42:20] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:42:20] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:42:20] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:42:20] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:42:20] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:42:20] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:42:21] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2024-05-30 13:42:21] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:42:21] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:22] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:42:22] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:42:22] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:42:22] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:42:22] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:42:22] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:42:22] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:42:23] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:42:23] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:42:23] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:42:23] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:42:23] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:42:23] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:42:24] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:42:24] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:42:24] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 16/457 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:26] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:27] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:42:27] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:42:27] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:42:27] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:42:27] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:42:28] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:42:28] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:42:28] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:42:28] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:42:29] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:42:29] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:42:30] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 12/470 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:34] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:42:34] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/394 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 13 (OVERLAPS) 0/394 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 472 constraints, problems are : Problem set: 0 solved, 196 unsolved in 25762 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 58/58 constraints]
After SMT, in 33074ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 33078ms
Starting structural reductions in LTL mode, iteration 1 : 197/206 places, 197/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33263 ms. Remains : 197/206 places, 197/206 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 75 ms.
Product exploration explored 100000 steps with 25000 reset in 78 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4452 steps (0 resets) in 48 ms. (90 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-05-30 13:42:44] [INFO ] Invariant cache hit.
[2024-05-30 13:42:44] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-30 13:42:44] [INFO ] Invariant cache hit.
[2024-05-30 13:42:44] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 13:42:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:42:45] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:42:46] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/394 variables, 197/225 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 225 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7235 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/225 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 196/421 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:53] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:42:53] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-30 13:42:53] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-05-30 13:42:53] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:42:53] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:42:53] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:42:53] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 5 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:42:55] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:42:55] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:42:55] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:42:55] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:42:55] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:42:56] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:42:56] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:42:56] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:42:56] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:42:56] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:42:57] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:42:57] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:42:57] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:42:57] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:42:57] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:42:57] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:42:57] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:42:58] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:42:58] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:42:58] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:42:58] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 16/457 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:43:00] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:43:02] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:43:02] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:43:02] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:43:02] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:43:02] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:43:02] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:43:02] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:43:02] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:43:02] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:43:04] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:43:04] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 12/470 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:43:09] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:43:09] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/394 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 13 (OVERLAPS) 0/394 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 472 constraints, problems are : Problem set: 0 solved, 196 unsolved in 26472 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 58/58 constraints]
After SMT, in 33722ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 33725ms
Finished structural reductions in LTL mode , in 1 iterations and 33900 ms. Remains : 197/197 places, 197/197 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4398 steps (0 resets) in 31 ms. (137 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 75 ms.
Product exploration explored 100000 steps with 25000 reset in 82 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 197 transition count 197
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 52 place count 197 transition count 218
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 73 place count 197 transition count 218
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 133 place count 197 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 134 place count 197 transition count 217
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 173 place count 158 transition count 178
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 212 place count 158 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 213 place count 158 transition count 178
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 215 place count 156 transition count 176
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 217 place count 156 transition count 176
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -127
Deduced a syphon composed of 111 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 235 place count 156 transition count 303
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 254 place count 137 transition count 265
Deduced a syphon composed of 92 places in 1 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 273 place count 137 transition count 265
Deduced a syphon composed of 92 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 276 place count 137 transition count 262
Deduced a syphon composed of 92 places in 0 ms
Applied a total of 276 rules in 50 ms. Remains 137 /197 variables (removed 60) and now considering 262/197 (removed -65) transitions.
[2024-05-30 13:43:19] [INFO ] Redundant transitions in 3 ms returned []
Running 261 sub problems to find dead transitions.
// Phase 1: matrix 262 rows 137 cols
[2024-05-30 13:43:19] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:43:19] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-30 13:43:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-30 13:43:20] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-30 13:43:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-05-30 13:43:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-30 13:43:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-30 13:43:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD257 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 20/41 constraints. Problems are: Problem set: 187 solved, 74 unsolved
[2024-05-30 13:43:21] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 1/42 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/42 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 261/398 variables, 137/179 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 80/259 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/259 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 1/399 variables, 1/260 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/260 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/399 variables, 0/260 constraints. Problems are: Problem set: 192 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 260 constraints, problems are : Problem set: 192 solved, 69 unsolved in 3953 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 137/137 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 192 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 93/137 variables, 21/21 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 21/42 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/42 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 261/398 variables, 137/179 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 80/259 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 69/328 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/328 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 1/399 variables, 1/329 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/329 constraints. Problems are: Problem set: 192 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/399 variables, 0/329 constraints. Problems are: Problem set: 192 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 329 constraints, problems are : Problem set: 192 solved, 69 unsolved in 3755 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 137/137 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 69/261 constraints, Known Traps: 21/21 constraints]
After SMT, in 7815ms problems are : Problem set: 192 solved, 69 unsolved
Search for dead transitions found 192 dead transitions in 7820ms
Found 192 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 192 transitions
Dead transitions reduction (with SMT) removed 192 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 137/197 places, 70/197 transitions.
Graph (complete) has 240 edges and 137 vertex of which 45 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.2 ms
Discarding 92 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 45 /137 variables (removed 92) and now considering 70/70 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/197 places, 70/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7894 ms. Remains : 45/197 places, 70/197 transitions.
Built C files in :
/tmp/ltsmin549268607068282871
[2024-05-30 13:43:27] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin549268607068282871
Running compilation step : cd /tmp/ltsmin549268607068282871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 331 ms.
Running link step : cd /tmp/ltsmin549268607068282871;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin549268607068282871;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2665055819738686353.hoa' '--buchi-type=spotba'
LTSmin run took 402 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-005B-LTLCardinality-07 finished in 78336 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 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 205 transition count 155
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 102 place count 155 transition count 153
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 154 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 152 transition count 151
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 107 place count 152 transition count 113
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 183 place count 114 transition count 113
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 191 place count 106 transition count 105
Iterating global reduction 4 with 8 rules applied. Total rules applied 199 place count 106 transition count 105
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 199 place count 106 transition count 98
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 213 place count 99 transition count 98
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 285 place count 63 transition count 62
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 313 place count 49 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 315 place count 47 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 316 place count 46 transition count 73
Applied a total of 316 rules in 23 ms. Remains 46 /206 variables (removed 160) and now considering 73/206 (removed 133) transitions.
// Phase 1: matrix 73 rows 46 cols
[2024-05-30 13:43:28] [INFO ] Computed 20 invariants in 0 ms
[2024-05-30 13:43:28] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 13:43:28] [INFO ] Invariant cache hit.
[2024-05-30 13:43:28] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-30 13:43:28] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-30 13:43:28] [INFO ] Redundant transitions in 0 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-30 13:43:28] [INFO ] Invariant cache hit.
[2024-05-30 13:43:28] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 3/46 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-30 13:43:28] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-30 13:43:28] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 72/118 variables, 46/68 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 28/96 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/119 variables, and 96 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1703 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 46/46 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 3/46 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 72/118 variables, 46/68 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 28/96 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 66/162 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/119 variables, and 162 constraints, problems are : Problem set: 0 solved, 66 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 46/46 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 2/2 constraints]
After SMT, in 2635ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2636ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/206 places, 73/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2788 ms. Remains : 46/206 places, 73/206 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-08
Stuttering criterion allowed to conclude after 3070 steps with 1 reset in 14 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-08 finished in 2858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 197 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 197 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 196 transition count 196
Applied a total of 20 rules in 14 ms. Remains 196 /206 variables (removed 10) and now considering 196/206 (removed 10) transitions.
// Phase 1: matrix 196 rows 196 cols
[2024-05-30 13:43:30] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:43:31] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 13:43:31] [INFO ] Invariant cache hit.
[2024-05-30 13:43:31] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-30 13:43:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:32] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:43:32] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:43:32] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:43:32] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:43:33] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 222 constraints, problems are : Problem set: 0 solved, 195 unsolved in 6596 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 195/417 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:39] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-30 13:43:39] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:43:39] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:43:39] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:43:40] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:43:40] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:43:40] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:43:40] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-30 13:43:40] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:43:40] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:43:40] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:43:40] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:43:40] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:43:41] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:43:41] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:43:41] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:43:41] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:43:41] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:43:41] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:43:41] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:42] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:43:42] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:43:42] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:43:43] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:43:43] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:43:43] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:43:43] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:43:43] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:43:43] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:43:44] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:43:44] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:43:44] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 12/449 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:45] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:43:45] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:43:46] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:43:46] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:43:46] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:43:46] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:43:47] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 7/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:51] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:43:51] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:43:51] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/392 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:54] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:43:59] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:43:59] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/392 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:05] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:44:06] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/392 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 464 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 52/52 constraints]
After SMT, in 36631ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 36633ms
Starting structural reductions in LTL mode, iteration 1 : 196/206 places, 196/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36817 ms. Remains : 196/206 places, 196/206 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-09
Product exploration explored 100000 steps with 1110 reset in 149 ms.
Stack based approach found an accepted trace after 189 steps with 1 reset with depth 99 and stack size 99 in 1 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-09 finished in 37146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 197 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 197 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 196 transition count 196
Applied a total of 20 rules in 10 ms. Remains 196 /206 variables (removed 10) and now considering 196/206 (removed 10) transitions.
[2024-05-30 13:44:08] [INFO ] Invariant cache hit.
[2024-05-30 13:44:08] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-30 13:44:08] [INFO ] Invariant cache hit.
[2024-05-30 13:44:08] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-30 13:44:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:09] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:44:09] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:44:09] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:44:10] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:44:10] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 222 constraints, problems are : Problem set: 0 solved, 195 unsolved in 6419 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 195/417 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:16] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:44:16] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:44:16] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:44:16] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:44:16] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:44:16] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:44:17] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:44:17] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:44:17] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:44:17] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:44:17] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:44:17] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:44:17] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:44:17] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:44:17] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:44:18] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:44:18] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:44:18] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:44:18] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:44:18] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:19] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:44:19] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:44:19] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:44:19] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:44:20] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:44:20] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:44:20] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:44:20] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:44:20] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:44:20] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:44:20] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:44:21] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 12/449 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:22] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:44:22] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:44:22] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:44:22] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:44:23] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:44:23] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:44:23] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 7/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:28] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:44:28] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:44:28] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/392 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:31] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:36] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:44:36] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/392 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/392 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 464 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 52/52 constraints]
After SMT, in 36450ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 36452ms
Starting structural reductions in LTL mode, iteration 1 : 196/206 places, 196/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36632 ms. Remains : 196/206 places, 196/206 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-10
Stuttering criterion allowed to conclude after 21747 steps with 0 reset in 38 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-10 finished in 36817 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(X(p0)))&&G((X(X(G(p1))) U p1))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 200 transition count 200
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 200 transition count 200
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 199 transition count 199
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 199 transition count 199
Applied a total of 14 rules in 15 ms. Remains 199 /206 variables (removed 7) and now considering 199/206 (removed 7) transitions.
// Phase 1: matrix 199 rows 199 cols
[2024-05-30 13:44:44] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 13:44:45] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 13:44:45] [INFO ] Invariant cache hit.
[2024-05-30 13:44:45] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-30 13:44:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:44:46] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:44:46] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:44:46] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-30 13:44:46] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:44:46] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:44:46] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:44:46] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:44:46] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:44:47] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:44:47] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/398 variables, 199/230 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 0/398 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 230 constraints, problems are : Problem set: 0 solved, 198 unsolved in 6582 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/199 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/398 variables, 199/230 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 198/428 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:44:53] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-30 13:44:53] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:44:53] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-30 13:44:53] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:44:53] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:44:54] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:44:54] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:44:54] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:44:54] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:44:54] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:44:54] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:44:54] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:44:54] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:44:54] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:44:54] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-30 13:44:55] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:44:55] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:44:55] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:44:55] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:44:55] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 20/448 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:44:56] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:44:56] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:44:56] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:44:57] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:44:57] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:44:57] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:44:57] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:44:57] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:44:57] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:44:57] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:44:58] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 11/459 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:45:00] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:45:00] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:45:00] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:45:00] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-30 13:45:00] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:45:00] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:45:00] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:45:00] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 8/467 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:45:02] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 13:45:04] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (OVERLAPS) 0/398 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 469 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22145 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 51/51 constraints]
After SMT, in 28744ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 28746ms
Starting structural reductions in LTL mode, iteration 1 : 199/206 places, 199/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28934 ms. Remains : 199/206 places, 199/206 transitions.
Stuttering acceptance computed with spot in 421 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-14 finished in 29378 ms.
All properties solved by simple procedures.
Total runtime 520060 ms.

BK_STOP 1717076714351

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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