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-158987872300758.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872300758
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-22-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591180248825

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:30:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 10:30:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:30:50] [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:30:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 541 ms
[2020-06-03 10:30:51] [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:30:51] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 20 ms.
[2020-06-03 10:30:51] [INFO ] Computed order based on color domains.
[2020-06-03 10:30:51] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions in 29 ms.
[2020-06-03 10:30:51] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 56 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 373 resets, run finished after 474 ms. (steps per millisecond=21 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0]
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 130 ms. (steps per millisecond=76 ) properties seen :[0, 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 282 ms. (steps per millisecond=35 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 115 ms. (steps per millisecond=86 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 132 ms. (steps per millisecond=75 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 100 ms. (steps per millisecond=100 ) properties seen :[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 84 ms. (steps per millisecond=119 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 98 ms. (steps per millisecond=102 ) properties seen :[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 34 ms. (steps per millisecond=294 ) properties seen :[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 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 356 rows 1966 cols
[2020-06-03 10:30:52] [INFO ] Computed 1611 place invariants in 86 ms
[2020-06-03 10:30:53] [INFO ] [Real]Absence check using 4 positive place invariants in 52 ms returned sat
[2020-06-03 10:30:55] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 2033 ms returned sat
[2020-06-03 10:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:30:57] [INFO ] [Real]Absence check using state equation in 2637 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 10:30:58] [INFO ] [Real]Absence check using 4 positive place invariants in 30 ms returned sat
[2020-06-03 10:31:00] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 2284 ms returned sat
[2020-06-03 10:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:31:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:31:02] [INFO ] [Real]Absence check using state equation in 2484 ms returned (error "Failed to check-sat")
[2020-06-03 10:31:03] [INFO ] [Real]Absence check using 4 positive place invariants in 27 ms returned sat
[2020-06-03 10:31:05] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1998 ms returned sat
[2020-06-03 10:31:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:31:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:31:07] [INFO ] [Real]Absence check using state equation in 2785 ms returned (error "Failed to check-sat")
[2020-06-03 10:31:08] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2020-06-03 10:31:09] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1860 ms returned sat
[2020-06-03 10:31:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:31:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:31:12] [INFO ] [Real]Absence check using state equation in 2914 ms returned (error "Failed to check-sat")
[2020-06-03 10:31:13] [INFO ] [Real]Absence check using 4 positive place invariants in 19 ms returned sat
[2020-06-03 10:31:14] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1805 ms returned sat
[2020-06-03 10:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:31:17] [INFO ] [Real]Absence check using state equation in 2969 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 10:31:18] [INFO ] [Real]Absence check using 4 positive place invariants in 61 ms returned sat
[2020-06-03 10:31:20] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 2008 ms returned sat
[2020-06-03 10:31:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:31:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:31:22] [INFO ] [Real]Absence check using state equation in 2681 ms returned (error "Failed to check-sat")
[2020-06-03 10:31:23] [INFO ] [Real]Absence check using 4 positive place invariants in 18 ms returned unsat
[2020-06-03 10:31:23] [INFO ] [Real]Absence check using 4 positive place invariants in 30 ms returned sat
[2020-06-03 10:31:25] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1916 ms returned sat
[2020-06-03 10:31:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:31:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:31:28] [INFO ] [Real]Absence check using state equation in 2915 ms returned (error "Failed to check-sat")
[2020-06-03 10:31:28] [INFO ] [Real]Absence check using 4 positive place invariants in 28 ms returned sat
[2020-06-03 10:31:30] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 2169 ms returned sat
[2020-06-03 10:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:31:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:31:33] [INFO ] [Real]Absence check using state equation in 2614 ms returned (error "Failed to check-sat")
[2020-06-03 10:31:33] [INFO ] [Real]Absence check using 4 positive place invariants in 19 ms returned sat
[2020-06-03 10:31:35] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1904 ms returned sat
[2020-06-03 10:31:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:31:38] [INFO ] [Real]Absence check using state equation in 2881 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 10:31:38] [INFO ] [Real]Absence check using 4 positive place invariants in 26 ms returned sat
[2020-06-03 10:31:40] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 1913 ms returned sat
[2020-06-03 10:31:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:31:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:31:43] [INFO ] [Real]Absence check using state equation in 2826 ms returned (error "Failed to check-sat")
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 1389 out of 1966 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1966/1966 places, 356/356 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1966 transition count 356
Applied a total of 1 rules in 187 ms. Remains 1966 /1966 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1966/1966 places, 356/356 transitions.
Incomplete random walk after 1000000 steps, including 37135 resets, run finished after 28279 ms. (steps per millisecond=35 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 476220 steps, including 1228 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 257136 steps, including 221 resets, run timeout after 5001 ms. (steps per millisecond=51 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2218 resets, run finished after 3548 ms. (steps per millisecond=281 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 558672 steps, including 1222 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2249 resets, run finished after 3364 ms. (steps per millisecond=297 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 534473 steps, including 1203 resets, run timeout after 5001 ms. (steps per millisecond=106 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 985291 steps, including 1239 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 494318 steps, including 1224 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2201 resets, run finished after 2995 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2236 resets, run finished after 2780 ms. (steps per millisecond=359 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 11586017 steps, run timeout after 30001 ms. (steps per millisecond=386 ) properties seen :[0, 1, 1, 1, 0, 1, 1, 0, 1, 1]
Probabilistic random walk after 11586017 steps, saw 1220924 distinct states, run finished after 30002 ms. (steps per millisecond=386 ) properties seen :[0, 1, 1, 1, 0, 1, 1, 0, 1, 1]
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 356 rows 1966 cols
[2020-06-03 10:33:24] [INFO ] Computed 1611 place invariants in 32 ms
[2020-06-03 10:33:24] [INFO ] [Real]Absence check using 4 positive place invariants in 33 ms returned sat
[2020-06-03 10:33:26] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 2000 ms returned sat
[2020-06-03 10:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:33:34] [INFO ] [Real]Absence check using state equation in 8045 ms returned sat
[2020-06-03 10:33:34] [INFO ] Computed and/alt/rep : 332/2034/332 causal constraints in 32 ms.
[2020-06-03 10:33:37] [INFO ] Added : 155 causal constraints over 31 iterations in 2959 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 42 ms.
[2020-06-03 10:33:38] [INFO ] [Real]Absence check using 4 positive place invariants in 25 ms returned sat
[2020-06-03 10:33:40] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 2116 ms returned sat
[2020-06-03 10:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:33:45] [INFO ] [Real]Absence check using state equation in 5553 ms returned unsat
[2020-06-03 10:33:46] [INFO ] [Real]Absence check using 4 positive place invariants in 20 ms returned sat
[2020-06-03 10:33:48] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 2305 ms returned sat
[2020-06-03 10:33:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:33:55] [INFO ] [Real]Absence check using state equation in 6904 ms returned sat
[2020-06-03 10:33:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:33:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 36 ms returned sat
[2020-06-03 10:33:57] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 1921 ms returned sat
[2020-06-03 10:33:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:34:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:34:10] [INFO ] [Nat]Absence check using state equation in 12522 ms returned unsat
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Finished Parikh walk after 157 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=52 )
FORMULA QuasiCertifProtocol-COL-22-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-158987872300758"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;