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-171683758700426.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 ShieldPPPs-PT-005B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758700426
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 13 11:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 13 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 13 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 86K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716961789094

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-005B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 05:49:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 05:49:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 05:49:50] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-29 05:49:50] [INFO ] Transformed 343 places.
[2024-05-29 05:49:50] [INFO ] Transformed 318 transitions.
[2024-05-29 05:49:50] [INFO ] Found NUPN structural information;
[2024-05-29 05:49:50] [INFO ] Parsed PT model containing 343 places and 318 transitions and 876 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 128 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 318/318 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 330 transition count 305
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 330 transition count 305
Applied a total of 26 rules in 53 ms. Remains 330 /343 variables (removed 13) and now considering 305/318 (removed 13) transitions.
// Phase 1: matrix 305 rows 330 cols
[2024-05-29 05:49:50] [INFO ] Computed 56 invariants in 25 ms
[2024-05-29 05:49:50] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-29 05:49:50] [INFO ] Invariant cache hit.
[2024-05-29 05:49:51] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2024-05-29 05:49:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/330 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 11 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 2 ms to minimize.
[2024-05-29 05:49:55] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-29 05:49:56] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:49:56] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:49:56] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:49:56] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:49:56] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:49:56] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:49:56] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:49:56] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-29 05:49:56] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:49:57] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:49:57] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:49:57] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:49:57] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:49:57] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:49:57] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:49:57] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:49:57] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-29 05:49:57] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 3 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:49:58] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:00] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:00] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:50:00] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:50:00] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 5 ms to minimize.
[2024-05-29 05:50:01] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-29 05:50:01] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-29 05:50:01] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-29 05:50:01] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:50:01] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:01] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:50:01] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:50:01] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:50:01] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-29 05:50:01] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-29 05:50:02] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:50:02] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:50:02] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 6 ms to minimize.
[2024-05-29 05:50:02] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:50:02] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-29 05:50:02] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:02] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:50:03] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:50:04] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-29 05:50:04] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 05:50:04] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:50:04] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:50:04] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:50:04] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:50:04] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:05] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:50:05] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:50:05] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:50:05] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:50:05] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:50:05] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-05-29 05:50:06] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 2 ms to minimize.
[2024-05-29 05:50:06] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-29 05:50:06] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-29 05:50:06] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:50:06] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:50:06] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:50:06] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:50:06] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:50:06] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:50:06] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:50:06] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 17/153 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:50:09] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:50:10] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:50:10] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:50:10] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:50:10] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 10/163 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:12] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:50:12] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:50:12] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 05:50:12] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:50:12] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:50:12] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:50:13] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:50:13] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:50:13] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:13] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:50:13] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 11/174 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:15] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-29 05:50:15] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 2 ms to minimize.
[2024-05-29 05:50:15] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:50:15] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-29 05:50:15] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 2 ms to minimize.
[2024-05-29 05:50:16] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 6/180 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:18] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:18] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 2 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:50:19] [INFO ] Deduced a trap composed of 48 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:50:20] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:50:20] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:20] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-29 05:50:20] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-29 05:50:20] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 330/635 variables, and 200 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 0/330 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 144/144 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/330 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 144/200 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:23] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 58 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 2 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 60 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:50:24] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:50:25] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:25] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:50:25] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:50:25] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 0 ms to minimize.
[2024-05-29 05:50:25] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:50:25] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/330 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:26] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:50:26] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:50:26] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:50:26] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:50:26] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-29 05:50:26] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 2 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:50:27] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:28] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:50:28] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2024-05-29 05:50:28] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:50:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 3 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 58 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:50:29] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:30] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:50:30] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 20/260 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:31] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:50:31] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-29 05:50:31] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:50:31] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 2 ms to minimize.
[2024-05-29 05:50:31] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:50:31] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:50:31] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:50:31] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-29 05:50:31] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:50:31] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:32] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:50:32] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 2 ms to minimize.
[2024-05-29 05:50:32] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:50:32] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:50:32] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:50:32] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:50:32] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:50:32] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:50:32] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:50:32] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:33] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:50:33] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:50:33] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:50:33] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:50:33] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:50:33] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:50:33] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:50:34] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:50:34] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:50:34] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:34] [INFO ] Deduced a trap composed of 45 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:50:34] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:50:34] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-05-29 05:50:34] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:50:34] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-29 05:50:34] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:50:34] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:50:35] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:50:35] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:50:35] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 20/300 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:36] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 05:50:36] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:50:36] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:50:36] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-29 05:50:36] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
[2024-05-29 05:50:37] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-29 05:50:37] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:50:37] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:50:37] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-29 05:50:37] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-05-29 05:50:37] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-05-29 05:50:37] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-29 05:50:37] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-05-29 05:50:37] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 2 ms to minimize.
[2024-05-29 05:50:37] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2024-05-29 05:50:37] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-29 05:50:37] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:50:37] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2024-05-29 05:50:37] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 1 ms to minimize.
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 20/320 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:38] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:50:39] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:50:39] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:50:39] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:39] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 5/325 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:41] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:50:41] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:50:41] [INFO ] Deduced a trap composed of 55 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:50:42] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:50:42] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-29 05:50:42] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:50:42] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:50:42] [INFO ] Deduced a trap composed of 50 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:42] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 05:50:42] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:42] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:50:42] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:50:42] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:50:42] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:50:43] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 15/340 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:44] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:50:44] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:50:44] [INFO ] Deduced a trap composed of 47 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:50:44] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-05-29 05:50:44] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:50:44] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:50:44] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:50:44] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 05:50:45] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 9/349 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 05:50:47] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-29 05:50:47] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:50:47] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-29 05:50:47] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-05-29 05:50:47] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2024-05-29 05:50:48] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:50:48] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/330 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 304 unsolved
SMT process timed out in 60109ms, After SMT, problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in LTL mode, iteration 1 : 330/343 places, 305/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60787 ms. Remains : 330/343 places, 305/318 transitions.
Support contains 128 out of 330 places after structural reductions.
[2024-05-29 05:50:51] [INFO ] Flatten gal took : 47 ms
[2024-05-29 05:50:51] [INFO ] Flatten gal took : 23 ms
[2024-05-29 05:50:51] [INFO ] Input system was already deterministic with 305 transitions.
Support contains 126 out of 330 places (down from 128) after GAL structural reductions.
RANDOM walk for 40000 steps (45 resets) in 2243 ms. (17 steps per ms) remains 8/88 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 4/5 properties
[2024-05-29 05:50:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp82 is UNSAT
At refinement iteration 1 (OVERLAPS) 134/148 variables, 20/20 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-29 05:50:52] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
Problem AtomicPropp1 is UNSAT
[2024-05-29 05:50:52] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 2/22 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 182/330 variables, 36/58 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-29 05:50:53] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 6 ms to minimize.
[2024-05-29 05:50:53] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:50:53] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-29 05:50:53] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 4/62 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 305/635 variables, 330/392 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-29 05:50:53] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-29 05:50:53] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:50:53] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:50:53] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/635 variables, 4/396 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/635 variables, 0/396 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/635 variables, 0/396 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 635/635 variables, and 396 constraints, problems are : Problem set: 2 solved, 2 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 330/330 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 112/118 variables, 16/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/17 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 212/330 variables, 40/57 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 9/66 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-29 05:50:53] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-29 05:50:53] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:50:53] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:50:54] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 4/70 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/70 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 305/635 variables, 330/400 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/635 variables, 2/402 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-29 05:50:54] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-29 05:50:54] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-05-29 05:50:54] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 3 ms to minimize.
[2024-05-29 05:50:54] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/635 variables, 4/406 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/635 variables, 0/406 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/635 variables, 0/406 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 635/635 variables, and 406 constraints, problems are : Problem set: 2 solved, 2 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 330/330 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 18/18 constraints]
After SMT, in 1921ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 1540 ms.
Support contains 6 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 305/305 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 330 transition count 270
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 295 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 294 transition count 269
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 72 place count 294 transition count 244
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 122 place count 269 transition count 244
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 141 place count 250 transition count 225
Iterating global reduction 3 with 19 rules applied. Total rules applied 160 place count 250 transition count 225
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 160 place count 250 transition count 214
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 182 place count 239 transition count 214
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 332 place count 164 transition count 139
Partial Free-agglomeration rule applied 42 times.
Drop transitions (Partial Free agglomeration) removed 42 transitions
Iterating global reduction 3 with 42 rules applied. Total rules applied 374 place count 164 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 375 place count 163 transition count 138
Applied a total of 375 rules in 73 ms. Remains 163 /330 variables (removed 167) and now considering 138/305 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 163/330 places, 138/305 transitions.
RANDOM walk for 40000 steps (8 resets) in 1044 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 433242 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :0 out of 2
Probabilistic random walk after 433242 steps, saw 250773 distinct states, run finished after 3017 ms. (steps per millisecond=143 ) properties seen :0
// Phase 1: matrix 138 rows 163 cols
[2024-05-29 05:50:59] [INFO ] Computed 56 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/56 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/79 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 05:50:59] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 84/163 variables, 79/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 72/235 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 13/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/236 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/236 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/238 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 47/285 variables, 29/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 7/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/286 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/286 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/286 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/288 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/288 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/288 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/289 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/289 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/289 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 12/301 variables, 10/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/301 variables, 5/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/301 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/301 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 220 constraints, problems are : Problem set: 0 solved, 2 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/56 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/79 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 84/163 variables, 79/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 72/235 variables, 40/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 13/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 05:51:00] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 05:51:00] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-29 05:51:00] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:51:00] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:51:00] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 05:51:00] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:51:00] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/236 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/238 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/238 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 47/285 variables, 29/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/285 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 05:51:00] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:51:00] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:51:00] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/285 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/285 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/286 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/286 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/286 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/288 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/288 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/288 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 1/289 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/289 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/289 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 12/301 variables, 10/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/301 variables, 5/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/301 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 0/301 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 232 constraints, problems are : Problem set: 0 solved, 2 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 988ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 501 ms.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 138/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 163 /163 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 163/163 places, 138/138 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 138/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 163 /163 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2024-05-29 05:51:01] [INFO ] Invariant cache hit.
[2024-05-29 05:51:01] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-29 05:51:01] [INFO ] Invariant cache hit.
[2024-05-29 05:51:01] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-05-29 05:51:01] [INFO ] Redundant transitions in 3 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-29 05:51:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:01] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:51:01] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:51:02] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:51:02] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:51:02] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:51:02] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:51:02] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:51:02] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 05:51:02] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:51:02] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 05:51:02] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 05:51:02] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 2/163 variables, 21/68 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:03] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:51:03] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:51:03] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:51:03] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:51:03] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:51:03] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:51:03] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-29 05:51:03] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:51:03] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-29 05:51:03] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:51:04] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:51:05] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:05] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:51:05] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:51:05] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 05:51:05] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:51:05] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-29 05:51:05] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 05:51:05] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 05:51:05] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 05:51:05] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 9/103 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 138/301 variables, 163/266 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:07] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 05:51:07] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:51:07] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:51:07] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:51:07] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:51:08] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:08] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:51:08] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:10] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/301 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:10] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-29 05:51:11] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/301 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:12] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/301 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:12] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:51:12] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/301 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:13] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/301 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/301 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:15] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 05:51:15] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-29 05:51:15] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/301 variables, 3/285 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/301 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:17] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:51:17] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/301 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:17] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/301 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:18] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/301 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/301 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 26 (OVERLAPS) 0/301 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 289 constraints, problems are : Problem set: 0 solved, 134 unsolved in 19045 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 49/84 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 2/163 variables, 21/105 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 21/126 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:21] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 138/301 variables, 163/290 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 134/424 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-29 05:51:23] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-29 05:51:25] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 0/301 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 426 constraints, problems are : Problem set: 0 solved, 134 unsolved in 17942 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 73/73 constraints]
After SMT, in 37016ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 37018ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37299 ms. Remains : 163/163 places, 138/138 transitions.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-29 05:51:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 05:51:38] [INFO ] Flatten gal took : 18 ms
FORMULA ShieldPPPs-PT-005B-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 05:51:38] [INFO ] Flatten gal took : 18 ms
[2024-05-29 05:51:38] [INFO ] Input system was already deterministic with 305 transitions.
Support contains 113 out of 330 places (down from 115) after GAL structural reductions.
Computed a total of 74 stabilizing places and 74 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 305/305 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 309 transition count 284
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 309 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 308 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 308 transition count 283
Applied a total of 44 rules in 35 ms. Remains 308 /330 variables (removed 22) and now considering 283/305 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 308/330 places, 283/305 transitions.
[2024-05-29 05:51:38] [INFO ] Flatten gal took : 14 ms
[2024-05-29 05:51:38] [INFO ] Flatten gal took : 29 ms
[2024-05-29 05:51:38] [INFO ] Input system was already deterministic with 283 transitions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 305/305 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 311 transition count 286
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 311 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 310 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 310 transition count 285
Applied a total of 40 rules in 46 ms. Remains 310 /330 variables (removed 20) and now considering 285/305 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 310/330 places, 285/305 transitions.
[2024-05-29 05:51:38] [INFO ] Flatten gal took : 13 ms
[2024-05-29 05:51:38] [INFO ] Flatten gal took : 14 ms
[2024-05-29 05:51:38] [INFO ] Input system was already deterministic with 285 transitions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 305/305 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 309 transition count 284
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 309 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 308 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 308 transition count 283
Applied a total of 44 rules in 22 ms. Remains 308 /330 variables (removed 22) and now considering 283/305 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 308/330 places, 283/305 transitions.
[2024-05-29 05:51:38] [INFO ] Flatten gal took : 12 ms
[2024-05-29 05:51:38] [INFO ] Flatten gal took : 13 ms
[2024-05-29 05:51:38] [INFO ] Input system was already deterministic with 283 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 330/330 places, 305/305 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 329 transition count 269
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 294 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 293 transition count 268
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 72 place count 293 transition count 243
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 122 place count 268 transition count 243
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 144 place count 246 transition count 221
Iterating global reduction 3 with 22 rules applied. Total rules applied 166 place count 246 transition count 221
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 166 place count 246 transition count 209
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 190 place count 234 transition count 209
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 338 place count 160 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 340 place count 158 transition count 133
Applied a total of 340 rules in 57 ms. Remains 158 /330 variables (removed 172) and now considering 133/305 (removed 172) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 158/330 places, 133/305 transitions.
[2024-05-29 05:51:38] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:51:38] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:51:38] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 305/305 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 308 transition count 283
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 308 transition count 283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 307 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 307 transition count 282
Applied a total of 46 rules in 14 ms. Remains 307 /330 variables (removed 23) and now considering 282/305 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 307/330 places, 282/305 transitions.
[2024-05-29 05:51:38] [INFO ] Flatten gal took : 11 ms
[2024-05-29 05:51:38] [INFO ] Flatten gal took : 11 ms
[2024-05-29 05:51:39] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 330/330 places, 305/305 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 329 transition count 269
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 294 transition count 269
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 70 place count 294 transition count 246
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 116 place count 271 transition count 246
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 136 place count 251 transition count 226
Iterating global reduction 2 with 20 rules applied. Total rules applied 156 place count 251 transition count 226
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 156 place count 251 transition count 216
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 176 place count 241 transition count 216
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 2 with 142 rules applied. Total rules applied 318 place count 170 transition count 145
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 320 place count 168 transition count 143
Applied a total of 320 rules in 37 ms. Remains 168 /330 variables (removed 162) and now considering 143/305 (removed 162) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 168/330 places, 143/305 transitions.
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:51:39] [INFO ] Input system was already deterministic with 143 transitions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 305/305 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 309 transition count 284
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 309 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 308 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 308 transition count 283
Applied a total of 44 rules in 13 ms. Remains 308 /330 variables (removed 22) and now considering 283/305 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 308/330 places, 283/305 transitions.
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 11 ms
[2024-05-29 05:51:39] [INFO ] Input system was already deterministic with 283 transitions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 305/305 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 313 transition count 288
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 313 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 312 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 312 transition count 287
Applied a total of 36 rules in 15 ms. Remains 312 /330 variables (removed 18) and now considering 287/305 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 312/330 places, 287/305 transitions.
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 11 ms
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 11 ms
[2024-05-29 05:51:39] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 330/330 places, 305/305 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 329 transition count 273
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 298 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 297 transition count 272
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 64 place count 297 transition count 247
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 114 place count 272 transition count 247
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 132 place count 254 transition count 229
Iterating global reduction 3 with 18 rules applied. Total rules applied 150 place count 254 transition count 229
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 150 place count 254 transition count 221
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 166 place count 246 transition count 221
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 306 place count 176 transition count 151
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 308 place count 174 transition count 149
Applied a total of 308 rules in 38 ms. Remains 174 /330 variables (removed 156) and now considering 149/305 (removed 156) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 174/330 places, 149/305 transitions.
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 5 ms
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:51:39] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 305/305 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 312 transition count 287
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 312 transition count 287
Applied a total of 36 rules in 10 ms. Remains 312 /330 variables (removed 18) and now considering 287/305 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 312/330 places, 287/305 transitions.
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:51:39] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 330/330 places, 305/305 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 329 transition count 267
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 292 transition count 267
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 74 place count 292 transition count 242
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 124 place count 267 transition count 242
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 146 place count 245 transition count 220
Iterating global reduction 2 with 22 rules applied. Total rules applied 168 place count 245 transition count 220
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 168 place count 245 transition count 208
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 192 place count 233 transition count 208
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 338 place count 160 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 158 transition count 133
Applied a total of 340 rules in 31 ms. Remains 158 /330 variables (removed 172) and now considering 133/305 (removed 172) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 158/330 places, 133/305 transitions.
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:51:39] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 330/330 places, 305/305 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 329 transition count 271
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 296 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 295 transition count 270
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 68 place count 295 transition count 245
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 118 place count 270 transition count 245
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 137 place count 251 transition count 226
Iterating global reduction 3 with 19 rules applied. Total rules applied 156 place count 251 transition count 226
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 156 place count 251 transition count 218
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 172 place count 243 transition count 218
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 318 place count 170 transition count 145
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 320 place count 168 transition count 143
Applied a total of 320 rules in 32 ms. Remains 168 /330 variables (removed 162) and now considering 143/305 (removed 162) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 168/330 places, 143/305 transitions.
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:51:39] [INFO ] Input system was already deterministic with 143 transitions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 305/305 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 309 transition count 284
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 309 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 308 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 308 transition count 283
Applied a total of 44 rules in 15 ms. Remains 308 /330 variables (removed 22) and now considering 283/305 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 308/330 places, 283/305 transitions.
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 9 ms
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 9 ms
[2024-05-29 05:51:39] [INFO ] Input system was already deterministic with 283 transitions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 305/305 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 310 transition count 285
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 310 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 309 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 309 transition count 284
Applied a total of 42 rules in 12 ms. Remains 309 /330 variables (removed 21) and now considering 284/305 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 309/330 places, 284/305 transitions.
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:51:39] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 330/330 places, 305/305 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 329 transition count 271
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 296 transition count 271
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 66 place count 296 transition count 245
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 118 place count 270 transition count 245
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 138 place count 250 transition count 225
Iterating global reduction 2 with 20 rules applied. Total rules applied 158 place count 250 transition count 225
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 158 place count 250 transition count 217
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 174 place count 242 transition count 217
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 322 place count 168 transition count 143
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 324 place count 166 transition count 141
Applied a total of 324 rules in 29 ms. Remains 166 /330 variables (removed 164) and now considering 141/305 (removed 164) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 166/330 places, 141/305 transitions.
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 5 ms
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:51:39] [INFO ] Input system was already deterministic with 141 transitions.
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 10 ms
[2024-05-29 05:51:39] [INFO ] Flatten gal took : 11 ms
[2024-05-29 05:51:39] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-29 05:51:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 330 places, 305 transitions and 850 arcs took 3 ms.
Total runtime 109405 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPs-PT-005B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 330
TRANSITIONS: 305
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.007s]


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


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

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

Process ID: 1794
MODEL NAME: /home/mcc/execution/413/model
330 places, 305 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.

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 CTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 8388608 at unique_table.cc, line 313
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="ShieldPPPs-PT-005B"
export BK_EXAMINATION="CTLFireability"
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 ShieldPPPs-PT-005B, examination is CTLFireability"
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-171683758700426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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