fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r146-tall-177961073900061
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for FunctionPointer-PT-b002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
539.432 8796.00 16470.00 80.90 0 2 0 1 1 2 inf inf 0 2 0 0 0 inf 0 inf normal

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.r146-tall-177961073900061.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 FunctionPointer-PT-b002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961073900061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 7.9K Mar 7 07:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 7 07:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 07:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 7 07:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 07:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 7 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 07:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 7 07:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 391K Mar 3 18:30 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 FunctionPointer-PT-b002-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-b002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779667808294

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 00:10:09] [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-25 00:10:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 00:10:09] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2026-05-25 00:10:09] [INFO ] Transformed 306 places.
[2026-05-25 00:10:09] [INFO ] Transformed 840 transitions.
[2026-05-25 00:10:09] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b002-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2655248550669644918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11292800125335870147.kers'
[2026-05-25 00:10:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2655248550669644918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11292800125335870147.kers]
Normalized transition count is 414 out of 648 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 414 rows 221 cols 1114 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-25 00:10:09] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11292800125335870147.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 1, 1, 2, +inf, +inf, 2, +inf, +inf]
RANDOM walk for 10000 steps (13 resets) in 85 ms. (116 steps per ms)
FORMULA FunctionPointer-PT-b002-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (26 resets) in 67 ms. (735 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 2, 1, 14, 3] Max Struct:[+inf, +inf, 2, +inf, +inf]
[2026-05-25 00:10:09] [INFO ] Flow matrix only has 414 transitions (discarded 234 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16593428206378753695.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16856969240005456953.kers'
[2026-05-25 00:10:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16593428206378753695.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16856969240005456953.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 414 rows 221 cols 1114 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-25 00:10:10] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16856969240005456953.kers
Total runtime 2 ms.
[2026-05-25 00:10:10] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2026-05-25 00:10:10] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 00:10:10] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2026-05-25 00:10:10] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-25 00:10:10] [INFO ] [Real]Added 65 Read/Feed constraints in 22 ms returned sat
[2026-05-25 00:10:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:10:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-25 00:10:10] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:10] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2026-05-25 00:10:10] [INFO ] [Nat]Added 65 Read/Feed constraints in 17 ms returned sat
[2026-05-25 00:10:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2026-05-25 00:10:10] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 45 ms.
[2026-05-25 00:10:10] [INFO ] Added : 1 causal constraints over 1 iterations in 102 ms. Result :sat
Minimization took 79 ms.
[2026-05-25 00:10:11] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 00:10:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:11] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2026-05-25 00:10:11] [INFO ] [Real]Added 65 Read/Feed constraints in 26 ms returned sat
[2026-05-25 00:10:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:10:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 00:10:11] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:11] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2026-05-25 00:10:11] [INFO ] [Nat]Added 65 Read/Feed constraints in 8 ms returned sat
[2026-05-25 00:10:11] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 57 ms.
[2026-05-25 00:10:11] [INFO ] Added : 2 causal constraints over 1 iterations in 110 ms. Result :sat
Minimization took 83 ms.
[2026-05-25 00:10:11] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 00:10:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:11] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2026-05-25 00:10:11] [INFO ] [Real]Added 65 Read/Feed constraints in 13 ms returned sat
[2026-05-25 00:10:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:10:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 00:10:11] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:11] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2026-05-25 00:10:11] [INFO ] [Nat]Added 65 Read/Feed constraints in 20 ms returned sat
[2026-05-25 00:10:11] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 43 ms.
[2026-05-25 00:10:11] [INFO ] Added : 1 causal constraints over 1 iterations in 92 ms. Result :sat
Minimization took 102 ms.
[2026-05-25 00:10:12] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 00:10:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 4 ms returned sat
[2026-05-25 00:10:12] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2026-05-25 00:10:12] [INFO ] [Real]Added 65 Read/Feed constraints in 20 ms returned sat
[2026-05-25 00:10:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:10:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-25 00:10:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:12] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2026-05-25 00:10:12] [INFO ] [Nat]Added 65 Read/Feed constraints in 18 ms returned sat
[2026-05-25 00:10:12] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 43 ms.
[2026-05-25 00:10:12] [INFO ] Added : 2 causal constraints over 1 iterations in 108 ms. Result :sat
Minimization took 76 ms.
[2026-05-25 00:10:12] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 00:10:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-25 00:10:12] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2026-05-25 00:10:12] [INFO ] [Real]Added 65 Read/Feed constraints in 6 ms returned sat
[2026-05-25 00:10:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 00:10:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-25 00:10:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-25 00:10:12] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-25 00:10:12] [INFO ] [Nat]Added 65 Read/Feed constraints in 10 ms returned sat
[2026-05-25 00:10:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2026-05-25 00:10:13] [INFO ] Computed and/alt/rep : 57/91/57 causal constraints (skipped 355 transitions) in 43 ms.
[2026-05-25 00:10:13] [INFO ] Added : 2 causal constraints over 1 iterations in 95 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 2, 1, 14, 3] Max Struct:[+inf, +inf, 2, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 2, 1, 14, 3] Max Struct:[+inf, +inf, 2, +inf, +inf]
Support contains 5 out of 222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 222/222 places, 648/648 transitions.
Graph (complete) has 932 edges and 222 vertex of which 191 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 191 transition count 606
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 71 place count 163 transition count 444
Iterating global reduction 1 with 28 rules applied. Total rules applied 99 place count 163 transition count 444
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 127 place count 163 transition count 416
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 143 place count 147 transition count 384
Iterating global reduction 2 with 16 rules applied. Total rules applied 159 place count 147 transition count 384
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 163 place count 147 transition count 380
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 169 place count 141 transition count 368
Iterating global reduction 3 with 6 rules applied. Total rules applied 175 place count 141 transition count 368
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 181 place count 135 transition count 344
Iterating global reduction 3 with 6 rules applied. Total rules applied 187 place count 135 transition count 344
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 192 place count 130 transition count 334
Iterating global reduction 3 with 5 rules applied. Total rules applied 197 place count 130 transition count 334
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 202 place count 125 transition count 314
Iterating global reduction 3 with 5 rules applied. Total rules applied 207 place count 125 transition count 314
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 212 place count 120 transition count 294
Iterating global reduction 3 with 5 rules applied. Total rules applied 217 place count 120 transition count 294
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 222 place count 115 transition count 284
Iterating global reduction 3 with 5 rules applied. Total rules applied 227 place count 115 transition count 284
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 232 place count 110 transition count 274
Iterating global reduction 3 with 5 rules applied. Total rules applied 237 place count 110 transition count 274
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 242 place count 105 transition count 264
Iterating global reduction 3 with 5 rules applied. Total rules applied 247 place count 105 transition count 264
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 252 place count 100 transition count 254
Iterating global reduction 3 with 5 rules applied. Total rules applied 257 place count 100 transition count 254
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 262 place count 95 transition count 244
Iterating global reduction 3 with 5 rules applied. Total rules applied 267 place count 95 transition count 244
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 273 place count 95 transition count 238
Applied a total of 273 rules in 157 ms. Remains 95 /222 variables (removed 127) and now considering 238/648 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 95/222 places, 238/648 transitions.
[2026-05-25 00:10:13] [INFO ] Flow matrix only has 151 transitions (discarded 87 similar events)
findPositiveTsemiflow completed in 106 ms - Found solution {33=1, 77=1, 127=1, 148=1} and attempted to minimize in 0 ms success -> {27=1, 71=1, 105=1, 145=1}
FORMULA FunctionPointer-PT-b002-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-06 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL COVER_WALK
FORMULA FunctionPointer-PT-b002-UpperBounds-15 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
Current structural bounds on expressions (after cover walk) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 7589 ms.

BK_STOP 1779667817090

--------------------
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="FunctionPointer-PT-b002"
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 FunctionPointer-PT-b002, 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 r146-tall-177961073900061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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