Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 85K May 18 16:42 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-06-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716650490016

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 15:21:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:21:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:21:32] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-25 15:21:32] [INFO ] Transformed 376 places.
[2024-05-25 15:21:32] [INFO ] Transformed 297 transitions.
[2024-05-25 15:21:32] [INFO ] Found NUPN structural information;
[2024-05-25 15:21:32] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
// Phase 1: matrix 296 rows 375 cols
[2024-05-25 15:21:32] [INFO ] Computed 81 invariants in 27 ms
Incomplete random walk after 10000 steps, including 104 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 16) seen :11
FORMULA BusinessProcesses-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :1
FORMULA BusinessProcesses-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
[2024-05-25 15:21:32] [INFO ] Invariant cache hit.
[2024-05-25 15:21:32] [INFO ] [Real]Absence check using 42 positive place invariants in 26 ms returned sat
[2024-05-25 15:21:32] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 14 ms returned sat
[2024-05-25 15:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:21:32] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-25 15:21:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:21:32] [INFO ] [Nat]Absence check using 42 positive place invariants in 13 ms returned sat
[2024-05-25 15:21:32] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 9 ms returned sat
[2024-05-25 15:21:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:21:32] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-25 15:21:33] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 3 ms to minimize.
[2024-05-25 15:21:33] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2024-05-25 15:21:33] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-25 15:21:33] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-25 15:21:33] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-25 15:21:33] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 1 ms to minimize.
[2024-05-25 15:21:33] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 1 ms to minimize.
[2024-05-25 15:21:33] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-25 15:21:33] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:21:33] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:21:33] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-25 15:21:33] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 879 ms
[2024-05-25 15:21:33] [INFO ] Computed and/alt/rep : 272/351/272 causal constraints (skipped 23 transitions) in 16 ms.
[2024-05-25 15:21:34] [INFO ] Added : 231 causal constraints over 47 iterations in 1096 ms. Result :sat
Minimization took 93 ms.
[2024-05-25 15:21:35] [INFO ] [Real]Absence check using 42 positive place invariants in 17 ms returned sat
[2024-05-25 15:21:35] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 14 ms returned sat
[2024-05-25 15:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:21:35] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-25 15:21:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:21:35] [INFO ] [Nat]Absence check using 42 positive place invariants in 15 ms returned sat
[2024-05-25 15:21:35] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 14 ms returned sat
[2024-05-25 15:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:21:35] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-05-25 15:21:35] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 1 ms to minimize.
[2024-05-25 15:21:35] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 0 ms to minimize.
[2024-05-25 15:21:35] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:21:36] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2024-05-25 15:21:36] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 0 ms to minimize.
[2024-05-25 15:21:36] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2024-05-25 15:21:36] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:21:36] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2024-05-25 15:21:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 971 ms
[2024-05-25 15:21:36] [INFO ] Computed and/alt/rep : 272/351/272 causal constraints (skipped 23 transitions) in 29 ms.
[2024-05-25 15:21:37] [INFO ] Added : 232 causal constraints over 47 iterations in 1310 ms. Result :sat
Minimization took 72 ms.
[2024-05-25 15:21:38] [INFO ] [Real]Absence check using 42 positive place invariants in 16 ms returned sat
[2024-05-25 15:21:38] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 15 ms returned sat
[2024-05-25 15:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:21:38] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-25 15:21:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:21:38] [INFO ] [Nat]Absence check using 42 positive place invariants in 18 ms returned sat
[2024-05-25 15:21:38] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 14 ms returned sat
[2024-05-25 15:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:21:38] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2024-05-25 15:21:38] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 1 ms to minimize.
[2024-05-25 15:21:38] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2024-05-25 15:21:38] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:21:38] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-25 15:21:38] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-25 15:21:38] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:21:38] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-25 15:21:39] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-05-25 15:21:39] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2024-05-25 15:21:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 753 ms
[2024-05-25 15:21:39] [INFO ] Computed and/alt/rep : 272/351/272 causal constraints (skipped 23 transitions) in 34 ms.
[2024-05-25 15:21:40] [INFO ] Added : 243 causal constraints over 49 iterations in 1122 ms. Result :sat
Minimization took 58 ms.
[2024-05-25 15:21:40] [INFO ] [Real]Absence check using 42 positive place invariants in 17 ms returned sat
[2024-05-25 15:21:40] [INFO ] [Real]Absence check using 42 positive and 39 generalized place invariants in 13 ms returned sat
[2024-05-25 15:21:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:21:40] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-05-25 15:21:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:21:40] [INFO ] [Nat]Absence check using 42 positive place invariants in 15 ms returned sat
[2024-05-25 15:21:40] [INFO ] [Nat]Absence check using 42 positive and 39 generalized place invariants in 12 ms returned sat
[2024-05-25 15:21:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 15:21:40] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-25 15:21:40] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2024-05-25 15:21:40] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-25 15:21:41] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2024-05-25 15:21:41] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2024-05-25 15:21:41] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2024-05-25 15:21:41] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-25 15:21:41] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 0 ms to minimize.
[2024-05-25 15:21:41] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 1 ms to minimize.
[2024-05-25 15:21:41] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-05-25 15:21:41] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 1 ms to minimize.
[2024-05-25 15:21:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1060 ms
[2024-05-25 15:21:41] [INFO ] Computed and/alt/rep : 272/351/272 causal constraints (skipped 23 transitions) in 27 ms.
[2024-05-25 15:21:43] [INFO ] Added : 226 causal constraints over 46 iterations in 1177 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA BusinessProcesses-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 375/375 places, 296/296 transitions.
Graph (trivial) has 194 edges and 375 vertex of which 7 / 375 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 684 edges and 369 vertex of which 366 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 366 transition count 221
Reduce places removed 65 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 301 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 299 transition count 219
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 137 place count 299 transition count 154
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 276 place count 225 transition count 154
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 315 place count 186 transition count 115
Iterating global reduction 3 with 39 rules applied. Total rules applied 354 place count 186 transition count 115
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 496 place count 111 transition count 48
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 497 place count 111 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 498 place count 110 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 499 place count 110 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 500 place count 109 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 501 place count 108 transition count 46
Applied a total of 501 rules in 80 ms. Remains 108 /375 variables (removed 267) and now considering 46/296 (removed 250) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 108/375 places, 46/296 transitions.
// Phase 1: matrix 46 rows 108 cols
[2024-05-25 15:21:43] [INFO ] Computed 62 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 21739 resets, run finished after 2060 ms. (steps per millisecond=485 ) properties (out of 3) seen :3
FORMULA BusinessProcesses-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 13631 ms.

BK_STOP 1716650505735

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-06, 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 r065-tajo-171620414800306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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