fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r153-tall-174876824600004
Last Updated
June 24, 2025

About the Execution of 2024-gold for NeighborGrid-PT-d4n3m2c23

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15691.870 38078.00 46207.00 201.40 162 162 162 162 162 162 162 162 162 162 162 162 162 162 162 162 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r153-tall-174876824600004.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is NeighborGrid-PT-d4n3m2c23, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824600004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rwxr-xr-x 1 mcc users 469K May 29 14:32 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 NeighborGrid-PT-d4n3m2c23-UpperBounds-00
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-01
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-02
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-03
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-04
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-05
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-06
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-07
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-08
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-09
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-10
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-11
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-12
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-13
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-14
FORMULA_NAME NeighborGrid-PT-d4n3m2c23-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748841308165

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeighborGrid-PT-d4n3m2c23
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 05:15: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]
[2025-06-02 05:15:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:15:09] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2025-06-02 05:15:09] [INFO ] Transformed 81 places.
[2025-06-02 05:15:09] [INFO ] Transformed 1632 transitions.
[2025-06-02 05:15:09] [INFO ] Parsed PT model containing 81 places and 1632 transitions and 3264 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1632 rows 81 cols
[2025-06-02 05:15:09] [INFO ] Computed 1 invariants in 39 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162]
RANDOM walk for 10013 steps (2 resets) in 92 ms. (107 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 252 ms. (632 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[104, 40, 5, 56, 10, 56, 12, 34, 15, 35, 14, 56, 73, 38, 104, 100] Max Struct:[162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162]
[2025-06-02 05:15:10] [INFO ] Invariant cache hit.
[2025-06-02 05:15:10] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2025-06-02 05:15:10] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2025-06-02 05:15:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 81 ms.
[2025-06-02 05:15:10] [INFO ] Added : 0 causal constraints over 0 iterations in 200 ms. Result :sat
Minimization took 427 ms.
[2025-06-02 05:15:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:15:11] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2025-06-02 05:15:11] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 107 ms.
[2025-06-02 05:15:12] [INFO ] Added : 0 causal constraints over 0 iterations in 231 ms. Result :sat
Minimization took 419 ms.
[2025-06-02 05:15:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:15:12] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2025-06-02 05:15:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 64 ms.
[2025-06-02 05:15:12] [INFO ] Added : 0 causal constraints over 0 iterations in 157 ms. Result :sat
Minimization took 406 ms.
[2025-06-02 05:15:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:15:13] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2025-06-02 05:15:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 64 ms.
[2025-06-02 05:15:13] [INFO ] Added : 0 causal constraints over 0 iterations in 155 ms. Result :sat
Minimization took 410 ms.
[2025-06-02 05:15:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:15:14] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-06-02 05:15:14] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 62 ms.
[2025-06-02 05:15:14] [INFO ] Added : 0 causal constraints over 0 iterations in 171 ms. Result :sat
Minimization took 406 ms.
[2025-06-02 05:15:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:15:15] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2025-06-02 05:15:15] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 61 ms.
[2025-06-02 05:15:15] [INFO ] Added : 0 causal constraints over 0 iterations in 147 ms. Result :sat
Minimization took 391 ms.
[2025-06-02 05:15:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:15:16] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2025-06-02 05:15:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 61 ms.
[2025-06-02 05:15:16] [INFO ] Added : 0 causal constraints over 0 iterations in 153 ms. Result :sat
Minimization took 395 ms.
[2025-06-02 05:15:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:15:17] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2025-06-02 05:15:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 61 ms.
[2025-06-02 05:15:17] [INFO ] Added : 0 causal constraints over 0 iterations in 140 ms. Result :sat
Minimization took 393 ms.
[2025-06-02 05:15:17] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-02 05:15:18] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2025-06-02 05:15:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 63 ms.
[2025-06-02 05:15:18] [INFO ] Added : 0 causal constraints over 0 iterations in 153 ms. Result :sat
Minimization took 396 ms.
[2025-06-02 05:15:18] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-02 05:15:19] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2025-06-02 05:15:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 64 ms.
[2025-06-02 05:15:19] [INFO ] Added : 0 causal constraints over 0 iterations in 149 ms. Result :sat
Minimization took 394 ms.
[2025-06-02 05:15:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:15:19] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2025-06-02 05:15:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 62 ms.
[2025-06-02 05:15:20] [INFO ] Added : 0 causal constraints over 0 iterations in 150 ms. Result :sat
Minimization took 396 ms.
[2025-06-02 05:15:20] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-02 05:15:20] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2025-06-02 05:15:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 61 ms.
[2025-06-02 05:15:20] [INFO ] Added : 0 causal constraints over 0 iterations in 142 ms. Result :sat
Minimization took 400 ms.
[2025-06-02 05:15:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:15:21] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2025-06-02 05:15:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 58 ms.
[2025-06-02 05:15:21] [INFO ] Added : 0 causal constraints over 0 iterations in 147 ms. Result :sat
Minimization took 400 ms.
[2025-06-02 05:15:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:15:22] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2025-06-02 05:15:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 70 ms.
[2025-06-02 05:15:22] [INFO ] Added : 0 causal constraints over 0 iterations in 153 ms. Result :sat
Minimization took 407 ms.
[2025-06-02 05:15:23] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-02 05:15:23] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2025-06-02 05:15:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 70 ms.
[2025-06-02 05:15:23] [INFO ] Added : 0 causal constraints over 0 iterations in 152 ms. Result :sat
Minimization took 400 ms.
[2025-06-02 05:15:24] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-02 05:15:24] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2025-06-02 05:15:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 63 ms.
[2025-06-02 05:15:24] [INFO ] Added : 0 causal constraints over 0 iterations in 146 ms. Result :sat
Minimization took 404 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[104, 40, 5, 56, 10, 56, 12, 34, 15, 35, 14, 56, 73, 38, 104, 100] Max Struct:[162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162, 162]
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-15 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-14 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-13 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-12 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-11 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-10 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-09 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-08 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-07 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-06 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-05 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-04 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-03 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-02 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-01 162 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[162] Max Struct:[162]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 1632/1632 transitions.
Graph (trivial) has 1612 edges and 81 vertex of which 80 / 81 are part of one of the 1 SCC in 4 ms
Free SCC test removed 79 places
Drop transitions (Empty/Sink Transition effects.) removed 1612 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 1630 transitions.
Applied a total of 1 rules in 24 ms. Remains 2 /81 variables (removed 79) and now considering 2/1632 (removed 1630) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 2/81 places, 2/1632 transitions.
// Phase 1: matrix 2 rows 2 cols
[2025-06-02 05:15:45] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[162] Max Struct:[162]
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-00 162 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000023 steps (2 resets) in 80 ms. (12345 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 )
[2025-06-02 05:15:46] [INFO ] Flatten gal took : 142 ms
[2025-06-02 05:15:46] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:15:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3664813947096515516.gal : 3 ms
[2025-06-02 05:15:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality219206026654815140.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/ReachabilityCardinality3664813947096515516.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality219206026654815140.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 36720 ms.

BK_STOP 1748841346243

--------------------
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="NeighborGrid-PT-d4n3m2c23"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is NeighborGrid-PT-d4n3m2c23, 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 r153-tall-174876824600004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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