fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r171-tall-167838858600423
Last Updated
May 14, 2023

About the Execution of Smart+red for FamilyReunion-PT-L00100M0010C005P005G002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7815.896 3600000.00 3685887.00 10611.60 TFTTTTTTFTTTTFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r171-tall-167838858600423.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858600423
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 290K Feb 26 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Feb 26 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Feb 26 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Feb 26 12:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 170K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 700K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 327K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 869K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 15:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.3M Feb 26 15:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.8M Feb 26 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17M 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 FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-00
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-01
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-02
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-03
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-04
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-05
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-06
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-07
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-08
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-09
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-10
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-11
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-12
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-13
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-14
FORMULA_NAME FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679466708678

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=FamilyReunion-PT-L00100M0010C005P005G002
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 06:31:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 06:31:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:31:51] [INFO ] Load time of PNML (sax parser for PT used): 769 ms
[2023-03-22 06:31:51] [INFO ] Transformed 40605 places.
[2023-03-22 06:31:51] [INFO ] Transformed 36871 transitions.
[2023-03-22 06:31:51] [INFO ] Parsed PT model containing 40605 places and 36871 transitions and 112728 arcs in 1036 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 155 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 31 places and 0 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1221 ms. (steps per millisecond=8 ) properties (out of 16) seen :13
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 36871 rows 40574 cols
[2023-03-22 06:31:59] [INFO ] Computed 8805 place invariants in 5219 ms
[2023-03-22 06:32:08] [INFO ] [Real]Absence check using 300 positive place invariants in 961 ms returned sat
[2023-03-22 06:32:18] [INFO ] [Real]Absence check using 300 positive and 8505 generalized place invariants in 10374 ms returned sat
[2023-03-22 06:32:24] [INFO ] After 3578ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-22 06:32:24] [INFO ] After 3627ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-22 06:32:24] [INFO ] After 25146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 33 out of 40574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40574/40574 places, 36871/36871 transitions.
Graph (complete) has 65258 edges and 40574 vertex of which 38725 are kept as prefixes of interest. Removing 1849 places using SCC suffix rule.56 ms
Discarding 1849 places :
Also discarding 1507 output transitions
Drop transitions removed 1507 transitions
Drop transitions removed 304 transitions
Reduce isomorphic transitions removed 304 transitions.
Discarding 6662 places :
Implicit places reduction removed 6662 places
Drop transitions removed 19653 transitions
Trivial Post-agglo rules discarded 19653 transitions
Performed 19653 trivial Post agglomeration. Transition count delta: 19653
Iterating post reduction 0 with 26619 rules applied. Total rules applied 26620 place count 32063 transition count 15407
Reduce places removed 19653 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 19660 rules applied. Total rules applied 46280 place count 12410 transition count 15400
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 46287 place count 12403 transition count 15400
Performed 1922 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1922 Pre rules applied. Total rules applied 46287 place count 12403 transition count 13478
Deduced a syphon composed of 1922 places in 11 ms
Ensure Unique test removed 906 places
Reduce places removed 2828 places and 0 transitions.
Iterating global reduction 3 with 4750 rules applied. Total rules applied 51037 place count 9575 transition count 13478
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 601 transitions
Trivial Post-agglo rules discarded 601 transitions
Performed 601 trivial Post agglomeration. Transition count delta: 601
Iterating post reduction 3 with 604 rules applied. Total rules applied 51641 place count 9572 transition count 12877
Reduce places removed 601 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 604 rules applied. Total rules applied 52245 place count 8971 transition count 12874
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 52248 place count 8968 transition count 12874
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 52248 place count 8968 transition count 12873
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 52250 place count 8967 transition count 12873
Discarding 4643 places :
Symmetric choice reduction at 6 with 4643 rule applications. Total rules 56893 place count 4324 transition count 8032
Iterating global reduction 6 with 4643 rules applied. Total rules applied 61536 place count 4324 transition count 8032
Ensure Unique test removed 505 transitions
Reduce isomorphic transitions removed 505 transitions.
Discarding 203 places :
Implicit places reduction removed 203 places
Drop transitions removed 799 transitions
Trivial Post-agglo rules discarded 799 transitions
Performed 799 trivial Post agglomeration. Transition count delta: 799
Iterating post reduction 6 with 1507 rules applied. Total rules applied 63043 place count 4121 transition count 6728
Reduce places removed 799 places and 0 transitions.
Iterating post reduction 7 with 799 rules applied. Total rules applied 63842 place count 3322 transition count 6728
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 63842 place count 3322 transition count 6719
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 63860 place count 3313 transition count 6719
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 63875 place count 3298 transition count 5402
Iterating global reduction 8 with 15 rules applied. Total rules applied 63890 place count 3298 transition count 5402
Ensure Unique test removed 704 transitions
Reduce isomorphic transitions removed 704 transitions.
Iterating post reduction 8 with 704 rules applied. Total rules applied 64594 place count 3298 transition count 4698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 64594 place count 3298 transition count 4697
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 64596 place count 3297 transition count 4697
Discarding 599 places :
Symmetric choice reduction at 9 with 599 rule applications. Total rules 65195 place count 2698 transition count 4098
Iterating global reduction 9 with 599 rules applied. Total rules applied 65794 place count 2698 transition count 4098
Ensure Unique test removed 598 transitions
Reduce isomorphic transitions removed 598 transitions.
Iterating post reduction 9 with 598 rules applied. Total rules applied 66392 place count 2698 transition count 3500
Performed 404 Post agglomeration using F-continuation condition.Transition count delta: 404
Deduced a syphon composed of 404 places in 1 ms
Reduce places removed 404 places and 0 transitions.
Iterating global reduction 10 with 808 rules applied. Total rules applied 67200 place count 2294 transition count 3096
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 67206 place count 2291 transition count 3098
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 67207 place count 2291 transition count 3097
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 67211 place count 2291 transition count 3093
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 67215 place count 2287 transition count 3093
Free-agglomeration rule (complex) applied 112 times.
Iterating global reduction 11 with 112 rules applied. Total rules applied 67327 place count 2287 transition count 3777
Ensure Unique test removed 97 places
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 11 with 209 rules applied. Total rules applied 67536 place count 2078 transition count 3777
Partial Free-agglomeration rule applied 204 times.
Drop transitions removed 204 transitions
Iterating global reduction 12 with 204 rules applied. Total rules applied 67740 place count 2078 transition count 3777
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 12 with 99 rules applied. Total rules applied 67839 place count 2078 transition count 3777
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 67840 place count 2077 transition count 3776
Applied a total of 67840 rules in 5471 ms. Remains 2077 /40574 variables (removed 38497) and now considering 3776/36871 (removed 33095) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5472 ms. Remains : 2077/40574 places, 3776/36871 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 3) seen :2
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3776 rows 2077 cols
[2023-03-22 06:32:30] [INFO ] Computed 519 place invariants in 56 ms
[2023-03-22 06:32:30] [INFO ] [Real]Absence check using 0 positive and 519 generalized place invariants in 97 ms returned sat
[2023-03-22 06:32:32] [INFO ] After 2190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:32:33] [INFO ] [Nat]Absence check using 0 positive and 519 generalized place invariants in 108 ms returned sat
[2023-03-22 06:32:34] [INFO ] After 1731ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:32:35] [INFO ] After 2074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 383 ms.
[2023-03-22 06:32:35] [INFO ] After 2842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 567 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=27 )
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 31 ms.
All properties solved without resorting to model-checking.
Total runtime 45431 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FamilyReunion (PT), instance L00100M0010C005P005G002
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: 40605 places, 36871 transitions, 112728 arcs.
Final Score: 7.8473782335E7
Took : 455 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8269660 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16036888 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="FamilyReunion-PT-L00100M0010C005P005G002"
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 FamilyReunion-PT-L00100M0010C005P005G002, 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 r171-tall-167838858600423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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