fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683760300073
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldIIPs-PT-005B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
359.352 65026.00 90585.00 205.10 ??F????????????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683760300073.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 ShieldIIPs-PT-005B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760300073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K 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.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 14:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 14:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 82K 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 ShieldIIPs-PT-005B-CTLCardinality-2024-00
FORMULA_NAME ShieldIIPs-PT-005B-CTLCardinality-2024-01
FORMULA_NAME ShieldIIPs-PT-005B-CTLCardinality-2024-02
FORMULA_NAME ShieldIIPs-PT-005B-CTLCardinality-2024-03
FORMULA_NAME ShieldIIPs-PT-005B-CTLCardinality-2024-04
FORMULA_NAME ShieldIIPs-PT-005B-CTLCardinality-2024-05
FORMULA_NAME ShieldIIPs-PT-005B-CTLCardinality-2024-06
FORMULA_NAME ShieldIIPs-PT-005B-CTLCardinality-2024-07
FORMULA_NAME ShieldIIPs-PT-005B-CTLCardinality-2024-08
FORMULA_NAME ShieldIIPs-PT-005B-CTLCardinality-2024-09
FORMULA_NAME ShieldIIPs-PT-005B-CTLCardinality-2024-10
FORMULA_NAME ShieldIIPs-PT-005B-CTLCardinality-2024-11
FORMULA_NAME ShieldIIPs-PT-005B-CTLCardinality-2023-12
FORMULA_NAME ShieldIIPs-PT-005B-CTLCardinality-2023-13
FORMULA_NAME ShieldIIPs-PT-005B-CTLCardinality-2023-14
FORMULA_NAME ShieldIIPs-PT-005B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717224154206

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-005B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:42:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:42:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:42:35] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-01 06:42:35] [INFO ] Transformed 303 places.
[2024-06-01 06:42:35] [INFO ] Transformed 298 transitions.
[2024-06-01 06:42:35] [INFO ] Found NUPN structural information;
[2024-06-01 06:42:35] [INFO ] Parsed PT model containing 303 places and 298 transitions and 896 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 105 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 298/298 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 289 transition count 284
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 289 transition count 284
Applied a total of 28 rules in 43 ms. Remains 289 /303 variables (removed 14) and now considering 284/298 (removed 14) transitions.
// Phase 1: matrix 284 rows 289 cols
[2024-06-01 06:42:35] [INFO ] Computed 46 invariants in 18 ms
[2024-06-01 06:42:36] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-01 06:42:36] [INFO ] Invariant cache hit.
[2024-06-01 06:42:36] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-06-01 06:42:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:42:39] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 16 ms to minimize.
[2024-06-01 06:42:39] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:42:39] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:42:39] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:42:39] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:42:39] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:42:43] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:42:43] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:42:43] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:42:47] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:42:47] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:42:47] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:42:47] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:42:47] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:42:47] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:42:50] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:42:50] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:42:50] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:42:54] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:42:54] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:42:54] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:42:54] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:42:54] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:42:54] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:42:54] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:42:54] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:42:54] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:42:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:42:55] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-06-01 06:42:55] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:42:55] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:42:55] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:42:55] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:42:55] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 16/202 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:42:59] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:42:59] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:42:59] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:42:59] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:42:59] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:42:59] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 12/214 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:43:01] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:43:01] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:43:01] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:43:01] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:43:01] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:43:01] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:43:01] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:43:01] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:43:01] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:43:02] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 10/224 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:43:03] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:43:03] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:43:04] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:43:04] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 289/573 variables, and 228 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 0/289 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 182/182 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 182/228 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:43:08] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:43:08] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:43:08] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:43:08] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:43:09] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:43:09] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:43:09] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:43:09] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:43:09] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:43:09] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:43:09] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:43:09] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 12/240 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:43:10] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-06-01 06:43:10] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:43:11] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:43:11] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:43:11] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:43:11] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:43:11] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:43:11] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:43:11] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 9/249 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:43:13] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:43:13] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:43:13] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:43:13] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:43:13] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:43:13] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:43:14] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 7/256 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:43:15] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:43:17] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:43:17] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:43:19] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:43:19] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:43:21] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:43:22] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:43:22] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:43:22] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:43:22] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:43:22] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:43:22] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 17/278 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2024-06-01 06:43:24] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 10/288 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:43:25] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:43:25] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:43:25] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:43:25] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:43:25] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:43:26] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:43:26] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:43:26] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 8/296 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 13 (OVERLAPS) 284/573 variables, 289/585 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/573 variables, 283/868 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-01 06:43:32] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:43:32] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:43:32] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:43:33] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 3 ms to minimize.
[2024-06-01 06:43:33] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-06-01 06:43:33] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 4 ms to minimize.
[2024-06-01 06:43:33] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:43:34] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-06-01 06:43:34] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:43:34] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:43:34] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:43:34] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:43:34] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:43:35] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:43:35] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:43:35] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:43:35] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:43:35] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:43:35] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:43:35] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/573 variables, 20/888 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/573 variables, and 888 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 270/270 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in LTL mode, iteration 1 : 289/303 places, 284/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60776 ms. Remains : 289/303 places, 284/298 transitions.
Support contains 105 out of 289 places after structural reductions.
[2024-06-01 06:43:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 06:43:36] [INFO ] Flatten gal took : 48 ms
FORMULA ShieldIIPs-PT-005B-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:43:36] [INFO ] Flatten gal took : 20 ms
[2024-06-01 06:43:36] [INFO ] Input system was already deterministic with 284 transitions.
Support contains 103 out of 289 places (down from 105) after GAL structural reductions.
RANDOM walk for 40000 steps (56 resets) in 1893 ms. (21 steps per ms) remains 3/71 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/2 properties
[2024-06-01 06:43:37] [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
At refinement iteration 1 (OVERLAPS) 60/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 226/289 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 284/573 variables, 289/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/573 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 335 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp46 is UNSAT
After SMT solving in domain Int declared 63/573 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 9/46 constraints, State Equation: 0/289 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 215ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-06-01 06:43:37] [INFO ] Flatten gal took : 22 ms
[2024-06-01 06:43:37] [INFO ] Flatten gal took : 16 ms
[2024-06-01 06:43:37] [INFO ] Input system was already deterministic with 284 transitions.
Support contains 96 out of 289 places (down from 101) after GAL structural reductions.
Computed a total of 76 stabilizing places and 76 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 284/284 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 269 transition count 264
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 269 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 268 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 268 transition count 263
Applied a total of 42 rules in 17 ms. Remains 268 /289 variables (removed 21) and now considering 263/284 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 268/289 places, 263/284 transitions.
[2024-06-01 06:43:37] [INFO ] Flatten gal took : 16 ms
[2024-06-01 06:43:37] [INFO ] Flatten gal took : 14 ms
[2024-06-01 06:43:37] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 288 transition count 262
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 44 place count 267 transition count 260
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 265 transition count 260
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 46 place count 265 transition count 233
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 100 place count 238 transition count 233
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 118 place count 220 transition count 215
Iterating global reduction 3 with 18 rules applied. Total rules applied 136 place count 220 transition count 215
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 136 place count 220 transition count 205
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 156 place count 210 transition count 205
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 298 place count 139 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 299 place count 138 transition count 133
Applied a total of 299 rules in 54 ms. Remains 138 /289 variables (removed 151) and now considering 133/284 (removed 151) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 138/289 places, 133/284 transitions.
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:43:38] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 288 transition count 262
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 267 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 266 transition count 261
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 44 place count 266 transition count 233
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 100 place count 238 transition count 233
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 119 place count 219 transition count 214
Iterating global reduction 3 with 19 rules applied. Total rules applied 138 place count 219 transition count 214
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 138 place count 219 transition count 204
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 158 place count 209 transition count 204
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 300 place count 138 transition count 133
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 302 place count 136 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 303 place count 135 transition count 131
Applied a total of 303 rules in 47 ms. Remains 135 /289 variables (removed 154) and now considering 131/284 (removed 153) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 135/289 places, 131/284 transitions.
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:43:38] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 284/284 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 269 transition count 264
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 269 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 268 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 268 transition count 263
Applied a total of 42 rules in 14 ms. Remains 268 /289 variables (removed 21) and now considering 263/284 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 268/289 places, 263/284 transitions.
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 11 ms
[2024-06-01 06:43:38] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 288 transition count 261
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 266 transition count 260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 265 transition count 260
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 46 place count 265 transition count 233
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 100 place count 238 transition count 233
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 118 place count 220 transition count 215
Iterating global reduction 3 with 18 rules applied. Total rules applied 136 place count 220 transition count 215
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 136 place count 220 transition count 205
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 156 place count 210 transition count 205
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 306 place count 135 transition count 130
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 308 place count 133 transition count 128
Applied a total of 308 rules in 39 ms. Remains 133 /289 variables (removed 156) and now considering 128/284 (removed 156) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 133/289 places, 128/284 transitions.
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 7 ms
[2024-06-01 06:43:38] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 284/284 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 271 transition count 266
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 271 transition count 266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 270 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 270 transition count 265
Applied a total of 38 rules in 11 ms. Remains 270 /289 variables (removed 19) and now considering 265/284 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 270/289 places, 265/284 transitions.
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:43:38] [INFO ] Input system was already deterministic with 265 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 284/284 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 274 transition count 269
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 274 transition count 269
Applied a total of 30 rules in 7 ms. Remains 274 /289 variables (removed 15) and now considering 269/284 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 274/289 places, 269/284 transitions.
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:43:38] [INFO ] Input system was already deterministic with 269 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 288 transition count 259
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 264 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 263 transition count 258
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 50 place count 263 transition count 233
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 100 place count 238 transition count 233
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 119 place count 219 transition count 214
Iterating global reduction 3 with 19 rules applied. Total rules applied 138 place count 219 transition count 214
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 138 place count 219 transition count 203
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 160 place count 208 transition count 203
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 298 place count 139 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 300 place count 137 transition count 132
Applied a total of 300 rules in 32 ms. Remains 137 /289 variables (removed 152) and now considering 132/284 (removed 152) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 137/289 places, 132/284 transitions.
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:43:38] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 284/284 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 269 transition count 264
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 269 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 268 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 268 transition count 263
Applied a total of 42 rules in 12 ms. Remains 268 /289 variables (removed 21) and now considering 263/284 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 268/289 places, 263/284 transitions.
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:43:38] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 289/289 places, 284/284 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 288 transition count 257
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 262 transition count 257
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 262 transition count 231
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 236 transition count 231
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 125 place count 215 transition count 210
Iterating global reduction 2 with 21 rules applied. Total rules applied 146 place count 215 transition count 210
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 146 place count 215 transition count 197
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 172 place count 202 transition count 197
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 320 place count 128 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 322 place count 126 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 323 place count 125 transition count 121
Applied a total of 323 rules in 30 ms. Remains 125 /289 variables (removed 164) and now considering 121/284 (removed 163) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 125/289 places, 121/284 transitions.
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 5 ms
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 6 ms
[2024-06-01 06:43:38] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 284/284 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 270 transition count 265
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 270 transition count 265
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 269 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 269 transition count 264
Applied a total of 40 rules in 11 ms. Remains 269 /289 variables (removed 20) and now considering 264/284 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 269/289 places, 264/284 transitions.
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 13 ms
[2024-06-01 06:43:38] [INFO ] Input system was already deterministic with 264 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 284/284 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 268 transition count 263
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 268 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 267 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 267 transition count 262
Applied a total of 44 rules in 10 ms. Remains 267 /289 variables (removed 22) and now considering 262/284 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 267/289 places, 262/284 transitions.
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:43:38] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 284/284 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 268 transition count 263
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 268 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 267 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 267 transition count 262
Applied a total of 44 rules in 18 ms. Remains 267 /289 variables (removed 22) and now considering 262/284 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 267/289 places, 262/284 transitions.
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 10 ms
[2024-06-01 06:43:38] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 284/284 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 269 transition count 264
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 269 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 268 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 268 transition count 263
Applied a total of 42 rules in 12 ms. Remains 268 /289 variables (removed 21) and now considering 263/284 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 268/289 places, 263/284 transitions.
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:43:38] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 284/284 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 272 transition count 267
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 272 transition count 267
Applied a total of 34 rules in 6 ms. Remains 272 /289 variables (removed 17) and now considering 267/284 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 272/289 places, 267/284 transitions.
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 8 ms
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:43:38] [INFO ] Input system was already deterministic with 267 transitions.
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:43:38] [INFO ] Flatten gal took : 9 ms
[2024-06-01 06:43:38] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 06:43:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 289 places, 284 transitions and 868 arcs took 3 ms.
Total runtime 63439 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldIIPs-PT-005B-CTLCardinality-2024-00
Could not compute solution for formula : ShieldIIPs-PT-005B-CTLCardinality-2024-01
Could not compute solution for formula : ShieldIIPs-PT-005B-CTLCardinality-2024-03
Could not compute solution for formula : ShieldIIPs-PT-005B-CTLCardinality-2024-04
Could not compute solution for formula : ShieldIIPs-PT-005B-CTLCardinality-2024-05
Could not compute solution for formula : ShieldIIPs-PT-005B-CTLCardinality-2024-06
Could not compute solution for formula : ShieldIIPs-PT-005B-CTLCardinality-2024-07
Could not compute solution for formula : ShieldIIPs-PT-005B-CTLCardinality-2024-08
Could not compute solution for formula : ShieldIIPs-PT-005B-CTLCardinality-2024-09
Could not compute solution for formula : ShieldIIPs-PT-005B-CTLCardinality-2024-10
Could not compute solution for formula : ShieldIIPs-PT-005B-CTLCardinality-2024-11
Could not compute solution for formula : ShieldIIPs-PT-005B-CTLCardinality-2023-12
Could not compute solution for formula : ShieldIIPs-PT-005B-CTLCardinality-2023-13
Could not compute solution for formula : ShieldIIPs-PT-005B-CTLCardinality-2023-14
Could not compute solution for formula : ShieldIIPs-PT-005B-CTLCardinality-2023-15

