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.r170-smll-158987815400097.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 FMS-PT-20000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815400097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.4K Apr 1 20:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 1 20:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 1 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 1 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 1 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 1 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 1 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 1 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 1 13:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 1 13:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 16K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591158318573

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:25:20] [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-03 04:25:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:25:21] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2020-06-03 04:25:21] [INFO ] Transformed 22 places.
[2020-06-03 04:25:21] [INFO ] Transformed 20 transitions.
[2020-06-03 04:25:21] [INFO ] Parsed PT model containing 22 places and 20 transitions in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100020 steps, including 0 resets, run finished after 106 ms. (steps per millisecond=943 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 20 rows 22 cols
[2020-06-03 04:25:21] [INFO ] Computed 6 place invariants in 6 ms
[2020-06-03 04:25:21] [INFO ] [Real]Absence check using 6 positive place invariants in 22 ms returned sat
[2020-06-03 04:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:21] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2020-06-03 04:25:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:25:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2020-06-03 04:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:21] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-06-03 04:25:21] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 6 ms.
[2020-06-03 04:25:21] [INFO ] Added : 10 causal constraints over 2 iterations in 33 ms. Result :sat
[2020-06-03 04:25:21] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-03 04:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:21] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-03 04:25:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:25:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-03 04:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:21] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-03 04:25:21] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 3 ms.
[2020-06-03 04:25:21] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
[2020-06-03 04:25:21] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-03 04:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:21] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-03 04:25:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:25:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-03 04:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:21] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-03 04:25:21] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 3 ms.
[2020-06-03 04:25:21] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
[2020-06-03 04:25:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-03 04:25:21] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-03 04:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:21] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-03 04:25:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:25:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-03 04:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:21] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-03 04:25:21] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 3 ms.
[2020-06-03 04:25:21] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
[2020-06-03 04:25:21] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-03 04:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-03 04:25:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:25:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-03 04:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:22] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-03 04:25:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 2 ms.
[2020-06-03 04:25:22] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-03 04:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-03 04:25:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 13 ms.
[2020-06-03 04:25:22] [INFO ] Added : 3 causal constraints over 1 iterations in 19 ms. Result :sat
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-03 04:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-03 04:25:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:25:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-03 04:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:22] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2020-06-03 04:25:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 2 ms.
[2020-06-03 04:25:22] [INFO ] Added : 10 causal constraints over 2 iterations in 18 ms. Result :sat
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-03 04:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-03 04:25:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:25:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-03 04:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:22] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2020-06-03 04:25:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 3 ms.
[2020-06-03 04:25:22] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2020-06-03 04:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2020-06-03 04:25:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 3 ms.
[2020-06-03 04:25:22] [INFO ] Added : 10 causal constraints over 2 iterations in 13 ms. Result :sat
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned unsat
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-03 04:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2020-06-03 04:25:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:25:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-03 04:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:22] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-03 04:25:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 8 ms.
[2020-06-03 04:25:22] [INFO ] Added : 9 causal constraints over 2 iterations in 20 ms. Result :sat
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-03 04:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-03 04:25:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:25:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2020-06-03 04:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:22] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2020-06-03 04:25:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 3 ms.
[2020-06-03 04:25:22] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2020-06-03 04:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:22] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-03 04:25:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:25:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2020-06-03 04:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:25:22] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-03 04:25:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints in 6 ms.
[2020-06-03 04:25:22] [INFO ] Added : 8 causal constraints over 2 iterations in 18 ms. Result :sat
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2020-06-03 04:25:22] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 04:25:22] [INFO ] Flatten gal took : 36 ms
FORMULA FMS-PT-20000-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-20000-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 04:25:22] [INFO ] Flatten gal took : 8 ms
[2020-06-03 04:25:22] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2020-06-03 04:25:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ FMS-PT-20000 @ 3570 seconds

FORMULA FMS-PT-20000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-20000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2580
rslt: Output for LTLCardinality @ FMS-PT-20000

