Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r518-tajo-171654455800192.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S04J06T10, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r518-tajo-171654455800192
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 21K Apr 11 16:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 11 16:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 69K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 339K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 11 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 256K Apr 11 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 11 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 540K Apr 11 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.3M 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 1717269793308

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S04J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:23:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 19:23:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:23:14] [INFO ] Load time of PNML (sax parser for PT used): 281 ms
[2024-06-01 19:23:14] [INFO ] Transformed 966 places.
[2024-06-01 19:23:15] [INFO ] Transformed 5354 transitions.
[2024-06-01 19:23:15] [INFO ] Parsed PT model containing 966 places and 5354 transitions and 36134 arcs in 428 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 966/966 places, 5354/5354 transitions.
Ensure Unique test removed 4 places
Ensure Unique test removed 2710 transitions
Reduce isomorphic transitions removed 2710 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 2804 rules applied. Total rules applied 2804 place count 962 transition count 2554
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 2894 place count 872 transition count 2554
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 2894 place count 872 transition count 2434
Deduced a syphon composed of 120 places in 9 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 3134 place count 752 transition count 2434
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 3334 place count 652 transition count 2334
Applied a total of 3334 rules in 224 ms. Remains 652 /966 variables (removed 314) and now considering 2334/5354 (removed 3020) transitions.
Running 2330 sub problems to find dead transitions.
[2024-06-01 19:23:15] [INFO ] Flow matrix only has 2294 transitions (discarded 40 similar events)
// Phase 1: matrix 2294 rows 652 cols
[2024-06-01 19:23:15] [INFO ] Computed 58 invariants in 126 ms
[2024-06-01 19:23:15] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/648 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 2330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/2946 variables, and 54 constraints, problems are : Problem set: 0 solved, 2330 unsolved in 20119 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 38/41 constraints, State Equation: 0/652 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2330/2330 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/648 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 2330 unsolved
[2024-06-01 19:23:53] [INFO ] Deduced a trap composed of 52 places in 660 ms of which 43 ms to minimize.
[2024-06-01 19:23:54] [INFO ] Deduced a trap composed of 52 places in 648 ms of which 6 ms to minimize.
[2024-06-01 19:23:55] [INFO ] Deduced a trap composed of 52 places in 510 ms of which 5 ms to minimize.
[2024-06-01 19:23:55] [INFO ] Deduced a trap composed of 52 places in 520 ms of which 4 ms to minimize.
[2024-06-01 19:23:56] [INFO ] Deduced a trap composed of 52 places in 414 ms of which 4 ms to minimize.
[2024-06-01 19:23:56] [INFO ] Deduced a trap composed of 52 places in 401 ms of which 4 ms to minimize.
[2024-06-01 19:23:56] [INFO ] Deduced a trap composed of 266 places in 377 ms of which 4 ms to minimize.
[2024-06-01 19:23:57] [INFO ] Deduced a trap composed of 263 places in 375 ms of which 4 ms to minimize.
[2024-06-01 19:23:57] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:23:57] [INFO ] Deduced a trap composed of 48 places in 482 ms of which 4 ms to minimize.
[2024-06-01 19:23:58] [INFO ] Deduced a trap composed of 97 places in 513 ms of which 4 ms to minimize.
[2024-06-01 19:23:58] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:23:58] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:23:58] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:23:59] [INFO ] Deduced a trap composed of 216 places in 473 ms of which 4 ms to minimize.
[2024-06-01 19:24:00] [INFO ] Deduced a trap composed of 39 places in 322 ms of which 3 ms to minimize.
[2024-06-01 19:24:01] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 3 ms to minimize.
[2024-06-01 19:24:05] [INFO ] Deduced a trap composed of 272 places in 486 ms of which 4 ms to minimize.
[2024-06-01 19:24:05] [INFO ] Deduced a trap composed of 297 places in 423 ms of which 4 ms to minimize.
[2024-06-01 19:24:07] [INFO ] Deduced a trap composed of 284 places in 433 ms of which 3 ms to minimize.
SMT process timed out in 52333ms, After SMT, problems are : Problem set: 0 solved, 2330 unsolved
Search for dead transitions found 0 dead transitions in 52392ms
[2024-06-01 19:24:07] [INFO ] Flow matrix only has 2294 transitions (discarded 40 similar events)
[2024-06-01 19:24:07] [INFO ] Invariant cache hit.
[2024-06-01 19:24:08] [INFO ] Implicit Places using invariants in 1076 ms returned [67, 148, 183, 229, 315, 352, 375, 449, 488, 569]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1084 ms to find 10 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 642/966 places, 2334/5354 transitions.
Applied a total of 0 rules in 20 ms. Remains 642 /642 variables (removed 0) and now considering 2334/2334 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 53783 ms. Remains : 642/966 places, 2334/5354 transitions.
Initial state reduction rules removed 4 formulas.
RANDOM walk for 40000 steps (9 resets) in 5897 ms. (6 steps per ms) remains 581/2330 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 581/581 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 581/581 properties
[2024-06-01 19:24:10] [INFO ] Flow matrix only has 2294 transitions (discarded 40 similar events)
// Phase 1: matrix 2294 rows 642 cols
[2024-06-01 19:24:10] [INFO ] Computed 48 invariants in 78 ms
[2024-06-01 19:24:10] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Problem qltransition_12 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 10731ms, After SMT, problems are : Problem set: 0 solved, 581 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 642/642 places, 2334/2334 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 636 transition count 2328
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 636 transition count 2328
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 636 transition count 2318
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 626 transition count 2318
Applied a total of 32 rules in 307 ms. Remains 626 /642 variables (removed 16) and now considering 2318/2334 (removed 16) transitions.
Running 2314 sub problems to find dead transitions.
[2024-06-01 19:24:21] [INFO ] Flow matrix only has 2278 transitions (discarded 40 similar events)
// Phase 1: matrix 2278 rows 626 cols
[2024-06-01 19:24:21] [INFO ] Computed 48 invariants in 80 ms
[2024-06-01 19:24:21] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 2314 unsolved
[2024-06-01 19:24:54] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/2904 variables, and 44 constraints, problems are : Problem set: 0 solved, 2314 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 26/31 constraints, State Equation: 0/626 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2314/2314 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 2314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/622 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2314 unsolved
[2024-06-01 19:24:57] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:24:57] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:24:58] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 0 ms to minimize.
[2024-06-01 19:24:58] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:24:59] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:24:59] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:24:59] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:25:00] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:25:01] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:25:03] [INFO ] Deduced a trap composed of 60 places in 339 ms of which 4 ms to minimize.
[2024-06-01 19:25:03] [INFO ] Deduced a trap composed of 106 places in 272 ms of which 3 ms to minimize.
[2024-06-01 19:25:04] [INFO ] Deduced a trap composed of 87 places in 254 ms of which 3 ms to minimize.
[2024-06-01 19:25:09] [INFO ] Deduced a trap composed of 224 places in 411 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/2904 variables, and 57 constraints, problems are : Problem set: 0 solved, 2314 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 26/31 constraints, State Equation: 0/626 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2314 constraints, Known Traps: 14/14 constraints]
After SMT, in 52828ms problems are : Problem set: 0 solved, 2314 unsolved
Search for dead transitions found 0 dead transitions in 52861ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53178 ms. Remains : 626/642 places, 2318/2334 transitions.
Total runtime 120166 ms.
ITS solved all properties within timeout

BK_STOP 1717269914842

--------------------
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 QuasiLiveness -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-S04J06T10"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-PT-S04J06T10, 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 r518-tajo-171654455800192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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