Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r365-tall-171683779500512.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldRVs-PT-030A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r365-tall-171683779500512
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 17:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 12 17:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 191K May 18 16:43 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716917038880

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVs-PT-030A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202405141337
[2024-05-28 17:24:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-28 17:24:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:24:00] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-28 17:24:00] [INFO ] Transformed 423 places.
[2024-05-28 17:24:00] [INFO ] Transformed 573 transitions.
[2024-05-28 17:24:00] [INFO ] Found NUPN structural information;
[2024-05-28 17:24:00] [INFO ] Parsed PT model containing 423 places and 573 transitions and 2760 arcs in 216 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 423/423 places, 573/573 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 572
Applied a total of 2 rules in 56 ms. Remains 422 /423 variables (removed 1) and now considering 572/573 (removed 1) transitions.
// Phase 1: matrix 572 rows 422 cols
[2024-05-28 17:24:00] [INFO ] Computed 121 invariants in 34 ms
[2024-05-28 17:24:01] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-28 17:24:01] [INFO ] Invariant cache hit.
[2024-05-28 17:24:01] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
Running 571 sub problems to find dead transitions.
[2024-05-28 17:24:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 421/421 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (OVERLAPS) 1/422 variables, 121/542 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-28 17:24:12] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 36 ms to minimize.
[2024-05-28 17:24:12] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-05-28 17:24:12] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 2 ms to minimize.
[2024-05-28 17:24:12] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-28 17:24:12] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-05-28 17:24:13] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:24:13] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:24:13] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2024-05-28 17:24:13] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:24:13] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-28 17:24:13] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2024-05-28 17:24:13] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:24:13] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:24:13] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:24:14] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 2 ms to minimize.
[2024-05-28 17:24:14] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 2 ms to minimize.
[2024-05-28 17:24:14] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2024-05-28 17:24:14] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 2 ms to minimize.
[2024-05-28 17:24:14] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:24:14] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 20/563 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-28 17:24:15] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 2 ms to minimize.
[2024-05-28 17:24:15] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:24:15] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 2 ms to minimize.
[2024-05-28 17:24:15] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:24:15] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:24:15] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-28 17:24:15] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 2 ms to minimize.
[2024-05-28 17:24:16] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2024-05-28 17:24:16] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
[2024-05-28 17:24:16] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:24:16] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:24:16] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:24:16] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 2 ms to minimize.
[2024-05-28 17:24:16] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-05-28 17:24:16] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:24:17] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2024-05-28 17:24:17] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-05-28 17:24:17] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:24:17] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2024-05-28 17:24:17] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 20/583 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-28 17:24:17] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2024-05-28 17:24:18] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 1 ms to minimize.
[2024-05-28 17:24:18] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 6 ms to minimize.
[2024-05-28 17:24:18] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
[2024-05-28 17:24:18] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:24:18] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:24:18] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2024-05-28 17:24:18] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:24:19] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:24:19] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-28 17:24:19] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-05-28 17:24:19] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:24:19] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2024-05-28 17:24:19] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 2 ms to minimize.
[2024-05-28 17:24:19] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
[2024-05-28 17:24:19] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
[2024-05-28 17:24:20] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:24:20] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 2 ms to minimize.
[2024-05-28 17:24:20] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-05-28 17:24:20] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 20/603 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-28 17:24:24] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2024-05-28 17:24:24] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-05-28 17:24:24] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-05-28 17:24:24] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-05-28 17:24:25] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:24:25] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:24:25] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2024-05-28 17:24:25] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:24:25] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
[2024-05-28 17:24:25] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:24:25] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
[2024-05-28 17:24:25] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 2 ms to minimize.
[2024-05-28 17:24:26] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:24:26] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:24:26] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:24:26] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-05-28 17:24:26] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:24:26] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:24:26] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 2 ms to minimize.
[2024-05-28 17:24:27] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 20/623 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-28 17:24:27] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 2 ms to minimize.
[2024-05-28 17:24:27] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
[2024-05-28 17:24:28] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-05-28 17:24:28] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:24:28] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-28 17:24:28] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2024-05-28 17:24:28] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:24:28] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
[2024-05-28 17:24:29] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 2 ms to minimize.
[2024-05-28 17:24:29] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-28 17:24:29] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-05-28 17:24:29] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 2 ms to minimize.
[2024-05-28 17:24:29] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-05-28 17:24:29] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-28 17:24:29] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2024-05-28 17:24:29] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
[2024-05-28 17:24:30] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 2 ms to minimize.
[2024-05-28 17:24:30] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-28 17:24:30] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-28 17:24:30] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 20/643 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-28 17:24:30] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2024-05-28 17:24:30] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:24:31] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:24:31] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
SMT process timed out in 30309ms, After SMT, problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 30332ms
Starting structural reductions in LIVENESS mode, iteration 1 : 422/423 places, 572/573 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 31407 ms. Remains : 422/423 places, 572/573 transitions.
Discarding 180 transitions out of 572. Remains 392
Initial state reduction rules removed 1 formulas.
[2024-05-28 17:24:32] [INFO ] Flatten gal took : 217 ms
RANDOM walk for 40000 steps (97 resets) in 2454 ms. (16 steps per ms) remains 0/391 properties
[2024-05-28 17:24:32] [INFO ] Flatten gal took : 116 ms
[2024-05-28 17:24:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8357423184432789080.gal : 23 ms
[2024-05-28 17:24:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10957567355256683573.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8357423184432789080.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10957567355256683573.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

ITS runner timed out or was interrupted.
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 392 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 32507 ms.

BK_STOP 1716917072739

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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-030A"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
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-5568"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-030A, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r365-tall-171683779500512"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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