{
"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": "Wed Jun 3 04:25:27 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X ((X (F ((3 <= p16))) AND (p13 + 1 <= p20))) AND (p13 + 1 <= p20)))",
"processed_size": 72,
"rewrites": 69
},
"result":
{
"edges": 80004,
"markings": 80004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 473
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((G (F ((p21 <= p8))) OR (G ((F ((2 <= p15)) AND F ((p21 <= p8)))) OR (F ((1 <= p8)) OR (p8 + 1 <= p21))))))",
"processed_size": 113,
"rewrites": 69
},
"result":
{
"edges": 80003,
"markings": 80003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 615
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"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 (X (X (F ((3 <= p6)))))",
"processed_size": 25,
"rewrites": 69
},
"result":
{
"edges": 80003,
"markings": 80003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"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": 769
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 (X (F ((p8 <= 0))))",
"processed_size": 21,
"rewrites": 69
},
"result":
{
"edges": 100000,
"markings": 100000,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"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": 1026
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "(F ((G ((p21 <= p11)) OR G ((p6 <= p11)))) U X (F ((p21 <= p11))))",
"processed_size": 66,
"rewrites": 69
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"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": 1539
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((p3 <= p21)) AND ((2 <= p6) OR (p3 <= p21)))))",
"processed_size": 56,
"rewrites": 69
},
"result":
{
"edges": 540024,
"markings": 420018,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3078
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3078
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p19 <= p8)",
"processed_size": 11,
"rewrites": 69
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "(p19 <= p8)",
"processed_size": 11,
"rewrites": 69
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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": "F (G ((p8 + 1 <= p19)))",
"processed_size": 23,
"rewrites": 69
},
"result":
{
"edges": 100005,
"markings": 100004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3460,
"runtime": 990.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((X((X(F(**)) AND *)) AND **)) : G((F((G(**) OR **)) AND ((** U **) OR X(F((G(**) OR **)))))) : X(G((G(F(**)) OR (G((F(**) AND F(**))) OR (F(**) OR **))))) : X(F((G(*) AND **))) : X(X(X(F(**)))) : X(X(F(*))) : (F(G(*)) AND **) : F(G((F(**) AND (** OR **)))) : (F((G(**) OR G(**))) U X(F(**)))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "no unknown no unknown no no no no yes ",
"value": "no unknown no unknown no no no 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: 42/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 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: G (((F (X (X ((3 <= p16)))) AND NOT(X ((p20 <= p13)))) AND (p13 + 1 <= p20))) : G ((((p20 <= p10) U (p16 <= p3)) U F ((G (X (G ((p10 + 1 <= p20)))) OR X ((p1 <= p15)))))) : X (G ((((G (F ((2 <= p15))) U G (F ((p21 <= p8)))) OR F ((1 <= p8))) OR (p8 + 1 <= p21)))) : F (X ((NOT(((0 <= 0) U (F ((p18 <= p3)) U (3 <= p17)))) AND (2 <= p16)))) : X (X (F (X ((3 <= p6))))) : F (NOT(X (X ((1 <= p8))))) : (X (F (G (NOT(((0 <= 0) U F (X ((p19 <= p8)))))))) AND (p19 <= p8)) : F (((3 <= p8) U NOT(G (X (NOT(G (((2 <= p6) U (p3 <= p21))))))))) : ((F (G ((p21 <= p11))) OR F (G ((p6 <= p11)))) U F (X ((p21 <= p11))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((X (F ((3 <= p16))) AND (p13 + 1 <= p20))) AND (p13 + 1 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((X (F ((3 <= p16))) AND (p13 + 1 <= p20))) AND (p13 + 1 <= p20)))
lola: processed formula length: 72
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 80004 markings, 80004 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((G ((p10 + 1 <= p20)) OR (p1 <= p15))) AND (((p20 <= p10) U (p16 <= p3)) OR X (F ((G ((p10 + 1 <= p20)) OR (p1 <= p15)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((G ((p10 + 1 <= p20)) OR (p1 <= p15))) AND (((p20 <= p10) U (p16 <= p3)) OR X (F ((G ((p10 + 1 <= p20)) OR (p1 <= p15)))))))
lola: processed formula length: 131
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 3748258 markings, 4982276 edges, 749652 markings/sec, 0 secs
lola: 7491713 markings, 9967344 edges, 748691 markings/sec, 5 secs
lola: 11122176 markings, 14812928 edges, 726093 markings/sec, 10 secs
lola: 14723853 markings, 19615333 edges, 720335 markings/sec, 15 secs
lola: 18288692 markings, 24362483 edges, 712968 markings/sec, 20 secs
lola: 21785981 markings, 29038312 edges, 699458 markings/sec, 25 secs
lola: 25341549 markings, 33771553 edges, 711114 markings/sec, 30 secs
lola: 28789537 markings, 38373430 edges, 689598 markings/sec, 35 secs
lola: 32202364 markings, 42922569 edges, 682565 markings/sec, 40 secs
lola: 35604905 markings, 47456274 edges, 680508 markings/sec, 45 secs
lola: 38999148 markings, 51977531 edges, 678849 markings/sec, 50 secs
lola: 42381047 markings, 56480278 edges, 676380 markings/sec, 55 secs
lola: 45731353 markings, 60965637 edges, 670061 markings/sec, 60 secs
lola: 49232199 markings, 65616799 edges, 700169 markings/sec, 65 secs
lola: 52628790 markings, 70147336 edges, 679318 markings/sec, 70 secs
lola: 55986183 markings, 74637569 edges, 671479 markings/sec, 75 secs
lola: 59370533 markings, 79143989 edges, 676870 markings/sec, 80 secs
lola: 62704348 markings, 83582614 edges, 666763 markings/sec, 85 secs
lola: 66063666 markings, 88073484 edges, 671864 markings/sec, 90 secs
lola: 69399154 markings, 92506614 edges, 667098 markings/sec, 95 secs
lola: 72781138 markings, 97019125 edges, 676397 markings/sec, 100 secs
lola: 76085537 markings, 101425982 edges, 660880 markings/sec, 105 secs
lola: 79384124 markings, 105833768 edges, 659717 markings/sec, 110 secs
lola: 82709978 markings, 110252439 edges, 665171 markings/sec, 115 secs
lola: 85984671 markings, 114624383 edges, 654939 markings/sec, 120 secs
lola: 88996516 markings, 118634051 edges, 602369 markings/sec, 125 secs
lola: 92247695 markings, 122968726 edges, 650236 markings/sec, 130 secs
lola: 95649066 markings, 127506418 edges, 680274 markings/sec, 135 secs
lola: 98995749 markings, 131980606 edges, 669337 markings/sec, 140 secs
lola: 102331876 markings, 136414690 edges, 667225 markings/sec, 145 secs
lola: 105635790 markings, 140830461 edges, 660783 markings/sec, 150 secs
lola: 108889195 markings, 145170469 edges, 650681 markings/sec, 155 secs
lola: 111862144 markings, 149122099 edges, 594590 markings/sec, 160 secs
lola: 114092655 markings, 152105497 edges, 446102 markings/sec, 165 secs
lola: 116495548 markings, 155315420 edges, 480579 markings/sec, 170 secs
lola: 118555551 markings, 158049705 edges, 412001 markings/sec, 175 secs
lola: 119671311 markings, 159543312 edges, 223152 markings/sec, 180 secs
lola: 121306230 markings, 161725641 edges, 326984 markings/sec, 185 secs
lola: 123357184 markings, 164453763 edges, 410191 markings/sec, 190 secs
lola: 125032506 markings, 166684941 edges, 335064 markings/sec, 195 secs
lola: 127281239 markings, 169697708 edges, 449747 markings/sec, 200 secs
lola: 128716207 markings, 171610382 edges, 286994 markings/sec, 205 secs
lola: 131486490 markings, 175285718 edges, 554057 markings/sec, 210 secs
lola: 132474753 markings, 176618084 edges, 197653 markings/sec, 215 secs
lola: 135330839 markings, 180422127 edges, 571217 markings/sec, 220 secs
lola: 136420850 markings, 181877110 edges, 218002 markings/sec, 225 secs
lola: 137986609 markings, 183955700 edges, 313152 markings/sec, 230 secs
lola: 138321336 markings, 184397777 edges, 66945 markings/sec, 235 secs
lola: 138327307 markings, 184406735 edges, 1194 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (F ((p21 <= p8))) OR (G ((F ((2 <= p15)) AND F ((p21 <= p8)))) OR (F ((1 <= p8)) OR (p8 + 1 <= p21))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F ((p21 <= p8))) OR (G ((F ((2 <= p15)) AND F ((p21 <= p8)))) OR (F ((1 <= p8)) OR (p8 + 1 <= p21))))))
lola: processed formula length: 113
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 80003 markings, 80003 edges
lola: ========================================
lola: subprocess 3 will run for 552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((p17 <= 2)) AND (2 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((p17 <= 2)) AND (2 <= p16))))
lola: processed formula length: 39
lola: 69 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: 3963610 markings, 5263677 edges, 792722 markings/sec, 0 secs
lola: 7817640 markings, 10397773 edges, 770806 markings/sec, 5 secs
lola: 11586439 markings, 15426634 edges, 753760 markings/sec, 10 secs
lola: 15284999 markings, 20357120 edges, 739712 markings/sec, 15 secs
lola: 18956509 markings, 25254294 edges, 734302 markings/sec, 20 secs
lola: 22521936 markings, 30002346 edges, 713085 markings/sec, 25 secs
lola: 26083195 markings, 34754144 edges, 712252 markings/sec, 30 secs
lola: 29634790 markings, 39491449 edges, 710319 markings/sec, 35 secs
lola: 33239356 markings, 44298207 edges, 720913 markings/sec, 40 secs
lola: 36672846 markings, 48873459 edges, 686698 markings/sec, 45 secs
lola: 40234011 markings, 53620013 edges, 712233 markings/sec, 50 secs
lola: 43726985 markings, 58279388 edges, 698595 markings/sec, 55 secs
lola: 47212131 markings, 62927020 edges, 697029 markings/sec, 60 secs
lola: 50700531 markings, 67579533 edges, 697680 markings/sec, 65 secs
lola: 54152393 markings, 72177239 edges, 690372 markings/sec, 70 secs
lola: 57599619 markings, 76777991 edges, 689445 markings/sec, 75 secs
lola: 60948305 markings, 81240936 edges, 669737 markings/sec, 80 secs
lola: 64477284 markings, 85944316 edges, 705796 markings/sec, 85 secs
lola: 67971161 markings, 90605045 edges, 698775 markings/sec, 90 secs
lola: 71486742 markings, 95288328 edges, 703116 markings/sec, 95 secs
lola: 74924755 markings, 99875261 edges, 687603 markings/sec, 100 secs
lola: 78362256 markings, 104461426 edges, 687500 markings/sec, 105 secs
lola: 81740252 markings, 108961614 edges, 675599 markings/sec, 110 secs
lola: 85019054 markings, 113336458 edges, 655760 markings/sec, 115 secs
lola: 88372624 markings, 117806729 edges, 670714 markings/sec, 120 secs
lola: 91637744 markings, 122159978 edges, 653024 markings/sec, 125 secs
lola: 91886678 markings, 122488209 edges, 49787 markings/sec, 130 secs
lola: 93654154 markings, 124849674 edges, 353495 markings/sec, 135 secs
lola: 95014958 markings, 126660062 edges, 272161 markings/sec, 140 secs
lola: 95203985 markings, 126913600 edges, 37805 markings/sec, 145 secs
lola: 97968129 markings, 130599745 edges, 552829 markings/sec, 150 secs
lola: 100747391 markings, 134308571 edges, 555852 markings/sec, 155 secs
lola: 100903655 markings, 134512962 edges, 31253 markings/sec, 160 secs
lola: 101570320 markings, 135402943 edges, 133333 markings/sec, 165 secs
lola: 103886295 markings, 138488025 edges, 463195 markings/sec, 170 secs
lola: 103886295 markings, 138488025 edges, 0 markings/sec, 175 secs
lola: 105568790 markings, 140730549 edges, 336499 markings/sec, 180 secs
lola: 106921157 markings, 142539065 edges, 270473 markings/sec, 185 secs
lola: 108990974 markings, 145293738 edges, 413963 markings/sec, 190 secs
lola: 110388659 markings, 147160231 edges, 279537 markings/sec, 195 secs
lola: 112245532 markings, 149635493 edges, 371375 markings/sec, 200 secs
lola: 113336368 markings, 151091721 edges, 218167 markings/sec, 205 secs
lola: 113352229 markings, 151114118 edges, 3172 markings/sec, 210 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 615 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((3 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((3 <= p6)))))
lola: processed formula length: 25
lola: 69 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: 80003 markings, 80003 edges
lola: ========================================
lola: subprocess 5 will run for 769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p8 <= 0))))
lola: processed formula length: 21
lola: 69 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: 100000 markings, 100000 edges
lola: ========================================
lola: subprocess 6 will run for 1026 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G ((p21 <= p11)) OR G ((p6 <= p11)))) U X (F ((p21 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((G ((p21 <= p11)) OR G ((p6 <= p11)))) U X (F ((p21 <= p11))))
lola: processed formula length: 66
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 1539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p3 <= p21)) AND ((2 <= p6) OR (p3 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p3 <= p21)) AND ((2 <= p6) OR (p3 <= p21)))))
lola: processed formula length: 56
lola: 69 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: 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: 420018 markings, 540024 edges
lola: ========================================
lola: subprocess 8 will run for 3078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p8 + 1 <= p19))) AND (p19 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p19 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p19 <= p8)
lola: processed formula length: 11
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F ((G ((p10 + 1 <= p20)) OR (p1 <= p15))) AND (((p20 <= p10) U (p16 <= p3)) OR X (F ((G ((p10 + 1 <= p20)) OR (p1 <= p15)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((G ((p10 + 1 <= p20)) OR (p1 <= p15))) AND (((p20 <= p10) U (p16 <= p3)) OR X (F ((G ((p10 + 1 <= p20)) OR (p1 <= p15)))))))
lola: processed formula length: 131
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 3735765 markings, 4963539 edges, 747153 markings/sec, 0 secs
lola: 7439357 markings, 9899159 edges, 740718 markings/sec, 5 secs
lola: 11050024 markings, 14709725 edges, 722133 markings/sec, 10 secs
lola: 14640999 markings, 19500601 edges, 718195 markings/sec, 15 secs
lola: 18177486 markings, 24225680 edges, 707297 markings/sec, 20 secs
lola: 21683955 markings, 28885272 edges, 701294 markings/sec, 25 secs
lola: 25184983 markings, 33566711 edges, 700206 markings/sec, 30 secs
lola: 28629918 markings, 38164008 edges, 688987 markings/sec, 35 secs
lola: 32056735 markings, 42734129 edges, 685363 markings/sec, 40 secs
lola: 35470946 markings, 47285342 edges, 682842 markings/sec, 45 secs
lola: 38877410 markings, 51824933 edges, 681293 markings/sec, 50 secs
lola: 42261831 markings, 56331460 edges, 676884 markings/sec, 55 secs
lola: 45602219 markings, 60780962 edges, 668078 markings/sec, 60 secs
lola: 49072832 markings, 65407753 edges, 694123 markings/sec, 65 secs
lola: 52495497 markings, 69971645 edges, 684533 markings/sec, 70 secs
lola: 55870871 markings, 74469328 edges, 675075 markings/sec, 75 secs
lola: 59261760 markings, 79000123 edges, 678178 markings/sec, 80 secs
lola: 62602629 markings, 83452035 edges, 668174 markings/sec, 85 secs
lola: 65925477 markings, 87883654 edges, 664570 markings/sec, 90 secs
lola: 69205142 markings, 92245602 edges, 655933 markings/sec, 95 secs
lola: 72581513 markings, 96759506 edges, 675274 markings/sec, 100 secs
lola: 75636109 markings, 100834015 edges, 610919 markings/sec, 105 secs
lola: 78896248 markings, 105174064 edges, 652028 markings/sec, 110 secs
lola: 82226204 markings, 109616798 edges, 665991 markings/sec, 115 secs
lola: 85516064 markings, 114011490 edges, 657972 markings/sec, 120 secs
lola: 88775550 markings, 118353091 edges, 651897 markings/sec, 125 secs
lola: 91944455 markings, 122573877 edges, 633781 markings/sec, 130 secs
lola: 95360461 markings, 127127782 edges, 683201 markings/sec, 135 secs
lola: 98717132 markings, 131594399 edges, 671334 markings/sec, 140 secs
lola: 102035309 markings, 136029851 edges, 663635 markings/sec, 145 secs
lola: 105360175 markings, 140457257 edges, 664973 markings/sec, 150 secs
lola: 108627346 markings, 144807704 edges, 653434 markings/sec, 155 secs
lola: 111870897 markings, 149133403 edges, 648710 markings/sec, 160 secs
lola: 113570896 markings, 151413782 edges, 340000 markings/sec, 165 secs
lola: 114950090 markings, 153242555 edges, 275839 markings/sec, 170 secs
lola: 116666362 markings, 155543126 edges, 343254 markings/sec, 175 secs
lola: 117442756 markings, 156560547 edges, 155279 markings/sec, 180 secs
lola: 119412312 markings, 159189002 edges, 393911 markings/sec, 185 secs
lola: 119636876 markings, 159491661 edges, 44913 markings/sec, 190 secs
lola: 122376069 markings, 163150368 edges, 547839 markings/sec, 195 secs
lola: 124819092 markings, 166395631 edges, 488605 markings/sec, 200 secs
lola: 125003050 markings, 166640758 edges, 36792 markings/sec, 205 secs
lola: 126790458 markings, 169026944 edges, 357482 markings/sec, 210 secs
lola: 127614525 markings, 170137891 edges, 164813 markings/sec, 215 secs
lola: 129068518 markings, 172078838 edges, 290799 markings/sec, 220 secs
lola: 130588006 markings, 174088019 edges, 303898 markings/sec, 225 secs
lola: 131207767 markings, 174927644 edges, 123952 markings/sec, 230 secs
lola: 133425780 markings, 177882079 edges, 443603 markings/sec, 235 secs
lola: 136219230 markings, 181604687 edges, 558690 markings/sec, 240 secs
lola: 136342415 markings, 181759456 edges, 24637 markings/sec, 245 secs
lola: 138214955 markings, 184268214 edges, 374508 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (F ((G ((p17 <= 2)) AND (2 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((p17 <= 2)) AND (2 <= p16))))
lola: processed formula length: 39
lola: 69 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: 3835094 markings, 5092548 edges, 767019 markings/sec, 0 secs
lola: 7671258 markings, 10206697 edges, 767233 markings/sec, 5 secs
lola: 11451023 markings, 15246250 edges, 755953 markings/sec, 10 secs
lola: 15157631 markings, 20186069 edges, 741322 markings/sec, 15 secs
lola: 18833818 markings, 25090257 edges, 735237 markings/sec, 20 secs
lola: 22419866 markings, 29869241 edges, 717210 markings/sec, 25 secs
lola: 26016652 markings, 34664330 edges, 719357 markings/sec, 30 secs
lola: 29567023 markings, 39399798 edges, 710074 markings/sec, 35 secs
lola: 33196166 markings, 44236718 edges, 725829 markings/sec, 40 secs
lola: 36780555 markings, 49019916 edges, 716878 markings/sec, 45 secs
lola: 40343174 markings, 53763846 edges, 712524 markings/sec, 50 secs
lola: 43804813 markings, 58385543 edges, 692328 markings/sec, 55 secs
lola: 47294708 markings, 63035496 edges, 697979 markings/sec, 60 secs
lola: 50797594 markings, 67705123 edges, 700577 markings/sec, 65 secs
lola: 54241551 markings, 72300973 edges, 688791 markings/sec, 70 secs
lola: 57710820 markings, 76924790 edges, 693854 markings/sec, 75 secs
lola: 61084248 markings, 81424847 edges, 674686 markings/sec, 80 secs
lola: 64647471 markings, 86169592 edges, 712645 markings/sec, 85 secs
lola: 68153593 markings, 90848688 edges, 701224 markings/sec, 90 secs
lola: 71651406 markings, 95512600 edges, 699563 markings/sec, 95 secs
lola: 75118082 markings, 100135248 edges, 693335 markings/sec, 100 secs
lola: 78581058 markings, 104749624 edges, 692595 markings/sec, 105 secs
lola: 81997921 markings, 109304833 edges, 683373 markings/sec, 110 secs
lola: 85350905 markings, 113774226 edges, 670597 markings/sec, 115 secs
lola: 88728051 markings, 118279861 edges, 675429 markings/sec, 120 secs
lola: 91879372 markings, 122481586 edges, 630264 markings/sec, 125 secs
lola: 94162915 markings, 125526454 edges, 456709 markings/sec, 130 secs
lola: 96561524 markings, 128723135 edges, 479722 markings/sec, 135 secs
lola: 97538546 markings, 130025381 edges, 195404 markings/sec, 140 secs
lola: 99540141 markings, 132697727 edges, 400319 markings/sec, 145 secs
lola: 100699757 markings, 134241434 edges, 231923 markings/sec, 150 secs
lola: 103562184 markings, 138060690 edges, 572485 markings/sec, 155 secs
lola: 104550963 markings, 139373834 edges, 197756 markings/sec, 160 secs
lola: 106356729 markings, 141782437 edges, 361153 markings/sec, 165 secs
lola: 108741011 markings, 144962824 edges, 476856 markings/sec, 170 secs
lola: 109844632 markings, 146434204 edges, 220724 markings/sec, 175 secs
lola: 111832690 markings, 149086243 edges, 397612 markings/sec, 180 secs
lola: 113137237 markings, 150823029 edges, 260909 markings/sec, 185 secs
lola: 113334327 markings, 151088658 edges, 39418 markings/sec, 190 secs
lola: 113344541 markings, 151103979 edges, 2043 markings/sec, 195 secs
lola: 113344651 markings, 151104146 edges, 22 markings/sec, 200 secs
lola: 113346687 markings, 151107199 edges, 407 markings/sec, 205 secs
lola: 113350711 markings, 151112599 edges, 805 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (G ((p8 + 1 <= p19))) AND (p19 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p19 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p19 <= p8)
lola: processed formula length: 11
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
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: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((p8 + 1 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p8 + 1 <= p19)))
lola: processed formula length: 23
lola: 69 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: 100004 markings, 100005 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no unknown no no no no yes
lola:
preliminary result: no unknown no unknown no no no no yes
lola: memory consumption: 3460 KB
lola: time consumption: 990 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="FMS-PT-20000"
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 FMS-PT-20000, 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 r170-smll-158987815400097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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