fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r161-tall-174881260800169
Last Updated
June 24, 2025

About the Execution of ITS-Tools for PolyORBLF-COL-S02J04T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 104747.00 0.00 0.00 F normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r161-tall-174881260800169.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 itstools
Input is PolyORBLF-COL-S02J04T06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r161-tall-174881260800169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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 4.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 154K 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 1748856722754

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-COL-S02J04T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
Liveness COL
Running Version 202505121319
[2025-06-02 09:32:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-02 09:32:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:32:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-02 09:32:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 09:32:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 674 ms
[2025-06-02 09:32:04] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 21 ms.
[2025-06-02 09:32:04] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2025-06-02 09:32:04] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2025-06-02 09:32:04] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 29 ms.
[2025-06-02 09:32:04] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2025-06-02 09:32:04] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 12 ms.
[2025-06-02 09:32:04] [INFO ] Unfolded 65 HLPN properties in 1 ms.
[2025-06-02 09:32:04] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-02 09:32:04] [INFO ] Reduced 24 identical enabling conditions.
[2025-06-02 09:32:04] [INFO ] Reduced 66 identical enabling conditions.
[2025-06-02 09:32:04] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 1 ms.
[2025-06-02 09:32:04] [INFO ] Skeletonized 65 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2025-06-02 09:32:04] [INFO ] Unfolded HLPN to a Petri net with 476 places and 920 transitions 4242 arcs in 12 ms.
[2025-06-02 09:32:04] [INFO ] Unfolded 65 HLPN properties in 0 ms.
[2025-06-02 09:32:04] [INFO ] Reduced 6 identical enabling conditions.
[2025-06-02 09:32:04] [INFO ] Reduced 24 identical enabling conditions.
[2025-06-02 09:32:04] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Built sparse matrix representations for Structural reductions in 2 ms.19235KB 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 47 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 09:32:05] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2025-06-02 09:32:05] [INFO ] Computed 46 invariants in 53 ms
[2025-06-02 09:32:05] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:13] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:13] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:13] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:13] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:13] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:14] [INFO ] Deduced a trap composed of 217 places in 408 ms of which 209 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:14] [INFO ] Deduced a trap composed of 98 places in 223 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:14] [INFO ] Deduced a trap composed of 133 places in 231 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:15] [INFO ] Deduced a trap composed of 254 places in 228 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:15] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:15] [INFO ] Deduced a trap composed of 223 places in 283 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:18] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:20] [INFO ] Deduced a trap composed of 205 places in 243 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:20] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:23] [INFO ] Deduced a trap composed of 235 places in 274 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:23] [INFO ] Deduced a trap composed of 223 places in 276 ms of which 79 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1288 variables, and 58 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20570 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 58 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41285ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 41321ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 41415 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 29 ms. Remains 476 /476 variables (removed 0) and now considering 824/824 (removed 0) transitions.
[2025-06-02 09:32:46] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 09:32:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:32:46] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-02 09:32:46] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 09:32:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:32:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-06-02 09:32:46] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:32:46] [INFO ] Redundant transitions in 49 ms returned []
Running 822 sub problems to find dead transitions.
[2025-06-02 09:32:47] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
[2025-06-02 09:32:47] [INFO ] Invariant cache hit.
[2025-06-02 09:32:47] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:54] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:54] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:54] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:54] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:54] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:55] [INFO ] Deduced a trap composed of 133 places in 223 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:32:55] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:00] [INFO ] Deduced a trap composed of 205 places in 264 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:00] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:03] [INFO ] Deduced a trap composed of 223 places in 265 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:05] [INFO ] Deduced a trap composed of 200 places in 227 ms of which 50 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:13] [INFO ] Deduced a trap composed of 223 places in 256 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:14] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:14] [INFO ] Deduced a trap composed of 235 places in 249 ms of which 83 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 822 unsolved
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 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:28] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:29] [INFO ] Deduced a trap composed of 217 places in 249 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:33:31] [INFO ] Deduced a trap composed of 98 places in 238 ms of which 59 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1288 variables, and 59 constraints, problems are : Problem set: 0 solved, 822 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 30/34 constraints, State Equation: 0/476 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/822 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60412ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 60416ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61043 ms. Remains : 476/476 places, 824/824 transitions.
Finished random walk after 3968 steps, including 0 resets, run found a deadlock after 20 ms. (steps per millisecond=198 )
FORMULA Liveness FALSE TECHNIQUES STRUCTURAL DEADLOCK_TEST
Total runtime 103470 ms.

BK_STOP 1748856827501

--------------------
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
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -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="PolyORBLF-COL-S02J04T06"
export BK_EXAMINATION="Liveness"
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-5832"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-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 r161-tall-174881260800169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T06.tgz
mv PolyORBLF-COL-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 ;