Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 17:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 17:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 17:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 17:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 122K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717044237083

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 04:43:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 04:43:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 04:43:58] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-30 04:43:58] [INFO ] Transformed 403 places.
[2024-05-30 04:43:58] [INFO ] Transformed 453 transitions.
[2024-05-30 04:43:58] [INFO ] Found NUPN structural information;
[2024-05-30 04:43:58] [INFO ] Parsed PT model containing 403 places and 453 transitions and 1440 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-010B-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 114 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 453/453 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 365 transition count 415
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 365 transition count 415
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 364 transition count 414
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 364 transition count 414
Applied a total of 78 rules in 67 ms. Remains 364 /403 variables (removed 39) and now considering 414/453 (removed 39) transitions.
// Phase 1: matrix 414 rows 364 cols
[2024-05-30 04:43:58] [INFO ] Computed 41 invariants in 30 ms
[2024-05-30 04:43:58] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-30 04:43:58] [INFO ] Invariant cache hit.
[2024-05-30 04:43:59] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2024-05-30 04:43:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (OVERLAPS) 1/364 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:04] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 14 ms to minimize.
[2024-05-30 04:44:05] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 2 ms to minimize.
[2024-05-30 04:44:05] [INFO ] Deduced a trap composed of 62 places in 163 ms of which 2 ms to minimize.
[2024-05-30 04:44:05] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 2 ms to minimize.
[2024-05-30 04:44:05] [INFO ] Deduced a trap composed of 47 places in 264 ms of which 3 ms to minimize.
[2024-05-30 04:44:05] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 2 ms to minimize.
[2024-05-30 04:44:05] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 12 ms to minimize.
[2024-05-30 04:44:05] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-30 04:44:06] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-05-30 04:44:06] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-30 04:44:06] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-30 04:44:06] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-30 04:44:06] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-30 04:44:06] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 2 ms to minimize.
[2024-05-30 04:44:06] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-30 04:44:06] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-30 04:44:07] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2024-05-30 04:44:07] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
[2024-05-30 04:44:07] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
[2024-05-30 04:44:07] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:08] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2024-05-30 04:44:08] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-30 04:44:08] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-05-30 04:44:08] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-30 04:44:08] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-30 04:44:08] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-30 04:44:08] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-30 04:44:08] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-30 04:44:08] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-05-30 04:44:08] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-30 04:44:09] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-05-30 04:44:09] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-05-30 04:44:09] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-30 04:44:09] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 3 ms to minimize.
[2024-05-30 04:44:09] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 4 ms to minimize.
[2024-05-30 04:44:09] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-30 04:44:09] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-30 04:44:09] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-05-30 04:44:09] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 3 ms to minimize.
[2024-05-30 04:44:10] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:12] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-30 04:44:12] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-30 04:44:12] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-05-30 04:44:12] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-30 04:44:12] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-05-30 04:44:12] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-30 04:44:13] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 04:44:13] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-30 04:44:13] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-05-30 04:44:13] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-05-30 04:44:13] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 2 ms to minimize.
[2024-05-30 04:44:13] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2024-05-30 04:44:13] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-05-30 04:44:13] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 04:44:13] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:44:13] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-30 04:44:13] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 18 ms to minimize.
[2024-05-30 04:44:13] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-05-30 04:44:14] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-05-30 04:44:14] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:14] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 4 ms to minimize.
[2024-05-30 04:44:14] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-05-30 04:44:14] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-30 04:44:14] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 4 ms to minimize.
[2024-05-30 04:44:15] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-30 04:44:15] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 4 ms to minimize.
[2024-05-30 04:44:15] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-05-30 04:44:15] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-30 04:44:15] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-05-30 04:44:15] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 2 ms to minimize.
[2024-05-30 04:44:15] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-05-30 04:44:15] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-05-30 04:44:15] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-30 04:44:15] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-30 04:44:15] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-30 04:44:15] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
[2024-05-30 04:44:16] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-30 04:44:16] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-30 04:44:16] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2024-05-30 04:44:16] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:16] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-30 04:44:16] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-30 04:44:16] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-30 04:44:16] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 2 ms to minimize.
[2024-05-30 04:44:16] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-30 04:44:16] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 04:44:16] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-30 04:44:16] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-30 04:44:16] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-30 04:44:16] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-30 04:44:17] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-30 04:44:17] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 2 ms to minimize.
[2024-05-30 04:44:17] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-30 04:44:17] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-30 04:44:17] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-30 04:44:17] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-30 04:44:17] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-30 04:44:17] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-30 04:44:17] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-05-30 04:44:17] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:20] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-30 04:44:20] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-05-30 04:44:20] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 2 ms to minimize.
[2024-05-30 04:44:20] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-05-30 04:44:20] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 2 ms to minimize.
[2024-05-30 04:44:20] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 2 ms to minimize.
[2024-05-30 04:44:20] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 2 ms to minimize.
[2024-05-30 04:44:21] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-30 04:44:21] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-30 04:44:21] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-30 04:44:21] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-30 04:44:21] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 3 ms to minimize.
[2024-05-30 04:44:21] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-05-30 04:44:21] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-30 04:44:21] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-30 04:44:22] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-30 04:44:22] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2024-05-30 04:44:22] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-30 04:44:22] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-30 04:44:22] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:22] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-05-30 04:44:23] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
[2024-05-30 04:44:23] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-05-30 04:44:23] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-30 04:44:23] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-05-30 04:44:23] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
[2024-05-30 04:44:23] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 2 ms to minimize.
[2024-05-30 04:44:23] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-30 04:44:23] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-05-30 04:44:23] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 2 ms to minimize.
[2024-05-30 04:44:23] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-05-30 04:44:23] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-30 04:44:23] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-30 04:44:24] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-30 04:44:24] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-30 04:44:24] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-05-30 04:44:24] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:44:24] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 04:44:24] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-30 04:44:24] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:24] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-30 04:44:24] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 1 ms to minimize.
[2024-05-30 04:44:25] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 3 ms to minimize.
[2024-05-30 04:44:25] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-30 04:44:25] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 1 ms to minimize.
[2024-05-30 04:44:25] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-30 04:44:26] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-30 04:44:26] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-30 04:44:26] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-30 04:44:26] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-30 04:44:26] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:44:26] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-30 04:44:26] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 2 ms to minimize.
[2024-05-30 04:44:26] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-30 04:44:26] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-30 04:44:26] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:44:26] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-30 04:44:26] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-30 04:44:26] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-30 04:44:27] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/778 variables, and 201 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/364 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 160/160 constraints]
Escalating to Integer solving :Problem set: 0 solved, 413 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (OVERLAPS) 1/364 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 160/201 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:32] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-30 04:44:32] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-30 04:44:32] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-30 04:44:32] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-30 04:44:32] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-30 04:44:32] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
[2024-05-30 04:44:32] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:44:32] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 04:44:32] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-30 04:44:33] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-30 04:44:33] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 04:44:33] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-30 04:44:33] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-30 04:44:33] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:44:33] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-30 04:44:33] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 2 ms to minimize.
[2024-05-30 04:44:33] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-30 04:44:33] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-30 04:44:34] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
[2024-05-30 04:44:34] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:34] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-30 04:44:34] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-05-30 04:44:34] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-30 04:44:35] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-30 04:44:35] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-30 04:44:35] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 04:44:35] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-30 04:44:35] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-30 04:44:35] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-30 04:44:35] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-30 04:44:35] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-05-30 04:44:35] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-30 04:44:35] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-30 04:44:36] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-30 04:44:36] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-30 04:44:36] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-30 04:44:36] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-30 04:44:36] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 04:44:36] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-30 04:44:36] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:37] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-30 04:44:37] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-30 04:44:37] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-30 04:44:37] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-30 04:44:37] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-30 04:44:37] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-30 04:44:37] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-30 04:44:37] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-30 04:44:38] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-30 04:44:38] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 5 ms to minimize.
[2024-05-30 04:44:38] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-30 04:44:38] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-30 04:44:38] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-30 04:44:38] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-30 04:44:38] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 2 ms to minimize.
[2024-05-30 04:44:38] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-30 04:44:38] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-30 04:44:38] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-30 04:44:38] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-30 04:44:39] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:39] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2024-05-30 04:44:39] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 04:44:39] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-05-30 04:44:40] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-30 04:44:40] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 2 ms to minimize.
[2024-05-30 04:44:40] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-30 04:44:40] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-30 04:44:40] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-30 04:44:40] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-30 04:44:40] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-30 04:44:40] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-30 04:44:40] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 2 ms to minimize.
[2024-05-30 04:44:41] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-30 04:44:41] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-30 04:44:41] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-30 04:44:41] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-30 04:44:41] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-30 04:44:41] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 3 ms to minimize.
[2024-05-30 04:44:41] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:44:41] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:41] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-30 04:44:42] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-30 04:44:42] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-30 04:44:42] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-05-30 04:44:42] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-30 04:44:42] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 04:44:42] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-30 04:44:42] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-30 04:44:42] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 2 ms to minimize.
[2024-05-30 04:44:42] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-30 04:44:42] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-30 04:44:42] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-30 04:44:42] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-30 04:44:42] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 04:44:43] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-30 04:44:43] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 4 ms to minimize.
[2024-05-30 04:44:43] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-05-30 04:44:43] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-30 04:44:43] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-30 04:44:43] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 20/301 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:44] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-05-30 04:44:44] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-30 04:44:44] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-30 04:44:44] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-30 04:44:45] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-30 04:44:45] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-30 04:44:45] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-30 04:44:45] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-30 04:44:45] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-30 04:44:45] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-30 04:44:45] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 04:44:45] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 04:44:45] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 04:44:45] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-30 04:44:45] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-30 04:44:45] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-30 04:44:45] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-05-30 04:44:45] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-30 04:44:45] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 04:44:46] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 20/321 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:46] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 2 ms to minimize.
[2024-05-30 04:44:46] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-30 04:44:46] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-30 04:44:46] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-05-30 04:44:46] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
[2024-05-30 04:44:46] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-30 04:44:46] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-30 04:44:46] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-30 04:44:47] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-30 04:44:47] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-30 04:44:47] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-30 04:44:47] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-05-30 04:44:47] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-30 04:44:48] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-30 04:44:48] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 04:44:48] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-05-30 04:44:48] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-05-30 04:44:48] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-30 04:44:48] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-30 04:44:48] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 20/341 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:49] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-30 04:44:49] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-30 04:44:49] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-30 04:44:49] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-30 04:44:49] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-30 04:44:50] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-30 04:44:50] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-30 04:44:50] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-30 04:44:50] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-05-30 04:44:50] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-30 04:44:50] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-30 04:44:50] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-30 04:44:50] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-30 04:44:50] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-30 04:44:50] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-30 04:44:50] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 04:44:50] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-30 04:44:50] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-30 04:44:51] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 04:44:51] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:51] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-30 04:44:52] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-05-30 04:44:52] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-30 04:44:52] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-30 04:44:52] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-30 04:44:52] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:44:52] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-30 04:44:52] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-30 04:44:52] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-30 04:44:53] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-30 04:44:53] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-30 04:44:53] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:44:53] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-30 04:44:53] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-30 04:44:53] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-30 04:44:53] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-30 04:44:53] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 04:44:53] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-30 04:44:53] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-30 04:44:53] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 20/381 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:54] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-30 04:44:54] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-30 04:44:55] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-30 04:44:55] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 04:44:55] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-30 04:44:55] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-30 04:44:55] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-30 04:44:55] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 04:44:55] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-30 04:44:55] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-30 04:44:55] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 04:44:55] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-30 04:44:55] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 04:44:56] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-30 04:44:56] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-30 04:44:56] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-30 04:44:56] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-30 04:44:56] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-30 04:44:56] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-30 04:44:56] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 20/401 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-30 04:44:57] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-30 04:44:57] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-30 04:44:57] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-30 04:44:57] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-30 04:44:57] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:44:57] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-30 04:44:57] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-30 04:44:57] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-30 04:44:58] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:44:58] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2024-05-30 04:44:58] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-05-30 04:44:58] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-30 04:44:58] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-30 04:44:58] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-30 04:44:58] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-30 04:44:58] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-30 04:44:58] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-30 04:44:58] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-30 04:44:58] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-30 04:44:58] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 20/421 constraints. Problems are: Problem set: 0 solved, 413 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/778 variables, and 421 constraints, problems are : Problem set: 0 solved, 413 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 0/364 constraints, PredecessorRefiner: 0/413 constraints, Known Traps: 380/380 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 413 unsolved
Search for dead transitions found 0 dead transitions in 60271ms
Starting structural reductions in LTL mode, iteration 1 : 364/403 places, 414/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61059 ms. Remains : 364/403 places, 414/453 transitions.
Support contains 114 out of 364 places after structural reductions.
[2024-05-30 04:44:59] [INFO ] Flatten gal took : 64 ms
[2024-05-30 04:44:59] [INFO ] Flatten gal took : 31 ms
[2024-05-30 04:44:59] [INFO ] Input system was already deterministic with 414 transitions.
Support contains 100 out of 364 places (down from 114) after GAL structural reductions.
FORMULA ShieldRVs-PT-010B-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (88 resets) in 1361 ms. (29 steps per ms) remains 1/56 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
[2024-05-30 04:45:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp33 is UNSAT
After SMT solving in domain Real declared 16/778 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/41 constraints, State Equation: 0/364 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 49ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-30 04:45:00] [INFO ] Flatten gal took : 24 ms
[2024-05-30 04:45:00] [INFO ] Flatten gal took : 24 ms
[2024-05-30 04:45:00] [INFO ] Input system was already deterministic with 414 transitions.
Computed a total of 95 stabilizing places and 95 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 414/414 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 334 transition count 384
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 334 transition count 384
Applied a total of 60 rules in 14 ms. Remains 334 /364 variables (removed 30) and now considering 384/414 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 334/364 places, 384/414 transitions.
[2024-05-30 04:45:00] [INFO ] Flatten gal took : 24 ms
[2024-05-30 04:45:00] [INFO ] Flatten gal took : 20 ms
[2024-05-30 04:45:00] [INFO ] Input system was already deterministic with 384 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 414/414 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 337 transition count 387
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 337 transition count 387
Applied a total of 54 rules in 31 ms. Remains 337 /364 variables (removed 27) and now considering 387/414 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 337/364 places, 387/414 transitions.
[2024-05-30 04:45:00] [INFO ] Flatten gal took : 22 ms
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 35 ms
[2024-05-30 04:45:01] [INFO ] Input system was already deterministic with 387 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 414/414 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 335 transition count 385
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 335 transition count 385
Applied a total of 58 rules in 15 ms. Remains 335 /364 variables (removed 29) and now considering 385/414 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 335/364 places, 385/414 transitions.
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 33 ms
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 15 ms
[2024-05-30 04:45:01] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 414/414 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 332 transition count 382
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 332 transition count 382
Applied a total of 64 rules in 8 ms. Remains 332 /364 variables (removed 32) and now considering 382/414 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 332/364 places, 382/414 transitions.
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 14 ms
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 14 ms
[2024-05-30 04:45:01] [INFO ] Input system was already deterministic with 382 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 414/414 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 334 transition count 384
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 334 transition count 384
Applied a total of 60 rules in 8 ms. Remains 334 /364 variables (removed 30) and now considering 384/414 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 334/364 places, 384/414 transitions.
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 14 ms
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 13 ms
[2024-05-30 04:45:01] [INFO ] Input system was already deterministic with 384 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 414/414 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 332 transition count 382
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 332 transition count 382
Applied a total of 64 rules in 19 ms. Remains 332 /364 variables (removed 32) and now considering 382/414 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 332/364 places, 382/414 transitions.
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 17 ms
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 13 ms
[2024-05-30 04:45:01] [INFO ] Input system was already deterministic with 382 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 414/414 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 332 transition count 382
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 332 transition count 382
Applied a total of 64 rules in 23 ms. Remains 332 /364 variables (removed 32) and now considering 382/414 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 332/364 places, 382/414 transitions.
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 12 ms
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 13 ms
[2024-05-30 04:45:01] [INFO ] Input system was already deterministic with 382 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 414/414 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 334 transition count 384
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 334 transition count 384
Applied a total of 60 rules in 8 ms. Remains 334 /364 variables (removed 30) and now considering 384/414 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 334/364 places, 384/414 transitions.
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 13 ms
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 12 ms
[2024-05-30 04:45:01] [INFO ] Input system was already deterministic with 384 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 414/414 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 335 transition count 385
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 335 transition count 385
Applied a total of 58 rules in 9 ms. Remains 335 /364 variables (removed 29) and now considering 385/414 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 335/364 places, 385/414 transitions.
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 12 ms
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 12 ms
[2024-05-30 04:45:01] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 414/414 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 336 transition count 386
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 336 transition count 386
Applied a total of 56 rules in 11 ms. Remains 336 /364 variables (removed 28) and now considering 386/414 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 336/364 places, 386/414 transitions.
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 13 ms
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 30 ms
[2024-05-30 04:45:01] [INFO ] Input system was already deterministic with 386 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 414/414 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 335 transition count 385
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 335 transition count 385
Applied a total of 58 rules in 7 ms. Remains 335 /364 variables (removed 29) and now considering 385/414 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 335/364 places, 385/414 transitions.
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 11 ms
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 26 ms
[2024-05-30 04:45:01] [INFO ] Input system was already deterministic with 385 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 414/414 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 340 transition count 390
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 340 transition count 390
Applied a total of 48 rules in 10 ms. Remains 340 /364 variables (removed 24) and now considering 390/414 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 340/364 places, 390/414 transitions.
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 11 ms
[2024-05-30 04:45:01] [INFO ] Flatten gal took : 12 ms
[2024-05-30 04:45:01] [INFO ] Input system was already deterministic with 390 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 364/364 places, 414/414 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 363 transition count 374
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 79 place count 324 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 323 transition count 373
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 80 place count 323 transition count 324
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 178 place count 274 transition count 324
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 209 place count 243 transition count 293
Iterating global reduction 3 with 31 rules applied. Total rules applied 240 place count 243 transition count 293
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 240 place count 243 transition count 281
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 264 place count 231 transition count 281
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 426 place count 150 transition count 200
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 428 place count 148 transition count 198
Applied a total of 428 rules in 150 ms. Remains 148 /364 variables (removed 216) and now considering 198/414 (removed 216) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 151 ms. Remains : 148/364 places, 198/414 transitions.
[2024-05-30 04:45:02] [INFO ] Flatten gal took : 7 ms
[2024-05-30 04:45:02] [INFO ] Flatten gal took : 7 ms
[2024-05-30 04:45:02] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 414/414 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 332 transition count 382
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 332 transition count 382
Applied a total of 64 rules in 7 ms. Remains 332 /364 variables (removed 32) and now considering 382/414 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 332/364 places, 382/414 transitions.
[2024-05-30 04:45:02] [INFO ] Flatten gal took : 12 ms
[2024-05-30 04:45:02] [INFO ] Flatten gal took : 23 ms
[2024-05-30 04:45:02] [INFO ] Input system was already deterministic with 382 transitions.
[2024-05-30 04:45:02] [INFO ] Flatten gal took : 12 ms
[2024-05-30 04:45:02] [INFO ] Flatten gal took : 12 ms
[2024-05-30 04:45:02] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2024-05-30 04:45:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 364 places, 414 transitions and 1362 arcs took 3 ms.
Total runtime 63981 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVs-PT-010B

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1694
MODEL NAME: /home/mcc/execution/411/model
364 places, 414 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldRVs-PT-010B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683759500793"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-010B.tgz
mv ShieldRVs-PT-010B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;