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.r176-tajo-158987872300759.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 QuasiCertifProtocol-COL-22, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872300759
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 3.4K Apr 12 06:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 06:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 07:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 07:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 10 13:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 10 13:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 20:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 9 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 104K 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 QuasiCertifProtocol-COL-22-ReachabilityFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591180327967

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:32:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 10:32:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:32:11] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 10:32:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1118 ms
[2020-06-03 10:32:12] [INFO ] sort/places :
tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,

[2020-06-03 10:32:12] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 33 ms.
[2020-06-03 10:32:12] [INFO ] Computed order based on color domains.
[2020-06-03 10:32:13] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions in 73 ms.
[2020-06-03 10:32:13] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 123 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 372 resets, run finished after 353 ms. (steps per millisecond=28 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0]
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 80 ms. (steps per millisecond=125 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 58 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 247 ms. (steps per millisecond=40 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 134 ms. (steps per millisecond=74 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 169 ms. (steps per millisecond=59 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 120 ms. (steps per millisecond=83 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 125 ms. (steps per millisecond=80 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 356 rows 1966 cols
[2020-06-03 10:32:14] [INFO ] Computed 1611 place invariants in 71 ms
[2020-06-03 10:32:15] [INFO ] [Real]Absence check using 4 positive place invariants in 55 ms returned sat
[2020-06-03 10:32:17] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 2246 ms returned sat
[2020-06-03 10:32:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:32:19] [INFO ] [Real]Absence check using state equation in 2011 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 10:32:19] [INFO ] [Real]Absence check using 4 positive place invariants in 24 ms returned unsat
[2020-06-03 10:32:20] [INFO ] [Real]Absence check using 4 positive place invariants in 24 ms returned sat
[2020-06-03 10:32:21] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1751 ms returned sat
[2020-06-03 10:32:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:32:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:32:24] [INFO ] [Real]Absence check using state equation in 3046 ms returned unknown
[2020-06-03 10:32:25] [INFO ] [Real]Absence check using 4 positive place invariants in 19 ms returned sat
[2020-06-03 10:32:26] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1720 ms returned sat
[2020-06-03 10:32:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:32:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:32:29] [INFO ] [Real]Absence check using state equation in 3145 ms returned (error "Failed to check-sat")
[2020-06-03 10:32:30] [INFO ] [Real]Absence check using 4 positive place invariants in 26 ms returned sat
[2020-06-03 10:32:32] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 2451 ms returned sat
[2020-06-03 10:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:32:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:32:34] [INFO ] [Real]Absence check using state equation in 2284 ms returned (error "Failed to check-sat")
[2020-06-03 10:32:35] [INFO ] [Real]Absence check using 4 positive place invariants in 25 ms returned sat
[2020-06-03 10:32:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:32:39] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 4790 ms returned unknown
[2020-06-03 10:32:40] [INFO ] [Real]Absence check using 4 positive place invariants in 26 ms returned sat
[2020-06-03 10:32:43] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 3347 ms returned sat
[2020-06-03 10:32:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:32:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:32:45] [INFO ] [Real]Absence check using state equation in 1399 ms returned (error "Failed to check-sat")
[2020-06-03 10:32:45] [INFO ] [Real]Absence check using 4 positive place invariants in 19 ms returned sat
[2020-06-03 10:32:47] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 2374 ms returned sat
[2020-06-03 10:32:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:32:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:32:50] [INFO ] [Real]Absence check using state equation in 2432 ms returned (error "Failed to check-sat")
[2020-06-03 10:32:50] [INFO ] [Real]Absence check using 4 positive place invariants in 23 ms returned sat
[2020-06-03 10:32:53] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 2841 ms returned sat
[2020-06-03 10:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:32:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:32:55] [INFO ] [Real]Absence check using state equation in 1964 ms returned (error "Failed to check-sat")
[2020-06-03 10:32:55] [INFO ] [Real]Absence check using 4 positive place invariants in 24 ms returned sat
[2020-06-03 10:32:57] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 2658 ms returned sat
[2020-06-03 10:32:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:33:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:33:00] [INFO ] [Real]Absence check using state equation in 2184 ms returned (error "Failed to check-sat")
[2020-06-03 10:33:00] [INFO ] [Real]Absence check using 4 positive place invariants in 34 ms returned sat
[2020-06-03 10:33:02] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1782 ms returned sat
[2020-06-03 10:33:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:33:05] [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: Stream closed (= s1125 (- t283 t206))") while checking expression at index 10
[2020-06-03 10:33:05] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned unsat
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 788 out of 1966 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1966/1966 places, 356/356 transitions.
Discarding 50 places :
Also discarding 0 output transitions
Graph (complete) has 16044 edges and 1966 vertex of which 1916 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.23 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1916 transition count 355
Applied a total of 2 rules in 249 ms. Remains 1916 /1966 variables (removed 50) and now considering 355/356 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1916/1966 places, 355/356 transitions.
Incomplete random walk after 1000000 steps, including 37156 resets, run finished after 10536 ms. (steps per millisecond=94 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 876 resets, run finished after 2621 ms. (steps per millisecond=381 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2233 resets, run finished after 1261 ms. (steps per millisecond=793 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2233 resets, run finished after 1692 ms. (steps per millisecond=591 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1785 resets, run finished after 2127 ms. (steps per millisecond=470 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 319547 steps, including 983 resets, run timeout after 5001 ms. (steps per millisecond=63 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 376383 steps, including 837 resets, run timeout after 5001 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1782 resets, run finished after 2100 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 302124 steps, including 524 resets, run timeout after 5001 ms. (steps per millisecond=60 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 438403 steps, including 785 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2206 resets, run finished after 1225 ms. (steps per millisecond=816 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 13076248 steps, run timeout after 30001 ms. (steps per millisecond=435 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 0, 0, 1]
Probabilistic random walk after 13076248 steps, saw 1393438 distinct states, run finished after 30001 ms. (steps per millisecond=435 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 0, 0, 1]
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 355 rows 1916 cols
[2020-06-03 10:34:17] [INFO ] Computed 1563 place invariants in 94 ms
[2020-06-03 10:34:19] [INFO ] [Real]Absence check using 0 positive and 1563 generalized place invariants in 2117 ms returned sat
[2020-06-03 10:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:34:25] [INFO ] [Real]Absence check using state equation in 6047 ms returned unsat
[2020-06-03 10:34:27] [INFO ] [Real]Absence check using 0 positive and 1563 generalized place invariants in 1986 ms returned sat
[2020-06-03 10:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:34:33] [INFO ] [Real]Absence check using state equation in 5888 ms returned unsat
[2020-06-03 10:34:35] [INFO ] [Real]Absence check using 0 positive and 1563 generalized place invariants in 1817 ms returned sat
[2020-06-03 10:34:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:34:41] [INFO ] [Real]Absence check using state equation in 5535 ms returned unsat
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

--------------------
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="QuasiCertifProtocol-COL-22"
export BK_EXAMINATION="ReachabilityFireability"
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 QuasiCertifProtocol-COL-22, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987872300759"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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