About the Execution of GreatSPN+red for ShieldPPPs-PT-004B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16207.907 | 2444381.00 | 7870766.00 | 4498.00 | ?F?T???????????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r355-tall-171683758700409.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-004B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758700409
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 11:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 13 11:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 13 11:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 69K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2024-00
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2024-01
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2024-02
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2024-03
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2024-04
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2024-05
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2024-06
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2024-07
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2024-08
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2024-09
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2024-10
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2024-11
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2023-12
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2023-13
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2023-14
FORMULA_NAME ShieldPPPs-PT-004B-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716958388176
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 04:53:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 04:53:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 04:53:09] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-29 04:53:09] [INFO ] Transformed 275 places.
[2024-05-29 04:53:09] [INFO ] Transformed 255 transitions.
[2024-05-29 04:53:09] [INFO ] Found NUPN structural information;
[2024-05-29 04:53:09] [INFO ] Parsed PT model containing 275 places and 255 transitions and 702 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-004B-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-004B-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 255/255 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 262 transition count 242
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 262 transition count 242
Applied a total of 26 rules in 44 ms. Remains 262 /275 variables (removed 13) and now considering 242/255 (removed 13) transitions.
// Phase 1: matrix 242 rows 262 cols
[2024-05-29 04:53:09] [INFO ] Computed 45 invariants in 17 ms
[2024-05-29 04:53:09] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-29 04:53:09] [INFO ] Invariant cache hit.
[2024-05-29 04:53:10] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-29 04:53:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:12] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 14 ms to minimize.
[2024-05-29 04:53:12] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 04:53:12] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:53:12] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 04:53:13] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:14] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 04:53:14] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 04:53:14] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:53:14] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:53:14] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:53:14] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2024-05-29 04:53:14] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-29 04:53:14] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-29 04:53:14] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:53:14] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:53:15] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 04:53:15] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-29 04:53:15] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:53:15] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 5 ms to minimize.
[2024-05-29 04:53:15] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:53:15] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-29 04:53:15] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:53:15] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:53:15] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:53:15] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:16] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 3 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2024-05-29 04:53:17] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-29 04:53:18] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:53:18] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:53:18] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:18] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:53:18] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 04:53:18] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 2 ms to minimize.
[2024-05-29 04:53:18] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:53:18] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 3 ms to minimize.
[2024-05-29 04:53:19] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-29 04:53:19] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:53:19] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:53:19] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:53:19] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-29 04:53:19] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 04:53:19] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:53:19] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-29 04:53:19] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 14/119 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:20] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 04:53:20] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-29 04:53:20] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:53:20] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-29 04:53:20] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:53:21] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:53:21] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 2 ms to minimize.
[2024-05-29 04:53:21] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
[2024-05-29 04:53:21] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-29 04:53:21] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:53:21] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-29 04:53:21] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:53:21] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 0 ms to minimize.
[2024-05-29 04:53:21] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 14/133 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:23] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 04:53:23] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:53:23] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 04:53:23] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:53:23] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 04:53:23] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-05-29 04:53:24] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 7/140 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:24] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-29 04:53:25] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-29 04:53:25] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:53:25] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-29 04:53:25] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:53:25] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-29 04:53:25] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-29 04:53:25] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 04:53:25] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-29 04:53:25] [INFO ] Deduced a trap composed of 29 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:26] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:53:26] [INFO ] Deduced a trap composed of 50 places in 33 ms of which 1 ms to minimize.
[2024-05-29 04:53:26] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:53:26] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:53:26] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 0 ms to minimize.
[2024-05-29 04:53:26] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:53:26] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:53:26] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-29 04:53:26] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 1 ms to minimize.
[2024-05-29 04:53:27] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-29 04:53:27] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 04:53:27] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-29 04:53:27] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 2 ms to minimize.
[2024-05-29 04:53:27] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:53:27] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-29 04:53:27] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2024-05-29 04:53:27] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2024-05-29 04:53:27] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 2 ms to minimize.
[2024-05-29 04:53:27] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-29 04:53:27] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:29] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:53:29] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:53:29] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-05-29 04:53:29] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:53:30] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:53:30] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:53:30] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:53:30] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:53:30] [INFO ] Deduced a trap composed of 37 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:31] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-29 04:53:31] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2024-05-29 04:53:31] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:53:31] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 04:53:31] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 5/184 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:32] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-29 04:53:32] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2024-05-29 04:53:33] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-29 04:53:33] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:53:33] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:35] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-29 04:53:35] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-29 04:53:35] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:53:35] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/262 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:36] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-29 04:53:36] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:53:37] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:53:37] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:38] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2024-05-29 04:53:38] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 04:53:38] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:53:38] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 04:53:38] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:53:38] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/262 variables, 6/203 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 262/504 variables, and 203 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 0/262 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 158/158 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/262 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/262 variables, 158/203 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:41] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 04:53:41] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 0 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-05-29 04:53:42] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:43] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 04:53:43] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-29 04:53:43] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-29 04:53:43] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:44] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-05-29 04:53:44] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:53:44] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 1 ms to minimize.
[2024-05-29 04:53:44] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:53:45] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 04:53:45] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2024-05-29 04:53:45] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-29 04:53:45] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2024-05-29 04:53:45] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 04:53:45] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 04:53:45] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 04:53:45] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 1 ms to minimize.
[2024-05-29 04:53:45] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-29 04:53:45] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-29 04:53:45] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-29 04:53:45] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-29 04:53:45] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
[2024-05-29 04:53:45] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-05-29 04:53:45] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 19/246 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:46] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:53:46] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:48] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:53:48] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-05-29 04:53:48] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 2 ms to minimize.
[2024-05-29 04:53:48] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2024-05-29 04:53:48] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 0 ms to minimize.
[2024-05-29 04:53:48] [INFO ] Deduced a trap composed of 39 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 6/254 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:50] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-29 04:53:50] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-29 04:53:50] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 1 ms to minimize.
[2024-05-29 04:53:50] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-29 04:53:50] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 5/259 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (OVERLAPS) 242/504 variables, 262/521 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/504 variables, 241/762 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:53:57] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-29 04:53:57] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:53:57] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 04:53:58] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 04:53:58] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-29 04:53:58] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-29 04:53:59] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 04:53:59] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-29 04:54:01] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 9/771 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-29 04:54:08] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:54:08] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:54:09] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/504 variables, and 774 constraints, problems are : Problem set: 0 solved, 241 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 262/262 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 226/226 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in LTL mode, iteration 1 : 262/275 places, 242/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60675 ms. Remains : 262/275 places, 242/255 transitions.
Support contains 68 out of 262 places after structural reductions.
[2024-05-29 04:54:10] [INFO ] Flatten gal took : 50 ms
[2024-05-29 04:54:10] [INFO ] Flatten gal took : 19 ms
[2024-05-29 04:54:10] [INFO ] Input system was already deterministic with 242 transitions.
Support contains 67 out of 262 places (down from 68) after GAL structural reductions.
RANDOM walk for 40000 steps (53 resets) in 818 ms. (48 steps per ms) remains 1/40 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
[2024-05-29 04:54:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 48/504 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 9/45 constraints, State Equation: 0/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 13 ms
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 16 ms
[2024-05-29 04:54:11] [INFO ] Input system was already deterministic with 242 transitions.
Computed a total of 56 stabilizing places and 56 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 261 transition count 212
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 232 transition count 212
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 58 place count 232 transition count 192
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 98 place count 212 transition count 192
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 114 place count 196 transition count 176
Iterating global reduction 2 with 16 rules applied. Total rules applied 130 place count 196 transition count 176
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 130 place count 196 transition count 168
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 146 place count 188 transition count 168
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 268 place count 127 transition count 107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 270 place count 125 transition count 105
Applied a total of 270 rules in 57 ms. Remains 125 /262 variables (removed 137) and now considering 105/242 (removed 137) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 125/262 places, 105/242 transitions.
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:54:11] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 261 transition count 212
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 232 transition count 212
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 58 place count 232 transition count 192
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 98 place count 212 transition count 192
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 111 place count 199 transition count 179
Iterating global reduction 2 with 13 rules applied. Total rules applied 124 place count 199 transition count 179
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 124 place count 199 transition count 174
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 134 place count 194 transition count 174
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 260 place count 131 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 262 place count 129 transition count 109
Applied a total of 262 rules in 35 ms. Remains 129 /262 variables (removed 133) and now considering 109/242 (removed 133) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 129/262 places, 109/242 transitions.
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:54:11] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 242/242 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 246 transition count 226
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 246 transition count 226
Applied a total of 32 rules in 9 ms. Remains 246 /262 variables (removed 16) and now considering 226/242 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 246/262 places, 226/242 transitions.
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 10 ms
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 10 ms
[2024-05-29 04:54:11] [INFO ] Input system was already deterministic with 226 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 261 transition count 216
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 236 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 235 transition count 215
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 52 place count 235 transition count 196
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 90 place count 216 transition count 196
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 105 place count 201 transition count 181
Iterating global reduction 3 with 15 rules applied. Total rules applied 120 place count 201 transition count 181
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 120 place count 201 transition count 175
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 132 place count 195 transition count 175
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 254 place count 134 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 256 place count 132 transition count 112
Applied a total of 256 rules in 35 ms. Remains 132 /262 variables (removed 130) and now considering 112/242 (removed 130) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 132/262 places, 112/242 transitions.
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:54:11] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 261 transition count 213
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 233 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 232 transition count 212
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 58 place count 232 transition count 192
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 98 place count 212 transition count 192
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 114 place count 196 transition count 176
Iterating global reduction 3 with 16 rules applied. Total rules applied 130 place count 196 transition count 176
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 130 place count 196 transition count 168
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 146 place count 188 transition count 168
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 266 place count 128 transition count 108
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 268 place count 126 transition count 106
Applied a total of 268 rules in 47 ms. Remains 126 /262 variables (removed 136) and now considering 106/242 (removed 136) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 126/262 places, 106/242 transitions.
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 20 ms
[2024-05-29 04:54:11] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 242/242 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 250 transition count 230
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 250 transition count 230
Applied a total of 24 rules in 11 ms. Remains 250 /262 variables (removed 12) and now considering 230/242 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 250/262 places, 230/242 transitions.
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 9 ms
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 23 ms
[2024-05-29 04:54:11] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 261 transition count 213
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 233 transition count 213
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 56 place count 233 transition count 193
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 96 place count 213 transition count 193
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 111 place count 198 transition count 178
Iterating global reduction 2 with 15 rules applied. Total rules applied 126 place count 198 transition count 178
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 126 place count 198 transition count 171
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 191 transition count 171
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 260 place count 131 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 262 place count 129 transition count 109
Applied a total of 262 rules in 32 ms. Remains 129 /262 variables (removed 133) and now considering 109/242 (removed 133) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 129/262 places, 109/242 transitions.
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 6 ms
[2024-05-29 04:54:11] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 261 transition count 213
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 233 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 232 transition count 212
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 58 place count 232 transition count 193
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 96 place count 213 transition count 193
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 111 place count 198 transition count 178
Iterating global reduction 3 with 15 rules applied. Total rules applied 126 place count 198 transition count 178
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 126 place count 198 transition count 170
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 142 place count 190 transition count 170
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 266 place count 128 transition count 108
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 268 place count 126 transition count 106
Applied a total of 268 rules in 36 ms. Remains 126 /262 variables (removed 136) and now considering 106/242 (removed 136) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 126/262 places, 106/242 transitions.
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 10 ms
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 12 ms
[2024-05-29 04:54:11] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 242/242 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 252 transition count 232
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 252 transition count 232
Applied a total of 20 rules in 10 ms. Remains 252 /262 variables (removed 10) and now considering 232/242 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 252/262 places, 232/242 transitions.
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 9 ms
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:54:11] [INFO ] Input system was already deterministic with 232 transitions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 242/242 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 248 transition count 228
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 248 transition count 228
Applied a total of 28 rules in 10 ms. Remains 248 /262 variables (removed 14) and now considering 228/242 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 248/262 places, 228/242 transitions.
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 23 ms
[2024-05-29 04:54:11] [INFO ] Input system was already deterministic with 228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 242/242 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 246 transition count 226
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 246 transition count 226
Applied a total of 32 rules in 10 ms. Remains 246 /262 variables (removed 16) and now considering 226/242 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 246/262 places, 226/242 transitions.
[2024-05-29 04:54:11] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:54:12] [INFO ] Flatten gal took : 23 ms
[2024-05-29 04:54:12] [INFO ] Input system was already deterministic with 226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 242/242 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 247 transition count 227
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 247 transition count 227
Applied a total of 30 rules in 8 ms. Remains 247 /262 variables (removed 15) and now considering 227/242 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 247/262 places, 227/242 transitions.
[2024-05-29 04:54:12] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:54:12] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:54:12] [INFO ] Input system was already deterministic with 227 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 262/262 places, 242/242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 261 transition count 212
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 232 transition count 212
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 58 place count 232 transition count 192
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 98 place count 212 transition count 192
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 113 place count 197 transition count 177
Iterating global reduction 2 with 15 rules applied. Total rules applied 128 place count 197 transition count 177
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 128 place count 197 transition count 169
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 144 place count 189 transition count 169
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 268 place count 127 transition count 107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 270 place count 125 transition count 105
Applied a total of 270 rules in 22 ms. Remains 125 /262 variables (removed 137) and now considering 105/242 (removed 137) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 125/262 places, 105/242 transitions.
[2024-05-29 04:54:12] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:54:12] [INFO ] Flatten gal took : 5 ms
[2024-05-29 04:54:12] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 242/242 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 248 transition count 228
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 248 transition count 228
Applied a total of 28 rules in 16 ms. Remains 248 /262 variables (removed 14) and now considering 228/242 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 248/262 places, 228/242 transitions.
[2024-05-29 04:54:12] [INFO ] Flatten gal took : 7 ms
[2024-05-29 04:54:12] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:54:12] [INFO ] Input system was already deterministic with 228 transitions.
[2024-05-29 04:54:12] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:54:12] [INFO ] Flatten gal took : 8 ms
[2024-05-29 04:54:12] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-29 04:54:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 262 places, 242 transitions and 676 arcs took 2 ms.
Total runtime 62879 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldPPPs-PT-004B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 262
TRANSITIONS: 242
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.003s]
SAVING FILE /home/mcc/execution/408/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: 1225
MODEL NAME: /home/mcc/execution/408/model
262 places, 242 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-004B-CTLCardinality-2024-00 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-004B-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-004B-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-004B-CTLCardinality-2024-07 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-004B-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-004B-CTLCardinality-2024-09 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-004B-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-004B-CTLCardinality-2023-12 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-004B-CTLCardinality-2023-13 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-004B-CTLCardinality-2023-14 CANNOT_COMPUTE
FORMULA ShieldPPPs-PT-004B-CTLCardinality-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716960832557
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
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
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-004B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldPPPs-PT-004B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758700409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-004B.tgz
mv ShieldPPPs-PT-004B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;