Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r043-tajo-167813697100631.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is CANConstruction-PT-020, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697100631
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 21:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 21:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 21:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 21:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 21:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 21:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 641K Mar 5 18:22 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 CANConstruction-PT-020-ReachabilityFireability-00
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-01
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-02
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-03
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-04
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-05
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-06
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-07
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-08
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-09
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-10
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-11
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-12
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-13
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-14
FORMULA_NAME CANConstruction-PT-020-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678796370460

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-020
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 12:19:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 12:19:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:19:33] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2023-03-14 12:19:33] [INFO ] Transformed 1042 places.
[2023-03-14 12:19:33] [INFO ] Transformed 1760 transitions.
[2023-03-14 12:19:33] [INFO ] Parsed PT model containing 1042 places and 1760 transitions and 5200 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 28 resets, run finished after 548 ms. (steps per millisecond=18 ) properties (out of 16) seen :10
FORMULA CANConstruction-PT-020-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1760 rows 1042 cols
[2023-03-14 12:19:34] [INFO ] Computed 41 place invariants in 38 ms
[2023-03-14 12:19:34] [INFO ] [Real]Absence check using 21 positive place invariants in 56 ms returned sat
[2023-03-14 12:19:34] [INFO ] [Real]Absence check using 21 positive and 20 generalized place invariants in 14 ms returned sat
[2023-03-14 12:19:34] [INFO ] After 624ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 12:19:35] [INFO ] [Nat]Absence check using 21 positive place invariants in 27 ms returned sat
[2023-03-14 12:19:35] [INFO ] [Nat]Absence check using 21 positive and 20 generalized place invariants in 10 ms returned sat
[2023-03-14 12:19:36] [INFO ] After 1068ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-14 12:19:36] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-14 12:19:37] [INFO ] After 626ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-14 12:19:38] [INFO ] After 1535ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 541 ms.
[2023-03-14 12:19:38] [INFO ] After 3637ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA CANConstruction-PT-020-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CANConstruction-PT-020-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 107 out of 1042 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1042/1042 places, 1760/1760 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 1042 transition count 1680
Reduce places removed 80 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 98 rules applied. Total rules applied 178 place count 962 transition count 1662
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 196 place count 944 transition count 1662
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 196 place count 944 transition count 1651
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 218 place count 933 transition count 1651
Discarding 319 places :
Symmetric choice reduction at 3 with 319 rule applications. Total rules 537 place count 614 transition count 1013
Iterating global reduction 3 with 319 rules applied. Total rules applied 856 place count 614 transition count 1013
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 874 place count 605 transition count 1004
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 878 place count 603 transition count 1030
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 882 place count 603 transition count 1026
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 886 place count 599 transition count 1026
Partial Free-agglomeration rule applied 43 times.
Drop transitions removed 43 transitions
Iterating global reduction 4 with 43 rules applied. Total rules applied 929 place count 599 transition count 1026
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 939 place count 599 transition count 1026
Applied a total of 939 rules in 435 ms. Remains 599 /1042 variables (removed 443) and now considering 1026/1760 (removed 734) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 599/1042 places, 1026/1760 transitions.
Incomplete random walk after 10000 steps, including 63 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :2
FORMULA CANConstruction-PT-020-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-020-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1026 rows 599 cols
[2023-03-14 12:19:39] [INFO ] Computed 41 place invariants in 8 ms
[2023-03-14 12:19:39] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2023-03-14 12:19:39] [INFO ] [Real]Absence check using 21 positive and 20 generalized place invariants in 8 ms returned sat
[2023-03-14 12:19:39] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 12:19:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-03-14 12:19:39] [INFO ] [Nat]Absence check using 21 positive and 20 generalized place invariants in 5 ms returned sat
[2023-03-14 12:19:39] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 12:19:39] [INFO ] State equation strengthened by 841 read => feed constraints.
[2023-03-14 12:19:40] [INFO ] After 278ms SMT Verify possible using 841 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 12:19:40] [INFO ] After 516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-14 12:19:40] [INFO ] After 1182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 61 out of 599 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 1026/1026 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 599 transition count 1021
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 594 transition count 1020
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 593 transition count 1020
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 17 place count 588 transition count 1010
Iterating global reduction 3 with 5 rules applied. Total rules applied 22 place count 588 transition count 1010
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 48 place count 575 transition count 997
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 58 place count 570 transition count 997
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 3 with 15 rules applied. Total rules applied 73 place count 570 transition count 982
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 88 place count 555 transition count 982
Applied a total of 88 rules in 153 ms. Remains 555 /599 variables (removed 44) and now considering 982/1026 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 555/599 places, 982/1026 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 439464 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 439464 steps, saw 74052 distinct states, run finished after 3003 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 982 rows 555 cols
[2023-03-14 12:19:43] [INFO ] Computed 41 place invariants in 9 ms
[2023-03-14 12:19:44] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2023-03-14 12:19:44] [INFO ] [Real]Absence check using 21 positive and 20 generalized place invariants in 7 ms returned sat
[2023-03-14 12:19:44] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 12:19:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-03-14 12:19:44] [INFO ] [Nat]Absence check using 21 positive and 20 generalized place invariants in 6 ms returned sat
[2023-03-14 12:19:44] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 12:19:44] [INFO ] State equation strengthened by 861 read => feed constraints.
[2023-03-14 12:19:44] [INFO ] After 180ms SMT Verify possible using 861 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 12:19:44] [INFO ] After 327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-14 12:19:45] [INFO ] After 924ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA CANConstruction-PT-020-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 39 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
FORMULA CANConstruction-PT-020-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 4 ms.
All properties solved without resorting to model-checking.
Total runtime 12241 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANConstruction (PT), instance 020
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 1042 places, 1760 transitions, 5200 arcs.
Final Score: 118562.859
Took : 77 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 7717064 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16106660 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="CANConstruction-PT-020"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is CANConstruction-PT-020, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813697100631"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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