Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................................................................................................
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 6.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 68K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DrinkVendingMachine-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649937100367
=====================================================================

--------------------
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 DrinkVendingMachine-PT-02-CTLCardinality-00
FORMULA_NAME DrinkVendingMachine-PT-02-CTLCardinality-01
FORMULA_NAME DrinkVendingMachine-PT-02-CTLCardinality-02
FORMULA_NAME DrinkVendingMachine-PT-02-CTLCardinality-03
FORMULA_NAME DrinkVendingMachine-PT-02-CTLCardinality-04
FORMULA_NAME DrinkVendingMachine-PT-02-CTLCardinality-05
FORMULA_NAME DrinkVendingMachine-PT-02-CTLCardinality-06
FORMULA_NAME DrinkVendingMachine-PT-02-CTLCardinality-07
FORMULA_NAME DrinkVendingMachine-PT-02-CTLCardinality-08
FORMULA_NAME DrinkVendingMachine-PT-02-CTLCardinality-09
FORMULA_NAME DrinkVendingMachine-PT-02-CTLCardinality-10
FORMULA_NAME DrinkVendingMachine-PT-02-CTLCardinality-11
FORMULA_NAME DrinkVendingMachine-PT-02-CTLCardinality-12
FORMULA_NAME DrinkVendingMachine-PT-02-CTLCardinality-13
FORMULA_NAME DrinkVendingMachine-PT-02-CTLCardinality-14
FORMULA_NAME DrinkVendingMachine-PT-02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526727574523

