Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r265-tall-162106800400125.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is SmartHome-PT-13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800400125
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 19:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 19:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 92K May 5 16:52 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 SmartHome-PT-13-00
FORMULA_NAME SmartHome-PT-13-01
FORMULA_NAME SmartHome-PT-13-02
FORMULA_NAME SmartHome-PT-13-03
FORMULA_NAME SmartHome-PT-13-04
FORMULA_NAME SmartHome-PT-13-05
FORMULA_NAME SmartHome-PT-13-06
FORMULA_NAME SmartHome-PT-13-07
FORMULA_NAME SmartHome-PT-13-08
FORMULA_NAME SmartHome-PT-13-09
FORMULA_NAME SmartHome-PT-13-10
FORMULA_NAME SmartHome-PT-13-11
FORMULA_NAME SmartHome-PT-13-12
FORMULA_NAME SmartHome-PT-13-13
FORMULA_NAME SmartHome-PT-13-14
FORMULA_NAME SmartHome-PT-13-15

=== Now, execution of the tool begins

BK_START 1621198930579

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 21:02:12] [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]
[2021-05-16 21:02:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 21:02:12] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-16 21:02:12] [INFO ] Transformed 385 places.
[2021-05-16 21:02:12] [INFO ] Transformed 407 transitions.
[2021-05-16 21:02:12] [INFO ] Found NUPN structural information;
[2021-05-16 21:02:12] [INFO ] Parsed PT model containing 385 places and 407 transitions in 108 ms.
Deduced a syphon composed of 113 places in 4 ms
Reduce places removed 113 places and 88 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 466 resets, run finished after 308 ms. (steps per millisecond=324 ) properties seen :[0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0]
// Phase 1: matrix 319 rows 272 cols
[2021-05-16 21:02:12] [INFO ] Computed 13 place invariants in 11 ms
[2021-05-16 21:02:12] [INFO ] [Real]Absence check using 13 positive place invariants in 20 ms returned sat
[2021-05-16 21:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:02:13] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2021-05-16 21:02:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:02:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned unsat
[2021-05-16 21:02:13] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2021-05-16 21:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:02:13] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2021-05-16 21:02:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:02:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned unsat
[2021-05-16 21:02:13] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2021-05-16 21:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:02:13] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-16 21:02:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:02:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned unsat
[2021-05-16 21:02:13] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2021-05-16 21:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:02:14] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2021-05-16 21:02:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:02:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 29 ms returned unsat
[2021-05-16 21:02:14] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2021-05-16 21:02:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:02:14] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2021-05-16 21:02:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:02:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 60 ms returned sat
[2021-05-16 21:02:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 21:02:14] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2021-05-16 21:02:14] [INFO ] Deduced a trap composed of 32 places in 53 ms
[2021-05-16 21:02:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2021-05-16 21:02:14] [INFO ] Computed and/alt/rep : 318/933/318 causal constraints in 21 ms.
[2021-05-16 21:02:16] [INFO ] Added : 311 causal constraints over 63 iterations in 1213 ms. Result :sat
[2021-05-16 21:02:16] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2021-05-16 21:02:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:02:16] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2021-05-16 21:02:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:02:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned unsat
[2021-05-16 21:02:16] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2021-05-16 21:02:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:02:16] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2021-05-16 21:02:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:02:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 7 simplifications.
[2021-05-16 21:02:16] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-16 21:02:16] [INFO ] Flatten gal took : 64 ms
FORMULA SmartHome-PT-13-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-13-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-13-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-13-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 21:02:16] [INFO ] Applying decomposition
[2021-05-16 21:02:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 21:02:16] [INFO ] Flatten gal took : 20 ms
[2021-05-16 21:02:17] [INFO ] Decomposing Gal with order
[2021-05-16 21:02:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 21:02:17] [INFO ] Removed a total of 17 redundant transitions.
[2021-05-16 21:02:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 21:02:17] [INFO ] Flatten gal took : 42 ms
[2021-05-16 21:02:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 8 ms.
[2021-05-16 21:02:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-13-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 21:02:17] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-16 21:02:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SmartHome-PT-13 @ 3570 seconds

FORMULA SmartHome-PT-13-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-13-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-13-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-13-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for LTLCardinality @ SmartHome-PT-13

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 16 21:02:17 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p24))) AND ((1 <= p188))))",
"processed_size": 40,
"rewrites": 38
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 356
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((p231 <= 0))))",
"processed_size": 21,
"rewrites": 38
},
"result":
{
"edges": 565,
"markings": 436,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 4,
"aconj": 5,
"adisj": 4,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((X (G ((((p179 <= 0)) OR ((1 <= p261))))) U (X (G ((((1 <= p179)) AND ((p261 <= 0))))) OR (((1 <= p250)) AND ((p105 <= 0)))))))",
"processed_size": 134,
"rewrites": 38
},
"result":
{
"edges": 572,
"markings": 458,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 2,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (G (((G (((1 <= p15))) AND (G (F (((1 <= p15)))) OR ((1 <= p15)))) OR ((p208 <= 0))))) OR (((p264 <= 0)) OR ((1 <= p264)))))",
"processed_size": 130,
"rewrites": 38
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 3,
"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": 4269076,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((F(**) AND **)) : (X(**) OR ((G(F(**)) AND X(F(**))) OR X(**))) : X(X((X(G(**)) U (X(G(*)) OR **)))) : (F(G(**)) AND G(**)) : X((X(G(((G(**) AND (G(F(**)) OR **)) OR **))) OR (** OR **))) : (X(G(*)) OR **) : X(F((X(**) OR (** OR **)))) : (X(F(((X(X(**)) AND **) OR X(**)))) AND G(**)) : X(F((X(**) OR **))) : X(X(X(**))) : G(F(**))"
},
"net":
{
"arcs": 715,
"conflict_clusters": 252,
"places": 272,
"places_significant": 259,
"singleton_clusters": 0,
"transitions": 319
},
"result":
{
"interim_value": "no yes no unknown yes unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "no yes no unknown yes 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: 591/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 272
lola: finding significant places
lola: 272 places, 319 transitions, 259 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: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: X ((F (((1 <= p24))) AND ((1 <= p188)))) : ((G (F (((p231 <= 0)))) U X (((p248 <= 0)))) OR X (((p248 <= 0)))) : X ((X (X (G ((((p179 <= 0)) OR ((1 <= p261)))))) U X ((NOT(X (F ((((p179 <= 0)) OR ((1 <= p261)))))) OR (((1 <= p250)) AND ((p105 <= 0))))))) : (NOT(X (G (NOT(G ((((p155 <= 0)) OR ((1 <= p264)))))))) AND G (((1 <= 0) U (((p137 <= 0)) OR ((1 <= p170)))))) : X (((X (G (((G (((1 <= p15))) AND (G (F (((1 <= p15)))) OR ((1 <= p15)))) OR ((p208 <= 0))))) OR ((p264 <= 0))) OR ((1 <= p264)))) : (NOT(((1 <= 0) U F (X ((((1 <= p88)) AND ((p270 <= 0))))))) OR (((1 <= p88)) AND ((p270 <= 0)))) : (X (X (F ((((p116 <= 0)) OR ((1 <= p82)))))) U F (X (((X (((p62 <= 0))) OR ((p266 <= 0))) OR ((1 <= p23)))))) : (F (X (((X (X (((p186 <= 0)))) AND ((p186 <= 0))) OR X (((p186 <= 0)))))) AND ((1 <= 0) U G ((((p61 <= 0)) OR ((1 <= p176)))))) : X (F ((X ((((p49 <= 0)) OR ((1 <= p167)))) OR ((1 <= p168))))) : X (X ((((1 <= 0) U (1 <= 0)) OR X ((((p180 <= 0)) OR ((1 <= p36))))))) : NOT(F (NOT(F (((1 <= p228))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p24))) AND ((1 <= p188))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p24))) AND ((1 <= p188))))
lola: processed formula length: 40
lola: 38 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 19 markings, 19 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p248 <= 0))) OR ((G (F (((p231 <= 0)))) AND X (F (((p248 <= 0))))) OR X (((p248 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p231 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p231 <= 0))))
lola: processed formula length: 21
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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: 436 markings, 565 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p248 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p248 <= 0)))
lola: processed formula length: 17
lola: 38 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (G ((((p179 <= 0)) OR ((1 <= p261))))) U (X (G ((((1 <= p179)) AND ((p261 <= 0))))) OR (((1 <= p250)) AND ((p105 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (G ((((p179 <= 0)) OR ((1 <= p261))))) U (X (G ((((1 <= p179)) AND ((p261 <= 0))))) OR (((1 <= p250)) AND ((p105 <= 0)))))))
lola: processed formula length: 134
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 458 markings, 572 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((G (((1 <= p15))) AND (G (F (((1 <= p15)))) OR ((1 <= p15)))) OR ((p208 <= 0))))) OR (((p264 <= 0)) OR ((1 <= p264)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((G (((1 <= p15))) AND (G (F (((1 <= p15)))) OR ((1 <= p15)))) OR ((p208 <= 0))))) OR (((p264 <= 0)) OR ((1 <= p264)))))
lola: processed formula length: 130
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((((p88 <= 0)) OR ((1 <= p270))))) OR (((1 <= p88)) AND ((p270 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p88)) AND ((p270 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p88)) AND ((p270 <= 0)))
lola: processed formula length: 32
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 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: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p88 <= 0)) OR ((1 <= p270)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p88 <= 0)) OR ((1 <= p270)))))
lola: processed formula length: 40
lola: 38 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: 475182 markings, 1881370 edges, 95036 markings/sec, 0 secs
lola: 875872 markings, 3681477 edges, 80138 markings/sec, 5 secs
lola: 1151774 markings, 5513584 edges, 55180 markings/sec, 10 secs
lola: 1536100 markings, 7235275 edges, 76865 markings/sec, 15 secs
lola: 1862046 markings, 8951745 edges, 65189 markings/sec, 20 secs
lola: 2127083 markings, 10692500 edges, 53007 markings/sec, 25 secs
lola: 2493948 markings, 12385149 edges, 73373 markings/sec, 30 secs
lola: 2792024 markings, 14151753 edges, 59615 markings/sec, 35 secs
lola: 3018957 markings, 15935213 edges, 45387 markings/sec, 40 secs
lola: 3278412 markings, 17685334 edges, 51891 markings/sec, 45 secs
lola: 3633252 markings, 19379572 edges, 70968 markings/sec, 50 secs
lola: 3906390 markings, 21177739 edges, 54628 markings/sec, 55 secs
lola: 4082752 markings, 22939719 edges, 35272 markings/sec, 60 secs
lola: 4458768 markings, 24580763 edges, 75203 markings/sec, 65 secs
lola: 4744870 markings, 26323908 edges, 57220 markings/sec, 70 secs
lola: 4929399 markings, 28014225 edges, 36906 markings/sec, 75 secs
lola: 5208377 markings, 29699348 edges, 55796 markings/sec, 80 secs
lola: 5505763 markings, 31376825 edges, 59477 markings/sec, 85 secs
lola: 5741365 markings, 33161100 edges, 47120 markings/sec, 90 secs
lola: 5907627 markings, 34919371 edges, 33252 markings/sec, 95 secs
lola: 6200815 markings, 36652804 edges, 58638 markings/sec, 100 secs
lola: 6509792 markings, 38373998 edges, 61795 markings/sec, 105 secs
lola: 6752674 markings, 40155267 edges, 48576 markings/sec, 110 secs
lola: 6960729 markings, 41936062 edges, 41611 markings/sec, 115 secs
lola: 7359407 markings, 43599481 edges, 79736 markings/sec, 120 secs
lola: 7649564 markings, 45376855 edges, 58031 markings/sec, 125 secs
lola: 7831107 markings, 47121109 edges, 36309 markings/sec, 130 secs
lola: 8191110 markings, 48769865 edges, 72001 markings/sec, 135 secs
lola: 8510096 markings, 50421920 edges, 63797 markings/sec, 140 secs
lola: 8758242 markings, 52072777 edges, 49629 markings/sec, 145 secs
lola: 9096033 markings, 53705317 edges, 67558 markings/sec, 150 secs
lola: 9440827 markings, 55270839 edges, 68959 markings/sec, 155 secs
lola: 9699816 markings, 56896780 edges, 51798 markings/sec, 160 secs
lola: 9987075 markings, 58529350 edges, 57452 markings/sec, 165 secs
lola: 10373449 markings, 60224579 edges, 77275 markings/sec, 170 secs
lola: 10649974 markings, 61978210 edges, 55305 markings/sec, 175 secs
lola: 10925742 markings, 63728786 edges, 55154 markings/sec, 180 secs
lola: 11245055 markings, 65441069 edges, 63863 markings/sec, 185 secs
lola: 11577924 markings, 67139344 edges, 66574 markings/sec, 190 secs
lola: 11870906 markings, 68681482 edges, 58596 markings/sec, 195 secs
lola: 12105845 markings, 70272527 edges, 46988 markings/sec, 200 secs
lola: 12345977 markings, 71847643 edges, 48026 markings/sec, 205 secs
lola: 12571247 markings, 73434980 edges, 45054 markings/sec, 210 secs
lola: 12799211 markings, 75056427 edges, 45593 markings/sec, 215 secs
lola: 13042240 markings, 76662577 edges, 48606 markings/sec, 220 secs
lola: 13340787 markings, 78174898 edges, 59709 markings/sec, 225 secs
lola: 13575622 markings, 79615119 edges, 46967 markings/sec, 230 secs
lola: 13903941 markings, 81267086 edges, 65664 markings/sec, 235 secs
lola: 14335093 markings, 83061309 edges, 86230 markings/sec, 240 secs
lola: 14647545 markings, 84807959 edges, 62490 markings/sec, 245 secs
lola: 14970931 markings, 86515620 edges, 64677 markings/sec, 250 secs
lola: 15301930 markings, 88161552 edges, 66200 markings/sec, 255 secs
lola: 15585149 markings, 89803514 edges, 56644 markings/sec, 260 secs
lola: 15896076 markings, 91376405 edges, 62185 markings/sec, 265 secs
lola: 16136809 markings, 93012711 edges, 48147 markings/sec, 270 secs
lola: 16393418 markings, 94541898 edges, 51322 markings/sec, 275 secs
lola: 16652530 markings, 96127058 edges, 51822 markings/sec, 280 secs
lola: 16850130 markings, 97633993 edges, 39520 markings/sec, 285 secs
lola: 17167012 markings, 99085742 edges, 63376 markings/sec, 290 secs
lola: 17384616 markings, 100525475 edges, 43521 markings/sec, 295 secs
lola: 17678223 markings, 102002084 edges, 58721 markings/sec, 300 secs
lola: 17847172 markings, 103451568 edges, 33790 markings/sec, 305 secs
lola: 18172205 markings, 104926231 edges, 65007 markings/sec, 310 secs
lola: 18400294 markings, 106407733 edges, 45618 markings/sec, 315 secs
lola: 18720091 markings, 107851841 edges, 63959 markings/sec, 320 secs
lola: 18956100 markings, 109394419 edges, 47202 markings/sec, 325 secs
lola: 19293689 markings, 111066931 edges, 67518 markings/sec, 330 secs
lola: 19498598 markings, 112691043 edges, 40982 markings/sec, 335 secs
lola: 19813491 markings, 114296087 edges, 62979 markings/sec, 340 secs
lola: 20096336 markings, 116019232 edges, 56569 markings/sec, 345 secs
lola: 20346677 markings, 117693416 edges, 50068 markings/sec, 350 secs
lola: 20630653 markings, 119324207 edges, 56795 markings/sec, 355 secs
lola: 20810885 markings, 120958565 edges, 36046 markings/sec, 360 secs
lola: 21142941 markings, 122522322 edges, 66411 markings/sec, 365 secs
lola: 21336704 markings, 124055952 edges, 38753 markings/sec, 370 secs
lola: 21611945 markings, 125574146 edges, 55048 markings/sec, 375 secs
lola: 21811751 markings, 127119494 edges, 39961 markings/sec, 380 secs
lola: 21951482 markings, 128625591 edges, 27946 markings/sec, 385 secs
lola: 22238161 markings, 130087590 edges, 57336 markings/sec, 390 secs
lola: 22410586 markings, 131541255 edges, 34485 markings/sec, 395 secs
lola: 22603507 markings, 132948921 edges, 38584 markings/sec, 400 secs
lola: 22854165 markings, 134326443 edges, 50132 markings/sec, 405 secs
lola: 23005946 markings, 135648940 edges, 30356 markings/sec, 410 secs
lola: 23265284 markings, 137017259 edges, 51868 markings/sec, 415 secs
lola: 23465529 markings, 138464276 edges, 40049 markings/sec, 420 secs
lola: 23578588 markings, 139827162 edges, 22612 markings/sec, 425 secs
lola: 23869400 markings, 141249568 edges, 58162 markings/sec, 430 secs
lola: 24072123 markings, 142683522 edges, 40545 markings/sec, 435 secs
lola: 24293813 markings, 144076930 edges, 44338 markings/sec, 440 secs
lola: 24545693 markings, 145498912 edges, 50376 markings/sec, 445 secs
lola: 24702903 markings, 146952555 edges, 31442 markings/sec, 450 secs
lola: 25011288 markings, 148616412 edges, 61677 markings/sec, 455 secs
lola: 25209072 markings, 150322631 edges, 39557 markings/sec, 460 secs
lola: 25495150 markings, 152025555 edges, 57216 markings/sec, 465 secs
lola: 25748907 markings, 153807042 edges, 50751 markings/sec, 470 secs
lola: 26057994 markings, 155527783 edges, 61817 markings/sec, 475 secs
lola: 26303476 markings, 157289694 edges, 49096 markings/sec, 480 secs
lola: 26625182 markings, 158965261 edges, 64341 markings/sec, 485 secs
lola: 26894516 markings, 160641095 edges, 53867 markings/sec, 490 secs
lola: 27238501 markings, 162213867 edges, 68797 markings/sec, 495 secs
lola: 27489254 markings, 163754070 edges, 50151 markings/sec, 500 secs
lola: local time limit reached - aborting
lola:
preliminary result: no yes no unknown yes unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4268752 KB
lola: time consumption: 512 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no yes no unknown yes unknown unknown unknown unknown unknown unknown
lola: time limit reached - aborting
lola:
preliminary result: no yes no unknown yes unknown unknown unknown unknown unknown unknown
lola:
preliminary result: no yes no unknown yes unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4269076 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 11866500 kB
After kill :
MemTotal: 16427332 kB
MemFree: 11866508 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="SmartHome-PT-13"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is SmartHome-PT-13, 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 r265-tall-162106800400125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-13.tgz
mv SmartHome-PT-13 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 ;