Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r168-tall-174881266700259.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is PolyORBLF-PT-S02J04T06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-174881266700259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 21K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 144K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 862K May 29 14:32 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 Liveness

=== Now, execution of the tool begins

BK_START 1748899333174

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 21:22:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-02 21:22:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:22:14] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2025-06-02 21:22:14] [INFO ] Transformed 476 places.
[2025-06-02 21:22:14] [INFO ] Transformed 920 transitions.
[2025-06-02 21:22:14] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 230 ms.
Discarding 96 transitions out of 920. Remains 824
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Built sparse matrix representations for Structural reductions in 8 ms.21539KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 476/476 places, 824/824 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 58 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
Running 822 sub problems to find dead transitions.
[2025-06-02 21:22:14] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2025-06-02 21:22:14] [INFO ] Computed 46 invariants in 46 ms
[2025-06-02 21:22:14] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2025-06-02 21:22:22] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 14 ms to minimize.
[2025-06-02 21:22:22] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2025-06-02 21:22:22] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 1 ms to minimize.
[2025-06-02 21:22:22] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 2 ms to minimize.
[2025-06-02 21:22:22] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 1 ms to minimize.
[2025-06-02 21:22:22] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2025-06-02 21:22:23] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2025-06-02 21:22:23] [INFO ] Deduced a trap composed of 282 places in 162 ms of which 3 ms to minimize.
[2025-06-02 21:22:23] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 3 ms to minimize.
[2025-06-02 21:22:24] [INFO ] Deduced a trap composed of 322 places in 173 ms of which 4 ms to minimize.
[2025-06-02 21:22:24] [INFO ] Deduced a trap composed of 229 places in 187 ms of which 3 ms to minimize.
[2025-06-02 21:22:24] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2025-06-02 21:22:24] [INFO ] Deduced a trap composed of 242 places in 182 ms of which 3 ms to minimize.
[2025-06-02 21:22:24] [INFO ] Deduced a trap composed of 234 places in 185 ms of which 3 ms to minimize.
[2025-06-02 21:22:25] [INFO ] Deduced a trap composed of 269 places in 167 ms of which 2 ms to minimize.
[2025-06-02 21:22:28] [INFO ] Deduced a trap composed of 318 places in 167 ms of which 3 ms to minimize.
[2025-06-02 21:22:28] [INFO ] Deduced a trap composed of 242 places in 190 ms of which 3 ms to minimize.
[2025-06-02 21:22:28] [INFO ] Deduced a trap composed of 223 places in 169 ms of which 3 ms to minimize.
[2025-06-02 21:22:29] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 55 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2025-06-02 21:22:43] [INFO ] Deduced a trap composed of 2 places in 180 ms of which 3 ms to minimize.
[2025-06-02 21:22:43] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 3 ms to minimize.
[2025-06-02 21:22:43] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 3 ms to minimize.
[2025-06-02 21:22:43] [INFO ] Deduced a trap composed of 251 places in 174 ms of which 2 ms to minimize.
[2025-06-02 21:22:44] [INFO ] Deduced a trap composed of 193 places in 187 ms of which 3 ms to minimize.
[2025-06-02 21:22:44] [INFO ] Deduced a trap composed of 132 places in 155 ms of which 3 ms to minimize.
[2025-06-02 21:22:44] [INFO ] Deduced a trap composed of 271 places in 169 ms of which 3 ms to minimize.
[2025-06-02 21:22:44] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 3 ms to minimize.
[2025-06-02 21:22:45] [INFO ] Deduced a trap composed of 275 places in 162 ms of which 3 ms to minimize.
[2025-06-02 21:22:45] [INFO ] Deduced a trap composed of 272 places in 181 ms of which 3 ms to minimize.
[2025-06-02 21:22:45] [INFO ] Deduced a trap composed of 260 places in 164 ms of which 3 ms to minimize.
[2025-06-02 21:22:45] [INFO ] Deduced a trap composed of 132 places in 147 ms of which 2 ms to minimize.
[2025-06-02 21:22:46] [INFO ] Deduced a trap composed of 169 places in 145 ms of which 2 ms to minimize.
[2025-06-02 21:22:46] [INFO ] Deduced a trap composed of 274 places in 182 ms of which 3 ms to minimize.
[2025-06-02 21:22:46] [INFO ] Deduced a trap composed of 159 places in 171 ms of which 4 ms to minimize.
[2025-06-02 21:22:47] [INFO ] Deduced a trap composed of 159 places in 133 ms of which 3 ms to minimize.
[2025-06-02 21:22:47] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:22:47] [INFO ] Deduced a trap composed of 282 places in 173 ms of which 2 ms to minimize.
[2025-06-02 21:22:47] [INFO ] Deduced a trap composed of 132 places in 165 ms of which 2 ms to minimize.
[2025-06-02 21:22:47] [INFO ] Deduced a trap composed of 297 places in 170 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2025-06-02 21:22:53] [INFO ] Deduced a trap composed of 269 places in 191 ms of which 4 ms to minimize.
[2025-06-02 21:22:54] [INFO ] Deduced a trap composed of 279 places in 178 ms of which 3 ms to minimize.
[2025-06-02 21:22:54] [INFO ] Deduced a trap composed of 304 places in 172 ms of which 3 ms to minimize.
[2025-06-02 21:22:55] [INFO ] Deduced a trap composed of 275 places in 179 ms of which 3 ms to minimize.
[2025-06-02 21:22:55] [INFO ] Deduced a trap composed of 285 places in 178 ms of which 3 ms to minimize.
[2025-06-02 21:22:55] [INFO ] Deduced a trap composed of 252 places in 184 ms of which 3 ms to minimize.
[2025-06-02 21:22:55] [INFO ] Deduced a trap composed of 272 places in 177 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 82 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 46/46 constraints]
After SMT, in 41090ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 41127ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 41231 ms. Remains : 476/476 places, 824/824 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 476/476 places, 824/824 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 42 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2025-06-02 21:22:56] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 21:22:56] [INFO ] Invariant cache hit.
[2025-06-02 21:22:56] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-02 21:22:56] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 21:22:56] [INFO ] Invariant cache hit.
[2025-06-02 21:22:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 21:22:56] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2025-06-02 21:22:56] [INFO ] Redundant transitions in 49 ms returned []
Running 822 sub problems to find dead transitions.
[2025-06-02 21:22:56] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 21:22:56] [INFO ] Invariant cache hit.
[2025-06-02 21:22:56] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2025-06-02 21:23:03] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2025-06-02 21:23:03] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 1 ms to minimize.
[2025-06-02 21:23:03] [INFO ] Deduced a trap composed of 65 places in 42 ms of which 1 ms to minimize.
[2025-06-02 21:23:03] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
[2025-06-02 21:23:03] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 1 ms to minimize.
[2025-06-02 21:23:03] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 1 ms to minimize.
[2025-06-02 21:23:04] [INFO ] Deduced a trap composed of 277 places in 176 ms of which 3 ms to minimize.
[2025-06-02 21:23:04] [INFO ] Deduced a trap composed of 136 places in 176 ms of which 3 ms to minimize.
[2025-06-02 21:23:05] [INFO ] Deduced a trap composed of 246 places in 184 ms of which 3 ms to minimize.
[2025-06-02 21:23:05] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2025-06-02 21:23:05] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2025-06-02 21:23:05] [INFO ] Deduced a trap composed of 223 places in 186 ms of which 3 ms to minimize.
[2025-06-02 21:23:05] [INFO ] Deduced a trap composed of 290 places in 188 ms of which 3 ms to minimize.
[2025-06-02 21:23:06] [INFO ] Deduced a trap composed of 234 places in 169 ms of which 3 ms to minimize.
[2025-06-02 21:23:07] [INFO ] Deduced a trap composed of 262 places in 172 ms of which 3 ms to minimize.
[2025-06-02 21:23:09] [INFO ] Deduced a trap composed of 243 places in 187 ms of which 3 ms to minimize.
[2025-06-02 21:23:12] [INFO ] Deduced a trap composed of 215 places in 183 ms of which 3 ms to minimize.
[2025-06-02 21:23:13] [INFO ] Deduced a trap composed of 116 places in 179 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2025-06-02 21:23:19] [INFO ] Deduced a trap composed of 265 places in 181 ms of which 3 ms to minimize.
[2025-06-02 21:23:20] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 56 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 822 unsolved
[2025-06-02 21:23:37] [INFO ] Deduced a trap composed of 279 places in 177 ms of which 3 ms to minimize.
[2025-06-02 21:23:39] [INFO ] Deduced a trap composed of 2 places in 103 ms of which 2 ms to minimize.
[2025-06-02 21:23:39] [INFO ] Deduced a trap composed of 222 places in 181 ms of which 3 ms to minimize.
[2025-06-02 21:23:39] [INFO ] Deduced a trap composed of 226 places in 168 ms of which 3 ms to minimize.
[2025-06-02 21:23:40] [INFO ] Deduced a trap composed of 264 places in 167 ms of which 2 ms to minimize.
[2025-06-02 21:23:40] [INFO ] Deduced a trap composed of 261 places in 164 ms of which 2 ms to minimize.
[2025-06-02 21:23:40] [INFO ] Deduced a trap composed of 260 places in 171 ms of which 3 ms to minimize.
[2025-06-02 21:23:40] [INFO ] Deduced a trap composed of 255 places in 164 ms of which 3 ms to minimize.
[2025-06-02 21:23:41] [INFO ] Deduced a trap composed of 287 places in 160 ms of which 3 ms to minimize.
[2025-06-02 21:23:41] [INFO ] Deduced a trap composed of 264 places in 174 ms of which 3 ms to minimize.
[2025-06-02 21:23:41] [INFO ] Deduced a trap composed of 268 places in 174 ms of which 3 ms to minimize.
[2025-06-02 21:23:42] [INFO ] Deduced a trap composed of 275 places in 162 ms of which 2 ms to minimize.
[2025-06-02 21:23:42] [INFO ] Deduced a trap composed of 238 places in 161 ms of which 3 ms to minimize.
[2025-06-02 21:23:42] [INFO ] Deduced a trap composed of 286 places in 163 ms of which 4 ms to minimize.
[2025-06-02 21:23:46] [INFO ] Deduced a trap composed of 265 places in 164 ms of which 3 ms to minimize.
[2025-06-02 21:23:47] [INFO ] Deduced a trap composed of 276 places in 187 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 72 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 25/35 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 36/36 constraints]
After SMT, in 60827ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60838ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61609 ms. Remains : 476/476 places, 824/824 transitions.
Finished random walk after 2145 steps, including 0 resets, run found a deadlock after 13 ms. (steps per millisecond=165 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 103271 ms.
ITS solved all properties within timeout

BK_STOP 1748899437698

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -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="PolyORBLF-PT-S02J04T06"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is PolyORBLF-PT-S02J04T06, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r168-tall-174881266700259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T06.tgz
mv PolyORBLF-PT-S02J04T06 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;