info: Time: 3600 - MCC
===========================================================================================
prep: translating DrinkVendingMachine-PT-02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating DrinkVendingMachine-PT-02 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ DrinkVendingMachine-PT-02 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 96/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 24
lola: finding significant places
lola: 24 places, 72 transitions, 12 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 90 transition conflict sets
lola: TASK
lola: reading formula from DrinkVendingMachine-PT-02-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= optionSlots_1 + optionSlots_2)
lola: LP says that atomic proposition is always false: (3 <= productSlots_2 + productSlots_1)
lola: LP says that atomic proposition is always false: (3 <= theProducts_1 + theProducts_2)
lola: LP says that atomic proposition is always false: (3 <= theProducts_1 + theProducts_2)
lola: LP says that atomic proposition is always false: (3 <= productSlots_2 + productSlots_1)
lola: always true
lola: always true
lola: LP says that atomic proposition is always false: (3 <= theProducts_1 + theProducts_2)
lola: LP says that atomic proposition is always false: (2 <= ready_4)
lola: LP says that atomic proposition is always false: (2 <= ready_2)
lola: LP says that atomic proposition is always false: (2 <= wait_2)
lola: LP says that atomic proposition is always false: (3 <= ready_8)
lola: LP says that atomic proposition is always false: (3 <= wait_2)
lola: LP says that atomic proposition is always false: (2 <= ready_8)
lola: LP says that atomic proposition is always false: (3 <= wait_4)
lola: (3 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8) : NOT(((A (X ((theProducts_1 + theProducts_2 <= productSlots_2 + productSlots_1))) OR A (G ((1 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6)))) AND (() AND E (G ((2 <= optionSlots_1 + optionSlots_2)))))) : NOT(A (((theOptions_1 + theOptions_2 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6) U TRUE))) : (E (X (((productSlots_2 + productSlots_1 <= 0) AND (theOptions_1 + theOptions_2 <= 1)))) OR ((((ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6 <= 0)) OR ((optionSlots_1 + optionSlots_2 + 1 <= theOptions_1 + theOptions_2) AND (wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + 1 <= productSlots_2 + productSlots_1))) AND (1 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8))) : (E (F (((wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + 1 <= theOptions_1 + theOptions_2)))) OR ((optionSlots_1 + optionSlots_2 <= productSlots_2 + productSlots_1) AND (2 <= theOptions_1 + theOptions_2) AND (wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 <= 1) AND ((optionSlots_1 + optionSlots_2 <= theOptions_1 + theOptions_2)) AND (optionSlots_1 + optionSlots_2 <= theProducts_1 + theProducts_2))) : E (X ((FALSE AND E (F ((productSlots_2 + productSlots_1 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8)))))) : (E (G (((optionSlots_1 + optionSlots_2 <= productSlots_2 + productSlots_1) OR (theOptions_1 + theOptions_2 <= productSlots_2 + productSlots_1)))) OR A (F (((wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 <= optionSlots_1 + optionSlots_2) AND (productSlots_2 + productSlots_1 <= ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6) AND (wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 <= 2))))) : (theOptions_1 + theOptions_2 <= optionSlots_1 + optionSlots_2) : E (F (E (((1 <= optionSlots_2) U (wait_8 <= ready_8))))) : E (G ((((wait_7 <= wait_1) AND (ready_8 + 1 <= optionSlots_1)) OR (((1 <= optionSlots_1) OR (optionSlots_1 <= wait_5)))))) : (1 <= ready_6) : A (X ((ready_7 <= wait_4))) : (((E (X ((1 <= theProducts_2))) AND ((ready_4 + 1 <= wait_6))) OR ((optionSlots_2 <= 0) OR ((ready_6 + 1 <= wait_7)))) AND NOT(A (((wait_1 <= wait_4) U (wait_5 <= wait_8))))) : A (G ((E (G (FALSE)) OR E (G ((1 <= optionSlots_2)))))) : E (G (((wait_7 <= ready_6) OR ((ready_3 <= ready_1) AND (ready_7 <= ready_8))))) : (((1 <= ready_8) AND A (((ready_6 <= ready_3) U (ready_8 <= wait_5)))) AND NOT(E (F ((ready_6 <= theProducts_1)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8)
lola: processed formula length: 76
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola:
========================================
FORMULA DrinkVendingMachine-PT-02-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola:
FORMULA DrinkVendingMachine-PT-02-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (theOptions_1 + theOptions_2 <= optionSlots_1 + optionSlots_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (theOptions_1 + theOptions_2 <= optionSlots_1 + optionSlots_2)
lola: processed formula length: 62
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DrinkVendingMachine-PT-02-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= ready_6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= ready_6)
lola: processed formula length: 14
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola:
FORMULA DrinkVendingMachine-PT-02-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((productSlots_2 + productSlots_1 <= 0) AND (theOptions_1 + theOptions_2 <= 1)))) OR ((((ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6 <= 0)) OR ((optionSlots_1 + optionSlots_2 + 1 <= theOptions_1 + theOptions_2) AND (wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + 1 <= productSlots_2 + productSlots_1))) AND (1 <= wait_1 + wait_2 + wa... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((productSlots_2 + productSlots_1 <= 0) AND (theOptions_1 + theOptions_2 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(((productSlots_2 + productSlots_1 <= 0) AND (theOptions_1 + theOptions_2 <= 1)))
lola: processed formula length: 83
lola: 35 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6 <= 0)) OR ((optionSlots_1 + optionSlots_2 + 1 <= theOptions_1 + theOptions_2) AND (wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + 1 <= productSlots_2 + productSlots_1))) AND (1 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6 <= 0)) OR ((optionSlots_1 + optionSlots_2 + 1 <= theOptions_1 + theOptions_2) AND (wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8 + 1 <= productSlots_2 + productSlots_1))) AND (1 <= wait_1 + wait_2 + wait_3 + wait_4 + wait_5 + wait_6 + wait_7 + wait_8))
lola: processed formula length: 359
lola: 34 rewrites
lola: closed formula file DrinkVendingMachine-PT-02-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
========================================

FORMULA DrinkVendingMachine-PT-02-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X ((productSlots_2 + productSlots_1 + 1 <= theProducts_1 + theProducts_2))) AND E (F ((ready_8 + ready_7 + ready_1 + ready_2 + ready_3 + ready_4 + ready_5 + ready_6 <= 0)))) OR A (F ((optionSlots_1 + optionSlots_2 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown no yes unknown no unknown no unknown unknown no unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 26420 KB
lola: time consumption: 357 seconds
lola: time limit reached - aborting
lola:
preliminary result: yes unknown no yes unknown no unknown no unknown unknown no unknown unknown unknown unknown unknown
lola:
preliminary result: yes unknown no yes unknown no unknown no unknown unknown no unknown unknown unknown unknown unknown
lola: memory consumption: 26420 KB
lola: time consumption: 3570 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DrinkVendingMachine-PT-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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

tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-PT-02.tgz
mv DrinkVendingMachine-PT-02 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is DrinkVendingMachine-PT-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r076-blw3-152649937100367"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;