Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.0K May 14 00:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 00:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 18:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 18:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.1K May 13 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 07:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 07:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 12K May 12 20:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591295223914

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 18:27:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 18:27:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 18:27:05] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2020-06-04 18:27:05] [INFO ] Transformed 41 places.
[2020-06-04 18:27:05] [INFO ] Transformed 31 transitions.
[2020-06-04 18:27:05] [INFO ] Found NUPN structural information;
[2020-06-04 18:27:05] [INFO ] Parsed PT model containing 41 places and 31 transitions in 65 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Finished random walk after 934 steps, including 0 resets, run visited all 28 properties in 14 ms. (steps per millisecond=66 )
[2020-06-04 18:27:05] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-04 18:27:05] [INFO ] Flatten gal took : 28 ms
[2020-06-04 18:27:05] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-04 18:27:05] [INFO ] Flatten gal took : 8 ms
FORMULA ShieldIIPt-PT-002A-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002A-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002A-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 18:27:05] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2020-06-04 18:27:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldIIPt-PT-002A @ 3570 seconds

FORMULA ShieldIIPt-PT-002A-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: -1
rslt: Output for CTLFireability @ ShieldIIPt-PT-002A

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 18:27:06 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EF(AG(EX(((1 <= p23) AND (1 <= p36)))))",
"processed_size": 39,
"rewrites": 16
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 8212482,
"markings": 819201,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 41220,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(A(G(E(X(**)))))) : E((E(F(**)) U (** AND A(G(**))))) : (E(F(A(X(**)))) OR (** OR (** OR **))) : (E((A(F(**)) U A(G(**)))) OR **) : (A(G(E(F(*)))) AND **) : (A(G(E(F(**)))) AND E(F((A(G(**)) AND E(X(**)))))) : A(G(**)) : (E(F(**)) OR (A(F(E(G(**)))) OR **)) : (A(F((E(X(**)) OR (** OR **)))) AND A(G(E(X(*))))) : A(G((A(X(**)) OR **))) : E(F(**)) : (A(X(A(F(**)))) AND A(X(A(F(**))))) : (A(X(**)) OR **)"
},
"net":
{
"arcs": 124,
"conflict_clusters": 17,
"places": 41,
"places_significant": 22,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"interim_value": "no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 71/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1312
lola: finding significant places
lola: 41 places, 30 transitions, 22 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: E (F (A (G (E (X (((1 <= p23) AND (1 <= p36)))))))) : E ((E (F ((((1 <= p33)) OR ((1 <= p2) AND (1 <= p10))))) U (((1 <= p0) AND ((p14 <= 0))) AND A (G (((1 <= p2) AND (1 <= p10))))))) : (((E (F (A (X (((1 <= p6) AND (1 <= p15)))))) OR ((1 <= p24) AND (1 <= p35))) OR ((1 <= p12) AND (1 <= p37))) OR ((1 <= p5) AND (1 <= p16))) : (E ((A (F (((1 <= p39)))) U A (G (((1 <= p23) AND (1 <= p36)))))) OR ((1 <= p6) AND (1 <= p15))) : (A (G (NOT(A (G (((1 <= p23) AND (1 <= p36))))))) AND ((p8 <= 0) OR (p19 <= 0))) : (A (G (E (F (((p39 <= 0)))))) AND E (F ((A (G (((1 <= p24) AND (1 <= p35)))) AND E (X (((1 <= p24) AND (1 <= p35)))))))) : A (G (((p1 <= 0) OR (p18 <= 0) OR (p4 <= 0) OR (p17 <= 0) OR (p32 <= 0) OR (p38 <= 0) OR (p40 <= 0) OR (p25 <= 0) OR (p34 <= 0) OR (((p14 <= 0)) AND ((p20 <= 0)))))) : ((E (F (((1 <= p33) AND (1 <= p5) AND (1 <= p16) AND (1 <= p24) AND (1 <= p35) AND ((p11 <= 0) OR (p15 <= 0) OR (p21 <= 0) OR ((1 <= p20)))))) OR A (F (E (G (((1 <= p7) AND (1 <= p9))))))) OR ((1 <= p18))) : (A (F (((E (X (((1 <= p25) AND (1 <= p34)))) OR ((p1 <= 0))) OR ((p18 <= 0))))) AND A (G (NOT(A (X (((1 <= p2) AND (1 <= p10)))))))) : A (G ((A (X (((1 <= p14)))) OR ((1 <= p2) AND (1 <= p10))))) : E (F (E (((((1 <= p16)) OR ((1 <= p14) AND (1 <= p29))) U ((1 <= p39)))))) : A (X ((A (F (((p37 <= 0)))) AND A (F (((1 <= p33))))))) : (A (X ((((p26 <= 0) OR (p28 <= 0)) AND ((p27 <= 0) OR (p38 <= 0)) AND ((p14 <= 0))))) OR ((1 <= p24) AND (1 <= p35) AND (1 <= p18)))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:446
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (E (X (((1 <= p23) AND (1 <= p36))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AG(EX(((1 <= p23) AND (1 <= p36)))))
lola: processed formula length: 39
lola: 16 rewrites
lola: closed formula file CTLFireability.xml
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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 815556 markings, 4825417 edges, 163111 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 819201 markings, 8212482 edges
lola: ========================================
lola: subprocess 1 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X (((1 <= p6) AND (1 <= p15)))))) OR (((1 <= p24) AND (1 <= p35)) OR (((1 <= p12) AND (1 <= p37)) OR ((1 <= p5) AND (1 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 41220 KB
lola: time consumption: 308 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 41220 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 16123440 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16123440 kB

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-002A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ShieldIIPt-PT-002A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033477200236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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