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.r425-tajo-167905977700103.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 ltsminxred
Input is ShieldRVs-PT-020A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977700103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.0K Feb 26 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 18:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 18:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 18:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 18:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 127K Mar 5 18:23 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 ShieldRVs-PT-020A-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-020A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679298128616

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-020A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 07:42:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 07:42:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 07:42:10] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-20 07:42:10] [INFO ] Transformed 283 places.
[2023-03-20 07:42:10] [INFO ] Transformed 383 transitions.
[2023-03-20 07:42:10] [INFO ] Found NUPN structural information;
[2023-03-20 07:42:10] [INFO ] Parsed PT model containing 283 places and 383 transitions and 1840 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 36 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 16) seen :10
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :1
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :1
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :1
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 383 rows 283 cols
[2023-03-20 07:42:11] [INFO ] Computed 81 place invariants in 21 ms
[2023-03-20 07:42:11] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 07:42:11] [INFO ] [Nat]Absence check using 81 positive place invariants in 14 ms returned sat
[2023-03-20 07:42:11] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 07:42:12] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 5 ms to minimize.
[2023-03-20 07:42:12] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2023-03-20 07:42:12] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2023-03-20 07:42:12] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2023-03-20 07:42:12] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2023-03-20 07:42:12] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2023-03-20 07:42:12] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2023-03-20 07:42:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 480 ms
[2023-03-20 07:42:12] [INFO ] After 1092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 233 ms.
[2023-03-20 07:42:12] [INFO ] After 1430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 45 ms.
Support contains 78 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 383/383 transitions.
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 283 transition count 383
Applied a total of 28 rules in 87 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 283/283 places, 383/383 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
FORMULA ShieldRVs-PT-020A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 383 rows 283 cols
[2023-03-20 07:42:13] [INFO ] Computed 81 place invariants in 5 ms
[2023-03-20 07:42:13] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:42:13] [INFO ] [Nat]Absence check using 81 positive place invariants in 25 ms returned sat
[2023-03-20 07:42:13] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:42:14] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2023-03-20 07:42:14] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2023-03-20 07:42:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2023-03-20 07:42:14] [INFO ] After 598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-20 07:42:14] [INFO ] After 833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 50 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 382
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 282 transition count 382
Applied a total of 8 rules in 84 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 282/283 places, 382/383 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 748912 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :{}
Probabilistic random walk after 748912 steps, saw 148607 distinct states, run finished after 3002 ms. (steps per millisecond=249 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 382 rows 282 cols
[2023-03-20 07:42:17] [INFO ] Computed 81 place invariants in 10 ms
[2023-03-20 07:42:17] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:42:17] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-20 07:42:17] [INFO ] After 210ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:42:18] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
[2023-03-20 07:42:18] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2023-03-20 07:42:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2023-03-20 07:42:18] [INFO ] After 407ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-20 07:42:18] [INFO ] After 604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 50 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 382/382 transitions.
Applied a total of 0 rules in 14 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 282/282 places, 382/382 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 382/382 transitions.
Applied a total of 0 rules in 13 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-20 07:42:18] [INFO ] Invariant cache hit.
[2023-03-20 07:42:18] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-20 07:42:18] [INFO ] Invariant cache hit.
[2023-03-20 07:42:18] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2023-03-20 07:42:18] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-20 07:42:18] [INFO ] Invariant cache hit.
[2023-03-20 07:42:19] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 873 ms. Remains : 282/282 places, 382/382 transitions.
Applied a total of 0 rules in 11 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 07:42:19] [INFO ] Invariant cache hit.
[2023-03-20 07:42:19] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:42:19] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-20 07:42:19] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:42:19] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2023-03-20 07:42:19] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2023-03-20 07:42:19] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2023-03-20 07:42:20] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2023-03-20 07:42:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 295 ms
[2023-03-20 07:42:20] [INFO ] After 678ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-20 07:42:20] [INFO ] After 882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 07:42:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-20 07:42:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 282 places, 382 transitions and 1904 arcs took 7 ms.
[2023-03-20 07:42:20] [INFO ] Flatten gal took : 102 ms
Total runtime 10125 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/560/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393356 kB
MemFree: 16035520 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16095192 kB
Could not compute solution for formula : ShieldRVs-PT-020A-ReachabilityFireability-05

BK_STOP 1679301711893

--------------------
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
mcc2023
rfs formula name ShieldRVs-PT-020A-ReachabilityFireability-05
rfs formula type EF
rfs formula formula --invariant=/tmp/560/inv_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 282 places, 382 transitions and 1904 arcs
pnml2lts-sym: Petri net ShieldRVs_PT_020A analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 382->295 groups
pnml2lts-sym: Regrouping took 0.070 real 0.070 user 0.000 sys
pnml2lts-sym: state vector length is 282; there are 295 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
Killing (15) : 566
Killing (9) : 566

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="ShieldRVs-PT-020A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldRVs-PT-020A, 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 r425-tajo-167905977700103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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