MCC'2024- Execution of r355-tall-171683759900955

About the Execution of GreatSPN+red for ShieldRVt-PT-005B

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
3408.848	1128476.00	1264408.00	2328.20	TFFFFTTTFFFTFFFT	normal

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

--------------------
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 1717075614951

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-005B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 13:26:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 13:26:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:26:56] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-30 13:26:56] [INFO ] Transformed 253 places.
[2024-05-30 13:26:56] [INFO ] Transformed 253 transitions.
[2024-05-30 13:26:56] [INFO ] Found NUPN structural information;
[2024-05-30 13:26:56] [INFO ] Parsed PT model containing 253 places and 253 transitions and 596 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 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 46 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:26:56] [INFO ] Computed 21 invariants in 18 ms
[2024-05-30 13:26:56] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-30 13:26:56] [INFO ] Invariant cache hit.
[2024-05-30 13:26:57] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-05-30 13:26:57] [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:26:58] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 10 ms to minimize.
[2024-05-30 13:26:58] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
[2024-05-30 13:26:59] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:26:59] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:26:59] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:26:59] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:26:59] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:26:59] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:26:59] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:26:59] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:26:59] [INFO ] Deduced a trap composed of 24 places in 26 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:27:02] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:27:02] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:27:02] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 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 9358 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:27:07] [INFO ] Deduced a trap composed of 25 places in 56 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:27:09] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-30 13:27:09] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:27:09] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:27:09] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:27:10] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:27:10] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:27:10] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 2 ms to minimize.
[2024-05-30 13:27:10] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-05-30 13:27:10] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:27:10] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:27:10] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:27:10] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:27:10] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:27:10] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:27:11] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:27:11] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:27:11] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:27:11] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:27:11] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:27:11] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 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:27:12] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-30 13:27:13] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:27:13] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:27:13] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-30 13:27:14] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 3 ms to minimize.
[2024-05-30 13:27:14] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:27:14] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:27:14] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:27:14] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:27:15] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:27:15] [INFO ] Deduced a trap composed of 24 places in 40 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:27:16] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:27:17] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:27:18] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:27:18] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:27:18] [INFO ] Deduced a trap composed of 25 places in 30 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:27:26] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:27:26] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 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 30007 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 39434ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 39449ms
Starting structural reductions in LTL mode, iteration 1 : 206/253 places, 206/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39982 ms. Remains : 206/253 places, 206/253 transitions.
Support contains 28 out of 206 places after structural reductions.
[2024-05-30 13:27:36] [INFO ] Flatten gal took : 38 ms
[2024-05-30 13:27:36] [INFO ] Flatten gal took : 13 ms
[2024-05-30 13:27:36] [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 4453 steps (0 resets) in 203 ms. (21 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 13 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:27:37] [INFO ] Computed 21 invariants in 3 ms
[2024-05-30 13:27:37] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-30 13:27:37] [INFO ] Invariant cache hit.
[2024-05-30 13:27:37] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 13:27:37] [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:27:38] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:27:38] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:27:39] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:27:39] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
[2024-05-30 13:27:39] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:27:39] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:27:39] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 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:27:40] [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 7506 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:27:46] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:27:46] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:27:46] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:27:46] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:27:46] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:27:47] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-30 13:27:47] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:27:47] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:27:47] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:27:47] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:27:47] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:27:47] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:27:47] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:27:47] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-30 13:27:48] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 2 ms to minimize.
[2024-05-30 13:27:48] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:27:48] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:27:48] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:27:48] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:27:48] [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:27:49] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:27:49] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:27:49] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:27:50] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:27:50] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-05-30 13:27:50] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:27:50] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:27:50] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:27:50] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:27:51] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 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:27:52] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-30 13:27:52] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:27:52] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:27:52] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:27:53] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:27:54] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:27:54] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 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:27:56] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-30 13:27:57] [INFO ] Deduced a trap composed of 43 places in 60 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:27:59] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:27:59] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:27:59] [INFO ] Deduced a trap composed of 45 places in 58 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:28:01] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:28:02] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:28:02] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:28:02] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:28:02] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:28:02] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:28:03] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:28:03] [INFO ] Deduced a trap composed of 33 places in 57 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:28:05] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:28:05] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:28:06] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:28:06] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 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:28:08] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:28:08] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 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:28:11] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:28:12] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2024-05-30 13:28:12] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2024-05-30 13:28:12] [INFO ] Deduced a trap composed of 25 places in 48 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 482 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 68/68 constraints]
After SMT, in 37547ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 37551ms
Starting structural reductions in LTL mode, iteration 1 : 197/206 places, 197/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37769 ms. Remains : 197/206 places, 197/206 transitions.
Stuttering acceptance computed with spot in 227 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 21 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-01 finished in 38061 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 24 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:28:15] [INFO ] Computed 21 invariants in 6 ms
[2024-05-30 13:28:15] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-30 13:28:15] [INFO ] Invariant cache hit.
[2024-05-30 13:28:15] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 13:28:15] [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:28:16] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:28:16] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:28:17] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:28:17] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:28:17] [INFO ] Deduced a trap composed of 24 places in 34 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 7070 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:28:23] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:28:23] [INFO ] Deduced a trap composed of 24 places in 31 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:28:25] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-30 13:28:25] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-30 13:28:25] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:28:25] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:28:25] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:28:25] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:28:25] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 4 ms to minimize.
[2024-05-30 13:28:26] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-05-30 13:28:26] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:28:26] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:28:26] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:28:26] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:28:26] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:28:26] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:28:26] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 3 ms to minimize.
[2024-05-30 13:28:26] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:28:27] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 3 ms to minimize.
[2024-05-30 13:28:27] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:28:27] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:28:27] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 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:28:28] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:28:28] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:28:28] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:28:28] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:28:28] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-30 13:28:29] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:28:29] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:28:29] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:28:29] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:28:29] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:28:29] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:28:29] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:28:29] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:28:30] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:28:30] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2024-05-30 13:28:30] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:28:30] [INFO ] Deduced a trap composed of 25 places in 48 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:28:31] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-30 13:28:31] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 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:28:35] [INFO ] Deduced a trap composed of 19 places in 55 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:28:37] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 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:28:43] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:28:43] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:28:43] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:28:44] [INFO ] Deduced a trap composed of 26 places in 49 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:28:49] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:28:49] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:28:49] [INFO ] Deduced a trap composed of 27 places in 58 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
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
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 30017 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 37122ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 37144ms
Starting structural reductions in LTL mode, iteration 1 : 198/206 places, 198/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37422 ms. Remains : 198/206 places, 198/206 transitions.
Stuttering acceptance computed with spot in 170 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 370 reset in 380 ms.
Stack based approach found an accepted trace after 11601 steps with 34 reset with depth 403 and stack size 403 in 27 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-02 finished in 38046 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 9 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:28:53] [INFO ] Computed 21 invariants in 6 ms
[2024-05-30 13:28:53] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-30 13:28:53] [INFO ] Invariant cache hit.
[2024-05-30 13:28:53] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 13:28:53] [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:28:54] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:28:54] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:28:55] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:28:55] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:28:55] [INFO ] Deduced a trap composed of 24 places in 34 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 6679 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:29:01] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:29:01] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:29:02] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:29:02] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:29:02] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:29:02] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-30 13:29:02] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2024-05-30 13:29:02] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:29:02] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-05-30 13:29:03] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:29:03] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:29:03] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:29:03] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:29:03] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:29:03] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:29:03] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:29:04] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:29:04] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2024-05-30 13:29:04] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:29:04] [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:29:05] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:29:05] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-30 13:29:05] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:29:05] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:29:05] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:29:07] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:29:07] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:29:07] [INFO ] Deduced a trap composed of 26 places in 44 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:29:08] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:29:08] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:29:09] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:29:10] [INFO ] Deduced a trap composed of 22 places in 44 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:29:11] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:29:11] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:29:11] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:29:12] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:29:12] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:29:12] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:29:13] [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:29:15] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:29:15] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:29:15] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:29:15] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:29:16] [INFO ] Deduced a trap composed of 24 places in 44 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:29:18] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 3 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:29:20] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:29:22] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:29:22] [INFO ] Deduced a trap composed of 25 places in 58 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:29:28] [INFO ] Deduced a trap composed of 23 places in 49 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
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30018 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 36726ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 36730ms
Starting structural reductions in LTL mode, iteration 1 : 198/206 places, 198/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36926 ms. Remains : 198/206 places, 198/206 transitions.
Stuttering acceptance computed with spot in 211 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 33376 reset in 96 ms.
Product exploration explored 100000 steps with 33335 reset in 125 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 118 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 234 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 514 steps (0 resets) in 8 ms. (57 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 329 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 231 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 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)]
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 8 ms. Remains 198 /198 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-05-30 13:29:31] [INFO ] Invariant cache hit.
[2024-05-30 13:29:31] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-30 13:29:31] [INFO ] Invariant cache hit.
[2024-05-30 13:29:31] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 13:29:31] [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:29:33] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:29:33] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:29:33] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:29:33] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:29:33] [INFO ] Deduced a trap composed of 24 places in 36 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 6873 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:29:40] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:29:40] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:29:41] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:29:41] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:29:41] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:29:41] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:29:41] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:29:41] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:29:41] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:29:41] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:29:41] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:29:42] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:29:42] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-30 13:29:42] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 2 ms to minimize.
[2024-05-30 13:29:42] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2024-05-30 13:29:42] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:29:42] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:29:43] [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:29:43] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:29:45] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-30 13:29:45] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:29:45] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-30 13:29:45] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:29:45] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-30 13:29:46] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:29:46] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:29:46] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:29:46] [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:29:47] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:29:47] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:29:48] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:29:49] [INFO ] Deduced a trap composed of 22 places in 51 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:29:50] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:29:50] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:29:50] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:29:51] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:29:51] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:29:51] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:29:52] [INFO ] Deduced a trap composed of 22 places in 50 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:29:53] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:29:54] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:29:54] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:29:54] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:29:55] [INFO ] Deduced a trap composed of 24 places in 41 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:29:56] [INFO ] Deduced a trap composed of 22 places in 58 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:29:59] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:30:00] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:30:00] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 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:30:06] [INFO ] Deduced a trap composed of 23 places in 45 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
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 30009 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 36899ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 36901ms
Finished structural reductions in LTL mode , in 1 iterations and 37089 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 209 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 1111 steps (0 resets) in 26 ms. (41 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 255 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 231 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 209 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 239 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 33416 reset in 91 ms.
Product exploration explored 100000 steps with 33306 reset in 116 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 250 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 1 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 81 ms. Remains 138 /198 variables (removed 60) and now considering 267/198 (removed -69) transitions.
[2024-05-30 13:30:10] [INFO ] Redundant transitions in 11 ms returned []
Running 266 sub problems to find dead transitions.
// Phase 1: matrix 267 rows 138 cols
[2024-05-30 13:30:10] [INFO ] Computed 21 invariants in 5 ms
[2024-05-30 13:30:10] [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:30:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-30 13:30:12] [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:30:12] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 3 places in 24 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:30:12] [INFO ] Deduced a trap composed of 4 places in 19 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:30:13] [INFO ] Deduced a trap composed of 4 places in 31 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:30:13] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 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 4438 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 4115 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 8736ms problems are : Problem set: 193 solved, 73 unsolved
Search for dead transitions found 193 dead transitions in 8740ms
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.2 ms
Discarding 90 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 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 8848 ms. Remains : 48/198 places, 74/198 transitions.
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 3 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:30:19] [INFO ] Computed 21 invariants in 3 ms
[2024-05-30 13:30:19] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 13:30:19] [INFO ] Invariant cache hit.
[2024-05-30 13:30:19] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 13:30:19] [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:30:21] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:30:21] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:30:21] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:30:21] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:30:21] [INFO ] Deduced a trap composed of 24 places in 28 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 6587 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:30:28] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-30 13:30:28] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:30:29] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:30:29] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:30:29] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:30:29] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:30:29] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:30:29] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:30:29] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 3 ms to minimize.
[2024-05-30 13:30:29] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:30:30] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:30:30] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:30:30] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:30:30] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:30:30] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 4 ms to minimize.
[2024-05-30 13:30:30] [INFO ] Deduced a trap composed of 26 places in 51 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:30:31] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:30:31] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:30:31] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-30 13:30:32] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:30:32] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:30:32] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:30:32] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:30:32] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:30:33] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:30:33] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:30:33] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:30:33] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:30:33] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2024-05-30 13:30:33] [INFO ] Deduced a trap composed of 26 places in 47 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:30:35] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:30:35] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:30:35] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:30:36] [INFO ] Deduced a trap composed of 22 places in 46 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:30:37] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:30:37] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:30:38] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:30:38] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:30:38] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:30:38] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:30:39] [INFO ] Deduced a trap composed of 22 places in 53 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:30:41] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:30:41] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:30:41] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:30:41] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:30:42] [INFO ] Deduced a trap composed of 24 places in 41 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:30:44] [INFO ] Deduced a trap composed of 22 places in 79 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:30:46] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:30:47] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-30 13:30:47] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 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:30:54] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/396 variables, 1/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 30011 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 36617ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 36619ms
Finished structural reductions in LTL mode , in 1 iterations and 36797 ms. Remains : 198/198 places, 198/198 transitions.
Treatment of property ShieldRVt-PT-005B-LTLCardinality-03 finished in 123358 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 15 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:30:56] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:30:56] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-30 13:30:56] [INFO ] Invariant cache hit.
[2024-05-30 13:30:56] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 13:30:56] [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:30:58] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:30:58] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:30:58] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:30:58] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:30:58] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:30:58] [INFO ] Deduced a trap composed of 24 places in 39 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 6778 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:31:05] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:31:05] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:31:05] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-30 13:31:05] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-30 13:31:05] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:31:05] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:31:06] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-30 13:31:06] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:31:06] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:31:06] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 1 ms to minimize.
[2024-05-30 13:31:06] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:31:06] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:31:06] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:31:06] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:31:06] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:31:07] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:31:07] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:31:07] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:31:07] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:31:07] [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:31:08] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:31:08] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:31:08] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:31:09] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:31:09] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:31:09] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:31:09] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:31:09] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:31:09] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:31:09] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:31:09] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:31:09] [INFO ] Deduced a trap composed of 20 places in 54 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:31:11] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:31:11] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:31:11] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:31:12] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:31:12] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:31:12] [INFO ] Deduced a trap composed of 25 places in 51 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:31:14] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:31:14] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:31:14] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 3 ms to minimize.
[2024-05-30 13:31:15] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:31:16] [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:31:18] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:31:18] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:31:18] [INFO ] Deduced a trap composed of 27 places in 50 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:31:24] [INFO ] Deduced a trap composed of 23 places in 44 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:31:26] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:31:28] [INFO ] Deduced a trap composed of 26 places in 55 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 469 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30016 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 36814ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 36817ms
Starting structural reductions in LTL mode, iteration 1 : 197/206 places, 197/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37102 ms. Remains : 197/206 places, 197/206 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-04
Stuttering criterion allowed to conclude after 9473 steps with 12 reset in 17 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-04 finished in 37225 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 12 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:31:33] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:31:33] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-30 13:31:33] [INFO ] Invariant cache hit.
[2024-05-30 13:31:33] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 13:31: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:31:35] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:31:35] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:31:35] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:31:35] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:31:35] [INFO ] Deduced a trap composed of 24 places in 28 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:31:36] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:31:36] [INFO ] Deduced a trap composed of 22 places in 25 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 7611 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:31:43] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-30 13:31:43] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:31:43] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:31:43] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:31:43] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:31:43] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:31:44] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:31:44] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:31:44] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:31:44] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:31:44] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:31:44] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:31:44] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:31:44] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:31:44] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:31:45] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:31:45] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:31:45] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:31:45] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:31:45] [INFO ] Deduced a trap composed of 26 places in 40 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:31:46] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-05-30 13:31:46] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:31:46] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:31:46] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:31:46] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:31:47] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:31:47] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:31:47] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:31:47] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:31:47] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:31:47] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:31:48] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:31:48] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:31:48] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:31:48] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:31:48] [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:31:51] [INFO ] Deduced a trap composed of 20 places in 69 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:31:52] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-30 13:31:52] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:31:52] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:31:52] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:31:52] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:31:53] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-30 13:31:53] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:31:53] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:31:53] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:31:54] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-30 13:31:54] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:31:54] [INFO ] Deduced a trap composed of 24 places in 32 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:31:59] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:31:59] [INFO ] Deduced a trap composed of 33 places in 51 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 27092 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 34720ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 34722ms
Starting structural reductions in LTL mode, iteration 1 : 197/206 places, 197/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34922 ms. Remains : 197/206 places, 197/206 transitions.
Stuttering acceptance computed with spot in 178 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 85 ms.
Product exploration explored 100000 steps with 25000 reset in 88 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 70 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 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1470 steps (0 resets) in 11 ms. (122 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 80 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 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 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 2 ms. Remains 197 /197 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-05-30 13:32:09] [INFO ] Invariant cache hit.
[2024-05-30 13:32:09] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 13:32:09] [INFO ] Invariant cache hit.
[2024-05-30 13:32:09] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 13:32: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:32:11] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:32:11] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:32:11] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:32:11] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:32:11] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 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:32:12] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 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 7333 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:32:18] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-30 13:32:19] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:32:19] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:32:19] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:32:19] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:32:19] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:32:19] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:32:19] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:32:19] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-30 13:32:19] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:32:20] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:32:20] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:32:20] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:32:20] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:32:20] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:32:20] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:32:20] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:32:21] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:32:21] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:32:21] [INFO ] Deduced a trap composed of 26 places in 51 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:32:22] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:32:22] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:32:22] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:32:22] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:32:22] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:32:22] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:32:22] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:32:23] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:32:23] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:32:23] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 2 ms to minimize.
[2024-05-30 13:32:23] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:32:23] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:32:24] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:32:24] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:32:24] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:32:24] [INFO ] Deduced a trap composed of 25 places in 23 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:32:26] [INFO ] Deduced a trap composed of 20 places in 59 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:32:28] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:32:28] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:32:28] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:32:28] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:32:28] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:32:28] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:32:28] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:32:29] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:32:29] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:32:29] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:32:30] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:32:30] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 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:32:35] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-05-30 13:32:35] [INFO ] Deduced a trap composed of 33 places in 57 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 27715 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 35075ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 35078ms
Finished structural reductions in LTL mode , in 1 iterations and 35260 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 105 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 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1298 steps (0 resets) in 11 ms. (108 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 118 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 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 80 ms.
Product exploration explored 100000 steps with 25000 reset in 87 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 172 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 1 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 0 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 49 ms. Remains 137 /197 variables (removed 60) and now considering 262/197 (removed -65) transitions.
[2024-05-30 13:32:46] [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:32:46] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:32:46] [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:32:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-30 13:32:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-30 13:32:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-05-30 13:32:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-30 13:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-30 13:32:47] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-05-30 13:32:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-30 13:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-30 13:32:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-30 13:32:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
[2024-05-30 13:32:47] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-30 13:32:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-30 13:32:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-30 13:32:48] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-30 13:32:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-30 13:32:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-30 13:32:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-30 13:32:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-05-30 13:32:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-30 13:32:48] [INFO ] Deduced a trap composed of 3 places in 20 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:32:48] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 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 4041 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 3867 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 8023ms problems are : Problem set: 192 solved, 69 unsolved
Search for dead transitions found 192 dead transitions in 8027ms
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.1 ms
Discarding 92 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 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 8096 ms. Remains : 45/197 places, 70/197 transitions.
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 1 ms. Remains 197 /197 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 197 cols
[2024-05-30 13:32:54] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 13:32:54] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-30 13:32:54] [INFO ] Invariant cache hit.
[2024-05-30 13:32:54] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 13:32:54] [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:32:55] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:32:56] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:32:56] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:32:56] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:32:56] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 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:32:57] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:32:57] [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 7898 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:33:04] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:33:04] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:33:04] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:33:04] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:33:04] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:33:04] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:33:04] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:33:05] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:33:05] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:33:05] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:33:05] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:33:05] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:33:05] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:33:05] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:33:05] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:33:06] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-05-30 13:33:06] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:33:06] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:33:06] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:33:06] [INFO ] Deduced a trap composed of 26 places in 46 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:33:07] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:33:07] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:33:07] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 2 ms to minimize.
[2024-05-30 13:33:07] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:33:07] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:33:08] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:33:08] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:33:08] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:33:08] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 2 ms to minimize.
[2024-05-30 13:33:08] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:33:08] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:33:09] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:33:09] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:33:09] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:33:09] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:33:09] [INFO ] Deduced a trap composed of 25 places in 27 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:33:12] [INFO ] Deduced a trap composed of 20 places in 60 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:33:13] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:33:13] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 2 ms to minimize.
[2024-05-30 13:33:13] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:33:13] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:33:13] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:33:14] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:33:14] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:33:14] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:33:14] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:33:15] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:33:15] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-30 13:33:16] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 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:33:20] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:33:20] [INFO ] Deduced a trap composed of 33 places in 51 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 27163 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 35076ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 35078ms
Finished structural reductions in LTL mode , in 1 iterations and 35270 ms. Remains : 197/197 places, 197/197 transitions.
Treatment of property ShieldRVt-PT-005B-LTLCardinality-07 finished in 115961 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 29 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:33:29] [INFO ] Computed 20 invariants in 0 ms
[2024-05-30 13:33:29] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 13:33:29] [INFO ] Invariant cache hit.
[2024-05-30 13:33:29] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-30 13:33:29] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-05-30 13:33:29] [INFO ] Redundant transitions in 0 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-30 13:33:29] [INFO ] Invariant cache hit.
[2024-05-30 13:33:29] [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:33:30] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:33:30] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 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 923 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 963 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 1907ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1908ms
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 2221 ms. Remains : 46/206 places, 73/206 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-08
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-08 finished in 2270 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 9 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:33:31] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 13:33:32] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 13:33:32] [INFO ] Invariant cache hit.
[2024-05-30 13:33:32] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-30 13:33:32] [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:33:33] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:33:33] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:33:33] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:33:33] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:33:34] [INFO ] Deduced a trap composed of 24 places in 35 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 6739 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:33:40] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:33:41] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:33:41] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:33:41] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:33:41] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-30 13:33:41] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-30 13:33:41] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:33:41] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:33:42] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:33:42] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:33:42] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:33:42] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:33:42] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:33:42] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:33:42] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:33:42] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:33:42] [INFO ] Deduced a trap composed of 33 places in 56 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:33:43] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-30 13:33:43] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:33:44] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:33:44] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:33:44] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:33:44] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:33:44] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:33:44] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:33:45] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:33:45] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:33:45] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:33:45] [INFO ] Deduced a trap composed of 26 places in 44 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:33:47] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:33:47] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:33:47] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:33:47] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:33:47] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:33:48] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:33:48] [INFO ] Deduced a trap composed of 20 places in 56 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:33:52] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:33:53] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:33:53] [INFO ] Deduced a trap composed of 34 places in 57 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:33:57] [INFO ] Deduced a trap composed of 29 places in 60 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:34:01] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:34:01] [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:34:08] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:34:08] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30013 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 36767ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 36769ms
Starting structural reductions in LTL mode, iteration 1 : 196/206 places, 196/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36960 ms. Remains : 196/206 places, 196/206 transitions.
Stuttering acceptance computed with spot in 225 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 1097 reset in 215 ms.
Stack based approach found an accepted trace after 91 steps with 0 reset with depth 92 and stack size 92 in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-09 finished in 37420 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 7 ms. Remains 196 /206 variables (removed 10) and now considering 196/206 (removed 10) transitions.
[2024-05-30 13:34:09] [INFO ] Invariant cache hit.
[2024-05-30 13:34:09] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 13:34:09] [INFO ] Invariant cache hit.
[2024-05-30 13:34:09] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-30 13:34:09] [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:34:10] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:34:11] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:34:11] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:34:11] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:34: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/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 6715 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:34:18] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:34:18] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:34:18] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:34:18] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:34:18] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-30 13:34:18] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:34:18] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:34:18] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-30 13:34:18] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:34:19] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:34:19] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:34:19] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:34:19] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:34:19] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:34:19] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-30 13:34:20] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:34:20] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:34:20] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:34:20] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:34:20] [INFO ] Deduced a trap composed of 33 places in 51 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:34:20] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:34:21] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:34:21] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:34:21] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:34:22] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:34:22] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:34:22] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 2 ms to minimize.
[2024-05-30 13:34:22] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:34:22] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:34:22] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:34:23] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:34:23] [INFO ] Deduced a trap composed of 26 places in 50 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:34:24] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:34:24] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:34:25] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:34:25] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:34:25] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:34:25] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:34:26] [INFO ] Deduced a trap composed of 20 places in 57 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:34:30] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:34:30] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:34:31] [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:34:34] [INFO ] Deduced a trap composed of 29 places in 61 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:34:39] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:34:39] [INFO ] Deduced a trap composed of 26 places in 50 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:34:45] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:34:46] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
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 30016 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 36750ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 36752ms
Starting structural reductions in LTL mode, iteration 1 : 196/206 places, 196/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36938 ms. Remains : 196/206 places, 196/206 transitions.
Stuttering acceptance computed with spot in 162 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
Product exploration explored 100000 steps with 4 reset in 154 ms.
Stack based approach found an accepted trace after 136 steps with 0 reset with depth 137 and stack size 137 in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-10 finished in 37279 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 10 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:34:46] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:34:46] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-30 13:34:46] [INFO ] Invariant cache hit.
[2024-05-30 13:34:46] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-30 13:34:46] [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:34:48] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:34:48] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:34:48] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:34:48] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:34:48] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:34:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:34:48] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:34:48] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:34:49] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:34:49] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 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 6948 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:34:55] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-30 13:34:55] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:34:55] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:34:56] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-30 13:34:56] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-30 13:34:56] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:34:56] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:34:56] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:34:56] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:34:56] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-30 13:34:56] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:34:56] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:34:57] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:34:57] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-30 13:34:57] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:34:57] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:34:57] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:34:57] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-30 13:34:57] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-05-30 13:34:57] [INFO ] Deduced a trap composed of 25 places in 64 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:34:58] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:34:58] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-30 13:34:58] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:34:59] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:34:59] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:34:59] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:35:00] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:35:00] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:35:00] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:35:00] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:35:00] [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:35:02] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:35:02] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:35:02] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:35:02] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:35:02] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:35:03] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:35:03] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:35:03] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 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:35:05] [INFO ] Deduced a trap composed of 22 places in 58 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:35:07] [INFO ] Deduced a trap composed of 28 places in 72 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 23283 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 30268ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 30271ms
Starting structural reductions in LTL mode, iteration 1 : 199/206 places, 199/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30472 ms. Remains : 199/206 places, 199/206 transitions.
Stuttering acceptance computed with spot in 283 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 22 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-005B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLCardinality-14 finished in 30783 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)))))'
Found a Shortening insensitive property : ShieldRVt-PT-005B-LTLCardinality-03
Stuttering acceptance computed with spot in 222 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 206 places. Attempting structural reductions.
Starting structural reductions in LI_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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 205 transition count 156
Reduce places removed 49 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 51 rules applied. Total rules applied 100 place count 156 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 155 transition count 154
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 101 place count 155 transition count 117
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 175 place count 118 transition count 117
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 182 place count 111 transition count 110
Iterating global reduction 3 with 7 rules applied. Total rules applied 189 place count 111 transition count 110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 189 place count 111 transition count 104
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 201 place count 105 transition count 104
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 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 3 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 3 with 2 rules applied. Total rules applied 315 place count 47 transition count 73
Applied a total of 315 rules in 20 ms. Remains 47 /206 variables (removed 159) and now considering 73/206 (removed 133) transitions.
// Phase 1: matrix 73 rows 47 cols
[2024-05-30 13:35:17] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:35:17] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-30 13:35:17] [INFO ] Invariant cache hit.
[2024-05-30 13:35:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-30 13:35:17] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-05-30 13:35:17] [INFO ] Invariant cache hit.
[2024-05-30 13:35:17] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 2/47 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 72/119 variables, 47/68 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/120 variables, and 73 constraints, problems are : Problem set: 0 solved, 67 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 47/47 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 2/47 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 72/119 variables, 47/68 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 67/140 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/120 variables, and 140 constraints, problems are : Problem set: 0 solved, 67 unsolved in 795 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 47/47 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 0/0 constraints]
After SMT, in 1589ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 1589ms
Starting structural reductions in LI_LTL mode, iteration 1 : 47/206 places, 73/206 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1707 ms. Remains : 47/206 places, 73/206 transitions.
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-03
Stuttering criterion allowed to conclude after 198 steps with 78 reset in 0 ms.
Treatment of property ShieldRVt-PT-005B-LTLCardinality-03 finished in 2044 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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)))))'
Found a Shortening insensitive property : ShieldRVt-PT-005B-LTLCardinality-07
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LI_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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 205 transition count 153
Reduce places removed 52 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 54 rules applied. Total rules applied 106 place count 153 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 152 transition count 151
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 107 place count 152 transition count 114
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 181 place count 115 transition count 114
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 188 place count 108 transition count 107
Iterating global reduction 3 with 7 rules applied. Total rules applied 195 place count 108 transition count 107
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 195 place count 108 transition count 101
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 207 place count 102 transition count 101
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 291 place count 60 transition count 59
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 319 place count 46 transition count 71
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 320 place count 46 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 322 place count 44 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 323 place count 43 transition count 69
Applied a total of 323 rules in 28 ms. Remains 43 /206 variables (removed 163) and now considering 69/206 (removed 137) transitions.
// Phase 1: matrix 69 rows 43 cols
[2024-05-30 13:35:19] [INFO ] Computed 20 invariants in 1 ms
[2024-05-30 13:35:19] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 13:35:19] [INFO ] Invariant cache hit.
[2024-05-30 13:35:19] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-30 13:35:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 68/111 variables, 43/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 0/111 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 63 constraints, problems are : Problem set: 0 solved, 65 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 68/111 variables, 43/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 65/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 0/111 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 128 constraints, problems are : Problem set: 0 solved, 65 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 1207ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 1208ms
Starting structural reductions in LI_LTL mode, iteration 1 : 43/206 places, 69/206 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1349 ms. Remains : 43/206 places, 69/206 transitions.
Running random walk in product with property : ShieldRVt-PT-005B-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 166 ms.
Product exploration explored 100000 steps with 25000 reset in 162 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 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 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 743 steps (1 resets) in 17 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 117 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 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 69/69 transitions.
Applied a total of 0 rules in 0 ms. Remains 43 /43 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-05-30 13:35:22] [INFO ] Invariant cache hit.
[2024-05-30 13:35:22] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 13:35:22] [INFO ] Invariant cache hit.
[2024-05-30 13:35:22] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-30 13:35:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 68/111 variables, 43/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 0/111 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 63 constraints, problems are : Problem set: 0 solved, 65 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 68/111 variables, 43/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 65/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 0/111 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 128 constraints, problems are : Problem set: 0 solved, 65 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 1151ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 1152ms
Finished structural reductions in LTL mode , in 1 iterations and 1249 ms. Remains : 43/43 places, 69/69 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 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 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 350 steps (0 resets) in 13 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 84 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 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 196 ms.
Product exploration explored 100000 steps with 25000 reset in 120 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 69/69 transitions.
Applied a total of 0 rules in 13 ms. Remains 43 /43 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-05-30 13:35:24] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-30 13:35:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 68/111 variables, 43/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 0/111 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 63 constraints, problems are : Problem set: 0 solved, 65 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 68/111 variables, 43/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 65/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 0/111 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 128 constraints, problems are : Problem set: 0 solved, 65 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 1168ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 1169ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1187 ms. Remains : 43/43 places, 69/69 transitions.
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 69/69 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-05-30 13:35:26] [INFO ] Invariant cache hit.
[2024-05-30 13:35:26] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 13:35:26] [INFO ] Invariant cache hit.
[2024-05-30 13:35:26] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-30 13:35:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 68/111 variables, 43/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 0/111 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 63 constraints, problems are : Problem set: 0 solved, 65 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 68/111 variables, 43/63 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 65/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 0/111 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 128 constraints, problems are : Problem set: 0 solved, 65 unsolved in 623 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 1189ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 1190ms
Finished structural reductions in LTL mode , in 1 iterations and 1282 ms. Remains : 43/43 places, 69/69 transitions.
Treatment of property ShieldRVt-PT-005B-LTLCardinality-07 finished in 7871 ms.
[2024-05-30 13:35:27] [INFO ] Flatten gal took : 15 ms
[2024-05-30 13:35:27] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-30 13:35:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 206 places, 206 transitions and 502 arcs took 2 ms.
Total runtime 511249 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-005B

IS_COLORED=
IS_NUPN=

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

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

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

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

Process ID: 3908
MODEL NAME: /home/mcc/execution/403/model
206 places, 206 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldRVt-PT-005B-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-005B-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717076743427

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

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

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="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is 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 r355-tall-171683759900955"
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 ;