Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r338-smll-178021499100061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is ErlangenMainframeV1-PT-bP02C02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.6K May 27 08:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 27 08:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 27 08:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 27 08:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 27 10:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 27 10:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 27 10:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 08:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 27 08:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 27 08:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 27 08:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 64K May 26 18:17 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

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

=== Now, execution of the tool begins

BK_START 1780260704807

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP02C02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-31 20:51:46] [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]
[2026-05-31 20:51:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 20:51:47] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2026-05-31 20:51:47] [INFO ] Transformed 193 places.
[2026-05-31 20:51:47] [INFO ] Transformed 255 transitions.
[2026-05-31 20:51:47] [INFO ] Found NUPN structural information;
[2026-05-31 20:51:47] [INFO ] Parsed PT model containing 193 places and 255 transitions and 805 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6660765926173934135.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5550985034226210121.kers'
[2026-05-31 20:51:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6660765926173934135.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5550985034226210121.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 255 rows 193 cols 805 entries
Finished phase 1 with 180 SingleSign rule and 3 generalized
[2026-05-31 20:51:47] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5550985034226210121.kers
Total runtime 4 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 83 ms. (119 steps per ms)
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30001 steps (6 resets) in 73 ms. (405 steps per ms)
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-31 20:51:47] [INFO ] Invariant cache hit.
[2026-05-31 20:51:47] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2026-05-31 20:51:47] [INFO ] [Real]Absence check using 8 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-31 20:51:47] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2026-05-31 20:51:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 20:51:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 24 ms returned sat
[2026-05-31 20:51:48] [INFO ] [Nat]Absence check using 8 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-31 20:51:48] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2026-05-31 20:51:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2026-05-31 20:51:49] [INFO ] Computed and/alt/rep : 222/582/222 causal constraints (skipped 32 transitions) in 66 ms.
[2026-05-31 20:51:50] [INFO ] Added : 210 causal constraints over 44 iterations in 1561 ms. Result :sat
Minimization took 159 ms.
[2026-05-31 20:51:50] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-31 20:51:50] [INFO ] [Real]Absence check using 8 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-31 20:51:50] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2026-05-31 20:51:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-31 20:51:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2026-05-31 20:51:51] [INFO ] [Nat]Absence check using 8 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-31 20:51:51] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2026-05-31 20:51:51] [INFO ] Computed and/alt/rep : 222/582/222 causal constraints (skipped 32 transitions) in 25 ms.
[2026-05-31 20:51:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2026-05-31 20:51:53] [INFO ] Added : 203 causal constraints over 41 iterations in 1827 ms. Result :sat
Minimization took 271 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 193 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p17) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 254/254 transitions.
Graph (trivial) has 184 edges and 193 vertex of which 12 / 193 are part of one of the 5 SCC in 12 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 186 transition count 157
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 96 rules applied. Total rules applied 181 place count 102 transition count 145
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 184 place count 99 transition count 145
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 184 place count 99 transition count 141
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 192 place count 95 transition count 141
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 213 place count 74 transition count 120
Iterating global reduction 3 with 21 rules applied. Total rules applied 234 place count 74 transition count 120
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 234 place count 74 transition count 115
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 244 place count 69 transition count 115
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 253 place count 60 transition count 82
Ensure Unique test removed 1 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 263 place count 59 transition count 82
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 266 place count 56 transition count 68
Iterating global reduction 3 with 3 rules applied. Total rules applied 269 place count 56 transition count 68
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 270 place count 55 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 271 place count 55 transition count 66
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 305 place count 38 transition count 49
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 323 place count 29 transition count 65
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 335 place count 29 transition count 53
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 338 place count 26 transition count 44
Iterating global reduction 4 with 3 rules applied. Total rules applied 341 place count 26 transition count 44
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 346 place count 26 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 350 place count 24 transition count 53
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 351 place count 24 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 370 place count 24 transition count 33
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 375 place count 24 transition count 28
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 385 place count 19 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 386 place count 19 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 387 place count 18 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 388 place count 17 transition count 21
Applied a total of 388 rules in 144 ms. Remains 17 /193 variables (removed 176) and now considering 21/254 (removed 233) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 17/193 places, 21/254 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17633142964140909198.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14038825124137995540.kers'
[2026-05-31 20:51:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17633142964140909198.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14038825124137995540.kers]
Normalized transition count is 20 out of 21 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 20 rows 11 cols 42 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-31 20:51:54] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14038825124137995540.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (58098 resets) in 1648 ms. (606 steps per ms)
FORMULA ErlangenMainframeV1-PT-bP02C02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (13503 resets) in 441 ms. (2262 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 9665 ms.

BK_STOP 1780260716481

--------------------
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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="ErlangenMainframeV1-PT-bP02C02"
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-5973"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV1-PT-bP02C02, 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 r338-smll-178021499100061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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