fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r224-tall-171649612700390
Last Updated
July 7, 2024

About the Execution of ITS-Tools for LeafsetExtension-PT-S64C2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1737.712 20677.00 56561.00 75.90 FFFFTFTTFTTTTTFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 13:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 13:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-00
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-01
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-02
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-03
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-04
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-05
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-06
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-07
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-08
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-09
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-10
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-11
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-12
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-13
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-14
FORMULA_NAME LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716585291300

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-24 21:14:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 21:14:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 21:14:53] [INFO ] Load time of PNML (sax parser for PT used): 653 ms
[2024-05-24 21:14:53] [INFO ] Transformed 21462 places.
[2024-05-24 21:14:53] [INFO ] Transformed 21129 transitions.
[2024-05-24 21:14:53] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 831 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (2201 resets) in 3003 ms. (13 steps per ms) remains 10/16 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (99 resets) in 766 ms. (52 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (100 resets) in 229 ms. (173 steps per ms) remains 9/10 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (100 resets) in 522 ms. (76 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (98 resets) in 398 ms. (100 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (100 resets) in 224 ms. (177 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (99 resets) in 240 ms. (165 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (102 resets) in 344 ms. (115 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (99 resets) in 213 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (100 resets) in 290 ms. (137 steps per ms) remains 9/9 properties
// Phase 1: matrix 21129 rows 21462 cols
[2024-05-24 21:14:55] [INFO ] Flatten gal took : 1542 ms
[2024-05-24 21:14:56] [INFO ] Flatten gal took : 593 ms
[2024-05-24 21:14:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17805996235948803186.gal : 174 ms
[2024-05-24 21:14:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8701060391456991766.prop : 3 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/ReachabilityCardinality17805996235948803186.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8701060391456991766.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...329
[2024-05-24 21:14:58] [INFO ] Computed 333 invariants in 2754 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-06 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-13 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 19934/20104 variables, 127/127 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Loading property file /tmp/ReachabilityCardinality8701060391456991766.prop.
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 Real declared 20104/42591 variables, and 127 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/67 constraints, Generalized P Invariants (flows): 127/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-05 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 19964/20091 variables, 114/114 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20091 variables, 0/114 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-02 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-07 is UNSAT
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 67/20158 variables, 67/181 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20158/42591 variables, and 181 constraints, problems are : Problem set: 6 solved, 3 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 114/266 constraints, State Equation: 0/21462 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 13101ms problems are : Problem set: 6 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 2143 are kept as prefixes of interest. Removing 19319 places using SCC suffix rule.28 ms
Discarding 19319 places :
Also discarding 10805 output transitions
Drop transitions (Output transitions of discarded places.) removed 10805 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4190 transitions
Reduce isomorphic transitions removed 4190 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 879 transitions
Trivial Post-agglo rules discarded 879 transitions
Performed 879 trivial Post agglomeration. Transition count delta: 879
Iterating post reduction 0 with 5069 rules applied. Total rules applied 5070 place count 2143 transition count 5255
Reduce places removed 881 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 1 with 908 rules applied. Total rules applied 5978 place count 1262 transition count 5228
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 29 rules applied. Total rules applied 6007 place count 1235 transition count 5226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 6009 place count 1233 transition count 5226
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 6009 place count 1233 transition count 5191
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 6079 place count 1198 transition count 5191
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 6094 place count 1198 transition count 5176
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 6109 place count 1183 transition count 5176
Partial Free-agglomeration rule applied 803 times.
Drop transitions (Partial Free agglomeration) removed 803 transitions
Iterating global reduction 5 with 803 rules applied. Total rules applied 6912 place count 1183 transition count 5176
Discarding 24 places :
Implicit places reduction removed 24 places
Iterating post reduction 5 with 24 rules applied. Total rules applied 6936 place count 1159 transition count 5176
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 6949 place count 1159 transition count 5163
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 6962 place count 1146 transition count 5163
Applied a total of 6962 rules in 1094 ms. Remains 1146 /21462 variables (removed 20316) and now considering 5163/21129 (removed 15966) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1105 ms. Remains : 1146/21462 places, 5163/21129 transitions.
RANDOM walk for 40000 steps (7484 resets) in 1751 ms. (22 steps per ms) remains 2/3 properties
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (198 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (198 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
[2024-05-24 21:15:10] [INFO ] Flow matrix only has 1978 transitions (discarded 3185 similar events)
// Phase 1: matrix 1978 rows 1146 cols
[2024-05-24 21:15:10] [INFO ] Computed 2 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 271/285 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1312/1597 variables, 327/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1597 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1527/3124 variables, 805/1146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3124 variables, 2/1148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3124 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3124 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3124/3124 variables, and 1148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 727 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 1146/1146 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 271/285 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1312/1597 variables, 327/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1597 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1527/3124 variables, 805/1147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3124 variables, 2/1149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3124 variables, 1/1150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3124 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/3124 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3124/3124 variables, and 1150 constraints, problems are : Problem set: 0 solved, 2 unsolved in 928 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 1146/1146 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1689ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
FORMULA LeafsetExtension-PT-S64C2-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 13 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 19535 ms.

BK_STOP 1716585311977

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="LeafsetExtension-PT-S64C2"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S64C2, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-171649612700390"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C2.tgz
mv LeafsetExtension-PT-S64C2 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;