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.r166-smll-171636274600189.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 greatspnxred
Input is FMS-PT-00020, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-171636274600189
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K 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:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 22:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 11 22:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 22:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 22:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16K May 18 16:42 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 1716493274400

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FMS-PT-00020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:41:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-23 19:41:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:41:17] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-23 19:41:17] [INFO ] Transformed 22 places.
[2024-05-23 19:41:17] [INFO ] Transformed 20 transitions.
[2024-05-23 19:41:17] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 424 ms.
Discarding 2 transitions out of 20. Remains 18
Built sparse matrix representations for Structural reductions in 9 ms.19205KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 22/22 places, 20/20 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 32 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 62 ms. Remains : 22/22 places, 20/20 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 22/22 places, 20/20 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 4 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-23 19:41:17] [INFO ] Computed 6 invariants in 7 ms
[2024-05-23 19:41:17] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-23 19:41:17] [INFO ] Invariant cache hit.
[2024-05-23 19:41:18] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-05-23 19:41:18] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-23 19:41:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 3/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 3/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 877ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 892ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1298 ms. Remains : 22/22 places, 20/20 transitions.
Random walk for 1250000 steps, including 0 resets, run took 791 ms (no deadlock found). (steps per millisecond=1580 )
Random directed walk for 1250000 steps, including 0 resets, run took 683 ms (no deadlock found). (steps per millisecond=1830 )
[2024-05-23 19:41:20] [INFO ] Invariant cache hit.
[2024-05-23 19:41:20] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 12 edges and 13 vertex of which 9 / 13 are part of one of the 3 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 18 place count 7 transition count 12
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 27 place count 4 transition count 6
Applied a total of 27 rules in 29 ms. Remains 4 /22 variables (removed 18) and now considering 6/20 (removed 14) transitions.
[2024-05-23 19:41:20] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
// Phase 1: matrix 4 rows 4 cols
[2024-05-23 19:41:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 19:41:20] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 19:41:20] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2024-05-23 19:41:20] [INFO ] Invariant cache hit.
[2024-05-23 19:41:20] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2024-05-23 19:41:20] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2024-05-23 19:41:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Starting structural reductions in LIVENESS mode, iteration 1 : 4/22 places, 6/20 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 170 ms. Remains : 4/22 places, 6/20 transitions.
Discarding 2 transitions out of 6. Remains 4
Initial state reduction rules removed 2 formulas.
RANDOM walk for 88 steps (0 resets) in 8 ms. (9 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 4 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 12 edges and 13 vertex of which 9 / 13 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 18 place count 7 transition count 12
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 27 place count 4 transition count 6
Applied a total of 27 rules in 4 ms. Remains 4 /22 variables (removed 18) and now considering 6/20 (removed 14) transitions.
[2024-05-23 19:41:20] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2024-05-23 19:41:20] [INFO ] Invariant cache hit.
[2024-05-23 19:41:20] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-23 19:41:20] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2024-05-23 19:41:20] [INFO ] Invariant cache hit.
[2024-05-23 19:41:20] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2024-05-23 19:41:20] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2024-05-23 19:41:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 89ms
Starting structural reductions in LIVENESS mode, iteration 1 : 4/22 places, 6/20 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 162 ms. Remains : 4/22 places, 6/20 transitions.
Discarding 2 transitions out of 6. Remains 4
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :3 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 3 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 3888 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FMS-PT-00020

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 22
TRANSITIONS: 20
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.002s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 538
MODEL NAME: /home/mcc/execution/model
22 places, 20 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716493281741

--------------------
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="FMS-PT-00020"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FMS-PT-00020, 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 r166-smll-171636274600189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-00020.tgz
mv FMS-PT-00020 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;