Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699100470.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 63K Mar 24 05:37 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-03-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589250400350

[2020-05-12 02:26:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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]
[2020-05-12 02:26:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:26:42] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2020-05-12 02:26:42] [INFO ] Transformed 274 places.
[2020-05-12 02:26:42] [INFO ] Transformed 237 transitions.
[2020-05-12 02:26:42] [INFO ] Found NUPN structural information;
[2020-05-12 02:26:42] [INFO ] Parsed PT model containing 274 places and 237 transitions in 86 ms.
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 60 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 118 resets, run finished after 86 ms. (steps per millisecond=116 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 1, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 236 rows 273 cols
[2020-05-12 02:26:43] [INFO ] Computed 43 place invariants in 28 ms
[2020-05-12 02:26:43] [INFO ] [Real]Absence check using 31 positive place invariants in 53 ms returned sat
[2020-05-12 02:26:43] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-05-12 02:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:26:43] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2020-05-12 02:26:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:26:43] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned unsat
[2020-05-12 02:26:44] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2020-05-12 02:26:44] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 11 ms returned sat
[2020-05-12 02:26:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:26:44] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2020-05-12 02:26:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:26:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 48 ms returned sat
[2020-05-12 02:26:44] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-05-12 02:26:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:26:44] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2020-05-12 02:26:44] [INFO ] Deduced a trap composed of 14 places in 143 ms
[2020-05-12 02:26:44] [INFO ] Deduced a trap composed of 12 places in 220 ms
[2020-05-12 02:26:45] [INFO ] Deduced a trap composed of 14 places in 128 ms
[2020-05-12 02:26:46] [INFO ] Deduced a trap composed of 15 places in 1162 ms
[2020-05-12 02:26:46] [INFO ] Deduced a trap composed of 33 places in 79 ms
[2020-05-12 02:26:47] [INFO ] Deduced a trap composed of 11 places in 1082 ms
[2020-05-12 02:26:47] [INFO ] Deduced a trap composed of 19 places in 78 ms
[2020-05-12 02:26:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3060 ms
[2020-05-12 02:26:47] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 18 ms.
[2020-05-12 02:26:48] [INFO ] Added : 108 causal constraints over 22 iterations in 479 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-05-12 02:26:48] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2020-05-12 02:26:48] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-05-12 02:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:26:48] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2020-05-12 02:26:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:26:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 28 ms returned sat
[2020-05-12 02:26:48] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-05-12 02:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:26:48] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2020-05-12 02:26:48] [INFO ] Deduced a trap composed of 11 places in 96 ms
[2020-05-12 02:26:48] [INFO ] Deduced a trap composed of 19 places in 77 ms
[2020-05-12 02:26:49] [INFO ] Deduced a trap composed of 15 places in 77 ms
[2020-05-12 02:26:49] [INFO ] Deduced a trap composed of 69 places in 104 ms
[2020-05-12 02:26:49] [INFO ] Deduced a trap composed of 24 places in 78 ms
[2020-05-12 02:26:49] [INFO ] Deduced a trap composed of 13 places in 54 ms
[2020-05-12 02:26:49] [INFO ] Deduced a trap composed of 12 places in 48 ms
[2020-05-12 02:26:49] [INFO ] Deduced a trap composed of 38 places in 47 ms
[2020-05-12 02:26:49] [INFO ] Deduced a trap composed of 28 places in 44 ms
[2020-05-12 02:26:49] [INFO ] Deduced a trap composed of 35 places in 65 ms
[2020-05-12 02:26:49] [INFO ] Deduced a trap composed of 35 places in 74 ms
[2020-05-12 02:26:49] [INFO ] Deduced a trap composed of 9 places in 54 ms
[2020-05-12 02:26:49] [INFO ] Deduced a trap composed of 26 places in 45 ms
[2020-05-12 02:26:49] [INFO ] Deduced a trap composed of 23 places in 58 ms
[2020-05-12 02:26:49] [INFO ] Deduced a trap composed of 27 places in 56 ms
[2020-05-12 02:26:49] [INFO ] Deduced a trap composed of 27 places in 78 ms
[2020-05-12 02:26:50] [INFO ] Deduced a trap composed of 15 places in 66 ms
[2020-05-12 02:26:50] [INFO ] Deduced a trap composed of 27 places in 42 ms
[2020-05-12 02:26:50] [INFO ] Deduced a trap composed of 35 places in 65 ms
[2020-05-12 02:26:50] [INFO ] Deduced a trap composed of 40 places in 41 ms
[2020-05-12 02:26:50] [INFO ] Deduced a trap composed of 29 places in 56 ms
[2020-05-12 02:26:50] [INFO ] Deduced a trap composed of 27 places in 54 ms
[2020-05-12 02:26:50] [INFO ] Deduced a trap composed of 30 places in 55 ms
[2020-05-12 02:26:50] [INFO ] Deduced a trap composed of 37 places in 52 ms
[2020-05-12 02:26:50] [INFO ] Deduced a trap composed of 28 places in 55 ms
[2020-05-12 02:26:50] [INFO ] Deduced a trap composed of 39 places in 65 ms
[2020-05-12 02:26:50] [INFO ] Deduced a trap composed of 46 places in 39 ms
[2020-05-12 02:26:50] [INFO ] Deduced a trap composed of 29 places in 43 ms
[2020-05-12 02:26:50] [INFO ] Deduced a trap composed of 46 places in 36 ms
[2020-05-12 02:26:50] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 2082 ms
[2020-05-12 02:26:50] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 34 ms.
[2020-05-12 02:26:51] [INFO ] Added : 132 causal constraints over 27 iterations in 564 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-05-12 02:26:51] [INFO ] [Real]Absence check using 31 positive place invariants in 64 ms returned sat
[2020-05-12 02:26:51] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2020-05-12 02:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:26:51] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2020-05-12 02:26:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:26:51] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2020-05-12 02:26:51] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2020-05-12 02:26:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:26:52] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2020-05-12 02:26:52] [INFO ] Deduced a trap composed of 14 places in 129 ms
[2020-05-12 02:26:52] [INFO ] Deduced a trap composed of 14 places in 62 ms
[2020-05-12 02:26:55] [INFO ] Deduced a trap composed of 11 places in 2776 ms
[2020-05-12 02:26:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3038 ms
[2020-05-12 02:26:55] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 11 ms.
[2020-05-12 02:26:55] [INFO ] Added : 82 causal constraints over 17 iterations in 474 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-05-12 02:26:55] [INFO ] [Real]Absence check using 31 positive place invariants in 211 ms returned sat
[2020-05-12 02:26:56] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 54 ms returned sat
[2020-05-12 02:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:26:57] [INFO ] [Real]Absence check using state equation in 1859 ms returned sat
[2020-05-12 02:26:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:26:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 133 ms returned unsat
[2020-05-12 02:26:58] [INFO ] [Real]Absence check using 31 positive place invariants in 137 ms returned sat
[2020-05-12 02:26:58] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 29 ms returned sat
[2020-05-12 02:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:26:58] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2020-05-12 02:26:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:26:58] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2020-05-12 02:26:58] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2020-05-12 02:26:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:26:58] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2020-05-12 02:26:58] [INFO ] Deduced a trap composed of 11 places in 64 ms
[2020-05-12 02:26:58] [INFO ] Deduced a trap composed of 21 places in 84 ms
[2020-05-12 02:26:58] [INFO ] Deduced a trap composed of 18 places in 62 ms
[2020-05-12 02:26:58] [INFO ] Deduced a trap composed of 20 places in 43 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 29 places in 44 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 15 places in 53 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 25 places in 44 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 42 places in 48 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 8 places in 58 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 31 places in 74 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 34 places in 62 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 29 places in 41 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 36 places in 39 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 12 places in 37 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 37 places in 37 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 40 places in 34 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 30 places in 48 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 36 places in 45 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 29 places in 56 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 38 places in 54 ms
[2020-05-12 02:26:59] [INFO ] Deduced a trap composed of 36 places in 37 ms
[2020-05-12 02:27:00] [INFO ] Deduced a trap composed of 35 places in 42 ms
[2020-05-12 02:27:00] [INFO ] Deduced a trap composed of 33 places in 38 ms
[2020-05-12 02:27:00] [INFO ] Deduced a trap composed of 43 places in 38 ms
[2020-05-12 02:27:00] [INFO ] Deduced a trap composed of 42 places in 36 ms
[2020-05-12 02:27:00] [INFO ] Deduced a trap composed of 27 places in 35 ms
[2020-05-12 02:27:00] [INFO ] Deduced a trap composed of 45 places in 34 ms
[2020-05-12 02:27:00] [INFO ] Deduced a trap composed of 38 places in 50 ms
[2020-05-12 02:27:00] [INFO ] Deduced a trap composed of 74 places in 52 ms
[2020-05-12 02:27:00] [INFO ] Deduced a trap composed of 37 places in 47 ms
[2020-05-12 02:27:00] [INFO ] Deduced a trap composed of 13 places in 71 ms
[2020-05-12 02:27:00] [INFO ] Deduced a trap composed of 38 places in 87 ms
[2020-05-12 02:27:00] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 1928 ms
[2020-05-12 02:27:00] [INFO ] Computed and/alt/rep : 235/720/235 causal constraints in 11 ms.
[2020-05-12 02:27:01] [INFO ] Added : 139 causal constraints over 28 iterations in 503 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 13600 steps, including 110 resets, run finished after 27 ms. (steps per millisecond=503 ) properties seen :[0, 1, 0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 8300 steps, including 102 resets, run finished after 14 ms. (steps per millisecond=592 ) properties seen :[0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 12300 steps, including 112 resets, run finished after 21 ms. (steps per millisecond=585 ) properties seen :[0] could not realise parikh vector
Finished Parikh walk after 104 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=104 )
FORMULA BusinessProcesses-PT-03-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589250421462

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-03, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699100470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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