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.r092-tall-171624189500544.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 itstools
Input is DBSingleClientW-PT-d1m10, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189500544
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K 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 1716325041162

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-21 20:57:22] [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 20:57:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:57:22] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-21 20:57:22] [INFO ] Transformed 1440 places.
[2024-05-21 20:57:22] [INFO ] Transformed 672 transitions.
[2024-05-21 20:57:22] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 219 ms.
Deduced a syphon composed of 1093 places in 14 ms
Reduce places removed 1093 places and 0 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 347/347 places, 672/672 transitions.
[2024-05-21 20:57:22] [INFO ] Redundant transitions in 36 ms returned []
Running 671 sub problems to find dead transitions.
// Phase 1: matrix 672 rows 347 cols
[2024-05-21 20:57:22] [INFO ] Computed 6 invariants in 40 ms
[2024-05-21 20:57:23] [INFO ] State equation strengthened by 418 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (OVERLAPS) 8/333 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 20:57:35] [INFO ] Deduced a trap composed of 106 places in 180 ms of which 23 ms to minimize.
[2024-05-21 20:57:36] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 3 ms to minimize.
[2024-05-21 20:57:36] [INFO ] Deduced a trap composed of 148 places in 121 ms of which 3 ms to minimize.
[2024-05-21 20:57:36] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 3 ms to minimize.
[2024-05-21 20:57:36] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 3 ms to minimize.
[2024-05-21 20:57:36] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 3 ms to minimize.
[2024-05-21 20:57:36] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 3 ms to minimize.
[2024-05-21 20:57:36] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 2 ms to minimize.
[2024-05-21 20:57:36] [INFO ] Deduced a trap composed of 107 places in 105 ms of which 2 ms to minimize.
[2024-05-21 20:57:37] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 2 ms to minimize.
[2024-05-21 20:57:37] [INFO ] Deduced a trap composed of 145 places in 114 ms of which 2 ms to minimize.
[2024-05-21 20:57:37] [INFO ] Deduced a trap composed of 114 places in 103 ms of which 2 ms to minimize.
[2024-05-21 20:57:37] [INFO ] Deduced a trap composed of 110 places in 107 ms of which 2 ms to minimize.
[2024-05-21 20:57:37] [INFO ] Deduced a trap composed of 115 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:57:37] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:57:37] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-21 20:57:38] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-21 20:57:38] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:57:38] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 2 ms to minimize.
[2024-05-21 20:57:38] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 20:57:42] [INFO ] Deduced a trap composed of 160 places in 76 ms of which 2 ms to minimize.
[2024-05-21 20:57:45] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:57:45] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 2 ms to minimize.
[2024-05-21 20:57:45] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 2 ms to minimize.
[2024-05-21 20:57:45] [INFO ] Deduced a trap composed of 110 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:57:45] [INFO ] Deduced a trap composed of 103 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:57:45] [INFO ] Deduced a trap composed of 105 places in 82 ms of which 2 ms to minimize.
[2024-05-21 20:57:46] [INFO ] Deduced a trap composed of 110 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:57:46] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 1 ms to minimize.
[2024-05-21 20:57:46] [INFO ] Deduced a trap composed of 102 places in 86 ms of which 2 ms to minimize.
[2024-05-21 20:57:46] [INFO ] Deduced a trap composed of 102 places in 85 ms of which 2 ms to minimize.
[2024-05-21 20:57:46] [INFO ] Deduced a trap composed of 103 places in 84 ms of which 2 ms to minimize.
[2024-05-21 20:57:46] [INFO ] Deduced a trap composed of 102 places in 82 ms of which 2 ms to minimize.
[2024-05-21 20:57:46] [INFO ] Deduced a trap composed of 102 places in 84 ms of which 3 ms to minimize.
[2024-05-21 20:57:46] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 5 ms to minimize.
[2024-05-21 20:57:46] [INFO ] Deduced a trap composed of 103 places in 96 ms of which 2 ms to minimize.
[2024-05-21 20:57:47] [INFO ] Deduced a trap composed of 106 places in 86 ms of which 2 ms to minimize.
[2024-05-21 20:57:47] [INFO ] Deduced a trap composed of 112 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:57:47] [INFO ] Deduced a trap composed of 106 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:57:47] [INFO ] Deduced a trap composed of 119 places in 95 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 20:57:51] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 2 ms to minimize.
[2024-05-21 20:57:51] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2024-05-21 20:57:51] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:57:51] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-21 20:57:51] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 1 ms to minimize.
[2024-05-21 20:57:51] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 1 ms to minimize.
[2024-05-21 20:57:51] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-05-21 20:57:51] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:57:52] [INFO ] Deduced a trap composed of 43 places in 106 ms of which 2 ms to minimize.
[2024-05-21 20:57:52] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 3 ms to minimize.
[2024-05-21 20:57:52] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-21 20:57:52] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-21 20:57:52] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-21 20:57:52] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-05-21 20:57:52] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:57:52] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 5 ms to minimize.
[2024-05-21 20:57:53] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-21 20:57:53] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 4 ms to minimize.
[2024-05-21 20:57:53] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 1 ms to minimize.
[2024-05-21 20:57:53] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 333/1019 variables, and 65 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/4 constraints, State Equation: 0/347 constraints, ReadFeed: 0/418 constraints, PredecessorRefiner: 671/671 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 671 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 2 (OVERLAPS) 8/333 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/333 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 671 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 45/65 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 20:58:02] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 2 ms to minimize.
[2024-05-21 20:58:02] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 2 ms to minimize.
[2024-05-21 20:58:03] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 2 ms to minimize.
[2024-05-21 20:58:03] [INFO ] Deduced a trap composed of 105 places in 95 ms of which 3 ms to minimize.
[2024-05-21 20:58:03] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 2 ms to minimize.
[2024-05-21 20:58:03] [INFO ] Deduced a trap composed of 105 places in 79 ms of which 2 ms to minimize.
[2024-05-21 20:58:03] [INFO ] Deduced a trap composed of 105 places in 82 ms of which 2 ms to minimize.
[2024-05-21 20:58:03] [INFO ] Deduced a trap composed of 109 places in 79 ms of which 2 ms to minimize.
[2024-05-21 20:58:03] [INFO ] Deduced a trap composed of 110 places in 100 ms of which 2 ms to minimize.
[2024-05-21 20:58:04] [INFO ] Deduced a trap composed of 111 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:58:04] [INFO ] Deduced a trap composed of 109 places in 79 ms of which 2 ms to minimize.
[2024-05-21 20:58:04] [INFO ] Deduced a trap composed of 110 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:58:04] [INFO ] Deduced a trap composed of 110 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:58:04] [INFO ] Deduced a trap composed of 111 places in 89 ms of which 1 ms to minimize.
[2024-05-21 20:58:04] [INFO ] Deduced a trap composed of 110 places in 98 ms of which 2 ms to minimize.
[2024-05-21 20:58:04] [INFO ] Deduced a trap composed of 110 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:58:04] [INFO ] Deduced a trap composed of 110 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:58:04] [INFO ] Deduced a trap composed of 108 places in 92 ms of which 2 ms to minimize.
[2024-05-21 20:58:04] [INFO ] Deduced a trap composed of 108 places in 105 ms of which 2 ms to minimize.
[2024-05-21 20:58:05] [INFO ] Deduced a trap composed of 108 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 20:58:08] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 2 ms to minimize.
[2024-05-21 20:58:08] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:58:09] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:58:09] [INFO ] Deduced a trap composed of 116 places in 92 ms of which 2 ms to minimize.
[2024-05-21 20:58:09] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
[2024-05-21 20:58:09] [INFO ] Deduced a trap composed of 108 places in 94 ms of which 1 ms to minimize.
[2024-05-21 20:58:10] [INFO ] Deduced a trap composed of 108 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:58:10] [INFO ] Deduced a trap composed of 111 places in 84 ms of which 2 ms to minimize.
[2024-05-21 20:58:10] [INFO ] Deduced a trap composed of 106 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:58:10] [INFO ] Deduced a trap composed of 109 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:58:10] [INFO ] Deduced a trap composed of 109 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:58:10] [INFO ] Deduced a trap composed of 110 places in 84 ms of which 1 ms to minimize.
[2024-05-21 20:58:10] [INFO ] Deduced a trap composed of 112 places in 81 ms of which 2 ms to minimize.
[2024-05-21 20:58:10] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:58:10] [INFO ] Deduced a trap composed of 103 places in 84 ms of which 2 ms to minimize.
[2024-05-21 20:58:11] [INFO ] Deduced a trap composed of 103 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:58:11] [INFO ] Deduced a trap composed of 116 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 17/102 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 20:58:15] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2024-05-21 20:58:15] [INFO ] Deduced a trap composed of 129 places in 109 ms of which 2 ms to minimize.
[2024-05-21 20:58:15] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
[2024-05-21 20:58:15] [INFO ] Deduced a trap composed of 61 places in 109 ms of which 2 ms to minimize.
[2024-05-21 20:58:15] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 2 ms to minimize.
[2024-05-21 20:58:16] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 2 ms to minimize.
[2024-05-21 20:58:16] [INFO ] Deduced a trap composed of 112 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:58:16] [INFO ] Deduced a trap composed of 109 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:58:16] [INFO ] Deduced a trap composed of 112 places in 90 ms of which 1 ms to minimize.
[2024-05-21 20:58:16] [INFO ] Deduced a trap composed of 105 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:58:16] [INFO ] Deduced a trap composed of 109 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:58:16] [INFO ] Deduced a trap composed of 108 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:58:17] [INFO ] Deduced a trap composed of 108 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:58:17] [INFO ] Deduced a trap composed of 108 places in 92 ms of which 2 ms to minimize.
[2024-05-21 20:58:17] [INFO ] Deduced a trap composed of 108 places in 93 ms of which 2 ms to minimize.
[2024-05-21 20:58:17] [INFO ] Deduced a trap composed of 105 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:58:17] [INFO ] Deduced a trap composed of 103 places in 86 ms of which 2 ms to minimize.
[2024-05-21 20:58:17] [INFO ] Deduced a trap composed of 106 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:58:17] [INFO ] Deduced a trap composed of 106 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:58:17] [INFO ] Deduced a trap composed of 108 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 671 unsolved
[2024-05-21 20:58:21] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:58:22] [INFO ] Deduced a trap composed of 50 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:58:22] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 2 ms to minimize.
[2024-05-21 20:58:22] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 2 ms to minimize.
[2024-05-21 20:58:22] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:58:22] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
[2024-05-21 20:58:22] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-05-21 20:58:23] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-21 20:58:23] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-21 20:58:23] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:58:23] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:58:23] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-21 20:58:23] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 671 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/1019 variables, and 135 constraints, problems are : Problem set: 0 solved, 671 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/4 constraints, State Equation: 0/347 constraints, ReadFeed: 0/418 constraints, PredecessorRefiner: 0/671 constraints, Known Traps: 130/130 constraints]
After SMT, in 62398ms problems are : Problem set: 0 solved, 671 unsolved
Search for dead transitions found 0 dead transitions in 62427ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 62632 ms. Remains : 347/347 places, 672/672 transitions.
Final net has 347 places and 672 transitions.
[2024-05-21 20:58:25] [INFO ] Flatten gal took : 80 ms
[2024-05-21 20:58:25] [INFO ] Applying decomposition
[2024-05-21 20:58:25] [INFO ] Flatten gal took : 39 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/graph3297869062156909148.txt' '-o' '/tmp/graph3297869062156909148.bin' '-w' '/tmp/graph3297869062156909148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3297869062156909148.bin' '-l' '-1' '-v' '-w' '/tmp/graph3297869062156909148.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:58:25] [INFO ] Decomposing Gal with order
[2024-05-21 20:58:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:58:25] [INFO ] Removed a total of 525 redundant transitions.
[2024-05-21 20:58:26] [INFO ] Flatten gal took : 174 ms
[2024-05-21 20:58:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 724 labels/synchronizations in 34 ms.
[2024-05-21 20:58:26] [INFO ] Time to serialize gal into /tmp/StateSpace16450927130581109242.gal : 11 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/StateSpace16450927130581109242.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
ITS-tools command line returned an error code 137
[2024-05-21 21:06:30] [INFO ] Flatten gal took : 37 ms
[2024-05-21 21:06:30] [INFO ] Time to serialize gal into /tmp/StateSpace14136600541800886059.gal : 11 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/StateSpace14136600541800886059.gal' '-t' 'CGAL' '--stats' '--gen-order' 'FOLLOW'

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 ...241
ITS-tools command line returned an error code 137
[2024-05-21 21:17:07] [INFO ] Flatten gal took : 29 ms
[2024-05-21 21:17:07] [INFO ] Input system was already deterministic with 672 transitions.
[2024-05-21 21:17:07] [INFO ] Transformed 347 places.
[2024-05-21 21:17:07] [INFO ] Transformed 672 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 21:17:07] [INFO ] Time to serialize gal into /tmp/StateSpace14023802837940817311.gal : 4 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/StateSpace14023802837940817311.gal' '-t' 'CGAL' '--stats' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

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 ...286
Successfully loaded order from file /home/mcc/execution/model.ord
ITS-tools command line returned an error code 137
Total runtime 1762325 ms.

BK_STOP 1716326804848

--------------------
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="DBSingleClientW-PT-d1m10"
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 DBSingleClientW-PT-d1m10, 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 r092-tall-171624189500544"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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