Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853400554.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Parking-PT-864, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853400554
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 3.1K Apr 12 00:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 00:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 10 23:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 10 23:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 08:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 08:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 9 12:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 9 12:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 427K Mar 24 05:37 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 Parking-PT-864-00
FORMULA_NAME Parking-PT-864-01
FORMULA_NAME Parking-PT-864-02
FORMULA_NAME Parking-PT-864-03
FORMULA_NAME Parking-PT-864-04
FORMULA_NAME Parking-PT-864-05
FORMULA_NAME Parking-PT-864-06
FORMULA_NAME Parking-PT-864-07
FORMULA_NAME Parking-PT-864-08
FORMULA_NAME Parking-PT-864-09
FORMULA_NAME Parking-PT-864-10
FORMULA_NAME Parking-PT-864-11
FORMULA_NAME Parking-PT-864-12
FORMULA_NAME Parking-PT-864-13
FORMULA_NAME Parking-PT-864-14
FORMULA_NAME Parking-PT-864-15

=== Now, execution of the tool begins

BK_START 1591154488576

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:21:30] [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-03 03:21:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:21:30] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2020-06-03 03:21:30] [INFO ] Transformed 1185 places.
[2020-06-03 03:21:30] [INFO ] Transformed 1697 transitions.
[2020-06-03 03:21:30] [INFO ] Found NUPN structural information;
[2020-06-03 03:21:30] [INFO ] Parsed PT model containing 1185 places and 1697 transitions in 285 ms.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 67 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 385 resets, run finished after 1356 ms. (steps per millisecond=73 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1]
// Phase 1: matrix 1009 rows 1185 cols
[2020-06-03 03:21:32] [INFO ] Computed 280 place invariants in 65 ms
[2020-06-03 03:21:33] [INFO ] [Real]Absence check using 272 positive place invariants in 365 ms returned sat
[2020-06-03 03:21:33] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 11 ms returned sat
[2020-06-03 03:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:21:36] [INFO ] [Real]Absence check using state equation in 3015 ms returned sat
[2020-06-03 03:21:36] [INFO ] State equation strengthened by 248 read => feed constraints.
[2020-06-03 03:21:36] [INFO ] [Real]Added 248 Read/Feed constraints in 69 ms returned sat
[2020-06-03 03:21:36] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 67 ms.
[2020-06-03 03:21:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:21:37] [INFO ] [Nat]Absence check using 272 positive place invariants in 262 ms returned sat
[2020-06-03 03:21:37] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2020-06-03 03:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:21:40] [INFO ] [Nat]Absence check using state equation in 2818 ms returned sat
[2020-06-03 03:21:40] [INFO ] [Nat]Added 248 Read/Feed constraints in 52 ms returned sat
[2020-06-03 03:21:40] [INFO ] Deduced a trap composed of 60 places in 137 ms
[2020-06-03 03:21:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2020-06-03 03:21:41] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 119 ms.
[2020-06-03 03:21:57] [INFO ] Added : 815 causal constraints over 163 iterations in 16147 ms. Result :(error "Failed to check-sat")
[2020-06-03 03:21:57] [INFO ] [Real]Absence check using 272 positive place invariants in 204 ms returned sat
[2020-06-03 03:21:57] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 6 ms returned sat
[2020-06-03 03:21:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:22:00] [INFO ] [Real]Absence check using state equation in 2892 ms returned sat
[2020-06-03 03:22:00] [INFO ] [Real]Added 248 Read/Feed constraints in 41 ms returned sat
[2020-06-03 03:22:00] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 55 ms.
[2020-06-03 03:22:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:22:01] [INFO ] [Nat]Absence check using 272 positive place invariants in 205 ms returned sat
[2020-06-03 03:22:01] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 11 ms returned sat
[2020-06-03 03:22:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:22:03] [INFO ] [Nat]Absence check using state equation in 2781 ms returned sat
[2020-06-03 03:22:03] [INFO ] [Nat]Added 248 Read/Feed constraints in 44 ms returned sat
[2020-06-03 03:22:04] [INFO ] Deduced a trap composed of 60 places in 147 ms
[2020-06-03 03:22:04] [INFO ] Deduced a trap composed of 68 places in 91 ms
[2020-06-03 03:22:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2020-06-03 03:22:04] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 105 ms.
[2020-06-03 03:22:20] [INFO ] Added : 705 causal constraints over 141 iterations in 16400 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 03:22:21] [INFO ] [Real]Absence check using 272 positive place invariants in 217 ms returned sat
[2020-06-03 03:22:21] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 25 ms returned sat
[2020-06-03 03:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:22:24] [INFO ] [Real]Absence check using state equation in 2803 ms returned sat
[2020-06-03 03:22:24] [INFO ] [Real]Added 248 Read/Feed constraints in 45 ms returned sat
[2020-06-03 03:22:24] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 54 ms.
[2020-06-03 03:22:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:22:24] [INFO ] [Nat]Absence check using 272 positive place invariants in 197 ms returned sat
[2020-06-03 03:22:24] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 15 ms returned sat
[2020-06-03 03:22:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:22:27] [INFO ] [Nat]Absence check using state equation in 2727 ms returned sat
[2020-06-03 03:22:27] [INFO ] [Nat]Added 248 Read/Feed constraints in 42 ms returned sat
[2020-06-03 03:22:27] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 76 ms.
[2020-06-03 03:22:44] [INFO ] Added : 775 causal constraints over 155 iterations in 16806 ms. Result :unknown
[2020-06-03 03:22:44] [INFO ] [Real]Absence check using 272 positive place invariants in 211 ms returned sat
[2020-06-03 03:22:44] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2020-06-03 03:22:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:22:47] [INFO ] [Real]Absence check using state equation in 3105 ms returned sat
[2020-06-03 03:22:48] [INFO ] [Real]Added 248 Read/Feed constraints in 32 ms returned sat
[2020-06-03 03:22:48] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 46 ms.
[2020-06-03 03:22:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:22:48] [INFO ] [Nat]Absence check using 272 positive place invariants in 218 ms returned sat
[2020-06-03 03:22:48] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 10 ms returned sat
[2020-06-03 03:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:22:51] [INFO ] [Nat]Absence check using state equation in 2856 ms returned sat
[2020-06-03 03:22:51] [INFO ] [Nat]Added 248 Read/Feed constraints in 65 ms returned sat
[2020-06-03 03:22:51] [INFO ] Deduced a trap composed of 68 places in 75 ms
[2020-06-03 03:22:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2020-06-03 03:22:51] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 67 ms.
[2020-06-03 03:23:08] [INFO ] Added : 755 causal constraints over 151 iterations in 16532 ms. Result :unknown
[2020-06-03 03:23:08] [INFO ] [Real]Absence check using 272 positive place invariants in 217 ms returned sat
[2020-06-03 03:23:08] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2020-06-03 03:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:23:11] [INFO ] [Real]Absence check using state equation in 2661 ms returned sat
[2020-06-03 03:23:11] [INFO ] [Real]Added 248 Read/Feed constraints in 46 ms returned sat
[2020-06-03 03:23:11] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 109 ms.
[2020-06-03 03:23:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:23:12] [INFO ] [Nat]Absence check using 272 positive place invariants in 213 ms returned sat
[2020-06-03 03:23:12] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 13 ms returned sat
[2020-06-03 03:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:23:14] [INFO ] [Nat]Absence check using state equation in 2626 ms returned sat
[2020-06-03 03:23:14] [INFO ] [Nat]Added 248 Read/Feed constraints in 62 ms returned sat
[2020-06-03 03:23:14] [INFO ] Deduced a trap composed of 68 places in 75 ms
[2020-06-03 03:23:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2020-06-03 03:23:15] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 73 ms.
[2020-06-03 03:23:31] [INFO ] Added : 700 causal constraints over 140 iterations in 16771 ms. Result :unknown
[2020-06-03 03:23:32] [INFO ] [Real]Absence check using 272 positive place invariants in 222 ms returned sat
[2020-06-03 03:23:32] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 13 ms returned sat
[2020-06-03 03:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:23:34] [INFO ] [Real]Absence check using state equation in 2681 ms returned sat
[2020-06-03 03:23:34] [INFO ] [Real]Added 248 Read/Feed constraints in 44 ms returned sat
[2020-06-03 03:23:35] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 71 ms.
[2020-06-03 03:23:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:23:35] [INFO ] [Nat]Absence check using 272 positive place invariants in 260 ms returned sat
[2020-06-03 03:23:35] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2020-06-03 03:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:23:38] [INFO ] [Nat]Absence check using state equation in 2788 ms returned sat
[2020-06-03 03:23:38] [INFO ] [Nat]Added 248 Read/Feed constraints in 48 ms returned sat
[2020-06-03 03:23:38] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 67 ms.
[2020-06-03 03:23:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t865 0) (and (or (and (> t0 0) (< o0 o865)) (and (> t881 0) (< o881 o865))) (and (> t428 0) (< o428 o865))))") while checking expression at index 5
[2020-06-03 03:23:55] [INFO ] [Real]Absence check using 272 positive place invariants in 224 ms returned sat
[2020-06-03 03:23:55] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2020-06-03 03:23:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:23:58] [INFO ] [Real]Absence check using state equation in 2708 ms returned sat
[2020-06-03 03:23:58] [INFO ] [Real]Added 248 Read/Feed constraints in 46 ms returned sat
[2020-06-03 03:23:58] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 57 ms.
[2020-06-03 03:23:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:23:59] [INFO ] [Nat]Absence check using 272 positive place invariants in 212 ms returned sat
[2020-06-03 03:23:59] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2020-06-03 03:23:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:24:02] [INFO ] [Nat]Absence check using state equation in 2867 ms returned sat
[2020-06-03 03:24:02] [INFO ] [Nat]Added 248 Read/Feed constraints in 64 ms returned sat
[2020-06-03 03:24:02] [INFO ] Deduced a trap composed of 60 places in 66 ms
[2020-06-03 03:24:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2020-06-03 03:24:02] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 74 ms.
[2020-06-03 03:24:18] [INFO ] Added : 795 causal constraints over 159 iterations in 16538 ms. Result :unknown
[2020-06-03 03:24:19] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 03:24:19] [INFO ] Flatten gal took : 215 ms
FORMULA Parking-PT-864-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 03:24:19] [INFO ] Applying decomposition
[2020-06-03 03:24:19] [INFO ] Flatten gal took : 109 ms
[2020-06-03 03:24:19] [INFO ] Decomposing Gal with order
[2020-06-03 03:24:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 03:24:19] [INFO ] Removed a total of 256 redundant transitions.
[2020-06-03 03:24:20] [INFO ] Flatten gal took : 289 ms
[2020-06-03 03:24:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 63 ms.
[2020-06-03 03:24:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2020-06-03 03:24:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 29 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Parking-PT-864 @ 3570 seconds

FORMULA Parking-PT-864-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Parking-PT-864-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Parking-PT-864-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Parking-PT-864-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: 16427332 kB
MemFree: 12985744 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16142036 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="Parking-PT-864"
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 Parking-PT-864, 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 r174-csrt-158987853400554"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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