BK_STOP 1717224219232

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldIIPs-PT-005B-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1332/ctl_0_
ctl formula name ShieldIIPs-PT-005B-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1332/ctl_1_
ctl formula name ShieldIIPs-PT-005B-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1332/ctl_2_
ctl formula name ShieldIIPs-PT-005B-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1332/ctl_3_
ctl formula name ShieldIIPs-PT-005B-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1332/ctl_4_
ctl formula name ShieldIIPs-PT-005B-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1332/ctl_5_
ctl formula name ShieldIIPs-PT-005B-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1332/ctl_6_
ctl formula name ShieldIIPs-PT-005B-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1332/ctl_7_
ctl formula name ShieldIIPs-PT-005B-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1332/ctl_8_
ctl formula name ShieldIIPs-PT-005B-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1332/ctl_9_
ctl formula name ShieldIIPs-PT-005B-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1332/ctl_10_
ctl formula name ShieldIIPs-PT-005B-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1332/ctl_11_
ctl formula name ShieldIIPs-PT-005B-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1332/ctl_12_
ctl formula name ShieldIIPs-PT-005B-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1332/ctl_13_
ctl formula name ShieldIIPs-PT-005B-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1332/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ShieldIIPs-PT-005B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldIIPs-PT-005B, 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 r528-tall-171683760300073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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