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

About the Execution of ITS-Tools for PolyORBLF-COL-S02J04T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 927633.00 0.00 0.00 3.5324E+0009 ? 10 69 normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253700280.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 itstools
Input is PolyORBLF-COL-S02J04T08, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253700280
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K 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 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1748910450935

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
StateSpace COL
Running Version 202505121319
[2025-06-03 00:27:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 00:27:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 00:27:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 00:27:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 00:27:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 683 ms
[2025-06-03 00:27:32] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 614 PT places and 1300.0 transition bindings in 22 ms.
[2025-06-03 00:27:33] [INFO ] Unfolded HLPN to a Petri net with 614 places and 1242 transitions 5732 arcs in 40 ms.
[2025-06-03 00:27:33] [INFO ] Unfolded 0 HLPN properties in 0 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Running 1112 sub problems to find dead transitions.
[2025-06-03 00:27:33] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2025-06-03 00:27:33] [INFO ] Computed 50 invariants in 62 ms
[2025-06-03 00:27:33] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:48] [INFO ] Deduced a trap composed of 65 places in 951 ms of which 823 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:48] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:51] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:51] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:51] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:51] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:51] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:53] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1712 variables, and 54 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20093 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/36 constraints, State Equation: 0/614 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:57] [INFO ] Deduced a trap composed of 130 places in 338 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:57] [INFO ] Deduced a trap composed of 175 places in 331 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:58] [INFO ] Deduced a trap composed of 266 places in 368 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:58] [INFO ] Deduced a trap composed of 338 places in 372 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:27:59] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:05] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:12] [INFO ] Deduced a trap composed of 269 places in 385 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:12] [INFO ] Deduced a trap composed of 295 places in 388 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:13] [INFO ] Deduced a trap composed of 285 places in 456 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:13] [INFO ] Deduced a trap composed of 293 places in 676 ms of which 95 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1712 variables, and 64 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/36 constraints, State Equation: 0/614 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41106ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 41136ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:28:14] [INFO ] Redundant transitions in 52 ms returned []
Running 1112 sub problems to find dead transitions.
[2025-06-03 00:28:14] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2025-06-03 00:28:14] [INFO ] Invariant cache hit.
[2025-06-03 00:28:14] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:28] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:28] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:30] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:30] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:31] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:31] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:31] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:32] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:34] [INFO ] Deduced a trap composed of 269 places in 357 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:34] [INFO ] Deduced a trap composed of 19 places in 298 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:38] [INFO ] Deduced a trap composed of 293 places in 371 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:39] [INFO ] Deduced a trap composed of 47 places in 323 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:39] [INFO ] Deduced a trap composed of 311 places in 347 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:40] [INFO ] Deduced a trap composed of 3 places in 257 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:41] [INFO ] Deduced a trap composed of 175 places in 367 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:44] [INFO ] Deduced a trap composed of 266 places in 372 ms of which 123 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1712 variables, and 62 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/36 constraints, State Equation: 0/614 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1112/1112 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:53] [INFO ] Deduced a trap composed of 285 places in 329 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:54] [INFO ] Deduced a trap composed of 303 places in 353 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:28:59] [INFO ] Deduced a trap composed of 295 places in 374 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:00] [INFO ] Deduced a trap composed of 285 places in 339 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 00:29:02] [INFO ] Deduced a trap composed of 130 places in 356 ms of which 97 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/610 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1112 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/1712 variables, and 67 constraints, problems are : Problem set: 0 solved, 1112 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/36 constraints, State Equation: 0/614 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1112 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60666ms problems are : Problem set: 0 solved, 1112 unsolved
Search for dead transitions found 0 dead transitions in 60673ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 101971 ms. Remains : 614/614 places, 1114/1114 transitions.
Final net has 614 places and 1114 transitions.
[2025-06-03 00:29:15] [INFO ] Flatten gal took : 131 ms
[2025-06-03 00:29:15] [INFO ] Applying decomposition
[2025-06-03 00:29:15] [INFO ] Flatten gal took : 94 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15007654886701668789.txt' '-o' '/tmp/graph15007654886701668789.bin' '-w' '/tmp/graph15007654886701668789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15007654886701668789.bin' '-l' '-1' '-v' '-w' '/tmp/graph15007654886701668789.weights' '-q' '0' '-e' '0.001'
[2025-06-03 00:29:15] [INFO ] Decomposing Gal with order
[2025-06-03 00:29:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 00:29:15] [INFO ] Removed a total of 733 redundant transitions.
[2025-06-03 00:29:15] [INFO ] Flatten gal took : 225 ms
[2025-06-03 00:29:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 143 labels/synchronizations in 28 ms.
[2025-06-03 00:29:16] [INFO ] Time to serialize gal into /tmp/StateSpace3961872859990209581.gal : 25 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace3961872859990209581.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...219
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.53244e+09,819.864,11989276,90844,127636,7.6059e+06,3.41322e+06,2318,6.78152e+07,1253,7.5025e+07,0
Total reachable state count : 3532437216

Max variable value : 10
STATE_SPACE MAX_TOKEN_IN_PLACE 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 69
STATE_SPACE MAX_TOKEN_PER_MARKING 69 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 3532437216
STATE_SPACE STATES 3532437216 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 926409 ms.

BK_STOP 1748911378568

--------------------
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
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -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="PolyORBLF-COL-S02J04T08"
export BK_EXAMINATION="StateSpace"
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-5832"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S02J04T08, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881253700280"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T08.tgz
mv PolyORBLF-COL-S02J04T08 execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;