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.r151-smll-167819438000283.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 ltsminxred
Input is DoubleExponent-PT-002, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-smll-167819438000283
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.7K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 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 33K 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 1678390073836

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 19:27:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-09 19:27:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 19:27:57] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-09 19:27:57] [INFO ] Transformed 110 places.
[2023-03-09 19:27:57] [INFO ] Transformed 98 transitions.
[2023-03-09 19:27:57] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 320 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 12 ms.
Incomplete random walk after 10000 steps, including 329 resets, run finished after 680 ms. (steps per millisecond=14 ) properties (out of 99) seen :44
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 55) seen :24
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
// Phase 1: matrix 98 rows 110 cols
[2023-03-09 19:27:59] [INFO ] Computed 14 place invariants in 19 ms
[2023-03-09 19:27:59] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-09 19:28:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 26 ms returned sat
[2023-03-09 19:28:00] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 13 ms returned sat
[2023-03-09 19:28:00] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2023-03-09 19:28:00] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 9 ms to minimize.
[2023-03-09 19:28:00] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 1 ms to minimize.
[2023-03-09 19:28:01] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 2 ms to minimize.
[2023-03-09 19:28:01] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 2 ms to minimize.
[2023-03-09 19:28:01] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2023-03-09 19:28:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 390 ms
[2023-03-09 19:28:01] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2023-03-09 19:28:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-09 19:28:01] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2023-03-09 19:28:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-09 19:28:01] [INFO ] After 1281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :31
Attempting to minimize the solution found.
Minimization took 219 ms.
[2023-03-09 19:28:01] [INFO ] After 1988ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :31
Parikh walk visited 0 properties in 1808 ms.
Support contains 31 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 107 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 107 transition count 82
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 91 transition count 82
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 33 place count 91 transition count 79
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 39 place count 88 transition count 79
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 71 place count 72 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 70 transition count 63
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 70 transition count 59
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 83 place count 66 transition count 59
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 66 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 65 transition count 58
Applied a total of 88 rules in 43 ms. Remains 65 /110 variables (removed 45) and now considering 58/98 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 65/110 places, 58/98 transitions.
Incomplete random walk after 1000000 steps, including 128384 resets, run finished after 28169 ms. (steps per millisecond=35 ) properties (out of 31) seen :14
Incomplete Best-First random walk after 100001 steps, including 8481 resets, run finished after 1911 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8474 resets, run finished after 1833 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8515 resets, run finished after 1821 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8429 resets, run finished after 1845 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8429 resets, run finished after 1798 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8482 resets, run finished after 1854 ms. (steps per millisecond=53 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8397 resets, run finished after 1995 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8506 resets, run finished after 2084 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8361 resets, run finished after 2041 ms. (steps per millisecond=48 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8514 resets, run finished after 1890 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8553 resets, run finished after 1708 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8449 resets, run finished after 1705 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8491 resets, run finished after 1636 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8500 resets, run finished after 1603 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8436 resets, run finished after 1666 ms. (steps per millisecond=60 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8450 resets, run finished after 1653 ms. (steps per millisecond=60 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8452 resets, run finished after 1760 ms. (steps per millisecond=56 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 58 rows 65 cols
[2023-03-09 19:29:02] [INFO ] Computed 12 place invariants in 7 ms
[2023-03-09 19:29:02] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-09 19:29:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-09 19:29:02] [INFO ] [Nat]Absence check using 4 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-09 19:29:03] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-09 19:29:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 19:29:03] [INFO ] After 79ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-09 19:29:03] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-09 19:29:03] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 255 ms.
Support contains 17 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 58/58 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 65 transition count 54
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 61 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 59 transition count 52
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 59 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 58 transition count 51
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 17 place count 58 transition count 51
Applied a total of 17 rules in 16 ms. Remains 58 /65 variables (removed 7) and now considering 51/58 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 58/65 places, 51/58 transitions.
Incomplete random walk after 1000000 steps, including 128248 resets, run finished after 26166 ms. (steps per millisecond=38 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8607 resets, run finished after 1616 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8462 resets, run finished after 1617 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8436 resets, run finished after 1835 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8496 resets, run finished after 1853 ms. (steps per millisecond=53 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8458 resets, run finished after 1819 ms. (steps per millisecond=54 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8430 resets, run finished after 1966 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8451 resets, run finished after 1876 ms. (steps per millisecond=53 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8472 resets, run finished after 1966 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8493 resets, run finished after 2047 ms. (steps per millisecond=48 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8498 resets, run finished after 1936 ms. (steps per millisecond=51 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8540 resets, run finished after 1803 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8449 resets, run finished after 1614 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 8537 resets, run finished after 1601 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8499 resets, run finished after 1595 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8488 resets, run finished after 1612 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8451 resets, run finished after 1613 ms. (steps per millisecond=61 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100000 steps, including 8399 resets, run finished after 1645 ms. (steps per millisecond=60 ) properties (out of 17) seen :0
Finished probabilistic random walk after 1220 steps, run visited all 17 properties in 36 ms. (steps per millisecond=33 )
Probabilistic random walk after 1220 steps, saw 643 distinct states, run finished after 36 ms. (steps per millisecond=33 ) properties seen :17
Able to resolve query StableMarking after proving 100 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 122755 ms.
ITS solved all properties within timeout

BK_STOP 1678390200967

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="DoubleExponent-PT-002"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DoubleExponent-PT-002, 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 r151-smll-167819438000283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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