Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399600480.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-04, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399600480
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K May 18 16:42 model.pnml

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

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

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1716333766148

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-21 23:22:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:22:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:22:47] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-21 23:22:47] [INFO ] Transformed 288 places.
[2024-05-21 23:22:47] [INFO ] Transformed 283 transitions.
[2024-05-21 23:22:47] [INFO ] Found NUPN structural information;
[2024-05-21 23:22:47] [INFO ] Parsed PT model containing 288 places and 283 transitions and 916 arcs in 176 ms.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 286/286 places, 281/281 transitions.
[2024-05-21 23:22:47] [INFO ] Redundant transitions in 12 ms returned []
Running 280 sub problems to find dead transitions.
// Phase 1: matrix 281 rows 286 cols
[2024-05-21 23:22:47] [INFO ] Computed 44 invariants in 38 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 282/282 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 22/304 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 4/286 variables, 21/325 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 4/329 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 22 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 2 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:22:52] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:22:53] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:22:53] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 3 ms to minimize.
[2024-05-21 23:22:53] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 13 ms to minimize.
[2024-05-21 23:22:53] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:22:53] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:22:53] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:22:53] [INFO ] Deduced a trap composed of 87 places in 193 ms of which 2 ms to minimize.
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 73 places in 209 ms of which 2 ms to minimize.
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 59 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:22:54] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:22:55] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:22:56] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 87 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 6 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:22:57] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 20/370 constraints. Problems are: Problem set: 0 solved, 280 unsolved
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:22:58] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:22:59] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 5 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:23:00] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 20/390 constraints. Problems are: Problem set: 4 solved, 276 unsolved
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:23:01] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:23:02] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 20/410 constraints. Problems are: Problem set: 4 solved, 276 unsolved
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:23:06] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 20/430 constraints. Problems are: Problem set: 4 solved, 276 unsolved
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:23:07] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:23:08] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:23:09] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:23:09] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:23:09] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:23:09] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:23:09] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:23:09] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 20/450 constraints. Problems are: Problem set: 4 solved, 276 unsolved
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 1 ms to minimize.
[2024-05-21 23:23:10] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:23:11] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:23:12] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:23:12] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:23:12] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:23:12] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 20/470 constraints. Problems are: Problem set: 4 solved, 276 unsolved
[2024-05-21 23:23:14] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:23:14] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:23:14] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:23:14] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:23:15] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:23:16] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:23:16] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:23:16] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:23:16] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:23:16] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:23:16] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:23:16] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/286 variables, 20/490 constraints. Problems are: Problem set: 4 solved, 276 unsolved
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:23:17] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:23:18] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
SMT process timed out in 30285ms, After SMT, problems are : Problem set: 4 solved, 276 unsolved
Search for dead transitions found 4 dead transitions in 30306ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 286/286 places, 277/281 transitions.
[2024-05-21 23:23:18] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 30437 ms. Remains : 286/286 places, 277/281 transitions.
Final net has 286 places and 277 transitions.
[2024-05-21 23:23:18] [INFO ] Flatten gal took : 78 ms
[2024-05-21 23:23:18] [INFO ] Applying decomposition
[2024-05-21 23:23:18] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6161003921678593504.txt' '-o' '/tmp/graph6161003921678593504.bin' '-w' '/tmp/graph6161003921678593504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6161003921678593504.bin' '-l' '-1' '-v' '-w' '/tmp/graph6161003921678593504.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:23:18] [INFO ] Decomposing Gal with order
[2024-05-21 23:23:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:23:18] [INFO ] Removed a total of 224 redundant transitions.
[2024-05-21 23:23:18] [INFO ] Flatten gal took : 75 ms
[2024-05-21 23:23:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 22 ms.
[2024-05-21 23:23:18] [INFO ] Time to serialize gal into /tmp/StateSpace15834033940270025333.gal : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace15834033940270025333.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...220
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.19702e+11,1.39985,41336,3937,71,70466,720,853,121909,66,2671,0
Total reachable state count : 219702042353

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 25
STATE_SPACE MAX_TOKEN_PER_MARKING 25 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 219702042353
STATE_SPACE STATES 219702042353 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 32791 ms.

BK_STOP 1716333800290

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="BusinessProcesses-PT-04"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-04, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399600480"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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