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.r021-oct2-167813608900268.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is AutoFlight-PT-04b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-167813608900268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 18:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 18:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 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 91K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678932158265

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=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-04b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 02:02:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-16 02:02:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 02:02:41] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-16 02:02:41] [INFO ] Transformed 390 places.
[2023-03-16 02:02:41] [INFO ] Transformed 388 transitions.
[2023-03-16 02:02:41] [INFO ] Found NUPN structural information;
[2023-03-16 02:02:41] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 142 ms.
Structural test allowed to assert that 231 places are NOT stable. Took 8 ms.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 159) seen :91
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 68) seen :0
Running SMT prover for 68 properties.
// Phase 1: matrix 388 rows 390 cols
[2023-03-16 02:02:42] [INFO ] Computed 28 place invariants in 13 ms
[2023-03-16 02:02:43] [INFO ] After 1595ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:68
[2023-03-16 02:02:44] [INFO ] [Nat]Absence check using 27 positive place invariants in 30 ms returned sat
[2023-03-16 02:02:44] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-16 02:02:46] [INFO ] After 1633ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :68
[2023-03-16 02:02:47] [INFO ] Deduced a trap composed of 24 places in 329 ms of which 18 ms to minimize.
[2023-03-16 02:02:47] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 1 ms to minimize.
[2023-03-16 02:02:47] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2023-03-16 02:02:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 703 ms
[2023-03-16 02:02:48] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 11 ms to minimize.
[2023-03-16 02:02:48] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 1 ms to minimize.
[2023-03-16 02:02:48] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 0 ms to minimize.
[2023-03-16 02:02:48] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 1 ms to minimize.
[2023-03-16 02:02:48] [INFO ] Deduced a trap composed of 69 places in 211 ms of which 1 ms to minimize.
[2023-03-16 02:02:49] [INFO ] Deduced a trap composed of 71 places in 517 ms of which 1 ms to minimize.
[2023-03-16 02:02:49] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 1 ms to minimize.
[2023-03-16 02:02:49] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 0 ms to minimize.
[2023-03-16 02:02:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1726 ms
[2023-03-16 02:02:50] [INFO ] Deduced a trap composed of 70 places in 357 ms of which 1 ms to minimize.
[2023-03-16 02:02:50] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 0 ms to minimize.
[2023-03-16 02:02:50] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 0 ms to minimize.
[2023-03-16 02:02:50] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 1 ms to minimize.
[2023-03-16 02:02:50] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 0 ms to minimize.
[2023-03-16 02:02:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 838 ms
[2023-03-16 02:02:50] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 0 ms to minimize.
[2023-03-16 02:02:50] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2023-03-16 02:02:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2023-03-16 02:02:51] [INFO ] Deduced a trap composed of 78 places in 973 ms of which 28 ms to minimize.
[2023-03-16 02:02:54] [INFO ] Deduced a trap composed of 63 places in 2561 ms of which 1 ms to minimize.
[2023-03-16 02:02:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3631 ms
[2023-03-16 02:02:55] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 0 ms to minimize.
[2023-03-16 02:02:55] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 0 ms to minimize.
[2023-03-16 02:02:55] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 0 ms to minimize.
[2023-03-16 02:02:55] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 1 ms to minimize.
[2023-03-16 02:02:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 437 ms
[2023-03-16 02:02:55] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 0 ms to minimize.
[2023-03-16 02:02:55] [INFO ] Deduced a trap composed of 81 places in 431 ms of which 0 ms to minimize.
[2023-03-16 02:02:56] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 0 ms to minimize.
[2023-03-16 02:02:56] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 1 ms to minimize.
[2023-03-16 02:02:56] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 1 ms to minimize.
[2023-03-16 02:02:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 978 ms
[2023-03-16 02:02:56] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 1 ms to minimize.
[2023-03-16 02:02:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-16 02:02:57] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 0 ms to minimize.
[2023-03-16 02:02:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-16 02:02:58] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 1 ms to minimize.
[2023-03-16 02:02:58] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 1 ms to minimize.
[2023-03-16 02:02:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 347 ms
[2023-03-16 02:02:59] [INFO ] After 13759ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :68
Attempting to minimize the solution found.
Minimization took 2415 ms.
[2023-03-16 02:03:01] [INFO ] After 17834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :68
Parikh walk visited 22 properties in 7980 ms.
Support contains 46 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 390 transition count 257
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 157 rules applied. Total rules applied 288 place count 259 transition count 231
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 296 place count 251 transition count 231
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 296 place count 251 transition count 187
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 384 place count 207 transition count 187
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 408 place count 183 transition count 163
Iterating global reduction 3 with 24 rules applied. Total rules applied 432 place count 183 transition count 163
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 432 place count 183 transition count 151
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 456 place count 171 transition count 151
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 532 place count 133 transition count 113
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 534 place count 133 transition count 111
Free-agglomeration rule applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 550 place count 133 transition count 95
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 566 place count 117 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 567 place count 116 transition count 94
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 16 rules applied. Total rules applied 583 place count 106 transition count 88
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 589 place count 100 transition count 88
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 589 place count 100 transition count 78
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 609 place count 90 transition count 78
Applied a total of 609 rules in 59 ms. Remains 90 /390 variables (removed 300) and now considering 78/388 (removed 310) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 90/390 places, 78/388 transitions.
Finished random walk after 371 steps, including 0 resets, run visited all 46 properties in 6 ms. (steps per millisecond=61 )
Able to resolve query StableMarking after proving 160 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 28460 ms.
ITS solved all properties within timeout

BK_STOP 1678932189796

--------------------
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 StableMarking -timeout 180 -rebuildPNML

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="AutoFlight-PT-04b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 lolaxred"
echo " Input is AutoFlight-PT-04b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-167813608900268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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