Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r170-oct2-162089287000029.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is PhilosophersDyn-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287000029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 99M
-rw-r--r-- 1 mcc users 617K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.3M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 56M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 39K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 597K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K Mar 27 09:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 27 09:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Mar 25 11:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.4M Mar 25 11:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 25K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 19M May 5 16:51 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 PhilosophersDyn-PT-20-00
FORMULA_NAME PhilosophersDyn-PT-20-01
FORMULA_NAME PhilosophersDyn-PT-20-02
FORMULA_NAME PhilosophersDyn-PT-20-03
FORMULA_NAME PhilosophersDyn-PT-20-04
FORMULA_NAME PhilosophersDyn-PT-20-05
FORMULA_NAME PhilosophersDyn-PT-20-06
FORMULA_NAME PhilosophersDyn-PT-20-07
FORMULA_NAME PhilosophersDyn-PT-20-08
FORMULA_NAME PhilosophersDyn-PT-20-09
FORMULA_NAME PhilosophersDyn-PT-20-10
FORMULA_NAME PhilosophersDyn-PT-20-11
FORMULA_NAME PhilosophersDyn-PT-20-12
FORMULA_NAME PhilosophersDyn-PT-20-13
FORMULA_NAME PhilosophersDyn-PT-20-14
FORMULA_NAME PhilosophersDyn-PT-20-15

=== Now, execution of the tool begins

