Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920000109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920000109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 17K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 46K Jun 2 16:33 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 MedleyA-PT-14-UpperBounds-00
FORMULA_NAME MedleyA-PT-14-UpperBounds-01
FORMULA_NAME MedleyA-PT-14-UpperBounds-02
FORMULA_NAME MedleyA-PT-14-UpperBounds-03
FORMULA_NAME MedleyA-PT-14-UpperBounds-04
FORMULA_NAME MedleyA-PT-14-UpperBounds-05
FORMULA_NAME MedleyA-PT-14-UpperBounds-06
FORMULA_NAME MedleyA-PT-14-UpperBounds-07
FORMULA_NAME MedleyA-PT-14-UpperBounds-08
FORMULA_NAME MedleyA-PT-14-UpperBounds-09
FORMULA_NAME MedleyA-PT-14-UpperBounds-10
FORMULA_NAME MedleyA-PT-14-UpperBounds-11
FORMULA_NAME MedleyA-PT-14-UpperBounds-12
FORMULA_NAME MedleyA-PT-14-UpperBounds-13
FORMULA_NAME MedleyA-PT-14-UpperBounds-14
FORMULA_NAME MedleyA-PT-14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717369006592

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 22:56:48] [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-06-02 22:56:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:56:48] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-06-02 22:56:48] [INFO ] Transformed 184 places.
[2024-06-02 22:56:48] [INFO ] Transformed 178 transitions.
[2024-06-02 22:56:48] [INFO ] Found NUPN structural information;
[2024-06-02 22:56:48] [INFO ] Parsed PT model containing 184 places and 178 transitions and 492 arcs in 261 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 90 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 178 rows 184 cols
[2024-06-02 22:56:49] [INFO ] Computed 24 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 60 ms. (163 steps per ms)
FORMULA MedleyA-PT-14-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-14-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-14-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-14-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-14-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-14-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-14-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 129 ms. (307 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 22:56:49] [INFO ] Invariant cache hit.
[2024-06-02 22:56:49] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned sat
[2024-06-02 22:56:49] [INFO ] [Real]Absence check using 15 positive and 9 generalized place invariants in 7 ms returned sat
[2024-06-02 22:56:49] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-06-02 22:56:50] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 34 ms to minimize.
[2024-06-02 22:56:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:56:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2024-06-02 22:56:50] [INFO ] [Nat]Absence check using 15 positive and 9 generalized place invariants in 6 ms returned sat
[2024-06-02 22:56:50] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-06-02 22:56:50] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-06-02 22:56:50] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:56:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2024-06-02 22:56:50] [INFO ] Computed and/alt/rep : 177/350/177 causal constraints (skipped 0 transitions) in 33 ms.
[2024-06-02 22:56:51] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:56:51] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-06-02 22:56:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2024-06-02 22:56:52] [INFO ] Added : 173 causal constraints over 35 iterations in 1196 ms. Result :sat
Minimization took 177 ms.
[2024-06-02 22:56:52] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-06-02 22:56:52] [INFO ] [Real]Absence check using 15 positive and 9 generalized place invariants in 8 ms returned sat
[2024-06-02 22:56:52] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-06-02 22:56:52] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 3 ms to minimize.
[2024-06-02 22:56:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:56:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-06-02 22:56:52] [INFO ] [Nat]Absence check using 15 positive and 9 generalized place invariants in 9 ms returned sat
[2024-06-02 22:56:52] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-06-02 22:56:53] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 3 ms to minimize.
[2024-06-02 22:56:53] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 3 ms to minimize.
[2024-06-02 22:56:53] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:56:53] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 3 ms to minimize.
[2024-06-02 22:56:53] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 4 ms to minimize.
[2024-06-02 22:56:53] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 3 ms to minimize.
[2024-06-02 22:56:53] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 3 ms to minimize.
[2024-06-02 22:56:53] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 4 ms to minimize.
[2024-06-02 22:56:54] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 3 ms to minimize.
[2024-06-02 22:56:54] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 3 ms to minimize.
[2024-06-02 22:56:54] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 3 ms to minimize.
[2024-06-02 22:56:54] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 3 ms to minimize.
[2024-06-02 22:56:54] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-06-02 22:56:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1811 ms
[2024-06-02 22:56:54] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-06-02 22:56:54] [INFO ] [Real]Absence check using 15 positive and 9 generalized place invariants in 6 ms returned sat
[2024-06-02 22:56:54] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-06-02 22:56:55] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 3 ms to minimize.
[2024-06-02 22:56:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:56:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2024-06-02 22:56:55] [INFO ] [Nat]Absence check using 15 positive and 9 generalized place invariants in 7 ms returned sat
[2024-06-02 22:56:55] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-06-02 22:56:55] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-06-02 22:56:55] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 3 ms to minimize.
[2024-06-02 22:56:55] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 4 ms to minimize.
[2024-06-02 22:56:56] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 3 ms to minimize.
[2024-06-02 22:56:56] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 4 ms to minimize.
[2024-06-02 22:56:56] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-06-02 22:56:56] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 3 ms to minimize.
[2024-06-02 22:56:56] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-06-02 22:56:56] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 4 ms to minimize.
[2024-06-02 22:56:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 1328 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 0, 0]
FORMULA MedleyA-PT-14-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MedleyA-PT-14-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 184 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p67) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 183 transition count 170
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 177 transition count 170
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 13 place count 177 transition count 163
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 27 place count 170 transition count 163
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 65 place count 132 transition count 125
Iterating global reduction 2 with 38 rules applied. Total rules applied 103 place count 132 transition count 125
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 103 place count 132 transition count 109
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 135 place count 116 transition count 109
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 141 place count 110 transition count 103
Iterating global reduction 2 with 6 rules applied. Total rules applied 147 place count 110 transition count 103
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 187 place count 90 transition count 83
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 213 place count 77 transition count 108
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 214 place count 77 transition count 107
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 77 transition count 105
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 219 place count 75 transition count 104
Applied a total of 219 rules in 167 ms. Remains 75 /184 variables (removed 109) and now considering 104/177 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 75/184 places, 104/177 transitions.
// Phase 1: matrix 104 rows 75 cols
[2024-06-02 22:56:57] [INFO ] Computed 24 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA MedleyA-PT-14-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (61922 resets) in 1592 ms. (627 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-06-02 22:56:59] [INFO ] Flatten gal took : 66 ms
[2024-06-02 22:56:59] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:56:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1061503337588927932.gal : 14 ms
[2024-06-02 22:56:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7789968300828775412.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1061503337588927932.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7789968300828775412.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 10492 ms.

BK_STOP 1717369019212

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="MedleyA-PT-14"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-14, 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 r576-smll-171734920000109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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