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-167813697200719.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 CANInsertWithFailure-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-167813697200719
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 9.6K Feb 26 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 01:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 01:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 00:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 2.6M 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 CANInsertWithFailure-PT-020-ReachabilityFireability-00
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-01
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-02
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-03
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-04
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-05
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-06
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-07
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-08
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-09
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-10
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-11
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-12
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-13
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-14
FORMULA_NAME CANInsertWithFailure-PT-020-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678801432931

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=CANInsertWithFailure-PT-020
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 13:43:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 13:43:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 13:43:55] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2023-03-14 13:43:55] [INFO ] Transformed 1044 places.
[2023-03-14 13:43:55] [INFO ] Transformed 2520 transitions.
[2023-03-14 13:43:55] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 22 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 16) seen :9
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :1
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :1
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2520 rows 1044 cols
[2023-03-14 13:43:56] [INFO ] Computed 23 place invariants in 71 ms
[2023-03-14 13:43:56] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-03-14 13:43:56] [INFO ] [Real]Absence check using 21 positive and 2 generalized place invariants in 8 ms returned sat
[2023-03-14 13:43:57] [INFO ] After 1419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 13:43:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2023-03-14 13:43:57] [INFO ] [Nat]Absence check using 21 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-14 13:44:00] [INFO ] After 2270ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-14 13:44:00] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-14 13:44:02] [INFO ] After 2476ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-14 13:44:04] [INFO ] After 4516ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 1631 ms.
[2023-03-14 13:44:06] [INFO ] After 8775ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA CANInsertWithFailure-PT-020-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 99 ms.
Support contains 123 out of 1044 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Graph (complete) has 3501 edges and 1044 vertex of which 1043 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 1043 transition count 2430
Reduce places removed 90 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 93 rules applied. Total rules applied 184 place count 953 transition count 2427
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 187 place count 950 transition count 2427
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 187 place count 950 transition count 2412
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 217 place count 935 transition count 2412
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 318
Deduced a syphon composed of 318 places in 1 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 3 with 636 rules applied. Total rules applied 853 place count 617 transition count 2094
Drop transitions removed 300 transitions
Redundant transition composition rules discarded 300 transitions
Iterating global reduction 3 with 300 rules applied. Total rules applied 1153 place count 617 transition count 1794
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 3 with 21 rules applied. Total rules applied 1174 place count 617 transition count 1773
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 1195 place count 596 transition count 1773
Partial Free-agglomeration rule applied 413 times.
Drop transitions removed 413 transitions
Iterating global reduction 4 with 413 rules applied. Total rules applied 1608 place count 596 transition count 1773
Partial Free-agglomeration rule applied 270 times.
Drop transitions removed 270 transitions
Iterating global reduction 4 with 270 rules applied. Total rules applied 1878 place count 596 transition count 1773
Applied a total of 1878 rules in 372 ms. Remains 596 /1044 variables (removed 448) and now considering 1773/2520 (removed 747) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 374 ms. Remains : 596/1044 places, 1773/2520 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 325596 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325596 steps, saw 56723 distinct states, run finished after 3003 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1773 rows 596 cols
[2023-03-14 13:44:10] [INFO ] Computed 22 place invariants in 23 ms
[2023-03-14 13:44:10] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-14 13:44:10] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-14 13:44:11] [INFO ] After 910ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 13:44:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-14 13:44:11] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 19 ms returned sat
[2023-03-14 13:44:12] [INFO ] After 1144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 13:44:12] [INFO ] State equation strengthened by 1359 read => feed constraints.
[2023-03-14 13:44:14] [INFO ] After 1276ms SMT Verify possible using 1359 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 13:44:15] [INFO ] After 2436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 738 ms.
[2023-03-14 13:44:15] [INFO ] After 4651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 6 ms.
Support contains 123 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1773/1773 transitions.
Applied a total of 0 rules in 54 ms. Remains 596 /596 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 596/596 places, 1773/1773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1773/1773 transitions.
Applied a total of 0 rules in 73 ms. Remains 596 /596 variables (removed 0) and now considering 1773/1773 (removed 0) transitions.
[2023-03-14 13:44:16] [INFO ] Invariant cache hit.
[2023-03-14 13:44:16] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-14 13:44:16] [INFO ] Invariant cache hit.
[2023-03-14 13:44:16] [INFO ] State equation strengthened by 1359 read => feed constraints.
[2023-03-14 13:44:20] [INFO ] Implicit Places using invariants and state equation in 3592 ms returned []
Implicit Place search using SMT with State Equation took 4007 ms to find 0 implicit places.
[2023-03-14 13:44:20] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-14 13:44:20] [INFO ] Invariant cache hit.
[2023-03-14 13:44:20] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4889 ms. Remains : 596/596 places, 1773/1773 transitions.
Graph (trivial) has 772 edges and 596 vertex of which 40 / 596 are part of one of the 1 SCC in 4 ms
Free SCC test removed 39 places
Drop transitions removed 76 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 121 transitions.
Graph (complete) has 1819 edges and 557 vertex of which 553 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 13 place count 542 transition count 1619
Iterating global reduction 0 with 11 rules applied. Total rules applied 24 place count 542 transition count 1619
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 34 place count 542 transition count 1609
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 52 place count 542 transition count 1591
Free-agglomeration rule applied 113 times with reduction of 13 identical transitions.
Iterating global reduction 1 with 113 rules applied. Total rules applied 165 place count 542 transition count 1465
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 138 transitions
Reduce isomorphic transitions removed 138 transitions.
Iterating post reduction 1 with 251 rules applied. Total rules applied 416 place count 429 transition count 1327
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 2 with 39 rules applied. Total rules applied 455 place count 429 transition count 1288
Partial Free-agglomeration rule applied 409 times.
Drop transitions removed 409 transitions
Iterating global reduction 2 with 409 rules applied. Total rules applied 864 place count 429 transition count 1288
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 872 place count 429 transition count 1280
Applied a total of 872 rules in 1111 ms. Remains 429 /596 variables (removed 167) and now considering 1280/1773 (removed 493) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1280 rows 429 cols
[2023-03-14 13:44:22] [INFO ] Computed 18 place invariants in 29 ms
[2023-03-14 13:44:22] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-14 13:44:22] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 13:44:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-14 13:44:23] [INFO ] After 748ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-14 13:44:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-14 13:44:23] [INFO ] After 676ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-14 13:44:24] [INFO ] After 1578ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 639 ms.
[2023-03-14 13:44:25] [INFO ] After 3084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-14 13:44:25] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2023-03-14 13:44:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 596 places, 1773 transitions and 6592 arcs took 17 ms.
[2023-03-14 13:44:25] [INFO ] Flatten gal took : 155 ms
Total runtime 30996 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CANInsertWithFailure (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: 596 places, 1773 transitions, 6592 arcs.
Final Score: 66188.692
Took : 89 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678801555977

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
ERROR in file model.sm near line 8989:
syntax error

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="CANInsertWithFailure-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 CANInsertWithFailure-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-167813697200719"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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