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.r056-oct2-162038334600101.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 ClientsAndServers-PT-N0020P4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334600101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.2K 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 ClientsAndServers-PT-N0020P4-00
FORMULA_NAME ClientsAndServers-PT-N0020P4-01
FORMULA_NAME ClientsAndServers-PT-N0020P4-02
FORMULA_NAME ClientsAndServers-PT-N0020P4-03
FORMULA_NAME ClientsAndServers-PT-N0020P4-04
FORMULA_NAME ClientsAndServers-PT-N0020P4-05
FORMULA_NAME ClientsAndServers-PT-N0020P4-06
FORMULA_NAME ClientsAndServers-PT-N0020P4-07
FORMULA_NAME ClientsAndServers-PT-N0020P4-08
FORMULA_NAME ClientsAndServers-PT-N0020P4-09
FORMULA_NAME ClientsAndServers-PT-N0020P4-10
FORMULA_NAME ClientsAndServers-PT-N0020P4-11
FORMULA_NAME ClientsAndServers-PT-N0020P4-12
FORMULA_NAME ClientsAndServers-PT-N0020P4-13
FORMULA_NAME ClientsAndServers-PT-N0020P4-14
FORMULA_NAME ClientsAndServers-PT-N0020P4-15

=== Now, execution of the tool begins

BK_START 1620897719294

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 09:22:00] [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-13 09:22:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:22:00] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-13 09:22:00] [INFO ] Transformed 25 places.
[2021-05-13 09:22:00] [INFO ] Transformed 18 transitions.
[2021-05-13 09:22:00] [INFO ] Parsed PT model containing 25 places and 18 transitions in 50 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100018 steps, including 24 resets, run finished after 56 ms. (steps per millisecond=1786 ) properties seen :[0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 18 rows 25 cols
[2021-05-13 09:22:00] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-13 09:22:00] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned unsat
[2021-05-13 09:22:00] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-13 09:22:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-13 09:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-13 09:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-13 09:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2021-05-13 09:22:01] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned unsat
[2021-05-13 09:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-13 09:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned unsat
[2021-05-13 09:22:01] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
[2021-05-13 09:22:01] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-13 09:22:01] [INFO ] Flatten gal took : 19 ms
FORMULA ClientsAndServers-PT-N0020P4-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:22:01] [INFO ] Flatten gal took : 4 ms
[2021-05-13 09:22:01] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 09:22:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ClientsAndServers-PT-N0020P4 @ 3570 seconds

FORMULA ClientsAndServers-PT-N0020P4-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P4-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2938
rslt: Output for LTLCardinality @ ClientsAndServers-PT-N0020P4

