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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-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 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.5K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 13 11:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 13 11:53 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 35K 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-002B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716953793195

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-002B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 03:36:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 03:36:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:36:34] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-29 03:36:34] [INFO ] Transformed 139 places.
[2024-05-29 03:36:34] [INFO ] Transformed 129 transitions.
[2024-05-29 03:36:34] [INFO ] Found NUPN structural information;
[2024-05-29 03:36:34] [INFO ] Parsed PT model containing 139 places and 129 transitions and 354 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 96 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 129/129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 137 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 127
Applied a total of 4 rules in 24 ms. Remains 137 /139 variables (removed 2) and now considering 127/129 (removed 2) transitions.
// Phase 1: matrix 127 rows 137 cols
[2024-05-29 03:36:34] [INFO ] Computed 23 invariants in 9 ms
[2024-05-29 03:36:34] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-29 03:36:34] [INFO ] Invariant cache hit.
[2024-05-29 03:36:34] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-29 03:36:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 11 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 2 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:36:36] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:37] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:36:37] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:36:37] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:36:37] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:36:37] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-05-29 03:36:37] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:36:37] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-29 03:36:37] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:36:37] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 03:36:37] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:36:37] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:36:37] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:36:37] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:36:37] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:36:37] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:38] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:38] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:36:38] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:36:38] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 127/264 variables, 137/199 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:39] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:36:39] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 03:36:39] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:40] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:36:40] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:36:40] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:36:40] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:36:40] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 5/207 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:41] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:42] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:42] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:43] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
[2024-05-29 03:36:44] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:36:44] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:44] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:36:44] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:45] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:36:45] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 6 ms to minimize.
[2024-05-29 03:36:45] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 17 (OVERLAPS) 0/264 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 218 constraints, problems are : Problem set: 0 solved, 126 unsolved in 12141 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 58/81 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:47] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:36:47] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:36:47] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:36:47] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-29 03:36:47] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
[2024-05-29 03:36:47] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 1 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 33 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:36:48] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:36:49] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:36:49] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:36:49] [INFO ] Deduced a trap composed of 43 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:36:49] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:36:49] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 03:36:49] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 11/112 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:49] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:36:49] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:36:49] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:36:49] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2024-05-29 03:36:49] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-29 03:36:49] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 6/118 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:50] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:36:50] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-29 03:36:50] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:36:50] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-29 03:36:50] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:36:50] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 03:36:50] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 7/125 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:50] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:36:50] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-05-29 03:36:51] [INFO ] Deduced a trap composed of 38 places in 23 ms of which 0 ms to minimize.
[2024-05-29 03:36:51] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:36:51] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
[2024-05-29 03:36:51] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 0 ms to minimize.
[2024-05-29 03:36:51] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:36:51] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:51] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:36:51] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 1 ms to minimize.
[2024-05-29 03:36:51] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:36:51] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:52] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-29 03:36:52] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-29 03:36:52] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:36:52] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:36:52] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:36:52] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:36:52] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:36:52] [INFO ] Deduced a trap composed of 47 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:36:52] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 03:36:52] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 10/147 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:53] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:36:53] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:36:53] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:36:53] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:36:53] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-29 03:36:53] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
[2024-05-29 03:36:53] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:36:53] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:53] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-29 03:36:53] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:54] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-29 03:36:54] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:36:54] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-29 03:36:54] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 03:36:54] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 14 (OVERLAPS) 127/264 variables, 137/299 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 126/425 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:36:56] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:37:00] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-29 03:37:00] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 03:37:00] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 2 ms to minimize.
[2024-05-29 03:37:00] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 03:37:00] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:37:00] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 03:37:01] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:37:01] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:37:01] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:37:01] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 03:37:01] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/264 variables, 11/437 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:37:05] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 03:37:05] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/264 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/264 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-29 03:37:13] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/264 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/264 variables, and 440 constraints, problems are : Problem set: 0 solved, 126 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 154/154 constraints]
After SMT, in 42235ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 42249ms
Starting structural reductions in LTL mode, iteration 1 : 137/139 places, 127/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42614 ms. Remains : 137/139 places, 127/129 transitions.
Support contains 96 out of 137 places after structural reductions.
[2024-05-29 03:37:17] [INFO ] Flatten gal took : 31 ms
[2024-05-29 03:37:17] [INFO ] Flatten gal took : 12 ms
[2024-05-29 03:37:17] [INFO ] Input system was already deterministic with 127 transitions.
RANDOM walk for 40000 steps (94 resets) in 1831 ms. (21 steps per ms) remains 7/95 properties
BEST_FIRST walk for 40003 steps (19 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (22 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (21 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (22 resets) in 106 ms. (373 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (26 resets) in 68 ms. (579 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (21 resets) in 68 ms. (579 steps per ms) remains 4/5 properties
[2024-05-29 03:37:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp42 is UNSAT
At refinement iteration 1 (OVERLAPS) 128/137 variables, 23/23 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-29 03:37:18] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 03:37:18] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
Problem AtomicPropp7 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 2/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 127/264 variables, 137/162 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 162 constraints, problems are : Problem set: 3 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Int declared 15/264 variables, and 1 constraints, problems are : Problem set: 4 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 1/23 constraints, State Equation: 0/137 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/2 constraints]
After SMT, in 253ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 9 ms
[2024-05-29 03:37:18] [INFO ] Input system was already deterministic with 127 transitions.
Computed a total of 31 stabilizing places and 31 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 126 transition count 116
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 126 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 125 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 125 transition count 115
Applied a total of 24 rules in 15 ms. Remains 125 /137 variables (removed 12) and now considering 115/127 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 125/137 places, 115/127 transitions.
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:37:18] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 136 transition count 111
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 121 transition count 111
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 121 transition count 100
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 110 transition count 100
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 62 place count 100 transition count 90
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 100 transition count 90
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 72 place count 100 transition count 85
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 82 place count 95 transition count 85
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 136 place count 68 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 66 transition count 56
Applied a total of 138 rules in 37 ms. Remains 66 /137 variables (removed 71) and now considering 56/127 (removed 71) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 66/137 places, 56/127 transitions.
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:37:18] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 136 transition count 113
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 123 transition count 113
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 26 place count 123 transition count 100
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 52 place count 110 transition count 100
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 64 place count 98 transition count 88
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 98 transition count 88
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 76 place count 98 transition count 82
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 92 transition count 82
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 132 place count 70 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 68 transition count 58
Applied a total of 134 rules in 19 ms. Remains 68 /137 variables (removed 69) and now considering 58/127 (removed 69) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 68/137 places, 58/127 transitions.
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:37:18] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 127 transition count 117
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 127 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 126 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 126 transition count 116
Applied a total of 22 rules in 6 ms. Remains 126 /137 variables (removed 11) and now considering 116/127 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 126/137 places, 116/127 transitions.
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:37:18] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 127 transition count 117
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 127 transition count 117
Applied a total of 20 rules in 3 ms. Remains 127 /137 variables (removed 10) and now considering 117/127 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 127/137 places, 117/127 transitions.
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:37:18] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 125 transition count 115
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 125 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 124 transition count 114
Applied a total of 26 rules in 6 ms. Remains 124 /137 variables (removed 13) and now considering 114/127 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 124/137 places, 114/127 transitions.
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 10 ms
[2024-05-29 03:37:18] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 136 transition count 115
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 125 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 124 transition count 114
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 24 place count 124 transition count 102
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 48 place count 112 transition count 102
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 59 place count 101 transition count 91
Iterating global reduction 3 with 11 rules applied. Total rules applied 70 place count 101 transition count 91
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 70 place count 101 transition count 86
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 80 place count 96 transition count 86
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 122 place count 75 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 73 transition count 63
Applied a total of 124 rules in 16 ms. Remains 73 /137 variables (removed 64) and now considering 63/127 (removed 64) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 73/137 places, 63/127 transitions.
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:37:18] [INFO ] Flatten gal took : 4 ms
[2024-05-29 03:37:18] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 127 transition count 117
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 127 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 126 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 126 transition count 116
Applied a total of 22 rules in 5 ms. Remains 126 /137 variables (removed 11) and now considering 116/127 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 126/137 places, 116/127 transitions.
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 128 transition count 118
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 128 transition count 118
Applied a total of 18 rules in 3 ms. Remains 128 /137 variables (removed 9) and now considering 118/127 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 128/137 places, 118/127 transitions.
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 125 transition count 115
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 125 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 124 transition count 114
Applied a total of 26 rules in 10 ms. Remains 124 /137 variables (removed 13) and now considering 114/127 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 124/137 places, 114/127 transitions.
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 126 transition count 116
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 126 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 125 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 125 transition count 115
Applied a total of 24 rules in 5 ms. Remains 125 /137 variables (removed 12) and now considering 115/127 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 125/137 places, 115/127 transitions.
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 126 transition count 116
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 126 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 125 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 125 transition count 115
Applied a total of 24 rules in 4 ms. Remains 125 /137 variables (removed 12) and now considering 115/127 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 125/137 places, 115/127 transitions.
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 125 transition count 115
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 125 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 124 transition count 114
Applied a total of 26 rules in 4 ms. Remains 124 /137 variables (removed 13) and now considering 114/127 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 124/137 places, 114/127 transitions.
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 131 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 131 transition count 121
Applied a total of 12 rules in 3 ms. Remains 131 /137 variables (removed 6) and now considering 121/127 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 131/137 places, 121/127 transitions.
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 6 ms
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 136 transition count 110
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 120 transition count 110
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 120 transition count 100
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 110 transition count 100
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 63 place count 99 transition count 89
Iterating global reduction 2 with 11 rules applied. Total rules applied 74 place count 99 transition count 89
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 74 place count 99 transition count 83
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 93 transition count 83
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 142 place count 65 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 63 transition count 53
Applied a total of 144 rules in 18 ms. Remains 63 /137 variables (removed 74) and now considering 53/127 (removed 74) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 63/137 places, 53/127 transitions.
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 3 ms
[2024-05-29 03:37:19] [INFO ] Input system was already deterministic with 53 transitions.
RANDOM walk for 1205 steps (6 resets) in 8 ms. (133 steps per ms) remains 0/1 properties
FORMULA ShieldPPPs-PT-002B-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 127/127 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 131 transition count 121
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 131 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 130 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 130 transition count 120
Applied a total of 14 rules in 3 ms. Remains 130 /137 variables (removed 7) and now considering 120/127 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 130/137 places, 120/127 transitions.
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 03:37:19] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-29 03:37:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 137 places, 127 transitions and 350 arcs took 3 ms.
Total runtime 44952 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPs-PT-002B

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/411/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: 1025
MODEL NAME: /home/mcc/execution/411/model
137 places, 127 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldPPPs-PT-002B-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPs-PT-002B-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPs-PT-002B-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPs-PT-002B-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPs-PT-002B-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPs-PT-002B-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPs-PT-002B-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-002B-CTLFireability-2024-01 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-002B-CTLFireability-2024-02 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-002B-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-002B-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-002B-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-002B-CTLFireability-2023-12 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-002B-CTLFireability-2023-13 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-002B-CTLFireability-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716955446120

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.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 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-002B"
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-002B, 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-171683758600378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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