Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r172-smll-158987827700313.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 Railroad-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-158987827700313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 4.1K Apr 12 08:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 08:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 11 09:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 09:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K 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.3K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 10 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 21:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 21:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 1.4M Mar 24 05:38 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 Railroad-PT-050-00
FORMULA_NAME Railroad-PT-050-01
FORMULA_NAME Railroad-PT-050-02
FORMULA_NAME Railroad-PT-050-03
FORMULA_NAME Railroad-PT-050-04
FORMULA_NAME Railroad-PT-050-05
FORMULA_NAME Railroad-PT-050-06
FORMULA_NAME Railroad-PT-050-07
FORMULA_NAME Railroad-PT-050-08
FORMULA_NAME Railroad-PT-050-09
FORMULA_NAME Railroad-PT-050-10
FORMULA_NAME Railroad-PT-050-11
FORMULA_NAME Railroad-PT-050-12
FORMULA_NAME Railroad-PT-050-13
FORMULA_NAME Railroad-PT-050-14
FORMULA_NAME Railroad-PT-050-15

=== Now, execution of the tool begins

BK_START 1591378404811

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 17:33:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 17:33:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 17:33:28] [INFO ] Load time of PNML (sax parser for PT used): 333 ms
[2020-06-05 17:33:28] [INFO ] Transformed 518 places.
[2020-06-05 17:33:28] [INFO ] Transformed 2756 transitions.
[2020-06-05 17:33:28] [INFO ] Parsed PT model containing 518 places and 2756 transitions in 414 ms.
Deduced a syphon composed of 151 places in 46 ms
Reduce places removed 151 places and 50 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 104 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1817 ms. (steps per millisecond=55 ) properties seen :[1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0]
// Phase 1: matrix 2706 rows 367 cols
[2020-06-05 17:33:30] [INFO ] Invariants computation overflowed in 85 ms
[2020-06-05 17:33:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:33:31] [INFO ] [Real]Absence check using state equation in 652 ms returned unsat
[2020-06-05 17:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:33:31] [INFO ] [Real]Absence check using state equation in 513 ms returned unsat
[2020-06-05 17:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:33:33] [INFO ] [Real]Absence check using state equation in 2062 ms returned unsat
[2020-06-05 17:33:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:33:36] [INFO ] [Real]Absence check using state equation in 2568 ms returned sat
[2020-06-05 17:33:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 17:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 17:33:39] [INFO ] [Nat]Absence check using state equation in 2455 ms returned sat
[2020-06-05 17:33:39] [INFO ] Deduced a trap composed of 52 places in 116 ms
[2020-06-05 17:33:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 335 ms
[2020-06-05 17:33:40] [INFO ] Computed and/alt/rep : 2656/132761/2656 causal constraints in 624 ms.
[2020-06-05 17:33:56] [INFO ] Added : 305 causal constraints over 61 iterations in 17174 ms. Result :(error "Failed to check-sat")
[2020-06-05 17:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:33:59] [INFO ] [Real]Absence check using state equation in 2210 ms returned unsat
[2020-06-05 17:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:33:59] [INFO ] [Real]Absence check using state equation in 364 ms returned unsat
[2020-06-05 17:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:34:00] [INFO ] [Real]Absence check using state equation in 557 ms returned unsat
[2020-06-05 17:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:34:03] [INFO ] [Real]Absence check using state equation in 3017 ms returned sat
[2020-06-05 17:34:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 17:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 17:34:05] [INFO ] [Nat]Absence check using state equation in 2566 ms returned sat
[2020-06-05 17:34:06] [INFO ] Deduced a trap composed of 4 places in 887 ms
[2020-06-05 17:34:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1057 ms
[2020-06-05 17:34:07] [INFO ] Computed and/alt/rep : 2656/132761/2656 causal constraints in 689 ms.
[2020-06-05 17:34:23] [INFO ] Added : 190 causal constraints over 38 iterations in 16378 ms. Result :(error "Failed to check-sat")
[2020-06-05 17:34:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:34:23] [INFO ] [Real]Absence check using state equation in 545 ms returned unsat
[2020-06-05 17:34:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:34:24] [INFO ] [Real]Absence check using state equation in 602 ms returned unsat
[2020-06-05 17:34:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:34:25] [INFO ] [Real]Absence check using state equation in 550 ms returned unsat
[2020-06-05 17:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:34:28] [INFO ] [Real]Absence check using state equation in 2757 ms returned unsat
[2020-06-05 17:34:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:34:28] [INFO ] [Real]Absence check using state equation in 511 ms returned unsat
[2020-06-05 17:34:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:34:29] [INFO ] [Real]Absence check using state equation in 550 ms returned unsat
[2020-06-05 17:34:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:34:32] [INFO ] [Real]Absence check using state equation in 2801 ms returned unsat
[2020-06-05 17:34:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:34:32] [INFO ] [Real]Absence check using state equation in 518 ms returned unsat
[2020-06-05 17:34:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:34:33] [INFO ] [Real]Absence check using state equation in 525 ms returned unsat
[2020-06-05 17:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:34:35] [INFO ] [Real]Absence check using state equation in 2427 ms returned unsat
[2020-06-05 17:34:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:34:37] [INFO ] [Real]Absence check using state equation in 1282 ms returned unsat
[2020-06-05 17:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 17:34:37] [INFO ] [Real]Absence check using state equation in 518 ms returned unsat
Successfully simplified 18 atomic propositions for a total of 22 simplifications.
[2020-06-05 17:34:38] [INFO ] Initial state reduction rules for CTL removed 13 formulas.
[2020-06-05 17:34:38] [INFO ] Flatten gal took : 466 ms
FORMULA Railroad-PT-050-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 17:34:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 17:34:38] [INFO ] Flatten gal took : 226 ms
[2020-06-05 17:34:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Railroad-PT-050-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 17:34:39] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-05 17:34:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 43 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Railroad-PT-050 @ 3570 seconds

FORMULA Railroad-PT-050-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Railroad-PT-050-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLCardinality @ Railroad-PT-050

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 17:34:40 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X (X (F ((p263 <= p37)))) U (1 <= p281))",
"processed_size": 41,
"rewrites": 6
},
"result":
{
"edges": 102,
"markings": 102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F ((F (G ((p76 <= p220))) OR (p266 <= p181))) AND X ((p76 <= p220))))",
"processed_size": 73,
"rewrites": 6
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 67036,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X(F(**))) U **) : F((F((F(G(**)) OR **)) AND X(**)))"
},
"net":
{
"arcs": 16077,
"conflict_clusters": 57,
"places": 367,
"places_significant": 206,
"singleton_clusters": 0,
"transitions": 2706
},
"result":
{
"preliminary_value": "no yes ",
"value": "no yes "
},
"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: 3073/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 11744
lola: finding significant places
lola: 367 places, 2706 transitions, 206 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 LTLCardinality.xml
lola: (((0 <= 0) U X (X ((p263 <= p37)))) U (1 <= p281)) : F ((F ((X (X (F (G ((p76 <= p220))))) OR (p266 <= p181))) AND X ((p76 <= p220))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((p263 <= p37)))) U (1 <= p281))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (F ((p263 <= p37)))) U (1 <= p281))
lola: processed formula length: 41
lola: 6 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 102 markings, 102 edges
lola: ========================================
lola: subprocess 1 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((F (G ((p76 <= p220))) OR (p266 <= p181))) AND X ((p76 <= p220))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((F (G ((p76 <= p220))) OR (p266 <= p181))) AND X ((p76 <= p220))))
lola: processed formula length: 73
lola: 6 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 51 markings, 50 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes
lola:
preliminary result: no yes
lola: memory consumption: 67036 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
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="Railroad-PT-050"
export BK_EXAMINATION="LTLCardinality"
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 Railroad-PT-050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r172-smll-158987827700313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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