fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033477400386
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldIIPt-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.020 3600000.00 3657770.00 1270.10 ?T?T?T?F?FFF?FFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477400386.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldIIPt-PT-100B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477400386
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 3.0K May 14 01:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 01:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 18:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 18:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 13:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 08:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 08:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 1.7M May 12 20: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

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-100B-00
FORMULA_NAME ShieldIIPt-PT-100B-01
FORMULA_NAME ShieldIIPt-PT-100B-02
FORMULA_NAME ShieldIIPt-PT-100B-03
FORMULA_NAME ShieldIIPt-PT-100B-04
FORMULA_NAME ShieldIIPt-PT-100B-05
FORMULA_NAME ShieldIIPt-PT-100B-06
FORMULA_NAME ShieldIIPt-PT-100B-07
FORMULA_NAME ShieldIIPt-PT-100B-08
FORMULA_NAME ShieldIIPt-PT-100B-09
FORMULA_NAME ShieldIIPt-PT-100B-10
FORMULA_NAME ShieldIIPt-PT-100B-11
FORMULA_NAME ShieldIIPt-PT-100B-12
FORMULA_NAME ShieldIIPt-PT-100B-13
FORMULA_NAME ShieldIIPt-PT-100B-14
FORMULA_NAME ShieldIIPt-PT-100B-15

=== Now, execution of the tool begins