{
"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": "Thu May 13 09:22:01 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (X (F ((p16 <= p17)))) AND (F ((p3 <= p0)) U (p10 + 1 <= p16))))",
"processed_size": 70,
"rewrites": 96
},
"result":
{
"edges": 2103,
"markings": 2102,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"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 (F ((2 <= p17)))",
"processed_size": 18,
"rewrites": 96
},
"result":
{
"edges": 1727,
"markings": 1726,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 356
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((p3 + 1 <= p1))",
"processed_size": 18,
"rewrites": 96
},
"result":
{
"edges": 180,
"markings": 180,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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 (X ((p3 + 1 <= p1)))",
"processed_size": 22,
"rewrites": 96
},
"result":
{
"edges": 1289,
"markings": 1289,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G ((p23 + 1 <= p15))))",
"processed_size": 28,
"rewrites": 96
},
"result":
{
"edges": 1289,
"markings": 1289,
"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": 509
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((p16 <= p10)))",
"processed_size": 20,
"rewrites": 96
},
"result":
{
"edges": 1289,
"markings": 1289,
"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": 594
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 649
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p5 + 1 <= p22) R X (G ((p20 + 1 <= p16))))",
"processed_size": 44,
"rewrites": 96
},
"result":
{
"edges": 1289,
"markings": 1289,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": null
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 649
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"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": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (X (G ((p13 <= p20)))) OR (G ((p22 <= 0)) AND F (G ((p13 <= p20))))))",
"processed_size": 75,
"rewrites": 96
},
"result":
{
"edges": 1323,
"markings": 1302,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"compoundnumber": 7,
"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": 812
},
"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 ((p24 <= p18)))",
"processed_size": 20,
"rewrites": 96
},
"result":
{
"edges": 81059,
"markings": 52159,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1082
},
"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": "F (G ((p4 <= p2)))",
"processed_size": 18,
"rewrites": 96
},
"result":
{
"edges": 572,
"markings": 571,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1624
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F ((F (G ((2 <= p22))) AND (p22 <= 1)))",
"processed_size": 39,
"rewrites": 96
},
"result":
{
"edges": 180,
"markings": 180,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": 3248
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((F ((p8 <= p24)) AND (((3 <= p4) U (p10 <= p22)) OR (p8 <= p24)))))",
"processed_size": 73,
"rewrites": 96
},
"result":
{
"edges": 1291,
"markings": 1290,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p5 + 1 <= p22) R X (G ((p20 + 1 <= p16))))",
"processed_size": 44,
"rewrites": 96
},
"result":
{
"edges": 1289,
"markings": 1289,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3444,
"runtime": 632.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((F(G(**)) AND **)) : X((X(X(F(**))) AND (F(**) U **))) : X(F(**)) : (X(X(**)) OR (G(*) AND X(X(F(**))))) : (G(F((G(*) OR (G(*) AND *)))) AND X(**)) : X(X(G(*))) : X(G(**)) : ((* R X(G(*))) OR X(((* R F(*)) OR **))) : G(F(**)) : F((X(X(G(**))) OR (G(*) AND F(G(**))))) : F(G((F(**) AND ((** U **) OR **)))) : F(G(**))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "no no no no no no no unknown no no no no ",
"value": "no no no no no no no unknown 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: 43/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 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: ((((p12 <= p11) AND (2 <= p22)) U (0 <= 0)) U (F (X (G ((2 <= p22)))) AND (p22 <= 1))) : X ((NOT(G (X (NOT(X ((p16 <= p17)))))) AND (F ((p3 <= p0)) U (p10 + 1 <= p16)))) : (F (X ((F ((X ((p14 <= p0)) AND (3 <= p23))) U (0 <= 0)))) AND F (X ((2 <= p17)))) : (NOT(F ((p1 <= p3))) U X (X ((p3 + 1 <= p1)))) : (G (NOT(G (X (G ((((2 <= p24) U F ((p24 <= 1))) U (3 <= p12))))))) AND X ((p23 <= p9))) : X (G (NOT(F (X ((p15 <= p23)))))) : (((X ((p11 <= p15)) AND (p15 + 1 <= p11)) U (0 <= 0)) AND X (G ((p16 <= p10)))) : (NOT(((p22 <= p5) U F (X ((p16 <= p20))))) OR X ((NOT(((p0 <= p4) U G ((p22 <= p6)))) OR (p0 <= p4)))) : X (G (F ((p24 <= p18)))) : F ((G (NOT(F ((1 <= p22)))) U G (X (X ((p13 <= p20)))))) : F (X (((3 <= p4) U NOT(F (NOT((X (((3 <= p4) U (p10 <= p22))) U X ((p8 <= p24))))))))) : F (((0 <= 0) U G ((p4 <= p2))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:332
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: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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:341
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (F ((p16 <= p17)))) AND (F ((p3 <= p0)) U (p10 + 1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (F ((p16 <= p17)))) AND (F ((p3 <= p0)) U (p10 + 1 <= p16))))
lola: processed formula length: 70
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 2102 markings, 2103 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((2 <= p17)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((2 <= p17)))
lola: processed formula length: 18
lola: 96 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: 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: 1726 markings, 1727 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((p3 + 1 <= p1))) OR (G ((p3 + 1 <= p1)) AND X (X (F ((p3 + 1 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p3 + 1 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p3 + 1 <= p1))
lola: processed formula length: 18
lola: 96 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: 180 markings, 180 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((p3 + 1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((p3 + 1 <= p1)))
lola: processed formula length: 22
lola: 96 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: 1289 markings, 1289 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((G ((p12 <= 2)) OR (G ((2 <= p24)) AND (p12 <= 2))))) AND X ((p23 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p12 <= 2)) OR (G ((2 <= p24)) AND (p12 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p12 <= 2)) OR (G ((2 <= p24)) AND (p12 <= 2)))))
lola: processed formula length: 59
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 882 markings, 882 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p23 + 1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p23 + 1 <= p15))))
lola: processed formula length: 28
lola: 96 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: 1289 markings, 1289 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p16 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p16 <= p10)))
lola: processed formula length: 20
lola: 96 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: 1289 markings, 1289 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p5 + 1 <= p22) R X (G ((p20 + 1 <= p16)))) OR X ((((p4 + 1 <= p0) R F ((p6 + 1 <= p22))) OR (p0 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p4 + 1 <= p0) R F ((p6 + 1 <= p22))) OR (p0 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p4 + 1 <= p0) R F ((p6 + 1 <= p22))) OR (p0 <= p4)))
lola: processed formula length: 58
lola: 96 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: 2997533 markings, 8937746 edges, 599507 markings/sec, 0 secs
lola: 5715007 markings, 17298691 edges, 543495 markings/sec, 5 secs
lola: 8252283 markings, 25214030 edges, 507455 markings/sec, 10 secs
lola: 10928674 markings, 33583064 edges, 535278 markings/sec, 15 secs
lola: 13426809 markings, 41497837 edges, 499627 markings/sec, 20 secs
lola: 16015733 markings, 49731394 edges, 517785 markings/sec, 25 secs
lola: 18742265 markings, 58257830 edges, 545306 markings/sec, 30 secs
lola: 20941803 markings, 65867253 edges, 439908 markings/sec, 35 secs
lola: 23007439 markings, 73232156 edges, 413127 markings/sec, 40 secs
lola: 24989383 markings, 80388130 edges, 396389 markings/sec, 45 secs
lola: 27035537 markings, 87764160 edges, 409231 markings/sec, 50 secs
lola: 29323133 markings, 96045547 edges, 457519 markings/sec, 55 secs
lola: 31567899 markings, 104240163 edges, 448953 markings/sec, 60 secs
lola: 33842361 markings, 112571815 edges, 454892 markings/sec, 65 secs
lola: 36448449 markings, 121428654 edges, 521218 markings/sec, 70 secs
lola: 39064631 markings, 130090165 edges, 523236 markings/sec, 75 secs
lola: 41328223 markings, 138141219 edges, 452718 markings/sec, 80 secs
lola: 43516005 markings, 146000881 edges, 437556 markings/sec, 85 secs
lola: 45663410 markings, 153752979 edges, 429481 markings/sec, 90 secs
lola: 47936073 markings, 162019196 edges, 454533 markings/sec, 95 secs
lola: 50168437 markings, 170126122 edges, 446473 markings/sec, 100 secs
lola: 52384809 markings, 178235495 edges, 443274 markings/sec, 105 secs
lola: 54908427 markings, 186921653 edges, 504724 markings/sec, 110 secs
lola: 57572745 markings, 195689980 edges, 532864 markings/sec, 115 secs
lola: 59924708 markings, 204042069 edges, 470393 markings/sec, 120 secs
lola: 62187645 markings, 212155921 edges, 452587 markings/sec, 125 secs
lola: 64368745 markings, 220028638 edges, 436220 markings/sec, 130 secs
lola: 66692774 markings, 228470298 edges, 464806 markings/sec, 135 secs
lola: 68955548 markings, 236705160 edges, 452555 markings/sec, 140 secs
lola: 71204173 markings, 244935693 edges, 449725 markings/sec, 145 secs
lola: 73784547 markings, 253771022 edges, 516075 markings/sec, 150 secs
lola: 76469785 markings, 262631733 edges, 537048 markings/sec, 155 secs
lola: 78796839 markings, 270910243 edges, 465411 markings/sec, 160 secs
lola: 81045951 markings, 278995431 edges, 449822 markings/sec, 165 secs
lola: 83226489 markings, 286872977 edges, 436108 markings/sec, 170 secs
lola: 85502522 markings, 295115122 edges, 455207 markings/sec, 175 secs
lola: 87748619 markings, 303310752 edges, 449219 markings/sec, 180 secs
lola: 89991703 markings, 311521266 edges, 448617 markings/sec, 185 secs
lola: 92582521 markings, 320354618 edges, 518164 markings/sec, 190 secs
lola: 95237855 markings, 329136778 edges, 531067 markings/sec, 195 secs
lola: 97621372 markings, 337594865 edges, 476703 markings/sec, 200 secs
lola: 99682745 markings, 345018927 edges, 412275 markings/sec, 205 secs
lola: 101532353 markings, 351681358 edges, 369922 markings/sec, 210 secs
lola: 103639715 markings, 359381127 edges, 421472 markings/sec, 215 secs
lola: 105701431 markings, 366908836 edges, 412343 markings/sec, 220 secs
lola: 107803637 markings, 374516980 edges, 420441 markings/sec, 225 secs
lola: 110159173 markings, 383020529 edges, 471107 markings/sec, 230 secs
lola: 112876505 markings, 391714209 edges, 543466 markings/sec, 235 secs
lola: 114268377 markings, 396561599 edges, 278374 markings/sec, 240 secs
lola: 116167015 markings, 403345137 edges, 379728 markings/sec, 245 secs
lola: 118109645 markings, 410277777 edges, 388526 markings/sec, 250 secs
lola: 119880941 markings, 416735317 edges, 354259 markings/sec, 255 secs
lola: 121856556 markings, 423842446 edges, 395123 markings/sec, 260 secs
lola: 123729494 markings, 430677531 edges, 374588 markings/sec, 265 secs
lola: 125630599 markings, 437615466 edges, 380221 markings/sec, 270 secs
lola: 127560868 markings, 444663802 edges, 386054 markings/sec, 275 secs
lola: 129746893 markings, 452137782 edges, 437205 markings/sec, 280 secs
lola: 132111819 markings, 459825443 edges, 472985 markings/sec, 285 secs
lola: 134152281 markings, 467039388 edges, 408092 markings/sec, 290 secs
lola: 136044504 markings, 473791351 edges, 378445 markings/sec, 295 secs
lola: 137825027 markings, 480197151 edges, 356105 markings/sec, 300 secs
lola: 139615678 markings, 486717519 edges, 358130 markings/sec, 305 secs
lola: 140731632 markings, 490745979 edges, 223191 markings/sec, 310 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 649 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 + 1 <= p22) R X (G ((p20 + 1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p5 + 1 <= p22) R X (G ((p20 + 1 <= p16))))
lola: processed formula length: 44
lola: 96 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: 1289 markings, 1289 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 7 will run for 649 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (G ((p13 <= p20)))) OR (G ((p22 <= 0)) AND F (G ((p13 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (G ((p13 <= p20)))) OR (G ((p22 <= 0)) AND F (G ((p13 <= p20))))))
lola: processed formula length: 75
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 1302 markings, 1323 edges
lola: ========================================
lola: subprocess 8 will run for 812 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p24 <= p18)))
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 ((p24 <= p18)))
lola: processed formula length: 20
lola: 96 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: 52159 markings, 81059 edges
lola: ========================================
lola: subprocess 9 will run for 1082 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p4 <= p2)))
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 ((p4 <= p2)))
lola: processed formula length: 18
lola: 96 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: 571 markings, 572 edges
lola: ========================================
lola: subprocess 10 will run for 1624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((2 <= p22))) AND (p22 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((2 <= p22))) AND (p22 <= 1)))
lola: processed formula length: 39
lola: 96 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: 180 markings, 180 edges
lola: ========================================
lola: subprocess 11 will run for 3248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p8 <= p24)) AND (((3 <= p4) U (p10 <= p22)) OR (p8 <= p24)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p8 <= p24)) AND (((3 <= p4) U (p10 <= p22)) OR (p8 <= p24)))))
lola: processed formula length: 73
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 1290 markings, 1291 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((p5 + 1 <= p22) R X (G ((p20 + 1 <= p16)))) OR X ((((p4 + 1 <= p0) R F ((p6 + 1 <= p22))) OR (p0 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: X ((((p4 + 1 <= p0) R F ((p6 + 1 <= p22))) OR (p0 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p4 + 1 <= p0) R F ((p6 + 1 <= p22))) OR (p0 <= p4)))
lola: processed formula length: 58
lola: 96 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: 3144783 markings, 9407805 edges, 628957 markings/sec, 0 secs
lola: 6034505 markings, 18310926 edges, 577944 markings/sec, 5 secs
lola: 8741349 markings, 26790846 edges, 541369 markings/sec, 10 secs
lola: 11499215 markings, 35415485 edges, 551573 markings/sec, 15 secs
lola: 14040347 markings, 43424800 edges, 508226 markings/sec, 20 secs
lola: 16793422 markings, 52068831 edges, 550615 markings/sec, 25 secs
lola: 19390271 markings, 60430202 edges, 519370 markings/sec, 30 secs
lola: 21531711 markings, 67947178 edges, 428288 markings/sec, 35 secs
lola: 23576831 markings, 75258824 edges, 409024 markings/sec, 40 secs
lola: 25649457 markings, 82733688 edges, 414525 markings/sec, 45 secs
lola: 27884501 markings, 90816881 edges, 447009 markings/sec, 50 secs
lola: 30160719 markings, 99134365 edges, 455244 markings/sec, 55 secs
lola: 32355000 markings, 107178131 edges, 438856 markings/sec, 60 secs
lola: 34732399 markings, 115910636 edges, 475480 markings/sec, 65 secs
lola: 37646675 markings, 125192348 edges, 582855 markings/sec, 70 secs
lola: 40044803 markings, 133572778 edges, 479626 markings/sec, 75 secs
lola: 42303877 markings, 141616887 edges, 451815 markings/sec, 80 secs
lola: 44472635 markings, 149442826 edges, 433752 markings/sec, 85 secs
lola: 46717917 markings, 157560546 edges, 449056 markings/sec, 90 secs
lola: 48961230 markings, 165766715 edges, 448663 markings/sec, 95 secs
lola: 51139685 markings, 173756702 edges, 435691 markings/sec, 100 secs
lola: 53459973 markings, 182269173 edges, 464058 markings/sec, 105 secs
lola: 56282191 markings, 191249978 edges, 564444 markings/sec, 110 secs
lola: 58763566 markings, 199899627 edges, 496275 markings/sec, 115 secs
lola: 61071895 markings, 208123796 edges, 461666 markings/sec, 120 secs
lola: 63251117 markings, 215993118 edges, 435844 markings/sec, 125 secs
lola: 65522243 markings, 224203698 edges, 454225 markings/sec, 130 secs
lola: 67775519 markings, 232450352 edges, 450655 markings/sec, 135 secs
lola: 69873749 markings, 240140743 edges, 419646 markings/sec, 140 secs
lola: 72126627 markings, 248394159 edges, 450576 markings/sec, 145 secs
lola: 74844395 markings, 257136862 edges, 543554 markings/sec, 150 secs
lola: 77291531 markings, 265532146 edges, 489427 markings/sec, 155 secs
lola: 79492647 markings, 273421853 edges, 440223 markings/sec, 160 secs
lola: 81520219 markings, 280677537 edges, 405514 markings/sec, 165 secs
lola: 83456949 markings, 287731834 edges, 387346 markings/sec, 170 secs
lola: 85568632 markings, 295352340 edges, 422337 markings/sec, 175 secs
lola: 87547803 markings, 302565422 edges, 395834 markings/sec, 180 secs
lola: 89498815 markings, 309691610 edges, 390202 markings/sec, 185 secs
lola: 91829961 markings, 317925719 edges, 466229 markings/sec, 190 secs
lola: 94497331 markings, 326554178 edges, 533474 markings/sec, 195 secs
lola: 96800097 markings, 334697028 edges, 460553 markings/sec, 200 secs
lola: 99005395 markings, 342605933 edges, 441060 markings/sec, 205 secs
lola: 101147085 markings, 350352141 edges, 428338 markings/sec, 210 secs
lola: 103519652 markings, 358934770 edges, 474513 markings/sec, 215 secs
lola: 105787101 markings, 367193243 edges, 453490 markings/sec, 220 secs
lola: 108079159 markings, 375508322 edges, 458412 markings/sec, 225 secs
lola: 110630593 markings, 384520769 edges, 510287 markings/sec, 230 secs
lola: 113374329 markings, 393430207 edges, 548747 markings/sec, 235 secs
lola: 115593701 markings, 401288574 edges, 443874 markings/sec, 240 secs
lola: 117622481 markings, 408555183 edges, 405756 markings/sec, 245 secs
lola: 119486819 markings, 415266578 edges, 372868 markings/sec, 250 secs
lola: 121473900 markings, 422443422 edges, 397416 markings/sec, 255 secs
lola: 123456387 markings, 429658810 edges, 396497 markings/sec, 260 secs
lola: 125366391 markings, 436630816 edges, 382001 markings/sec, 265 secs
lola: 127241215 markings, 443476925 edges, 374965 markings/sec, 270 secs
lola: 129378451 markings, 450949454 edges, 427447 markings/sec, 275 secs
lola: 131694453 markings, 458394368 edges, 463200 markings/sec, 280 secs
lola: 133729505 markings, 465546246 edges, 407010 markings/sec, 285 secs
lola: 135570513 markings, 472122452 edges, 368202 markings/sec, 290 secs
lola: 137320539 markings, 478414440 edges, 350005 markings/sec, 295 secs
lola: 138989919 markings, 484409283 edges, 333876 markings/sec, 300 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((p5 + 1 <= p22) R X (G ((p20 + 1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p5 + 1 <= p22) R X (G ((p20 + 1 <= p16))))
lola: processed formula length: 44
lola: 96 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: 1289 markings, 1289 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no unknown no no no no
lola:
preliminary result: no no no no no no no unknown no no no no
lola: ========================================
lola: memory consumption: 3444 KB
lola: time consumption: 632 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="ClientsAndServers-PT-N0020P4"
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 ClientsAndServers-PT-N0020P4, 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 r056-oct2-162038334600101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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