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.r035-tajo-162038167700093.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 gold2020
Input is BusinessProcesses-PT-07, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-tajo-162038167700093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.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.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K 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.8K 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 100K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620904319789

[2021-05-13 11:12:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 11:12:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 11:12:01] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-13 11:12:01] [INFO ] Transformed 386 places.
[2021-05-13 11:12:01] [INFO ] Transformed 360 transitions.
[2021-05-13 11:12:01] [INFO ] Found NUPN structural information;
[2021-05-13 11:12:01] [INFO ] Parsed PT model containing 386 places and 360 transitions in 113 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
Incomplete random walk after 100000 steps, including 1093 resets, run finished after 1292 ms. (steps per millisecond=77 ) properties seen :[1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1]
// Phase 1: matrix 360 rows 386 cols
[2021-05-13 11:12:02] [INFO ] Computed 62 place invariants in 22 ms
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 33 positive place invariants in 44 ms returned sat
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 19 ms returned sat
[2021-05-13 11:12:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:03] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 12 places in 201 ms
[2021-05-13 11:12:03] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 17 places in 79 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 15 places in 82 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 20 places in 43 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 28 places in 32 ms
[2021-05-13 11:12:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 662 ms
[2021-05-13 11:12:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2021-05-13 11:12:04] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 11 ms returned sat
[2021-05-13 11:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:04] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 95 places in 123 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 12 places in 53 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 17 places in 35 ms
[2021-05-13 11:12:04] [INFO ] Deduced a trap composed of 28 places in 30 ms
[2021-05-13 11:12:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 318 ms
[2021-05-13 11:12:05] [INFO ] Computed and/alt/rep : 359/1286/359 causal constraints in 27 ms.
[2021-05-13 11:12:06] [INFO ] Added : 239 causal constraints over 48 iterations in 1573 ms. Result :sat
[2021-05-13 11:12:06] [INFO ] Deduced a trap composed of 100 places in 183 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 105 places in 204 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 90 places in 157 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 99 places in 132 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 100 places in 153 ms
[2021-05-13 11:12:07] [INFO ] Deduced a trap composed of 98 places in 151 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 89 places in 240 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 97 places in 228 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 90 places in 137 ms
[2021-05-13 11:12:08] [INFO ] Deduced a trap composed of 85 places in 156 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 92 places in 140 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 81 places in 123 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 99 places in 160 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 89 places in 149 ms
[2021-05-13 11:12:09] [INFO ] Deduced a trap composed of 91 places in 131 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 92 places in 142 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 90 places in 204 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 99 places in 159 ms
[2021-05-13 11:12:10] [INFO ] Deduced a trap composed of 105 places in 160 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 82 places in 132 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 87 places in 150 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 86 places in 206 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 96 places in 159 ms
[2021-05-13 11:12:11] [INFO ] Deduced a trap composed of 87 places in 128 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 87 places in 114 ms
[2021-05-13 11:12:12] [INFO ] Deduced a trap composed of 92 places in 138 ms
[2021-05-13 11:12:12] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 5817 ms
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned unsat
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned sat
[2021-05-13 11:12:12] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 33 ms returned sat
[2021-05-13 11:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2021-05-13 11:12:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 33 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 33 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 33 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned unsat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned sat
[2021-05-13 11:12:13] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-13 11:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:14] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2021-05-13 11:12:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:14] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:14] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:14] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2021-05-13 11:12:14] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 14 ms returned sat
[2021-05-13 11:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:14] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2021-05-13 11:12:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:15] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:15] [INFO ] [Real]Absence check using 33 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:15] [INFO ] [Real]Absence check using 33 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:15] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:15] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:15] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned unsat
[2021-05-13 11:12:15] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:15] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:15] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:15] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:15] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 33 positive place invariants in 24 ms returned unsat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned unsat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned unsat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned unsat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 33 positive place invariants in 38 ms returned unsat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:16] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 33 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:17] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned unsat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 33 positive place invariants in 26 ms returned sat
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 18 ms returned sat
[2021-05-13 11:12:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:18] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 10 places in 128 ms
[2021-05-13 11:12:18] [INFO ] Deduced a trap composed of 39 places in 147 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 21 places in 122 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 23 places in 120 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 39 places in 125 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 12 places in 127 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 11 places in 108 ms
[2021-05-13 11:12:19] [INFO ] Deduced a trap composed of 11 places in 118 ms
[2021-05-13 11:12:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 1099 ms
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 33 positive place invariants in 24 ms returned unsat
[2021-05-13 11:12:19] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned unsat
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned unsat
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 16 ms returned sat
[2021-05-13 11:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2021-05-13 11:12:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2021-05-13 11:12:20] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 23 ms returned sat
[2021-05-13 11:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:21] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2021-05-13 11:12:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 11:12:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 66 ms returned sat
[2021-05-13 11:12:21] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 14 ms returned sat
[2021-05-13 11:12:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 11:12:21] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 10 places in 188 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 36 places in 155 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 39 places in 173 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 41 places in 167 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 45 places in 201 ms
[2021-05-13 11:12:22] [INFO ] Deduced a trap composed of 96 places in 124 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 46 places in 136 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 98 places in 134 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 36 places in 119 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 44 places in 113 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 95 places in 110 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 25 places in 99 ms
[2021-05-13 11:12:23] [INFO ] Deduced a trap composed of 83 places in 108 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 85 places in 110 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 85 places in 125 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 90 places in 108 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 88 places in 154 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 91 places in 127 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 89 places in 128 ms
[2021-05-13 11:12:24] [INFO ] Deduced a trap composed of 93 places in 153 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 94 places in 157 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 92 places in 146 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 85 places in 144 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 94 places in 117 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 88 places in 121 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 85 places in 114 ms
[2021-05-13 11:12:25] [INFO ] Deduced a trap composed of 88 places in 117 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 90 places in 117 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 25 places in 129 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 91 places in 138 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 86 places in 110 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 95 places in 119 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 84 places in 126 ms
[2021-05-13 11:12:26] [INFO ] Deduced a trap composed of 94 places in 131 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 95 places in 139 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 97 places in 144 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 95 places in 111 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 98 places in 135 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 90 places in 123 ms
[2021-05-13 11:12:27] [INFO ] Deduced a trap composed of 93 places in 132 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 90 places in 135 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 92 places in 121 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 95 places in 108 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 105 places in 118 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 29 places in 147 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 31 places in 144 ms
[2021-05-13 11:12:28] [INFO ] Deduced a trap composed of 85 places in 141 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 86 places in 134 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 88 places in 126 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 32 places in 148 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 96 places in 149 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 92 places in 114 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 93 places in 114 ms
[2021-05-13 11:12:29] [INFO ] Deduced a trap composed of 94 places in 109 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 93 places in 143 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 92 places in 113 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 95 places in 109 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 107 places in 107 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 102 places in 110 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 94 places in 150 ms
[2021-05-13 11:12:30] [INFO ] Deduced a trap composed of 24 places in 113 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 50 places in 117 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 90 places in 118 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 88 places in 111 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 37 places in 117 ms
[2021-05-13 11:12:31] [INFO ] Deduced a trap composed of 97 places in 114 ms
[2021-05-13 11:12:31] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 9742 ms
[2021-05-13 11:12:31] [INFO ] Computed and/alt/rep : 359/1286/359 causal constraints in 24 ms.
[2021-05-13 11:12:33] [INFO ] Added : 256 causal constraints over 52 iterations in 1589 ms. Result :sat
[2021-05-13 11:12:33] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:33] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned unsat
[2021-05-13 11:12:33] [INFO ] [Real]Absence check using 33 positive place invariants in 16 ms returned unsat
[2021-05-13 11:12:33] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:33] [INFO ] [Real]Absence check using 33 positive place invariants in 18 ms returned unsat
[2021-05-13 11:12:33] [INFO ] [Real]Absence check using 33 positive place invariants in 19 ms returned unsat
[2021-05-13 11:12:33] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned unsat
[2021-05-13 11:12:33] [INFO ] [Real]Absence check using 33 positive place invariants in 19 ms returned unsat
Successfully simplified 64 atomic propositions for a total of 64 simplifications.
[2021-05-13 11:12:34] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-13 11:12:34] [INFO ] Flatten gal took : 88 ms
[2021-05-13 11:12:34] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-13 11:12:34] [INFO ] Flatten gal took : 38 ms
FORMULA BusinessProcesses-PT-07-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 11:12:34] [INFO ] Applying decomposition
[2021-05-13 11:12:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 11:12:34] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph10932652426120411436.txt, -o, /tmp/graph10932652426120411436.bin, -w, /tmp/graph10932652426120411436.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph10932652426120411436.bin, -l, -1, -v, -w, /tmp/graph10932652426120411436.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 11:12:34] [INFO ] Decomposing Gal with order
[2021-05-13 11:12:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:12:34] [INFO ] Removed a total of 209 redundant transitions.
[2021-05-13 11:12:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 11:12:34] [INFO ] Flatten gal took : 98 ms
[2021-05-13 11:12:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 26 ms.
[2021-05-13 11:12:34] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 13 ms
[2021-05-13 11:12:34] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.14359e+17,321.649,4224488,2,587738,5,1.64027e+07,6,0,1906,1.78951e+07,0


Converting to forward existential form...Done !
original formula: FALSE
=> equivalent forward existential formula: [(Init * FALSE)] != FALSE
(forward)formula 0,0,321.733,4224488,1,0,5,1.64027e+07,7,0,1906,1.78951e+07,0
FORMULA BusinessProcesses-PT-07-CTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 1,0,321.89,4224488,1,0,6,1.64027e+07,7,1,2351,1.78951e+07,1
FORMULA BusinessProcesses-PT-07-CTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 2,0,321.891,4224488,1,0,6,1.64027e+07,7,1,2351,1.78951e+07,1
FORMULA BusinessProcesses-PT-07-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG(((A(EG(TRUE) U AF((gi3.gu11.p277<=((((((((gi3.gu11.p122+gi3.gu11.p195)+gi3.gu11.p51)+gi3.gu11.p337)+gi3.gu11.p105)+gi3.gu11.p158)+gi3.gu11.p173)+gi3.gu11.p126)+gi3.gu11.p22)))) + AG(EF((((((((gi9.gu72.p106+gi9.gu72.p329)+gi9.gu72.p65)+gi9.gu72.p231)+gi9.gu72.p166)+gi9.gu72.p360)+gi9.gu72.p146)<=(((((((((gi9.gu72.p228+gi9.gu72.p283)+gi9.gu72.p149)+gi9.gu72.p100)+gi9.gu72.p79)+gi9.gu72.p351)+gi9.gu72.p213)+gi9.gu72.p132)+gi9.gu72.p286)+gi9.gu72.p115))))) + EG((!(AG(((((((gi2.gu9.p284+gi2.gu9.p20)+gi6.gu39.p68)+gi2.gu9.p365)+gi2.gu9.p330)+gi2.gu9.p203)<=((((((((gi2.gu9.p326+gi2.gu9.p117)+gi6.gu39.p119)+gi7.gu50.p206)+gi2.gu9.p317)+gi9.gu72.p351)+gi2.gu9.p59)+gi2.gu9.p98)+gi2.gu9.p96)))) + ((((((((((gi10.gu85.p327+gi10.gu85.p114)+gi10.gu85.p37)+gi10.gu85.p161)+gi10.gu85.p70)+gi10.gu85.p361)+gi9.gu72.p166)+gi10.gu85.p247)+gi10.gu85.p242)+gi10.gu85.p287)<=gi10.gu85.p336)))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(EG((!(!(E(TRUE U !(((((((gi2.gu9.p284+gi2.gu9.p20)+gi6.gu39.p68)+gi2.gu9.p365)+gi2.gu9.p330)+gi2.gu9.p203)<=((((((((gi2.gu9.p326+gi2.gu9.p117)+gi6.gu39.p119)+gi7.gu50.p206)+gi2.gu9.p317)+gi9.gu72.p351)+gi2.gu9.p59)+gi2.gu9.p98)+gi2.gu9.p96)))))) + ((((((((((gi10.gu85.p327+gi10.gu85.p114)+gi10.gu85.p37)+gi10.gu85.p161)+gi10.gu85.p70)+gi10.gu85.p361)+gi9.gu72.p166)+gi10.gu85.p247)+gi10.gu85.p242)+gi10.gu85.p287)<=gi10.gu85.p336))))) * !(!((E(!(!(EG(!((gi3.gu11.p277<=((((((((gi3.gu11.p122+gi3.gu11.p195)+gi3.gu11.p51)+gi3.gu11.p337)+gi3.gu11.p105)+gi3.gu11.p158)+gi3.gu11.p173)+gi3.gu11.p126)+gi3.gu11.p22)))))) U (!(EG(TRUE)) * !(!(EG(!((gi3.gu11.p277<=((((((((gi3.gu11.p122+gi3.gu11.p195)+gi3.gu11.p51)+gi3.gu11.p337)+gi3.gu11.p105)+gi3.gu11.p158)+gi3.gu11.p173)+gi3.gu11.p126)+gi3.gu11.p22)))))))) + EG(!(!(EG(!((gi3.gu11.p277<=((((((((gi3.gu11.p122+gi3.gu11.p195)+gi3.gu11.p51)+gi3.gu11.p337)+gi3.gu11.p105)+gi3.gu11.p158)+gi3.gu11.p173)+gi3.gu11.p126)+gi3.gu11.p22))))))))))),TRUE) * !(E(TRUE U (((((((gi9.gu72.p106+gi9.gu72.p329)+gi9.gu72.p65)+gi9.gu72.p231)+gi9.gu72.p166)+gi9.gu72.p360)+gi9.gu72.p146)<=(((((((((gi9.gu72.p228+gi9.gu72.p283)+gi9.gu72.p149)+gi9.gu72.p100)+gi9.gu72.p79)+gi9.gu72.p351)+gi9.gu72.p213)+gi9.gu72.p132)+gi9.gu72.p286)+gi9.gu72.p115)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions gi0.gu13.t151, gi0.gu15.t253, gi1.gu78.t154, gi2.gu7.t260, gi2.gu9.t78, gi3.gu10.t262, gi3.gu11.t191, gi3.gu41.t171, gi3.t258, gi5.gu46.t165, gi5.gu47.t163, gi5.t162, gi6.gu22.t229, gi6.gu39.t147, gi6.gu39.t183, gi6.t231, gi6.t146, gi7.gu12.t257, gi7.t179, gi8.gu17.t247, gi8.gu52.t143, gi8.gu53.t139, gi8.gu55.t135, gi8.t242, gi8.t138, gi8.t134, gi9.gu57.t131, gi9.gu72.t12, gi9.gu72.t29, gi9.gu72.t43, gi9.gu72.t51, gi9.gu72.t57, gi9.gu72.t80, gi9.gu72.t187, gi9.t130, gi9.t89, gi9.t84, gi9.t73, gi9.t71, gi9.t59, gi9.t20, gi9.t14, gi10.gu0.t159, gi10.gu85.t115, gi10.gu85.t119, gi10.gu85.t224, gi10.t158, gi10.t114, gi11.gi1.gu61.t123, gi11.gi1.t122, gi11.gi2.gi1.gu64.t107, gi11.gi2.gi1.t106, gi11.gi2.gi2.gu66.t103, gi11.gi2.gi2.t102, gi11.gi3.gi0.gu23.t207, gi11.gi3.gi0.gu23.t211, gi11.gi3.gi0.gu23.t215, gi11.gi3.gi0.gu23.t221, gi11.gi3.gi0.t203, gi11.gi3.gi0.t201, gi11.gi3.gi1.gu58.t127, gi11.gi3.gi1.t126, gi11.gi3.gi3.gu63.t111, gi11.t196, t17, t32, t47, t64, t76, t82, t91, t96, t110, t118, t142, t150, t155, t166, t172, t175, t195, t199, t233, t237, t238, t241, t248, t254, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :32/228/88/348
(forward)formula 3,1,1040.52,11752344,1,0,698,5.8665e+07,14,310,6198,4.08978e+07,11
FORMULA BusinessProcesses-PT-07-CTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2021-05-13 11:32:45] [INFO ] Applying decomposition
[2021-05-13 11:32:45] [INFO ] Flatten gal took : 35 ms
[2021-05-13 11:32:45] [INFO ] Decomposing Gal with order
[2021-05-13 11:32:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 11:32:45] [INFO ] Removed a total of 117 redundant transitions.
[2021-05-13 11:32:45] [INFO ] Flatten gal took : 60 ms
[2021-05-13 11:32:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2021-05-13 11:32:45] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 8 ms
[2021-05-13 11:32:45] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Detected timeout of ITS tools.
[2021-05-13 11:52:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 11:52:58] [INFO ] Flatten gal took : 808 ms
[2021-05-13 11:52:58] [INFO ] Input system was already deterministic with 360 transitions.
[2021-05-13 11:52:58] [INFO ] Transformed 386 places.
[2021-05-13 11:52:58] [INFO ] Transformed 360 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-13 11:53:28] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 12 ms
[2021-05-13 11:53:28] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-07.tgz
mv BusinessProcesses-PT-07 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;