BK_START 1621372148060

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 21:09:09] [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-18 21:09:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 21:09:11] [INFO ] Load time of PNML (sax parser for PT used): 1030 ms
[2021-05-18 21:09:11] [INFO ] Transformed 540 places.
[2021-05-18 21:09:11] [INFO ] Transformed 17220 transitions.
[2021-05-18 21:09:11] [INFO ] Parsed PT model containing 540 places and 17220 transitions in 1303 ms.
Ensure Unique test removed 190 transitions
Reduce redundant transitions removed 190 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 104 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 11449 resets, run finished after 10028 ms. (steps per millisecond=9 ) properties seen :[1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1]
[2021-05-18 21:09:21] [INFO ] Flow matrix only has 15510 transitions (discarded 1520 similar events)
// Phase 1: matrix 15510 rows 540 cols
[2021-05-18 21:09:23] [INFO ] Computed 79 place invariants in 1489 ms
[2021-05-18 21:09:23] [INFO ] [Real]Absence check using 53 positive place invariants in 300 ms returned sat
[2021-05-18 21:09:23] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 206 ms returned unsat
[2021-05-18 21:09:24] [INFO ] [Real]Absence check using 53 positive place invariants in 30 ms returned sat
[2021-05-18 21:09:24] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 25 ms returned sat
[2021-05-18 21:09:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:09:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 21:09:43] [INFO ] [Real]Absence check using state equation in 19870 ms returned (error "Failed to check-sat")
[2021-05-18 21:09:44] [INFO ] [Real]Absence check using 53 positive place invariants in 18 ms returned unsat
[2021-05-18 21:09:44] [INFO ] [Real]Absence check using 53 positive place invariants in 52 ms returned unsat
[2021-05-18 21:09:44] [INFO ] [Real]Absence check using 53 positive place invariants in 41 ms returned sat
[2021-05-18 21:09:44] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 63 ms returned unsat
[2021-05-18 21:09:44] [INFO ] [Real]Absence check using 53 positive place invariants in 9 ms returned unsat
[2021-05-18 21:09:44] [INFO ] [Real]Absence check using 53 positive place invariants in 25 ms returned sat
[2021-05-18 21:09:44] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 28 ms returned sat
[2021-05-18 21:09:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:10:04] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 21:10:04] [INFO ] [Real]Absence check using state equation in 19901 ms returned unknown
[2021-05-18 21:10:04] [INFO ] [Real]Absence check using 53 positive place invariants in 19 ms returned unsat
[2021-05-18 21:10:04] [INFO ] [Real]Absence check using 53 positive place invariants in 85 ms returned sat
[2021-05-18 21:10:04] [INFO ] [Real]Absence check using 53 positive and 26 generalized place invariants in 23 ms returned sat
[2021-05-18 21:10:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 21:10:24] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 21:10:24] [INFO ] [Real]Absence check using state equation in 19875 ms returned (error "Failed to check-sat")
[2021-05-18 21:10:24] [INFO ] [Real]Absence check using 53 positive place invariants in 4 ms returned unsat
[2021-05-18 21:10:24] [INFO ] [Real]Absence check using 53 positive place invariants in 36 ms returned unsat
[2021-05-18 21:10:24] [INFO ] [Real]Absence check using 53 positive place invariants in 74 ms returned unsat
[2021-05-18 21:10:24] [INFO ] [Real]Absence check using 53 positive place invariants in 4 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 11 simplifications.
[2021-05-18 21:10:26] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-18 21:10:26] [INFO ] Flatten gal took : 1145 ms
FORMULA PhilosophersDyn-PT-20-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-20-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 21:10:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 21:10:27] [INFO ] Flatten gal took : 856 ms
[2021-05-18 21:10:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PhilosophersDyn-PT-20-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 21:10:28] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 21 ms.
[2021-05-18 21:10:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 124 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PhilosophersDyn-PT-20 @ 3570 seconds

FORMULA PhilosophersDyn-PT-20-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-20-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-20-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-20-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-20-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-20-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-20-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3403
rslt: Output for LTLCardinality @ PhilosophersDyn-PT-20

{
"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": "Tue May 18 21:10:28 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 488
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 120,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 120,
"visible_transitions": 0
},
"processed": "X (X ((X ((X ((p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373 <= p126 + p138 + p140 + p174 + p185 + p200 + p213 + p237 + p244 + p277 + p313 + p381 + p31 + p535 + p486 + p47 + p432 + p56 + p71 + p361)) AND ((1 <= p4 + p150 + p159 + p170 + p184 + p218 + p261 + p275 + p308 + p319 + p325 + p353 + p362 + p394 + p462 + p523 + p520 + p46 + p76 + p97) U (2 <= p115 + p130 + p147 + p168 + p245 + p259 + p292 + p331 + p345 + p359 + p376 + p29 + p34 + p469 + p468 + p423 + p62 + p393 + p89 + p91)))) OR (p0 + p102 + p129 + p137 + p187 + p250 + p295 + p339 + p340 + p356 + p390 + p461 + p25 + p496 + p482 + p477 + p447 + p44 + p57 + p87 <= p113 + p151 + p182 + p190 + p209 + p273 + p281 + p282 + p343 + p355 + p367 + p385 + p420 + p35 + p507 + p476 + p465 + p434 + p51 + p64))))",
"processed_size": 857,
"rewrites": 41
},
"result":
{
"edges": 76,
"markings": 60,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 569
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 60,
"visible_transitions": 0
},
"processed": "(F ((2 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373)) U X (((p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497 <= p113 + p151 + p182 + p190 + p209 + p273 + p281 + p282 + p343 + p355 + p367 + p385 + p420 + p35 + p507 + p476 + p465 + p434 + p51 + p64) R F ((p113 + p151 + p182 + p190 + p209 + p273 + p281 + p282 + p343 + p355 + p367 + p385 + p420 + p35 + p507 + p476 + p465 + p434 + p51 + p64 + 1 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497)))))",
"processed_size": 716,
"rewrites": 41
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 683
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (X (F ((X (F ((p504 + 1 <= p508))) AND F (G ((p308 <= p482))))))))",
"processed_size": 71,
"rewrites": 41
},
"result":
{
"edges": 10,
"markings": 10,
"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": 854
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (X ((X (G ((G ((p213 + 1 <= p475)) OR G ((p0 + 1 <= p2))))) AND F (G ((p0 + 1 <= p2)))))))",
"processed_size": 95,
"rewrites": 41
},
"result":
{
"edges": 12,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1138
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "X ((p295 <= p257))",
"processed_size": 18,
"rewrites": 41
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1707
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "G (F ((p416 <= p62)))",
"processed_size": 21,
"rewrites": 41
},
"result":
{
"edges": 9614,
"markings": 3440,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 3403
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (G ((1 <= p192)))",
"processed_size": 19,
"rewrites": 41
},
"result":
{
"edges": 253,
"markings": 127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3403
},
"exit":
{
"localtimelimitreached": false
},
"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 ((p307 + 1 <= p523)))",
"processed_size": 26,
"rewrites": 41
},
"result":
{
"edges": 12,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 942832,
"runtime": 167.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X((X((X(**) AND (** U **))) OR **))) : (F(**) U X((* R F(*)))) : F(G(*)) : X(X(X(F((X(F(**)) AND F(G(**))))))) : X(X(X((X(G((G(*) OR G(*)))) AND F(G(*)))))) : (X(**) AND (F(*) OR X(G(**)))) : (G(F(**)) OR X(G(**)))"
},
"net":
{
"arcs": 132420,
"conflict_clusters": 1,
"places": 540,
"places_significant": 461,
"singleton_clusters": 0,
"transitions": 17030
},
"result":
{
"preliminary_value": "no no no no no no no ",
"value": "no no no no no no no "
},
"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: 17570/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 17280
lola: finding significant places
lola: 540 places, 17030 transitions, 461 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: X (X ((X ((X ((p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373 <= p126 + p138 + p140 + p174 + p185 + p200 + p213 + p237 + p244 + p277 + p313 + p381 + p31 + p535 + p486 + p47 + p432 + p56 + p71 + p361)) AND ((1 <= p4 + p150 + p159 + p170 + p184 + p218 + p261 + p275 + p308 + p319 + p325 + p353 + p362 + p394 + p462 + p523 + p520 + p46 + p76 + p97) U (2 <= p115 + p130 + p147 + p168 + p245 + p259 + p292 + p331 + p345 + p359 + p376 + p29 + p34 + p469 + p468 + p423 + p62 + p393 + p89 + p91)))) OR (p0 + p102 + p129 + p137 + p187 + p250 + p295 + p339 + p340 + p356 + p390 + p461 + p25 + p496 + p482 + p477 + p447 + p44 + p57 + p87 <= p113 + p151 + p182 + p190 + p209 + p273 + p281 + p282 + p343 + p355 + p367 + p385 + p420 + p35 + p507 + p476 + p465 + p434 + p51 + p64)))) : (F ((2 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373)) U X (NOT(((p113 + p151 + p182 + p190 + p209 + p273 + p281 + p282 + p343 + p355 + p367 + p385 + p420 + p35 + p507 + p476 + p465 + p434 + p51 + p64 + 1 <= p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497) U G ((p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497 <= p113 + p151 + p182 + p190 + p209 + p273 + p281 + p282 + p343 + p355 + p367 + p385 + p420 + p35 + p507 + p476 + p465 + p434 + p51 + p64)))))) : F (NOT(F (X ((p523 <= p307))))) : X (F (X (X ((F (X ((p504 + 1 <= p508))) AND F (G (X ((p308 <= p482))))))))) : X (X (X ((NOT(F (X ((F ((p475 <= p213)) AND F ((p2 <= p0)))))) AND NOT(G (F ((p2 <= p0)))))))) : NOT((G ((p464 <= p389)) U NOT(X ((p295 <= p257))))) : (G (F ((p416 <= p62))) OR G (X ((1 <= p192))))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:332
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X ((X ((p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373 <= p126 + p138 + p140 + p174 + p185 + p200 + p213 + p237 + p244 + p277 + p313 + p381 + p31 + p535 + p486 + p47 + p432 + p56 + p71 + p361)) AND ((1 <= p4 + p150 + p159 + p170 + p184 + p218 + p261 + p275 + p308 + p319 + p325 + p353 + p362 + p394 + p46... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X ((X ((p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373 <= p126 + p138 + p140 + p174 + p185 + p200 + p213 + p237 + p244 + p277 + p313 + p381 + p31 + p535 + p486 + p47 + p432 + p56 + p71 + p361)) AND ((1 <= p4 + p150 + p159 + p170 + p184 + p218 + p261 + p275 + p308 + p319 + p325 + p353 + p362 + p394 + p46... (shortened)
lola: processed formula length: 857
lola: 41 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 60 markings, 76 edges
lola: ========================================
lola: subprocess 1 will run for 569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((2 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373)) U X (((p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497 <= p113 + p151 + p182 + p190 + p209 + p273 + p281 + p282 + p343 + p355 + p367 + p385 + p420 + p35 + p507 + p47... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((2 <= p154 + p156 + p192 + p212 + p214 + p263 + p286 + p304 + p307 + p348 + p371 + p372 + p427 + p505 + p508 + p42 + p443 + p403 + p72 + p373)) U X (((p119 + p121 + p160 + p173 + p177 + p258 + p268 + p291 + p323 + p94 + p379 + p58 + p429 + p439 + p451 + p464 + p475 + p33 + p489 + p497 <= p113 + p151 + p182 + p190 + p209 + p273 + p281 + p282 + p343 + p355 + p367 + p385 + p420 + p35 + p507 + p47... (shortened)
lola: processed formula length: 716
lola: 41 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((X (F ((p504 + 1 <= p508))) AND F (G ((p308 <= p482))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((X (F ((p504 + 1 <= p508))) AND F (G ((p308 <= p482))))))))
lola: processed formula length: 71
lola: 41 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 854 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((X (G ((G ((p213 + 1 <= p475)) OR G ((p0 + 1 <= p2))))) AND F (G ((p0 + 1 <= p2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((X (G ((G ((p213 + 1 <= p475)) OR G ((p0 + 1 <= p2))))) AND F (G ((p0 + 1 <= p2)))))))
lola: processed formula length: 95
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 11 markings, 12 edges
lola: ========================================
lola: subprocess 4 will run for 1138 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p295 <= p257)) AND (F ((p389 + 1 <= p464)) OR X (G ((p295 <= p257)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 1138 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p295 <= p257))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p295 <= p257))
lola: processed formula length: 18
lola: 41 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: 14 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 1707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p416 <= p62))) OR X (G ((1 <= p192))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 1707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p416 <= p62)))
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 ((p416 <= p62)))
lola: processed formula length: 21
lola: 41 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: 1434 markings, 3791 edges, 287 markings/sec, 0 secs
lola: 2853 markings, 7931 edges, 284 markings/sec, 5 secs
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: 3440 markings, 9614 edges
lola: ========================================
lola: subprocess 6 will run for 3403 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p192)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p192)))
lola: processed formula length: 19
lola: 41 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: 127 markings, 253 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 3403 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p307 + 1 <= p523)))
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 ((p307 + 1 <= p523)))
lola: processed formula length: 26
lola: 41 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: 11 markings, 12 edges
lola: RESULT
lola:
SUMMARY: no no no no no no no
lola:
preliminary result: no no no no no no no
lola: ========================================
lola: memory consumption: 942832 KB
lola: time consumption: 167 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="PhilosophersDyn-PT-20"
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 PhilosophersDyn-PT-20, 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-oct2-162089287000029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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