BK_START 1591303183495

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 20:39:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 20:39:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 20:39:45] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2020-06-04 20:39:45] [INFO ] Transformed 7003 places.
[2020-06-04 20:39:45] [INFO ] Transformed 6503 transitions.
[2020-06-04 20:39:45] [INFO ] Found NUPN structural information;
[2020-06-04 20:39:45] [INFO ] Parsed PT model containing 7003 places and 6503 transitions in 554 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 269 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1731 ms. (steps per millisecond=57 ) properties seen :[0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0]
// Phase 1: matrix 6503 rows 7003 cols
[2020-06-04 20:39:47] [INFO ] Computed 901 place invariants in 162 ms
[2020-06-04 20:39:53] [INFO ] [Real]Absence check using 901 positive place invariants in 3502 ms returned sat
[2020-06-04 20:39:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:40:08] [INFO ] [Real]Absence check using state equation in 14678 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 20:40:12] [INFO ] [Real]Absence check using 901 positive place invariants in 3277 ms returned sat
[2020-06-04 20:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:40:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:40:28] [INFO ] [Real]Absence check using state equation in 15767 ms returned (error "Failed to check-sat")
[2020-06-04 20:40:31] [INFO ] [Real]Absence check using 901 positive place invariants in 2683 ms returned sat
[2020-06-04 20:40:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:40:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:40:48] [INFO ] [Real]Absence check using state equation in 16391 ms returned (error "Failed to check-sat")
[2020-06-04 20:40:52] [INFO ] [Real]Absence check using 901 positive place invariants in 3089 ms returned sat
[2020-06-04 20:40:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:41:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:41:08] [INFO ] [Real]Absence check using state equation in 16001 ms returned (error "Failed to check-sat")
[2020-06-04 20:41:12] [INFO ] [Real]Absence check using 901 positive place invariants in 3103 ms returned sat
[2020-06-04 20:41:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:41:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:41:28] [INFO ] [Real]Absence check using state equation in 15865 ms returned (error "Failed to check-sat")
[2020-06-04 20:41:32] [INFO ] [Real]Absence check using 901 positive place invariants in 2749 ms returned sat
[2020-06-04 20:41:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:41:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:41:48] [INFO ] [Real]Absence check using state equation in 16189 ms returned (error "Failed to check-sat")
[2020-06-04 20:41:52] [INFO ] [Real]Absence check using 901 positive place invariants in 2731 ms returned sat
[2020-06-04 20:41:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:42:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:42:08] [INFO ] [Real]Absence check using state equation in 16237 ms returned (error "Failed to check-sat")
[2020-06-04 20:42:12] [INFO ] [Real]Absence check using 901 positive place invariants in 2836 ms returned sat
[2020-06-04 20:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:42:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:42:28] [INFO ] [Real]Absence check using state equation in 16182 ms returned (error "Failed to check-sat")
[2020-06-04 20:42:32] [INFO ] [Real]Absence check using 901 positive place invariants in 2785 ms returned sat
[2020-06-04 20:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:42:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:42:48] [INFO ] [Real]Absence check using state equation in 16200 ms returned (error "Failed to check-sat")
[2020-06-04 20:42:51] [INFO ] [Real]Absence check using 901 positive place invariants in 2647 ms returned sat
[2020-06-04 20:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:43:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:43:08] [INFO ] [Real]Absence check using state equation in 16425 ms returned (error "Failed to check-sat")
[2020-06-04 20:43:12] [INFO ] [Real]Absence check using 901 positive place invariants in 2991 ms returned sat
[2020-06-04 20:43:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:43:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:43:28] [INFO ] [Real]Absence check using state equation in 15950 ms returned unknown
[2020-06-04 20:43:31] [INFO ] [Real]Absence check using 901 positive place invariants in 2713 ms returned sat
[2020-06-04 20:43:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:43:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:43:48] [INFO ] [Real]Absence check using state equation in 16475 ms returned (error "Failed to check-sat")
[2020-06-04 20:43:52] [INFO ] [Real]Absence check using 901 positive place invariants in 2946 ms returned sat
[2020-06-04 20:43:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:44:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:44:08] [INFO ] [Real]Absence check using state equation in 16119 ms returned (error "Failed to check-sat")
[2020-06-04 20:44:11] [INFO ] [Real]Absence check using 901 positive place invariants in 2661 ms returned sat
[2020-06-04 20:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:44:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:44:28] [INFO ] [Real]Absence check using state equation in 16399 ms returned (error "Failed to check-sat")
[2020-06-04 20:44:32] [INFO ] [Real]Absence check using 901 positive place invariants in 2973 ms returned sat
[2020-06-04 20:44:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:44:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:44:48] [INFO ] [Real]Absence check using state equation in 16092 ms returned unknown
[2020-06-04 20:44:49] [INFO ] [Real]Absence check using 901 positive place invariants in 60 ms returned unsat
[2020-06-04 20:44:52] [INFO ] [Real]Absence check using 901 positive place invariants in 2722 ms returned sat
[2020-06-04 20:44:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:45:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:45:09] [INFO ] [Real]Absence check using state equation in 16434 ms returned (error "Failed to check-sat")
[2020-06-04 20:45:14] [INFO ] [Real]Absence check using 901 positive place invariants in 3932 ms returned sat
[2020-06-04 20:45:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:45:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:45:29] [INFO ] [Real]Absence check using state equation in 15058 ms returned unknown
[2020-06-04 20:45:33] [INFO ] [Real]Absence check using 901 positive place invariants in 2826 ms returned sat
[2020-06-04 20:45:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:45:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:45:49] [INFO ] [Real]Absence check using state equation in 16311 ms returned (error "Failed to check-sat")
[2020-06-04 20:45:52] [INFO ] [Real]Absence check using 901 positive place invariants in 2722 ms returned sat
[2020-06-04 20:45:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:46:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:46:09] [INFO ] [Real]Absence check using state equation in 16448 ms returned (error "Failed to check-sat")
[2020-06-04 20:46:13] [INFO ] [Real]Absence check using 901 positive place invariants in 3182 ms returned sat
[2020-06-04 20:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:46:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:46:29] [INFO ] [Real]Absence check using state equation in 15748 ms returned (error "Failed to check-sat")
[2020-06-04 20:46:33] [INFO ] [Real]Absence check using 901 positive place invariants in 3147 ms returned sat
[2020-06-04 20:46:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:46:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:46:49] [INFO ] [Real]Absence check using state equation in 16043 ms returned (error "Failed to check-sat")
[2020-06-04 20:46:53] [INFO ] [Real]Absence check using 901 positive place invariants in 3549 ms returned sat
[2020-06-04 20:46:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:47:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:47:09] [INFO ] [Real]Absence check using state equation in 15689 ms returned (error "Failed to check-sat")
[2020-06-04 20:47:13] [INFO ] [Real]Absence check using 901 positive place invariants in 3120 ms returned sat
[2020-06-04 20:47:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:47:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:47:29] [INFO ] [Real]Absence check using state equation in 16035 ms returned (error "Failed to check-sat")
[2020-06-04 20:47:33] [INFO ] [Real]Absence check using 901 positive place invariants in 3636 ms returned sat
[2020-06-04 20:47:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:47:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 20:47:49] [INFO ] [Real]Absence check using state equation in 15576 ms returned (error "Failed to check-sat")
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-04 20:47:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 20:47:50] [INFO ] Flatten gal took : 473 ms
FORMULA ShieldIIPt-PT-100B-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 20:47:50] [INFO ] Applying decomposition
[2020-06-04 20:47:50] [INFO ] Flatten gal took : 249 ms
[2020-06-04 20:47:50] [INFO ] Decomposing Gal with order
[2020-06-04 20:47:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 20:47:54] [INFO ] Flatten gal took : 262 ms
[2020-06-04 20:47:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 53 ms.
[2020-06-04 20:47:56] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 14 ms.
[2020-06-04 20:47:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 124 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldIIPt-PT-100B @ 3570 seconds

FORMULA ShieldIIPt-PT-100B-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-100B-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 10879556 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16137544 kB

--------------------
content from stderr:

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="ShieldIIPt-PT-100B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is ShieldIIPt-PT-100B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033477400386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100B.tgz
mv ShieldIIPt-PT-100B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;