Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 104K May 5 16:51 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620544624300

Running Version 0
[2021-05-09 07:17:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 07:17:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:17:06] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2021-05-09 07:17:06] [INFO ] Transformed 403 places.
[2021-05-09 07:17:06] [INFO ] Transformed 374 transitions.
[2021-05-09 07:17:06] [INFO ] Found NUPN structural information;
[2021-05-09 07:17:06] [INFO ] Parsed PT model containing 403 places and 374 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 374 rows 403 cols
[2021-05-09 07:17:06] [INFO ] Computed 65 place invariants in 28 ms
Incomplete random walk after 10000 steps, including 106 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :11
FORMULA BusinessProcesses-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 5) seen :1
FORMULA BusinessProcesses-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
// Phase 1: matrix 374 rows 403 cols
[2021-05-09 07:17:06] [INFO ] Computed 65 place invariants in 8 ms
[2021-05-09 07:17:07] [INFO ] [Real]Absence check using 36 positive place invariants in 25 ms returned sat
[2021-05-09 07:17:07] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 23 ms returned sat
[2021-05-09 07:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:07] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-09 07:17:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:17:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-09 07:17:07] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-09 07:17:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:07] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-09 07:17:07] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 4 ms to minimize.
[2021-05-09 07:17:07] [INFO ] Deduced a trap composed of 96 places in 199 ms of which 1 ms to minimize.
[2021-05-09 07:17:08] [INFO ] Deduced a trap composed of 93 places in 210 ms of which 1 ms to minimize.
[2021-05-09 07:17:08] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 0 ms to minimize.
[2021-05-09 07:17:08] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 0 ms to minimize.
[2021-05-09 07:17:08] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:17:08] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:17:09] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 1 ms to minimize.
[2021-05-09 07:17:09] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:17:09] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 1 ms to minimize.
[2021-05-09 07:17:09] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2021-05-09 07:17:09] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:17:09] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
[2021-05-09 07:17:09] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:17:09] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:17:10] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 1 ms to minimize.
[2021-05-09 07:17:10] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 1 ms to minimize.
[2021-05-09 07:17:10] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 1 ms to minimize.
[2021-05-09 07:17:10] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2021-05-09 07:17:10] [INFO ] Deduced a trap composed of 99 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:17:10] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 1 ms to minimize.
[2021-05-09 07:17:10] [INFO ] Deduced a trap composed of 106 places in 91 ms of which 1 ms to minimize.
[2021-05-09 07:17:11] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2021-05-09 07:17:11] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 0 ms to minimize.
[2021-05-09 07:17:11] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 7 ms to minimize.
[2021-05-09 07:17:11] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 0 ms to minimize.
[2021-05-09 07:17:11] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:17:11] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4138 ms
[2021-05-09 07:17:11] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 22 ms.
[2021-05-09 07:17:12] [INFO ] Added : 111 causal constraints over 23 iterations in 624 ms. Result :sat
Minimization took 15 ms.
[2021-05-09 07:17:12] [INFO ] [Real]Absence check using 36 positive place invariants in 26 ms returned sat
[2021-05-09 07:17:12] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 15 ms returned sat
[2021-05-09 07:17:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:12] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2021-05-09 07:17:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:17:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2021-05-09 07:17:12] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 6 ms returned sat
[2021-05-09 07:17:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:12] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-09 07:17:12] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2021-05-09 07:17:13] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 26 ms to minimize.
[2021-05-09 07:17:13] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2021-05-09 07:17:13] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 0 ms to minimize.
[2021-05-09 07:17:13] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 0 ms to minimize.
[2021-05-09 07:17:13] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 6 ms to minimize.
[2021-05-09 07:17:13] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2021-05-09 07:17:13] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 5 ms to minimize.
[2021-05-09 07:17:13] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:17:13] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:17:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1096 ms
[2021-05-09 07:17:13] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 17 ms.
[2021-05-09 07:17:15] [INFO ] Added : 211 causal constraints over 43 iterations in 1159 ms. Result :sat
Minimization took 66 ms.
[2021-05-09 07:17:15] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2021-05-09 07:17:15] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-09 07:17:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:15] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-09 07:17:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:17:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2021-05-09 07:17:15] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-09 07:17:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:15] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2021-05-09 07:17:15] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2021-05-09 07:17:15] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 0 ms to minimize.
[2021-05-09 07:17:15] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2021-05-09 07:17:16] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:17:16] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2021-05-09 07:17:16] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2021-05-09 07:17:16] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:17:16] [INFO ] Deduced a trap composed of 96 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:17:16] [INFO ] Deduced a trap composed of 96 places in 73 ms of which 0 ms to minimize.
[2021-05-09 07:17:16] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 1 ms to minimize.
[2021-05-09 07:17:16] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 1 ms to minimize.
[2021-05-09 07:17:16] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:17:17] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 0 ms to minimize.
[2021-05-09 07:17:17] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:17:17] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 1 ms to minimize.
[2021-05-09 07:17:17] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 1 ms to minimize.
[2021-05-09 07:17:17] [INFO ] Deduced a trap composed of 110 places in 105 ms of which 1 ms to minimize.
[2021-05-09 07:17:17] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2021-05-09 07:17:17] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1940 ms
[2021-05-09 07:17:17] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 22 ms.
[2021-05-09 07:17:18] [INFO ] Added : 192 causal constraints over 39 iterations in 856 ms. Result :sat
Minimization took 63 ms.
[2021-05-09 07:17:18] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2021-05-09 07:17:18] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 19 ms returned sat
[2021-05-09 07:17:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:18] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2021-05-09 07:17:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:17:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2021-05-09 07:17:18] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 10 ms returned sat
[2021-05-09 07:17:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:17:19] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-09 07:17:19] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 4 ms to minimize.
[2021-05-09 07:17:19] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2021-05-09 07:17:19] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2021-05-09 07:17:19] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:17:19] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2021-05-09 07:17:19] [INFO ] Deduced a trap composed of 106 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:17:19] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:17:20] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2021-05-09 07:17:20] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 1 ms to minimize.
[2021-05-09 07:17:20] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:17:20] [INFO ] Deduced a trap composed of 100 places in 77 ms of which 1 ms to minimize.
[2021-05-09 07:17:20] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 13 ms to minimize.
[2021-05-09 07:17:20] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:17:20] [INFO ] Deduced a trap composed of 110 places in 82 ms of which 1 ms to minimize.
[2021-05-09 07:17:20] [INFO ] Deduced a trap composed of 92 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:17:20] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 0 ms to minimize.
[2021-05-09 07:17:20] [INFO ] Deduced a trap composed of 105 places in 82 ms of which 0 ms to minimize.
[2021-05-09 07:17:20] [INFO ] Deduced a trap composed of 113 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:17:21] [INFO ] Deduced a trap composed of 94 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:17:21] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 0 ms to minimize.
[2021-05-09 07:17:21] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 1 ms to minimize.
[2021-05-09 07:17:21] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 1 ms to minimize.
[2021-05-09 07:17:21] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 0 ms to minimize.
[2021-05-09 07:17:21] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2021-05-09 07:17:21] [INFO ] Deduced a trap composed of 104 places in 78 ms of which 0 ms to minimize.
[2021-05-09 07:17:21] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2021-05-09 07:17:21] [INFO ] Deduced a trap composed of 105 places in 97 ms of which 0 ms to minimize.
[2021-05-09 07:17:21] [INFO ] Deduced a trap composed of 101 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:17:21] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2021-05-09 07:17:21] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 0 ms to minimize.
[2021-05-09 07:17:22] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 0 ms to minimize.
[2021-05-09 07:17:22] [INFO ] Deduced a trap composed of 93 places in 67 ms of which 1 ms to minimize.
[2021-05-09 07:17:22] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 1 ms to minimize.
[2021-05-09 07:17:22] [INFO ] Deduced a trap composed of 100 places in 71 ms of which 1 ms to minimize.
[2021-05-09 07:17:22] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 0 ms to minimize.
[2021-05-09 07:17:22] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 0 ms to minimize.
[2021-05-09 07:17:22] [INFO ] Deduced a trap composed of 113 places in 75 ms of which 1 ms to minimize.
[2021-05-09 07:17:22] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 0 ms to minimize.
[2021-05-09 07:17:23] [INFO ] Deduced a trap composed of 100 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:17:23] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:17:23] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 0 ms to minimize.
[2021-05-09 07:17:23] [INFO ] Deduced a trap composed of 107 places in 91 ms of which 1 ms to minimize.
[2021-05-09 07:17:23] [INFO ] Deduced a trap composed of 113 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:17:23] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:17:23] [INFO ] Deduced a trap composed of 110 places in 87 ms of which 0 ms to minimize.
[2021-05-09 07:17:23] [INFO ] Deduced a trap composed of 104 places in 69 ms of which 0 ms to minimize.
[2021-05-09 07:17:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 9500 steps, including 100 resets, run finished after 27 ms. (steps per millisecond=351 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA BusinessProcesses-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 15200 steps, including 183 resets, run finished after 38 ms. (steps per millisecond=400 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 374/374 transitions.
Graph (trivial) has 224 edges and 403 vertex of which 7 / 403 are part of one of the 1 SCC in 26 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 837 edges and 397 vertex of which 395 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 395 transition count 281
Reduce places removed 84 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 85 rules applied. Total rules applied 171 place count 311 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 310 transition count 280
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 172 place count 310 transition count 219
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 304 place count 239 transition count 219
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 350 place count 193 transition count 173
Iterating global reduction 3 with 46 rules applied. Total rules applied 396 place count 193 transition count 173
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 396 place count 193 transition count 168
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 407 place count 187 transition count 168
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 533 place count 123 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 535 place count 122 transition count 109
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 537 place count 122 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 539 place count 120 transition count 107
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 540 place count 120 transition count 107
Applied a total of 540 rules in 149 ms. Remains 120 /403 variables (removed 283) and now considering 107/374 (removed 267) transitions.
Finished structural reductions, in 1 iterations. Remains : 120/403 places, 107/374 transitions.
// Phase 1: matrix 107 rows 120 cols
[2021-05-09 07:17:24] [INFO ] Computed 51 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 68471 resets, run finished after 2104 ms. (steps per millisecond=475 ) properties (out of 2) seen :2
FORMULA BusinessProcesses-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620544646473

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-09"
export BK_EXAMINATION="UpperBounds"
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-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-09, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143800387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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