Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 11:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 13 11:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 13 11:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 69K 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 ShieldPPPs-PT-004B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-004B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-004B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-004B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-004B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-004B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-004B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-004B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-004B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-004B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-004B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-004B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-004B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-004B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-004B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-004B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717242667160

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:51:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:51:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:51:08] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-06-01 11:51:08] [INFO ] Transformed 275 places.
[2024-06-01 11:51:08] [INFO ] Transformed 255 transitions.
[2024-06-01 11:51:08] [INFO ] Found NUPN structural information;
[2024-06-01 11:51:08] [INFO ] Parsed PT model containing 275 places and 255 transitions and 702 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPs-PT-004B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-004B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-004B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-004B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-004B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-004B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-004B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-004B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-004B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-004B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-004B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 255/255 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 252 transition count 232
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 252 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 251 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 251 transition count 231
Applied a total of 48 rules in 72 ms. Remains 251 /275 variables (removed 24) and now considering 231/255 (removed 24) transitions.
// Phase 1: matrix 231 rows 251 cols
[2024-06-01 11:51:08] [INFO ] Computed 45 invariants in 23 ms
[2024-06-01 11:51:09] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-06-01 11:51:09] [INFO ] Invariant cache hit.
[2024-06-01 11:51:09] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2024-06-01 11:51:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:11] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 13 ms to minimize.
[2024-06-01 11:51:11] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-06-01 11:51:11] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:51:12] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:51:12] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:51:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:51:12] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-06-01 11:51:12] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-06-01 11:51:12] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-06-01 11:51:12] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:51:12] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:51:12] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:51:12] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:51:12] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:51:12] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:51:12] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:51:12] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:51:12] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:51:13] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-06-01 11:51:13] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:13] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:51:13] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:51:13] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:51:13] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:51:13] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:51:13] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:51:13] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:51:14] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:51:14] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:51:14] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:51:14] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:51:14] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-06-01 11:51:14] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:51:14] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
[2024-06-01 11:51:14] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 5 ms to minimize.
[2024-06-01 11:51:14] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:51:14] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 11:51:14] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:51:14] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:51:14] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:15] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:51:15] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:51:16] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:51:16] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:51:16] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:51:16] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:51:16] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:51:16] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:51:16] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:51:16] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:51:16] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 2 ms to minimize.
[2024-06-01 11:51:16] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:51:16] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:51:16] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:51:17] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:51:17] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:51:17] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 17/102 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:17] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:51:18] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:51:18] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:51:18] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:51:18] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 11:51:18] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:51:18] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 2 ms to minimize.
[2024-06-01 11:51:18] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:51:18] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 9/111 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:19] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:51:19] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:51:19] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:51:19] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:51:20] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:21] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-06-01 11:51:22] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:23] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:51:23] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:24] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:51:24] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:51:24] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:26] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:51:26] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:51:27] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:51:27] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:28] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:51:28] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:29] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:51:29] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-06-01 11:51:29] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 14 (OVERLAPS) 231/482 variables, 251/383 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:33] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:51:33] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:51:33] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:51:33] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:51:33] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 5/388 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:36] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:51:36] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:51:36] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:51:36] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:51:37] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:51:37] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:51:37] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:51:37] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:38] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:51:38] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:51:38] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:51:38] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:51:38] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 401 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 105/105 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 105/150 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:41] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:51:41] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:51:41] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:42] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:43] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:51:43] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:51:43] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:51:44] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:51:44] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:44] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:51:44] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:51:45] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:51:45] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:51:45] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:46] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:51:46] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:51:46] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:51:46] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:47] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:51:47] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:51:47] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:51:47] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 4/172 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:49] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:51:49] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 11 (OVERLAPS) 231/482 variables, 251/425 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/482 variables, 230/655 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:51:53] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 11:51:53] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-06-01 11:51:53] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:51:53] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 11:51:54] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-01 11:51:54] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-01 11:51:54] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:51:54] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:51:55] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:51:55] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:51:55] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:51:55] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:51:55] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:51:55] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2024-06-01 11:51:55] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:51:55] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:51:56] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:51:56] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:51:56] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:51:56] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/482 variables, 20/675 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-06-01 11:52:01] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:52:01] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:52:02] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:52:02] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:52:02] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-01 11:52:02] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:52:03] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:52:03] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:52:03] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 9/684 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 684 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 158/158 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 251/275 places, 231/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60748 ms. Remains : 251/275 places, 231/255 transitions.
Support contains 25 out of 251 places after structural reductions.
[2024-06-01 11:52:09] [INFO ] Flatten gal took : 42 ms
[2024-06-01 11:52:09] [INFO ] Flatten gal took : 19 ms
[2024-06-01 11:52:09] [INFO ] Input system was already deterministic with 231 transitions.
Support contains 21 out of 251 places (down from 25) after GAL structural reductions.
RANDOM walk for 40000 steps (53 resets) in 645 ms. (61 steps per ms) remains 1/11 properties
BEST_FIRST walk for 21155 steps (4 resets) in 66 ms. (315 steps per ms) remains 0/1 properties
Computed a total of 50 stabilizing places and 50 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F((p1||X(X(F(p0)))))))))'
Support contains 2 out of 251 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 231/231 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 248 transition count 228
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 248 transition count 228
Applied a total of 6 rules in 12 ms. Remains 248 /251 variables (removed 3) and now considering 228/231 (removed 3) transitions.
// Phase 1: matrix 228 rows 248 cols
[2024-06-01 11:52:10] [INFO ] Computed 45 invariants in 6 ms
[2024-06-01 11:52:10] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 11:52:10] [INFO ] Invariant cache hit.
[2024-06-01 11:52:10] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-06-01 11:52:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:52:12] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:52:12] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:52:12] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:52:12] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:52:12] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:52:12] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:52:12] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-06-01 11:52:12] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-06-01 11:52:13] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:52:13] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:52:13] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:52:13] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
[2024-06-01 11:52:13] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:52:13] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:52:13] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:52:13] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:52:13] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 11:52:13] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-06-01 11:52:13] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:52:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:52:14] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:52:14] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:52:14] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:52:14] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:52:14] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:52:14] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:52:14] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:52:14] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-06-01 11:52:14] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:52:14] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:52:14] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:52:14] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:52:14] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:52:15] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:52:15] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:52:15] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:52:15] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:52:15] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:52:15] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:52:15] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:52:16] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:52:16] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:52:17] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:52:17] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:52:17] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:52:17] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:52:17] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:52:17] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:52:17] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 9/94 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:52:18] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 4 ms to minimize.
[2024-06-01 11:52:18] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:52:18] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:52:18] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:52:18] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:52:18] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:52:19] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:52:20] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:52:20] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:52:20] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (OVERLAPS) 228/476 variables, 248/352 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:52:23] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:52:23] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:52:23] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:52:23] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:52:23] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2024-06-01 11:52:24] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
[2024-06-01 11:52:24] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:52:24] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:52:24] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:52:24] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:52:24] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 11/363 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:52:27] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:52:27] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:52:27] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:52:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:52:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:52:27] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:52:27] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:52:27] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:52:27] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:52:28] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:52:28] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:52:28] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:52:28] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:52:28] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:52:28] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:52:28] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:52:28] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:52:28] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:52:28] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:52:28] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 20/383 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:52:29] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:52:29] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:52:29] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:52:29] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/476 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:52:31] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:52:31] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:52:31] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 2 ms to minimize.
[2024-06-01 11:52:31] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 2 ms to minimize.
[2024-06-01 11:52:31] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:52:31] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:52:32] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/476 variables, 7/394 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/476 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:52:36] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:52:36] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:52:36] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:52:36] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:52:37] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/476 variables, 5/399 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:52:38] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:52:38] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:52:38] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:52:38] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:52:38] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 5/404 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/476 variables, and 404 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 111/111 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/248 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/248 variables, 111/156 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:52:42] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:52:42] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:52:42] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:52:42] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:52:42] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:52:42] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:52:42] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:52:43] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:52:43] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:52:43] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:52:43] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:52:44] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:52:44] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 228/476 variables, 248/417 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 227/644 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:52:48] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-01 11:52:48] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-01 11:52:48] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-06-01 11:52:49] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-01 11:52:49] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:52:49] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-06-01 11:52:50] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-06-01 11:52:50] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:52:51] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:52:51] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2024-06-01 11:52:52] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:52:52] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 12/656 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:52:58] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-01 11:52:58] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 11:52:58] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-06-01 11:52:58] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:52:59] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:52:59] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-06-01 11:52:59] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 2 ms to minimize.
[2024-06-01 11:52:59] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:52:59] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:53:00] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:53:00] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-01 11:53:00] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:53:01] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 13/669 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-01 11:53:08] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-06-01 11:53:09] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-06-01 11:53:10] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:53:10] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:53:10] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/476 variables, and 674 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 154/154 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in LTL mode, iteration 1 : 248/251 places, 228/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60365 ms. Remains : 248/251 places, 228/231 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 172 steps with 0 reset in 7 ms.
FORMULA ShieldPPPs-PT-004B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004B-LTLCardinality-00 finished in 60683 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)||X(F(p1)))))'
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 231/231 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 247 transition count 227
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 247 transition count 227
Applied a total of 8 rules in 14 ms. Remains 247 /251 variables (removed 4) and now considering 227/231 (removed 4) transitions.
// Phase 1: matrix 227 rows 247 cols
[2024-06-01 11:53:10] [INFO ] Computed 45 invariants in 1 ms
[2024-06-01 11:53:10] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 11:53:10] [INFO ] Invariant cache hit.
[2024-06-01 11:53:11] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-06-01 11:53:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:53:13] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:53:13] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:53:13] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:53:13] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-06-01 11:53:13] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-06-01 11:53:13] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:53:13] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:53:13] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:53:13] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:53:13] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:53:13] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:53:14] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:53:14] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:53:14] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:53:14] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:53:14] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-01 11:53:14] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 11:53:14] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-06-01 11:53:14] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:14] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2024-06-01 11:53:14] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-06-01 11:53:15] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:53:15] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-06-01 11:53:15] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:53:15] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:53:15] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:53:15] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:53:15] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:53:15] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-06-01 11:53:15] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:53:15] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:53:15] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:53:15] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:53:15] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:53:15] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:53:15] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:53:16] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:53:16] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:53:16] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:17] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:53:17] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:53:17] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:53:17] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:53:17] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:53:18] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:53:18] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:53:18] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:53:18] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:53:18] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 10/95 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:19] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:53:19] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:53:19] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-06-01 11:53:19] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:53:19] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:53:19] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
[2024-06-01 11:53:19] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:53:19] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:20] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:22] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2024-06-01 11:53:22] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:53:22] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-06-01 11:53:22] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:23] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:53:23] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 227/474 variables, 247/357 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:26] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:53:27] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 0 ms to minimize.
[2024-06-01 11:53:27] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:53:28] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:29] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:53:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:32] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:53:32] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:53:32] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:53:32] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:53:32] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:53:32] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:53:32] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:53:32] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:53:32] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:53:32] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:53:33] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:53:33] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:53:33] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:53:33] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:53:33] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:53:33] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 16/379 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:34] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:53:34] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:53:35] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:53:35] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 4/383 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:39] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:53:39] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:53:39] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:53:39] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:53:39] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:53:39] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:53:39] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:53:39] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:53:39] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:53:39] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:53:39] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:53:40] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:53:40] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:53:40] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:53:40] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:53:40] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:53:40] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/474 variables, and 400 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 108/153 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:42] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:53:42] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:53:42] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:53:43] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:43] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:44] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:53:45] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:53:45] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:46] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:53:46] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:53:46] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:53:46] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:47] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:53:47] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (OVERLAPS) 227/474 variables, 247/414 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 226/640 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:53:53] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-06-01 11:53:53] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:53:54] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:53:54] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:53:54] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:53:54] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:53:55] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 7/647 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:54:03] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-06-01 11:54:03] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:54:03] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:54:03] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:54:03] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:54:03] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:54:03] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:54:03] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:54:04] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:54:05] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:54:05] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:54:05] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:54:05] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:54:06] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:54:06] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 15/662 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/474 variables, and 662 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 144/144 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 247/251 places, 227/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60349 ms. Remains : 247/251 places, 227/231 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLCardinality-01
Product exploration explored 100000 steps with 11452 reset in 254 ms.
Product exploration explored 100000 steps with 11523 reset in 198 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Detected a total of 48/247 stabilizing places and 48/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 172 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 46 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 141 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 11:54:12] [INFO ] Invariant cache hit.
[2024-06-01 11:54:12] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-06-01 11:54:12] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2024-06-01 11:54:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:54:13] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-06-01 11:54:13] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-06-01 11:54:13] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:54:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-06-01 11:54:13] [INFO ] Computed and/alt/rep : 226/399/226 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 11:54:14] [INFO ] Added : 143 causal constraints over 30 iterations in 819 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 247 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 227/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 247 /247 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-06-01 11:54:14] [INFO ] Invariant cache hit.
[2024-06-01 11:54:14] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 11:54:14] [INFO ] Invariant cache hit.
[2024-06-01 11:54:14] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-06-01 11:54:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/247 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:54:16] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-06-01 11:54:16] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:54:16] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2024-06-01 11:54:16] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:54:17] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-01 11:54:17] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-01 11:54:17] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:54:17] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:54:17] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:54:17] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:54:17] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:54:17] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:54:17] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:54:17] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:54:17] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:54:17] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:54:17] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-06-01 11:54:18] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-01 11:54:18] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:54:18] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:54:18] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:54:18] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:54:18] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2024-06-01 11:54:18] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-06-01 11:54:18] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:54:18] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-06-01 11:54:18] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:54:19] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:54:19] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-06-01 11:54:19] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 11:54:19] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:54:19] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:54:19] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:54:19] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:54:19] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:54:19] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 11:54:19] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-06-01 11:54:19] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:54:19] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:54:20] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:54:21] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 3 ms to minimize.
[2024-06-01 11:54:21] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:54:21] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:54:21] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:54:21] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:54:21] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 11:54:21] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-01 11:54:22] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:54:22] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:54:22] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 10/95 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:54:22] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:54:22] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:54:23] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-06-01 11:54:23] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:54:23] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 19 ms to minimize.
[2024-06-01 11:54:23] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 0 ms to minimize.
[2024-06-01 11:54:23] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:54:23] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:54:24] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:54:26] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:54:26] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:54:26] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:54:26] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:54:27] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:54:27] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 227/474 variables, 247/357 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:54:30] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:54:31] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:54:31] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:54:32] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:54:33] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:54:33] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:54:35] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:54:35] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:54:35] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:54:35] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:54:35] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:54:36] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:54:36] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:54:36] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:54:36] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:54:36] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:54:36] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:54:37] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:54:37] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:54:37] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:54:37] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:54:37] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 16/379 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:54:37] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:54:38] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:54:39] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:54:39] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 4/383 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-01 11:54:43] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:54:43] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:54:43] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:54:43] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:54:43] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:54:43] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:54:43] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-06-01 11:54:43] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:54:43] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:54:43] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:54:43] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:54:44] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:54:44] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:54:44] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:54:44] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:54:44] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:54:44] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
SMT process timed out in 30070ms, After SMT, problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 30072ms
Finished structural reductions in LTL mode , in 1 iterations and 30522 ms. Remains : 247/247 places, 227/227 transitions.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-06-01 11:54:45] [INFO ] Invariant cache hit.
[2024-06-01 11:54:45] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-06-01 11:54:45] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2024-06-01 11:54:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:54:45] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-06-01 11:54:45] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-06-01 11:54:46] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:54:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-06-01 11:54:46] [INFO ] Computed and/alt/rep : 226/399/226 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 11:54:46] [INFO ] Added : 143 causal constraints over 30 iterations in 756 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 11659 reset in 107 ms.
Product exploration explored 100000 steps with 11504 reset in 170 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 227/227 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 247 transition count 227
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 29 place count 247 transition count 228
Deduced a syphon composed of 38 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 247 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 246 transition count 227
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 246 transition count 227
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 118 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 120 place count 246 transition count 227
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 150 place count 216 transition count 197
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 180 place count 216 transition count 197
Deduced a syphon composed of 88 places in 1 ms
Applied a total of 180 rules in 79 ms. Remains 216 /247 variables (removed 31) and now considering 197/227 (removed 30) transitions.
[2024-06-01 11:54:47] [INFO ] Redundant transitions in 6 ms returned []
Running 196 sub problems to find dead transitions.
// Phase 1: matrix 197 rows 216 cols
[2024-06-01 11:54:47] [INFO ] Computed 45 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 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 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 TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 20/65 constraints. Problems are: Problem set: 63 solved, 133 unsolved
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-06-01 11:54:49] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-06-01 11:54:50] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-06-01 11:54:50] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-06-01 11:54:50] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 11:54:50] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
[2024-06-01 11:54:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
[2024-06-01 11:54:50] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-06-01 11:54:50] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:54:50] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
[2024-06-01 11:54:50] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
[2024-06-01 11:54:50] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:54:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD152 is UNSAT
[2024-06-01 11:54:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD173 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 17/82 constraints. Problems are: Problem set: 89 solved, 107 unsolved
[2024-06-01 11:54:51] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/83 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/83 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 197/413 variables, 216/299 constraints. Problems are: Problem set: 89 solved, 107 unsolved
[2024-06-01 11:54:52] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:54:52] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:54:52] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 3/302 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/302 constraints. Problems are: Problem set: 89 solved, 107 unsolved
[2024-06-01 11:54:54] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/413 variables, 1/303 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 0/303 constraints. Problems are: Problem set: 89 solved, 107 unsolved
[2024-06-01 11:54:56] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/413 variables, 1/304 constraints. Problems are: Problem set: 89 solved, 107 unsolved
[2024-06-01 11:54:56] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 1/305 constraints. Problems are: Problem set: 89 solved, 107 unsolved
[2024-06-01 11:54:57] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:54:58] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 2/307 constraints. Problems are: Problem set: 89 solved, 107 unsolved
[2024-06-01 11:54:58] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 1/308 constraints. Problems are: Problem set: 89 solved, 107 unsolved
[2024-06-01 11:54:59] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:54:59] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:54:59] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:54:59] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:54:59] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:54:59] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:54:59] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-06-01 11:54:59] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 8/316 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/413 variables, 0/316 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 17 (OVERLAPS) 0/413 variables, 0/316 constraints. Problems are: Problem set: 89 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 316 constraints, problems are : Problem set: 89 solved, 107 unsolved in 14362 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 89 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 89/216 variables, 45/45 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 55/100 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/100 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 197/413 variables, 216/316 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 107/423 constraints. Problems are: Problem set: 89 solved, 107 unsolved
[2024-06-01 11:55:04] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 1/424 constraints. Problems are: Problem set: 89 solved, 107 unsolved
[2024-06-01 11:55:06] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 1/425 constraints. Problems are: Problem set: 89 solved, 107 unsolved
[2024-06-01 11:55:09] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 1/426 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/426 constraints. Problems are: Problem set: 89 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/413 variables, 0/426 constraints. Problems are: Problem set: 89 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 426 constraints, problems are : Problem set: 89 solved, 107 unsolved in 15988 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 107/196 constraints, Known Traps: 58/58 constraints]
After SMT, in 30380ms problems are : Problem set: 89 solved, 107 unsolved
Search for dead transitions found 89 dead transitions in 30384ms
Found 89 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 89 transitions
Dead transitions reduction (with SMT) removed 89 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 216/247 places, 108/227 transitions.
Graph (complete) has 332 edges and 216 vertex of which 128 are kept as prefixes of interest. Removing 88 places using SCC suffix rule.4 ms
Discarding 88 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 128 /216 variables (removed 88) and now considering 108/108 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/247 places, 108/227 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30492 ms. Remains : 128/247 places, 108/227 transitions.
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 247/247 places, 227/227 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 246 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 246 transition count 226
Applied a total of 2 rules in 8 ms. Remains 246 /247 variables (removed 1) and now considering 226/227 (removed 1) transitions.
// Phase 1: matrix 226 rows 246 cols
[2024-06-01 11:55:18] [INFO ] Computed 45 invariants in 3 ms
[2024-06-01 11:55:18] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 11:55:18] [INFO ] Invariant cache hit.
[2024-06-01 11:55:18] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-06-01 11:55:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:20] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:55:20] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:55:20] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:55:20] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:55:20] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:55:20] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:55:20] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 11:55:20] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-06-01 11:55:20] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-06-01 11:55:20] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:55:20] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 2 ms to minimize.
[2024-06-01 11:55:20] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:55:21] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:55:21] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:55:21] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:55:21] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-06-01 11:55:21] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:55:21] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:55:21] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:55:21] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:21] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:55:21] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:55:22] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:24] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:55:24] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:55:24] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:55:24] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-06-01 11:55:24] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:55:24] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:55:25] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:55:25] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:55:25] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:55:25] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/472 variables, 246/339 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:28] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:55:28] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:55:28] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:55:28] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:55:28] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:55:28] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:55:29] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-06-01 11:55:29] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:55:29] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:55:29] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:55:29] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 11/350 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:31] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:55:31] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:55:31] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 3/353 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:32] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:55:32] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:55:32] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:55:32] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:55:33] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:55:33] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:55:33] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:55:33] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:55:33] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:55:33] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:55:33] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:55:33] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:55:33] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:55:33] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:55:33] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 15/368 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:36] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 11:55:36] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:55:36] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/472 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:42] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:55:42] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:55:42] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:55:43] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:55:43] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:55:43] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:55:43] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 2 ms to minimize.
[2024-06-01 11:55:43] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:55:43] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:55:43] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:55:43] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:55:43] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:55:43] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:55:43] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:55:44] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:55:44] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:55:44] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:55:44] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:55:44] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:55:44] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:44] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:55:45] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:55:45] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:55:45] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 4/398 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:55:47] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:55:47] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:55:47] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:55:47] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:55:48] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/472 variables, 6/404 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/472 variables, and 404 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/246 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:49] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:55:51] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:55:51] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:51] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:52] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:55:53] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:55:53] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:55:53] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:55:53] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:55:53] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:54] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:55:54] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:55:54] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:55:54] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:55:54] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 5/190 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:56] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:55:56] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:55:56] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:55:56] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:55:56] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:55:56] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:55:56] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:55:56] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:55:56] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:55:56] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:55:56] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:55:57] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:55:57] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 13/203 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-06-01 11:55:59] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:56:04] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:56:07] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 11:56:07] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:56:11] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-01 11:56:15] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:56:15] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:56:15] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:56:15] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:56:15] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/472 variables, and 215 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 0/246 constraints, PredecessorRefiner: 0/225 constraints, Known Traps: 170/170 constraints]
After SMT, in 60044ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 60047ms
Starting structural reductions in LTL mode, iteration 1 : 246/247 places, 226/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60297 ms. Remains : 246/247 places, 226/227 transitions.
Treatment of property ShieldPPPs-PT-004B-LTLCardinality-01 finished in 187494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&G(F(p2))))'
Support contains 6 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 231/231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 250 transition count 203
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 56 place count 223 transition count 201
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 221 transition count 201
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 58 place count 221 transition count 182
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 96 place count 202 transition count 182
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 100 place count 198 transition count 178
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 198 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 104 place count 198 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 197 transition count 177
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 230 place count 135 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 232 place count 133 transition count 113
Applied a total of 232 rules in 35 ms. Remains 133 /251 variables (removed 118) and now considering 113/231 (removed 118) transitions.
// Phase 1: matrix 113 rows 133 cols
[2024-06-01 11:56:18] [INFO ] Computed 45 invariants in 2 ms
[2024-06-01 11:56:18] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 11:56:18] [INFO ] Invariant cache hit.
[2024-06-01 11:56:18] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-06-01 11:56:18] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2024-06-01 11:56:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 3/133 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:56:19] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 113/246 variables, 133/192 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 11:56:20] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:56:21] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 11:56:22] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/246 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 11:56:23] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/246 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 11:56:24] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/246 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 15 (OVERLAPS) 0/246 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 197 constraints, problems are : Problem set: 0 solved, 110 unsolved in 7445 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 3/133 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 113/246 variables, 133/197 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 110/307 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 11:56:27] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:56:27] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:56:27] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:56:27] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:56:27] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 312 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5177 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 12633ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 12634ms
Starting structural reductions in SI_LTL mode, iteration 1 : 133/251 places, 113/231 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12837 ms. Remains : 133/251 places, 113/231 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLCardinality-06
Product exploration explored 100000 steps with 315 reset in 252 ms.
Product exploration explored 100000 steps with 315 reset in 246 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 266 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (124 resets) in 302 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 15637 steps (6 resets) in 50 ms. (306 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 329 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
Support contains 4 out of 133 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-06-01 11:56:32] [INFO ] Invariant cache hit.
[2024-06-01 11:56:33] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 11:56:33] [INFO ] Invariant cache hit.
[2024-06-01 11:56:33] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-06-01 11:56:33] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2024-06-01 11:56:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 11:56:33] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 3/133 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:56:34] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 113/246 variables, 133/192 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 11:56:35] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:56:35] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 11:56:36] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/246 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 11:56:38] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/246 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 11:56:39] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/246 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 15 (OVERLAPS) 0/246 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 197 constraints, problems are : Problem set: 0 solved, 110 unsolved in 7347 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 3/133 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 113/246 variables, 133/197 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 110/307 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-01 11:56:41] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:56:41] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:56:41] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:56:41] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:56:41] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 312 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5174 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 24/24 constraints]
After SMT, in 12533ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 12534ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12742 ms. Remains : 133/133 places, 113/113 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (124 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 13932 steps (6 resets) in 31 ms. (435 steps per ms) remains 0/1 properties
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 312 reset in 227 ms.
Product exploration explored 100000 steps with 316 reset in 248 ms.
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 113/113 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 130 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 129 transition count 109
Applied a total of 5 rules in 9 ms. Remains 129 /133 variables (removed 4) and now considering 109/113 (removed 4) transitions.
// Phase 1: matrix 109 rows 129 cols
[2024-06-01 11:56:46] [INFO ] Computed 45 invariants in 1 ms
[2024-06-01 11:56:46] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 11:56:46] [INFO ] Invariant cache hit.
[2024-06-01 11:56:47] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-06-01 11:56:47] [INFO ] Redundant transitions in 0 ms returned []
Running 107 sub problems to find dead transitions.
[2024-06-01 11:56:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 11:56:47] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 2/129 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 11:56:48] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:56:48] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 11:56:48] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:56:48] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 109/238 variables, 129/179 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 11:56:49] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:56:49] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:56:49] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/238 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 11:56:50] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (OVERLAPS) 0/238 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 183 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4748 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 2/129 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 109/238 variables, 129/183 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 107/290 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 11:56:53] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 11:56:54] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:56:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:56:55] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-06-01 11:57:02] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/238 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 295 constraints, problems are : Problem set: 0 solved, 107 unsolved in 24881 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 14/14 constraints]
After SMT, in 29653ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 29654ms
Starting structural reductions in SI_LTL mode, iteration 1 : 129/133 places, 109/113 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29877 ms. Remains : 129/133 places, 109/113 transitions.
Treatment of property ShieldPPPs-PT-004B-LTLCardinality-06 finished in 58347 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 U (X(F(!p2))||p1)))))'
Support contains 6 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 231/231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 250 transition count 201
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 221 transition count 201
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 58 place count 221 transition count 180
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 100 place count 200 transition count 180
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 196 transition count 176
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 196 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 108 place count 196 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 195 transition count 175
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 234 place count 133 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 132 transition count 112
Applied a total of 235 rules in 22 ms. Remains 132 /251 variables (removed 119) and now considering 112/231 (removed 119) transitions.
// Phase 1: matrix 112 rows 132 cols
[2024-06-01 11:57:16] [INFO ] Computed 45 invariants in 1 ms
[2024-06-01 11:57:16] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 11:57:16] [INFO ] Invariant cache hit.
[2024-06-01 11:57:16] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-06-01 11:57:16] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 11:57:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 4/132 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 11:57:17] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:57:17] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-06-01 11:57:17] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:57:17] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:57:17] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:57:17] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 11:57:18] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:57:18] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:57:18] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:57:18] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 112/244 variables, 132/187 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/244 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 187 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2994 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 4/132 variables, 30/50 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 112/244 variables, 132/187 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 108/295 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 11:57:21] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:57:21] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:57:21] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:57:21] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:57:21] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/244 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 300 constraints, problems are : Problem set: 0 solved, 108 unsolved in 11592 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 15/15 constraints]
After SMT, in 14602ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 14603ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/251 places, 112/231 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14799 ms. Remains : 132/251 places, 112/231 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLCardinality-11
Product exploration explored 100000 steps with 731 reset in 322 ms.
Product exploration explored 100000 steps with 801 reset in 275 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (OR (AND p1 p2) (AND p0 p2))), (X (NOT (OR (AND p1 p2) (AND p0 p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (OR (AND p1 p2) (AND p0 p2)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
Knowledge based reduction with 2 factoid took 713 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
RANDOM walk for 2276 steps (7 resets) in 21 ms. (103 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (OR (AND p1 p2) (AND p0 p2))), (X (NOT (OR (AND p1 p2) (AND p0 p2)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (OR (AND p1 p2) (AND p0 p2)))), (X (X (NOT (OR (AND p1 p2) (AND p0 p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR (AND p0 p2) (AND p1 p2))))]
Knowledge based reduction with 2 factoid took 951 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Support contains 6 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 112/112 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-06-01 11:57:34] [INFO ] Invariant cache hit.
[2024-06-01 11:57:34] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 11:57:34] [INFO ] Invariant cache hit.
[2024-06-01 11:57:34] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-06-01 11:57:34] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 11:57:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 4/132 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 11:57:35] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:57:35] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:57:35] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:57:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:57:35] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:57:35] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 11:57:36] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:57:36] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:57:36] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:57:36] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 112/244 variables, 132/187 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/244 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 187 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3052 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 4/132 variables, 30/50 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 112/244 variables, 132/187 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 108/295 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 11:57:39] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:57:39] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:57:39] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:57:39] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:57:39] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/244 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 300 constraints, problems are : Problem set: 0 solved, 108 unsolved in 11555 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 15/15 constraints]
After SMT, in 14625ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 14626ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14867 ms. Remains : 132/132 places, 112/112 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND p0 p2) (AND p1 p2))), (X (NOT (OR (AND p0 p2) (AND p1 p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 734 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
RANDOM walk for 2105 steps (7 resets) in 20 ms. (100 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (OR (AND p0 p2) (AND p1 p2))), (X (NOT (OR (AND p0 p2) (AND p1 p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p0 p2) (AND p1 p2)))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR (AND p0 p2) (AND p1 p2))))]
Knowledge based reduction with 2 factoid took 879 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 735 reset in 243 ms.
Product exploration explored 100000 steps with 686 reset in 269 ms.
Support contains 6 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-06-01 11:57:52] [INFO ] Invariant cache hit.
[2024-06-01 11:57:52] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 11:57:52] [INFO ] Invariant cache hit.
[2024-06-01 11:57:52] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-06-01 11:57:52] [INFO ] Redundant transitions in 0 ms returned []
Running 108 sub problems to find dead transitions.
[2024-06-01 11:57:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 4/132 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 11:57:52] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:57:52] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 3 ms to minimize.
[2024-06-01 11:57:52] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:57:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:57:53] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:57:53] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 11:57:53] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:57:53] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:57:53] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:57:53] [INFO ] Deduced a trap composed of 59 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 112/244 variables, 132/187 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/244 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 187 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2983 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 4/132 variables, 30/50 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 112/244 variables, 132/187 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 108/295 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 11:57:56] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:57:56] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:57:56] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:57:56] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:57:56] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/244 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 300 constraints, problems are : Problem set: 0 solved, 108 unsolved in 11856 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 15/15 constraints]
After SMT, in 14849ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 14851ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15025 ms. Remains : 132/132 places, 112/112 transitions.
Treatment of property ShieldPPPs-PT-004B-LTLCardinality-11 finished in 50342 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 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 231/231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 250 transition count 201
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 221 transition count 201
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 58 place count 221 transition count 181
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 98 place count 201 transition count 181
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 102 place count 197 transition count 177
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 197 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 106 place count 197 transition count 176
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 196 transition count 176
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 244 place count 128 transition count 108
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 246 place count 126 transition count 106
Applied a total of 246 rules in 19 ms. Remains 126 /251 variables (removed 125) and now considering 106/231 (removed 125) transitions.
// Phase 1: matrix 106 rows 126 cols
[2024-06-01 11:58:07] [INFO ] Computed 45 invariants in 1 ms
[2024-06-01 11:58:07] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 11:58:07] [INFO ] Invariant cache hit.
[2024-06-01 11:58:07] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-06-01 11:58:07] [INFO ] Redundant transitions in 1 ms returned []
Running 103 sub problems to find dead transitions.
[2024-06-01 11:58:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 11:58:07] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:58:07] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:58:07] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:58:07] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 106/232 variables, 126/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 11:58:08] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/232 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 176 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2838 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 106/232 variables, 126/176 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 103/279 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 11:58:13] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:58:13] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/232 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/232 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 281 constraints, problems are : Problem set: 0 solved, 103 unsolved in 16024 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 7/7 constraints]
After SMT, in 18873ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 18875ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/251 places, 106/231 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19068 ms. Remains : 126/251 places, 106/231 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-004B-LTLCardinality-13
Stuttering criterion allowed to conclude after 262 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-004B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004B-LTLCardinality-13 finished in 19130 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)||X(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&G(F(p2))))'
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 U (X(F(!p2))||p1)))))'
[2024-06-01 11:58:26] [INFO ] Flatten gal took : 17 ms
[2024-06-01 11:58:26] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 11:58:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 251 places, 231 transitions and 654 arcs took 2 ms.
Total runtime 438218 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ShieldPPPs-PT-004B-LTLCardinality-01
FORMULA ShieldPPPs-PT-004B-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPs-PT-004B-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717243492706

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldPPPs-PT-004B-LTLCardinality-01
ltl formula formula --ltl=/tmp/4098/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 251 places, 231 transitions and 654 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4098/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4098/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4098/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4098/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 253 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 252, there are 251 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~135 levels ~10000 states ~22176 transitions
pnml2lts-mc( 3/ 4): ~135 levels ~20000 states ~47396 transitions
pnml2lts-mc( 3/ 4): ~138 levels ~40000 states ~95864 transitions
pnml2lts-mc( 3/ 4): ~138 levels ~80000 states ~203608 transitions
pnml2lts-mc( 3/ 4): ~138 levels ~160000 states ~434460 transitions
pnml2lts-mc( 3/ 4): ~138 levels ~320000 states ~919976 transitions
pnml2lts-mc( 3/ 4): ~154 levels ~640000 states ~1837644 transitions
pnml2lts-mc( 3/ 4): ~154 levels ~1280000 states ~3836332 transitions
pnml2lts-mc( 3/ 4): ~154 levels ~2560000 states ~8264000 transitions
pnml2lts-mc( 2/ 4): ~160 levels ~5120000 states ~18302372 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8154904
pnml2lts-mc( 0/ 4): unique states count: 8155405
pnml2lts-mc( 0/ 4): unique transitions count: 29749234
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 21592248
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8155437
pnml2lts-mc( 0/ 4): - cum. max stack depth: 621
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8155437 states 29749370 transitions, fanout: 3.648
pnml2lts-mc( 0/ 4): Total exploration time 38.360 sec (38.350 sec minimum, 38.353 sec on average)
pnml2lts-mc( 0/ 4): States per second: 212603, Transitions per second: 775531
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 126.2MB, 16.2 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 24.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 231 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 126.2MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-004B-LTLCardinality-06
ltl formula formula --ltl=/tmp/4098/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 251 places, 231 transitions and 654 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4098/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4098/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4098/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4098/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 253 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 252, there are 317 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~557 levels ~10000 states ~38928 transitions
pnml2lts-mc( 0/ 4): ~557 levels ~20000 states ~79444 transitions
pnml2lts-mc( 0/ 4): ~557 levels ~40000 states ~170012 transitions
pnml2lts-mc( 0/ 4): ~557 levels ~80000 states ~348816 transitions
pnml2lts-mc( 0/ 4): ~557 levels ~160000 states ~768396 transitions
pnml2lts-mc( 0/ 4): ~557 levels ~320000 states ~1631908 transitions
pnml2lts-mc( 0/ 4): ~558 levels ~640000 states ~3376580 transitions
pnml2lts-mc( 0/ 4): ~558 levels ~1280000 states ~6954160 transitions
pnml2lts-mc( 0/ 4): ~558 levels ~2560000 states ~15172536 transitions
pnml2lts-mc( 0/ 4): ~558 levels ~5120000 states ~30953300 transitions
pnml2lts-mc( 0/ 4): ~558 levels ~10240000 states ~66059256 transitions
pnml2lts-mc( 0/ 4): ~558 levels ~20480000 states ~139812672 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33523465
pnml2lts-mc( 0/ 4): unique states count: 33530933
pnml2lts-mc( 0/ 4): unique transitions count: 240792405
pnml2lts-mc( 0/ 4): - self-loop count: 165
pnml2lts-mc( 0/ 4): - claim dead count: 207231862
pnml2lts-mc( 0/ 4): - claim found count: 5052
pnml2lts-mc( 0/ 4): - claim success count: 33530942
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7508
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33530942 states 240792427 transitions, fanout: 7.181
pnml2lts-mc( 0/ 4): Total exploration time 151.590 sec (151.570 sec minimum, 151.580 sec on average)
pnml2lts-mc( 0/ 4): States per second: 221195, Transitions per second: 1588445
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 283.3MB, 8.9 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/42.0%
pnml2lts-mc( 0/ 4): Stored 231 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 283.3MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-004B-LTLCardinality-11
ltl formula formula --ltl=/tmp/4098/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 251 places, 231 transitions and 654 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4098/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4098/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4098/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4098/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 252 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 252, there are 416 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~479 levels ~10000 states ~37840 transitions
pnml2lts-mc( 3/ 4): ~479 levels ~20000 states ~78572 transitions
pnml2lts-mc( 3/ 4): ~479 levels ~40000 states ~159632 transitions
pnml2lts-mc( 3/ 4): ~538 levels ~80000 states ~310868 transitions
pnml2lts-mc( 3/ 4): ~538 levels ~160000 states ~685604 transitions
pnml2lts-mc( 3/ 4): ~538 levels ~320000 states ~1550356 transitions
pnml2lts-mc( 3/ 4): ~672 levels ~640000 states ~3292580 transitions
pnml2lts-mc( 3/ 4): ~806 levels ~1280000 states ~7271588 transitions
pnml2lts-mc( 3/ 4): ~3417 levels ~2560000 states ~14965352 transitions
pnml2lts-mc( 3/ 4): ~3417 levels ~5120000 states ~30809024 transitions
pnml2lts-mc( 3/ 4): ~6630 levels ~10240000 states ~66406324 transitions
pnml2lts-mc( 3/ 4): ~12480 levels ~20480000 states ~138485524 transitions
pnml2lts-mc( 3/ 4): ~18559 levels ~40960000 states ~279612104 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33473371
pnml2lts-mc( 0/ 4): unique states count: 33503429
pnml2lts-mc( 0/ 4): unique transitions count: 580155301
pnml2lts-mc( 0/ 4): - self-loop count: 696
pnml2lts-mc( 0/ 4): - claim dead count: 546520608
pnml2lts-mc( 0/ 4): - claim found count: 32895
pnml2lts-mc( 0/ 4): - claim success count: 33503439
pnml2lts-mc( 0/ 4): - cum. max stack depth: 29374
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33503439 states 580155324 transitions, fanout: 17.316
pnml2lts-mc( 0/ 4): Total exploration time 194.390 sec (194.350 sec minimum, 194.370 sec on average)
pnml2lts-mc( 0/ 4): States per second: 172352, Transitions per second: 2984492
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 301.3MB, 9.4 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/70.0%
pnml2lts-mc( 0/ 4): Stored 231 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 301.3MB (~256.0MB paged-in)

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="ShieldPPPs-PT-004B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPs-PT-004B, 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 r528-tall-171683761000411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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