fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r616-tall-171774433000139
Last Updated
July 7, 2024

About the Execution of LTSMin+red for BlocksWorld-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6628.275 288429.00 339612.00 658.90 F normal

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.r616-tall-171774433000139.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 ltsminxred
Input is BlocksWorld-PT-08, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r616-tall-171774433000139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 31M
-rw-r--r-- 1 mcc users 622K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.9M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 610K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.3M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 28K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 446K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 1.4M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.8M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 31K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 74K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 1.9M Jun 7 06:26 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 1717775673262

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BlocksWorld-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 15:54:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-07 15:54:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 15:54:34] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2024-06-07 15:54:34] [INFO ] Transformed 1979 places.
[2024-06-07 15:54:34] [INFO ] Transformed 3785 transitions.
[2024-06-07 15:54:34] [INFO ] Found NUPN structural information;
[2024-06-07 15:54:34] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42]
[2024-06-07 15:54:34] [INFO ] Parsed PT model containing 1979 places and 3785 transitions and 18910 arcs in 363 ms.
Discarding 43 transitions out of 3785. Remains 3742
Built sparse matrix representations for Structural reductions in 27 ms.20422KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1979/1979 places, 3785/3785 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 506 ms. Remains 1979 /1979 variables (removed 0) and now considering 3785/3785 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 520 ms. Remains : 1979/1979 places, 3785/3785 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 1979/1979 places, 3785/3785 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 476 ms. Remains 1979 /1979 variables (removed 0) and now considering 3785/3785 (removed 0) transitions.
// Phase 1: matrix 3785 rows 1979 cols
[2024-06-07 15:54:36] [INFO ] Computed 87 invariants in 64 ms
[2024-06-07 15:54:37] [INFO ] Implicit Places using invariants in 526 ms returned []
[2024-06-07 15:54:37] [INFO ] Invariant cache hit.
[2024-06-07 15:54:38] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-07 15:54:38] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 2594 ms to find 0 implicit places.
[2024-06-07 15:54:39] [INFO ] Redundant transitions in 220 ms returned []
Running 3779 sub problems to find dead transitions.
[2024-06-07 15:54:39] [INFO ] Invariant cache hit.
[2024-06-07 15:54:39] [INFO ] State equation strengthened by 75 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2302 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2728 is UNSAT
Problem TDEAD2792 is UNSAT
Problem TDEAD2854 is UNSAT
Problem TDEAD2972 is UNSAT
Problem TDEAD3028 is UNSAT
Problem TDEAD3082 is UNSAT
Problem TDEAD3134 is UNSAT
Problem TDEAD3184 is UNSAT
Problem TDEAD3232 is UNSAT
Problem TDEAD3278 is UNSAT
Problem TDEAD3322 is UNSAT
Problem TDEAD3404 is UNSAT
Problem TDEAD3442 is UNSAT
Problem TDEAD3478 is UNSAT
Problem TDEAD3512 is UNSAT
Problem TDEAD3544 is UNSAT
Problem TDEAD3574 is UNSAT
Problem TDEAD3602 is UNSAT
Problem TDEAD3628 is UNSAT
Problem TDEAD3674 is UNSAT
Problem TDEAD3694 is UNSAT
Problem TDEAD3712 is UNSAT
Problem TDEAD3728 is UNSAT
Problem TDEAD3742 is UNSAT
Problem TDEAD3754 is UNSAT
Problem TDEAD3764 is UNSAT
Problem TDEAD3772 is UNSAT
Problem TDEAD3778 is UNSAT
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1973 variables, 77/77 constraints. Problems are: Problem set: 78 solved, 3701 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1973/5764 variables, and 77 constraints, problems are : Problem set: 78 solved, 3701 unsolved in 30105 ms.
Refiners :[Positive P Invariants (semi-flows): 77/87 constraints, State Equation: 0/1979 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 3740/1893 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 3701 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1934 variables, 5/5 constraints. Problems are: Problem set: 78 solved, 3701 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1934/5764 variables, and 5 constraints, problems are : Problem set: 78 solved, 3701 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 5/87 constraints, State Equation: 0/1979 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1847/1893 constraints, Known Traps: 0/0 constraints]
After SMT, in 88899ms problems are : Problem set: 78 solved, 3701 unsolved
Search for dead transitions found 78 dead transitions in 88966ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 1979/1979 places, 3707/3785 transitions.
Computed a total of 39 stabilizing places and 0 stable transitions
Graph (complete) has 10838 edges and 1979 vertex of which 1940 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.12 ms
Discarding 39 places :
Also discarding 0 output 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 1 rules in 325 ms. Remains 1940 /1979 variables (removed 39) and now considering 3707/3707 (removed 0) transitions.
// Phase 1: matrix 3707 rows 1940 cols
[2024-06-07 15:56:08] [INFO ] Computed 87 invariants in 41 ms
[2024-06-07 15:56:08] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-06-07 15:56:08] [INFO ] Invariant cache hit.
[2024-06-07 15:56:10] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-07 15:56:10] [INFO ] Implicit Places using invariants and state equation in 1479 ms returned []
Implicit Place search using SMT with State Equation took 1773 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 1940/1979 places, 3707/3785 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 94406 ms. Remains : 1940/1979 places, 3707/3785 transitions.
Interrupted Random walk after 815508 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=27 )
Interrupted Random directed walk after 1174491 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=39 )
[2024-06-07 15:57:10] [INFO ] Invariant cache hit.
[2024-06-07 15:57:11] [INFO ] [Real]Absence check using 87 positive place invariants in 600 ms returned sat
[2024-06-07 15:57:23] [INFO ] [Real]Absence check using state equation in 11722 ms returned sat
[2024-06-07 15:57:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-07 15:57:24] [INFO ] [Nat]Absence check using 87 positive place invariants in 478 ms returned sat
[2024-06-07 15:57:43] [INFO ] [Nat]Absence check using state equation in 18782 ms returned sat
[2024-06-07 15:57:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-07 15:57:43] [INFO ] [Nat]Added 9 Read/Feed constraints in 54 ms returned sat
[2024-06-07 15:57:45] [INFO ] Deduced a trap composed of 86 places in 1678 ms of which 99 ms to minimize.
[2024-06-07 15:57:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 2205 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 1979/1979 places, 3785/3785 transitions.
Applied a total of 0 rules in 32 ms. Remains 1979 /1979 variables (removed 0) and now considering 3785/3785 (removed 0) transitions.
// Phase 1: matrix 3785 rows 1979 cols
[2024-06-07 15:57:46] [INFO ] Computed 87 invariants in 26 ms
[2024-06-07 15:57:47] [INFO ] Implicit Places using invariants in 1565 ms returned []
[2024-06-07 15:57:47] [INFO ] Invariant cache hit.
[2024-06-07 15:57:49] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-07 15:57:52] [INFO ] Implicit Places using invariants and state equation in 4659 ms returned []
Implicit Place search using SMT with State Equation took 6225 ms to find 0 implicit places.
Running 3779 sub problems to find dead transitions.
[2024-06-07 15:57:52] [INFO ] Invariant cache hit.
[2024-06-07 15:57:52] [INFO ] State equation strengthened by 75 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2302 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2728 is UNSAT
Problem TDEAD2792 is UNSAT
Problem TDEAD2854 is UNSAT
Problem TDEAD2972 is UNSAT
Problem TDEAD3028 is UNSAT
Problem TDEAD3082 is UNSAT
Problem TDEAD3134 is UNSAT
Problem TDEAD3184 is UNSAT
Problem TDEAD3232 is UNSAT
Problem TDEAD3278 is UNSAT
Problem TDEAD3322 is UNSAT
Problem TDEAD3404 is UNSAT
Problem TDEAD3442 is UNSAT
Problem TDEAD3478 is UNSAT
Problem TDEAD3512 is UNSAT
Problem TDEAD3544 is UNSAT
Problem TDEAD3574 is UNSAT
Problem TDEAD3602 is UNSAT
Problem TDEAD3628 is UNSAT
Problem TDEAD3674 is UNSAT
Problem TDEAD3694 is UNSAT
Problem TDEAD3712 is UNSAT
Problem TDEAD3728 is UNSAT
Problem TDEAD3742 is UNSAT
Problem TDEAD3754 is UNSAT
Problem TDEAD3764 is UNSAT
Problem TDEAD3772 is UNSAT
Problem TDEAD3778 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1973 variables, 77/77 constraints. Problems are: Problem set: 78 solved, 3701 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1973/5764 variables, and 77 constraints, problems are : Problem set: 78 solved, 3701 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 77/87 constraints, State Equation: 0/1979 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 3740/1893 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 3701 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1934 variables, 5/5 constraints. Problems are: Problem set: 78 solved, 3701 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1934/5764 variables, and 5 constraints, problems are : Problem set: 78 solved, 3701 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 5/87 constraints, State Equation: 0/1979 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1847/1893 constraints, Known Traps: 0/0 constraints]
After SMT, in 89287ms problems are : Problem set: 78 solved, 3701 unsolved
Search for dead transitions found 78 dead transitions in 89335ms
Found 78 dead transitions using SMT.
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 287236 ms.
ITS solved all properties within timeout

BK_STOP 1717775961691

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="BlocksWorld-PT-08"
export BK_EXAMINATION="Liveness"
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 BlocksWorld-PT-08, 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 r616-tall-171774433000139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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