Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r227-tall-162098231200350.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ShieldPPPt-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231200350
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 12:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 18:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 19K May 5 16:52 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621176026041

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 14:40:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-16 14:40:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 14:40:27] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2021-05-16 14:40:27] [INFO ] Transformed 81 places.
[2021-05-16 14:40:27] [INFO ] Transformed 74 transitions.
[2021-05-16 14:40:27] [INFO ] Found NUPN structural information;
[2021-05-16 14:40:27] [INFO ] Parsed PT model containing 81 places and 74 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 195 steps, including 0 resets, run visited all 34 properties in 6 ms. (steps per millisecond=32 )
[2021-05-16 14:40:27] [INFO ] Flatten gal took : 30 ms
[2021-05-16 14:40:27] [INFO ] Applying decomposition
[2021-05-16 14:40:27] [INFO ] Flatten gal took : 9 ms
[2021-05-16 14:40:27] [INFO ] Decomposing Gal with order
[2021-05-16 14:40:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 14:40:28] [INFO ] Flatten gal took : 35 ms
[2021-05-16 14:40:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-16 14:40:28] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-16 14:40:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldPPPt-PT-001B @ 3570 seconds

FORMULA ShieldPPPt-PT-001B-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2406
rslt: Output for LTLFireability @ ShieldPPPt-PT-001B

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 16 14:40:29 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 1,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((F (((1 <= p57))) OR (G (((1 <= p8))) AND F (((1 <= p57))))) U G (((1 <= p12) AND (1 <= p74)))) OR G (((1 <= p57)))))",
"processed_size": 122,
"rewrites": 111
},
"result":
{
"edges": 57,
"markings": 57,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"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": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 4,
"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": "(X (X (G (((1 <= p43))))) U (X (F (((p26 <= 0) OR (p28 <= 0)))) U ((1 <= p71))))",
"processed_size": 81,
"rewrites": 111
},
"result":
{
"edges": 84,
"markings": 83,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (G (((1 <= p44)))))",
"processed_size": 24,
"rewrites": 111
},
"result":
{
"edges": 42,
"markings": 42,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 5,
"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": "(X (((X (((1 <= p65))) U ((1 <= p50))) OR ((1 <= p50)))) U (F (((1 <= p9))) AND ((1 <= p50))))",
"processed_size": 94,
"rewrites": 111
},
"result":
{
"edges": 1543,
"markings": 603,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 297
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p26) AND (1 <= p28)) U ((1 <= p42)))",
"processed_size": 44,
"rewrites": 111
},
"result":
{
"edges": 60,
"markings": 60,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 327
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (G (((1 <= p26) AND (1 <= p28) AND (1 <= p52)))))",
"processed_size": 54,
"rewrites": 111
},
"result":
{
"edges": 42,
"markings": 42,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 327
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (F (((((1 <= p53)) U ((1 <= p70))) AND ((1 <= p7))))))",
"processed_size": 59,
"rewrites": 111
},
"result":
{
"edges": 44,
"markings": 44,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 1,
"X": 1,
"aconj": 7,
"adisj": 0,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((F ((F (((1 <= p1) AND (1 <= p62))) OR ((1 <= p66)))) AND (((((1 <= p18) AND (1 <= p45)) U X (F (((p66 <= 0))))) AND ((1 <= p46))) OR (F (((1 <= p1) AND (1 <= p62))) OR ((1 <= p66))))))",
"processed_size": 188,
"rewrites": 111
},
"result":
{
"edges": 23635,
"markings": 6895,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 408
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((X (F (((p63 <= 0)))) AND F (((p66 <= 0)))) OR ((p63 <= 0))) R X (G (((1 <= p54)))))",
"processed_size": 86,
"rewrites": 111
},
"result":
{
"edges": 42,
"markings": 42,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 8,
"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": 467
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"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": "F ((F (((1 <= p40))) AND (X (G (((1 <= p66)))) OR ((p66 <= 0)))))",
"processed_size": 65,
"rewrites": 111
},
"result":
{
"edges": 42,
"markings": 42,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"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": 545
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p78 <= 0))",
"processed_size": 12,
"rewrites": 113
},
"result":
{
"edges": 81,
"markings": 80,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 654
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((p10 <= 0))))",
"processed_size": 20,
"rewrites": 111
},
"result":
{
"edges": 55468972,
"markings": 13972670,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 795
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((p42 <= 0)))",
"processed_size": 16,
"rewrites": 111
},
"result":
{
"edges": 207,
"markings": 207,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1061
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((F (G (((1 <= p65)))) OR G (((1 <= p65))))))",
"processed_size": 50,
"rewrites": 111
},
"result":
{
"edges": 122,
"markings": 119,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 13,
"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": 1591
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((F (G (((p76 <= 0)))) AND ((1 <= p53)))))",
"processed_size": 47,
"rewrites": 111
},
"result":
{
"edges": 114,
"markings": 111,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 14,
"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": 3183
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((F (((p24 <= 0))) AND (((1 <= p1)) AND ((1 <= p62))))))",
"processed_size": 61,
"rewrites": 111
},
"result":
{
"edges": 73,
"markings": 69,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((X (G (((p56 <= 0)))) OR G (F (((p3 <= 0) OR (p22 <= 0)))))))",
"processed_size": 68,
"rewrites": 111
},
"result":
{
"edges": 517170404,
"markings": 51622498,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 37264,
"runtime": 1164.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((((F(**) OR (G(**) AND F(**))) U G(**)) OR G(**))) : F(G((F(G(**)) OR G(**)))) : (X(X(G(**))) U (X(F(*)) U **)) : X(X(G(**))) : F(G(*)) : F(**) : (X(((X(**) U **) OR **)) U (F(**) AND **)) : F(G((X(G(**)) OR G(F(*))))) : (X(X(G(**))) OR (** U **)) : X(X(F(((** U **) AND **)))) : G((F((F(**) OR **)) AND (((** U X(F(*))) AND **) OR (F(**) OR **)))) : (((X(F(*)) AND F(*)) OR *) R X(G(**))) : G(*) : F((F(**) AND (X(G(*)) OR **))) : G(F((F(**) AND (** AND **)))) : G(F((F(G(*)) AND *)))"
},
"net":
{
"arcs": 184,
"conflict_clusters": 67,
"places": 81,
"places_significant": 69,
"singleton_clusters": 0,
"transitions": 74
},
"result":
{
"preliminary_value": "no no no no no no no no no no no no no no no no ",
"value": "no no no no no no no no no 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: 155/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 81
lola: finding significant places
lola: 81 places, 74 transitions, 69 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 LTLFireability.xml
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: (X (((G (((1 <= p8))) U F (((1 <= p57)))) U G (((1 <= p12) AND (1 <= p74))))) OR G (X (G (((1 <= p57)))))) : NOT(F (G (NOT(G ((F (G (((1 <= p65)))) OR G (((1 <= p65))))))))) : (G (X (X (((1 <= p43))))) U (NOT(G (X (((1 <= p26) AND (1 <= p28))))) U ((1 <= p71)))) : NOT(F (NOT(X (X (((1 <= p44))))))) : NOT(G (F (((X ((((1 <= p36)) OR ((1 <= p10)))) U X (((1 <= p71)))) U ((1 <= p10)))))) : F (((1 <= p78))) : (X (((X (((1 <= p65))) U ((1 <= p50))) OR ((1 <= p50)))) U (F (((1 <= p9))) AND ((1 <= p50)))) : F (G ((G (X (((p56 <= 0)))) OR NOT(F (X (G (((1 <= p3) AND (1 <= p22))))))))) : (G (X (X (((1 <= p26) AND (1 <= p28) AND (1 <= p52))))) OR (((1 <= p26) AND (1 <= p28)) U ((1 <= p42)))) : F (X (F (X (((((1 <= p53)) U ((1 <= p70))) AND ((1 <= p7))))))) : G ((((((1 <= p18) AND (1 <= p45)) U F (NOT(X (((1 <= p66)))))) AND ((1 <= p46))) U (F (((1 <= p1) AND (1 <= p62))) OR ((1 <= p66))))) : NOT((((G (X (((1 <= p63)))) OR G (((1 <= p66)))) AND ((1 <= p63))) U X (NOT(G (((1 <= p54))))))) : NOT(F ((((1 <= p46)) U ((1 <= p42))))) : F (((((1 <= p34) AND (1 <= p67)) U F (((1 <= p40)))) AND (NOT(X (F (((p66 <= 0))))) OR ((p66 <= 0))))) : NOT(G (F (NOT(X (F (X (((F (((p24 <= 0))) AND ((1 <= p1))) AND ((1 <= p62)))))))))) : NOT(F (G ((G (F (((1 <= p76)))) OR ((p53 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:410
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k: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:315
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((F (((1 <= p57))) OR (G (((1 <= p8))) AND F (((1 <= p57))))) U G (((1 <= p12) AND (1 <= p74)))) OR G (((1 <= p57)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((F (((1 <= p57))) OR (G (((1 <= p8))) AND F (((1 <= p57))))) U G (((1 <= p12) AND (1 <= p74)))) OR G (((1 <= p57)))))
lola: processed formula length: 122
lola: 111 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 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: 57 markings, 57 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G (((1 <= p43))))) U (X (F (((p26 <= 0) OR (p28 <= 0)))) U ((1 <= p71))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (G (((1 <= p43))))) U (X (F (((p26 <= 0) OR (p28 <= 0)))) U ((1 <= p71))))
lola: processed formula length: 81
lola: 111 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 83 markings, 84 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p44)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p44)))))
lola: processed formula length: 24
lola: 111 rewrites
lola: closed formula file LTLFireability.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: 42 markings, 42 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((X (((1 <= p65))) U ((1 <= p50))) OR ((1 <= p50)))) U (F (((1 <= p9))) AND ((1 <= p50))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((X (((1 <= p65))) U ((1 <= p50))) OR ((1 <= p50)))) U (F (((1 <= p9))) AND ((1 <= p50))))
lola: processed formula length: 94
lola: 111 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 603 markings, 1543 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (G (((p56 <= 0)))) OR G (F (((p3 <= 0) OR (p22 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (G (((p56 <= 0)))) OR G (F (((p3 <= 0) OR (p22 <= 0)))))))
lola: processed formula length: 68
lola: 111 rewrites
lola: closed formula file LTLFireability.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: 1352407 markings, 4064144 edges, 270481 markings/sec, 0 secs
lola: 2511965 markings, 7540704 edges, 231912 markings/sec, 5 secs
lola: 3455803 markings, 10699853 edges, 188768 markings/sec, 10 secs
lola: 4308670 markings, 13729127 edges, 170573 markings/sec, 15 secs
lola: 5056396 markings, 16521584 edges, 149545 markings/sec, 20 secs
lola: 5828555 markings, 19555177 edges, 154432 markings/sec, 25 secs
lola: 6592299 markings, 22671627 edges, 152749 markings/sec, 30 secs
lola: 7314202 markings, 25776669 edges, 144381 markings/sec, 35 secs
lola: 8004878 markings, 28839797 edges, 138135 markings/sec, 40 secs
lola: 8672894 markings, 31930382 edges, 133603 markings/sec, 45 secs
lola: 9325489 markings, 35067174 edges, 130519 markings/sec, 50 secs
lola: 9957726 markings, 38219463 edges, 126447 markings/sec, 55 secs
lola: 10561047 markings, 41352024 edges, 120664 markings/sec, 60 secs
lola: 11167127 markings, 44601298 edges, 121216 markings/sec, 65 secs
lola: 11753202 markings, 47858995 edges, 117215 markings/sec, 70 secs
lola: 12325828 markings, 51146297 edges, 114525 markings/sec, 75 secs
lola: 12896390 markings, 54485848 edges, 114112 markings/sec, 80 secs
lola: 13442493 markings, 57850289 edges, 109221 markings/sec, 85 secs
lola: 13976895 markings, 61302398 edges, 106880 markings/sec, 90 secs
lola: 14512285 markings, 64815743 edges, 107078 markings/sec, 95 secs
lola: 15029022 markings, 68266583 edges, 103347 markings/sec, 100 secs
lola: 15543216 markings, 71835560 edges, 102839 markings/sec, 105 secs
lola: 16087289 markings, 75466177 edges, 108815 markings/sec, 110 secs
lola: 16665511 markings, 79191292 edges, 115644 markings/sec, 115 secs
lola: 17074342 markings, 82611277 edges, 81766 markings/sec, 120 secs
lola: 17150655 markings, 85305965 edges, 15263 markings/sec, 125 secs
lola: 17177490 markings, 87865549 edges, 5367 markings/sec, 130 secs
lola: 17185564 markings, 90374911 edges, 1615 markings/sec, 135 secs
lola: 17194480 markings, 92879740 edges, 1783 markings/sec, 140 secs
lola: 17198754 markings, 95353535 edges, 855 markings/sec, 145 secs
lola: 17201951 markings, 97676888 edges, 639 markings/sec, 150 secs
lola: 17203012 markings, 99713033 edges, 212 markings/sec, 155 secs
lola: 17203929 markings, 101821479 edges, 183 markings/sec, 160 secs
lola: 17204217 markings, 104046460 edges, 58 markings/sec, 165 secs
lola: 17582932 markings, 106891040 edges, 75743 markings/sec, 170 secs
lola: 18167549 markings, 109858948 edges, 116923 markings/sec, 175 secs
lola: 18693848 markings, 112762522 edges, 105260 markings/sec, 180 secs
lola: 19187209 markings, 115660264 edges, 98672 markings/sec, 185 secs
lola: 19652050 markings, 118470653 edges, 92968 markings/sec, 190 secs
lola: 20098475 markings, 121288914 edges, 89285 markings/sec, 195 secs
lola: 20529401 markings, 124118206 edges, 86185 markings/sec, 200 secs
lola: 20952476 markings, 126952382 edges, 84615 markings/sec, 205 secs
lola: 21365185 markings, 129804487 edges, 82542 markings/sec, 210 secs
lola: 21772241 markings, 132681585 edges, 81411 markings/sec, 215 secs
lola: 22169964 markings, 135548891 edges, 79545 markings/sec, 220 secs
lola: 22599286 markings, 138775989 edges, 85864 markings/sec, 225 secs
lola: 23036337 markings, 142138089 edges, 87410 markings/sec, 230 secs
lola: 23470667 markings, 145583840 edges, 86866 markings/sec, 235 secs
lola: 23906954 markings, 149031413 edges, 87257 markings/sec, 240 secs
lola: 24335729 markings, 152500774 edges, 85755 markings/sec, 245 secs
lola: 24751578 markings, 156024203 edges, 83170 markings/sec, 250 secs
lola: 25164572 markings, 159554245 edges, 82599 markings/sec, 255 secs
lola: 25568628 markings, 163097559 edges, 80811 markings/sec, 260 secs
lola: 25967591 markings, 166695334 edges, 79793 markings/sec, 265 secs
lola: 26362151 markings, 170316167 edges, 78912 markings/sec, 270 secs
lola: 26747233 markings, 173959753 edges, 77016 markings/sec, 275 secs
lola: 27130290 markings, 177629506 edges, 76611 markings/sec, 280 secs
lola: 27508003 markings, 181326772 edges, 75543 markings/sec, 285 secs
lola: 27882448 markings, 185039689 edges, 74889 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown no no unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4148524 KB
lola: time consumption: 300 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G (((1 <= p26) AND (1 <= p28) AND (1 <= p52))))) OR (((1 <= p26) AND (1 <= p28)) U ((1 <= p42))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p26) AND (1 <= p28)) U ((1 <= p42)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p26) AND (1 <= p28)) U ((1 <= p42)))
lola: processed formula length: 44
lola: 111 rewrites
lola: closed formula file LTLFireability.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: 60 markings, 60 edges
lola: ========================================
lola: subprocess 6 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p26) AND (1 <= p28) AND (1 <= p52)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p26) AND (1 <= p28) AND (1 <= p52)))))
lola: processed formula length: 54
lola: 111 rewrites
lola: closed formula file LTLFireability.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: 42 markings, 42 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((((1 <= p53)) U ((1 <= p70))) AND ((1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((((1 <= p53)) U ((1 <= p70))) AND ((1 <= p7))))))
lola: processed formula length: 59
lola: 111 rewrites
lola: closed formula file LTLFireability.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: 44 markings, 44 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((F (((1 <= p1) AND (1 <= p62))) OR ((1 <= p66)))) AND (((((1 <= p18) AND (1 <= p45)) U X (F (((p66 <= 0))))) AND ((1 <= p46))) OR (F (((1 <= p1) AND (1 <= p62))) OR ((1 <= p66))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((F (((1 <= p1) AND (1 <= p62))) OR ((1 <= p66)))) AND (((((1 <= p18) AND (1 <= p45)) U X (F (((p66 <= 0))))) AND ((1 <= p46))) OR (F (((1 <= p1) AND (1 <= p62))) OR ((1 <= p66))))))
lola: processed formula length: 188
lola: 111 rewrites
lola: closed formula file LTLFireability.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: 6895 markings, 23635 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((X (F (((p63 <= 0)))) AND F (((p66 <= 0)))) OR ((p63 <= 0))) R X (G (((1 <= p54)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((X (F (((p63 <= 0)))) AND F (((p66 <= 0)))) OR ((p63 <= 0))) R X (G (((1 <= p54)))))
lola: processed formula length: 86
lola: 111 rewrites
lola: closed formula file LTLFireability.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: 42 markings, 42 edges
lola: ========================================
lola: subprocess 9 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p40))) AND (X (G (((1 <= p66)))) OR ((p66 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p40))) AND (X (G (((1 <= p66)))) OR ((p66 <= 0)))))
lola: processed formula length: 65
lola: 111 rewrites
lola: closed formula file LTLFireability.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: 42 markings, 42 edges
lola: ========================================
lola: subprocess 10 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p78)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p78 <= 0))
lola: processed formula length: 12
lola: 113 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 80 markings, 81 edges
lola: ========================================
lola: subprocess 11 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p10 <= 0))))
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 (((p10 <= 0))))
lola: processed formula length: 20
lola: 111 rewrites
lola: closed formula file LTLFireability.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: 1694543 markings, 3546927 edges, 338909 markings/sec, 0 secs
lola: 2942004 markings, 6886840 edges, 249492 markings/sec, 5 secs
lola: 4112992 markings, 10351079 edges, 234198 markings/sec, 10 secs
lola: 5228860 markings, 13790910 edges, 223174 markings/sec, 15 secs
lola: 6088473 markings, 16938384 edges, 171923 markings/sec, 20 secs
lola: 6909496 markings, 20300020 edges, 164205 markings/sec, 25 secs
lola: 7701229 markings, 23677167 edges, 158347 markings/sec, 30 secs
lola: 8488806 markings, 27067507 edges, 157515 markings/sec, 35 secs
lola: 9213441 markings, 30172576 edges, 144927 markings/sec, 40 secs
lola: 9914109 markings, 33163193 edges, 140134 markings/sec, 45 secs
lola: 10625063 markings, 36263549 edges, 142191 markings/sec, 50 secs
lola: 11063456 markings, 38754349 edges, 87679 markings/sec, 55 secs
lola: 11593771 markings, 41606448 edges, 106063 markings/sec, 60 secs
lola: 12132415 markings, 44606719 edges, 107729 markings/sec, 65 secs
lola: 12648474 markings, 47587657 edges, 103212 markings/sec, 70 secs
lola: 13230971 markings, 50909020 edges, 116499 markings/sec, 75 secs
lola: 13810889 markings, 54400897 edges, 115984 markings/sec, 80 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: 13972670 markings, 55468972 edges
lola: ========================================
lola: subprocess 12 will run for 795 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p42 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p42 <= 0)))
lola: processed formula length: 16
lola: 111 rewrites
lola: closed formula file LTLFireability.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: 207 markings, 207 edges
lola: ========================================
lola: subprocess 13 will run for 1061 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (G (((1 <= p65)))) OR G (((1 <= p65))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (G (((1 <= p65)))) OR G (((1 <= p65))))))
lola: processed formula length: 50
lola: 111 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 119 markings, 122 edges
lola: ========================================
lola: subprocess 14 will run for 1591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G (((p76 <= 0)))) AND ((1 <= p53)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G (((p76 <= 0)))) AND ((1 <= p53)))))
lola: processed formula length: 47
lola: 111 rewrites
lola: closed formula file LTLFireability.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: 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: 111 markings, 114 edges
lola: ========================================
lola: subprocess 15 will run for 3183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (((p24 <= 0))) AND (((1 <= p1)) AND ((1 <= p62))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (((p24 <= 0))) AND (((1 <= p1)) AND ((1 <= p62))))))
lola: processed formula length: 61
lola: 111 rewrites
lola: closed formula file LTLFireability.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: 69 markings, 73 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((X (G (((p56 <= 0)))) OR G (F (((p3 <= 0) OR (p22 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (G (((p56 <= 0)))) OR G (F (((p3 <= 0) OR (p22 <= 0)))))))
lola: processed formula length: 68
lola: 111 rewrites
lola: closed formula file LTLFireability.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: 1364924 markings, 4106876 edges, 272985 markings/sec, 0 secs
lola: 2535166 markings, 7613852 edges, 234048 markings/sec, 5 secs
lola: 3488524 markings, 10814713 edges, 190672 markings/sec, 10 secs
lola: 4371986 markings, 13960677 edges, 176692 markings/sec, 15 secs
lola: 5197753 markings, 17065704 edges, 165153 markings/sec, 20 secs
lola: 5984789 markings, 20167255 edges, 157407 markings/sec, 25 secs
lola: 6735879 markings, 23273284 edges, 150218 markings/sec, 30 secs
lola: 7453945 markings, 26398287 edges, 143613 markings/sec, 35 secs
lola: 8153691 markings, 29518263 edges, 139949 markings/sec, 40 secs
lola: 8827585 markings, 32673894 edges, 134779 markings/sec, 45 secs
lola: 9483695 markings, 35844812 edges, 131222 markings/sec, 50 secs
lola: 10127551 markings, 39086952 edges, 128771 markings/sec, 55 secs
lola: 10750257 markings, 42349902 edges, 124541 markings/sec, 60 secs
lola: 11357062 markings, 45656287 edges, 121361 markings/sec, 65 secs
lola: 11948465 markings, 48976294 edges, 118281 markings/sec, 70 secs
lola: 12528070 markings, 52331108 edges, 115921 markings/sec, 75 secs
lola: 13095012 markings, 55673301 edges, 113388 markings/sec, 80 secs
lola: 13646234 markings, 59138182 edges, 110244 markings/sec, 85 secs
lola: 14180835 markings, 62663661 edges, 106920 markings/sec, 90 secs
lola: 14717465 markings, 66161973 edges, 107326 markings/sec, 95 secs
lola: 15227264 markings, 69644073 edges, 101960 markings/sec, 100 secs
lola: 15754331 markings, 73292217 edges, 105413 markings/sec, 105 secs
lola: 16326225 markings, 77014110 edges, 114379 markings/sec, 110 secs
lola: 16890289 markings, 80731144 edges, 112813 markings/sec, 115 secs
lola: 17122009 markings, 83755585 edges, 46344 markings/sec, 120 secs
lola: 17168341 markings, 86404662 edges, 9266 markings/sec, 125 secs
lola: 17182076 markings, 88944973 edges, 2747 markings/sec, 130 secs
lola: 17191630 markings, 91468685 edges, 1911 markings/sec, 135 secs
lola: 17196152 markings, 94001687 edges, 904 markings/sec, 140 secs
lola: 17200881 markings, 96581257 edges, 946 markings/sec, 145 secs
lola: 17202762 markings, 99199878 edges, 376 markings/sec, 150 secs
lola: 17203930 markings, 101846044 edges, 234 markings/sec, 155 secs
lola: 17204239 markings, 104627715 edges, 62 markings/sec, 160 secs
lola: 17813581 markings, 108011263 edges, 121868 markings/sec, 165 secs
lola: 18452175 markings, 111401310 edges, 127719 markings/sec, 170 secs
lola: 19041367 markings, 114777381 edges, 117838 markings/sec, 175 secs
lola: 19602138 markings, 118154125 edges, 112154 markings/sec, 180 secs
lola: 20134585 markings, 121526040 edges, 106489 markings/sec, 185 secs
lola: 20645152 markings, 124886933 edges, 102113 markings/sec, 190 secs
lola: 21139379 markings, 128234677 edges, 98845 markings/sec, 195 secs
lola: 21613465 markings, 131558839 edges, 94817 markings/sec, 200 secs
lola: 22075246 markings, 134855093 edges, 92356 markings/sec, 205 secs
lola: 22462654 markings, 137759973 edges, 77482 markings/sec, 210 secs
lola: 22845083 markings, 140665157 edges, 76486 markings/sec, 215 secs
lola: 23216532 markings, 143576429 edges, 74290 markings/sec, 220 secs
lola: 23591613 markings, 146529566 edges, 75016 markings/sec, 225 secs
lola: 23962097 markings, 149477438 edges, 74097 markings/sec, 230 secs
lola: 24326620 markings, 152425409 edges, 72905 markings/sec, 235 secs
lola: 24683580 markings, 155440031 edges, 71392 markings/sec, 240 secs
lola: 25041848 markings, 158484015 edges, 71654 markings/sec, 245 secs
lola: 25389715 markings, 161526396 edges, 69573 markings/sec, 250 secs
lola: 25726305 markings, 164544977 edges, 67318 markings/sec, 255 secs
lola: 26071761 markings, 167650053 edges, 69091 markings/sec, 260 secs
lola: 26410129 markings, 170780740 edges, 67674 markings/sec, 265 secs
lola: 26743872 markings, 173923560 edges, 66749 markings/sec, 270 secs
lola: 27076812 markings, 177101512 edges, 66588 markings/sec, 275 secs
lola: 27406179 markings, 180321021 edges, 65873 markings/sec, 280 secs
lola: 27732554 markings, 183547926 edges, 65275 markings/sec, 285 secs
lola: 28053719 markings, 186745479 edges, 64233 markings/sec, 290 secs
lola: 28377733 markings, 190036486 edges, 64803 markings/sec, 295 secs
lola: 28704305 markings, 193342090 edges, 65314 markings/sec, 300 secs
lola: 29052263 markings, 196868809 edges, 69592 markings/sec, 305 secs
lola: 29406786 markings, 200496664 edges, 70905 markings/sec, 310 secs
lola: 29772339 markings, 204238041 edges, 73111 markings/sec, 315 secs
lola: 30135167 markings, 208072300 edges, 72566 markings/sec, 320 secs
lola: 30485238 markings, 211915574 edges, 70014 markings/sec, 325 secs
lola: 30835600 markings, 215810996 edges, 70072 markings/sec, 330 secs
lola: 31182653 markings, 219714224 edges, 69411 markings/sec, 335 secs
lola: 31527050 markings, 223555790 edges, 68879 markings/sec, 340 secs
lola: 31881195 markings, 227468678 edges, 70829 markings/sec, 345 secs
lola: 32243294 markings, 231447740 edges, 72420 markings/sec, 350 secs
lola: 32597304 markings, 235495096 edges, 70802 markings/sec, 355 secs
lola: 32951302 markings, 239549860 edges, 70800 markings/sec, 360 secs
lola: 33304344 markings, 243647016 edges, 70608 markings/sec, 365 secs
lola: 33658318 markings, 247737503 edges, 70795 markings/sec, 370 secs
lola: 33953048 markings, 251751231 edges, 58946 markings/sec, 375 secs
lola: 34106963 markings, 255330967 edges, 30783 markings/sec, 380 secs
lola: 34159920 markings, 258591210 edges, 10591 markings/sec, 385 secs
lola: 34196277 markings, 261793854 edges, 7271 markings/sec, 390 secs
lola: 34229136 markings, 264983247 edges, 6572 markings/sec, 395 secs
lola: 34248652 markings, 268138692 edges, 3903 markings/sec, 400 secs
lola: 34265594 markings, 271291155 edges, 3388 markings/sec, 405 secs
lola: 34284337 markings, 274441000 edges, 3749 markings/sec, 410 secs
lola: 34299343 markings, 277583918 edges, 3001 markings/sec, 415 secs
lola: 34312888 markings, 280735943 edges, 2709 markings/sec, 420 secs
lola: 34326521 markings, 283882947 edges, 2727 markings/sec, 425 secs
lola: 34340004 markings, 287021730 edges, 2697 markings/sec, 430 secs
lola: 34351849 markings, 290122987 edges, 2369 markings/sec, 435 secs
lola: 34363163 markings, 293261134 edges, 2263 markings/sec, 440 secs
lola: 34374788 markings, 296484489 edges, 2325 markings/sec, 445 secs
lola: 34385899 markings, 299733499 edges, 2222 markings/sec, 450 secs
lola: 34396886 markings, 303034092 edges, 2197 markings/sec, 455 secs
lola: 34408441 markings, 306557532 edges, 2311 markings/sec, 460 secs
lola: 35116553 markings, 310293515 edges, 141622 markings/sec, 465 secs
lola: 35659767 markings, 314110229 edges, 108643 markings/sec, 470 secs
lola: 36291423 markings, 317729979 edges, 126331 markings/sec, 475 secs
lola: 36853702 markings, 321208807 edges, 112456 markings/sec, 480 secs
lola: 37383149 markings, 324662053 edges, 105889 markings/sec, 485 secs
lola: 37877016 markings, 328044497 edges, 98773 markings/sec, 490 secs
lola: 38373565 markings, 331518864 edges, 99310 markings/sec, 495 secs
lola: 38840942 markings, 334925352 edges, 93475 markings/sec, 500 secs
lola: 39240353 markings, 337902812 edges, 79882 markings/sec, 505 secs
lola: 39613020 markings, 340737329 edges, 74533 markings/sec, 510 secs
lola: 40004738 markings, 343815934 edges, 78344 markings/sec, 515 secs
lola: 40422884 markings, 347123155 edges, 83629 markings/sec, 520 secs
lola: 40799448 markings, 350193857 edges, 75313 markings/sec, 525 secs
lola: 41150779 markings, 353150156 edges, 70266 markings/sec, 530 secs
lola: 41508542 markings, 356224206 edges, 71553 markings/sec, 535 secs
lola: 41890450 markings, 359591971 edges, 76382 markings/sec, 540 secs
lola: 42276240 markings, 363001376 edges, 77158 markings/sec, 545 secs
lola: 42655334 markings, 366440516 edges, 75819 markings/sec, 550 secs
lola: 43028444 markings, 369915344 edges, 74622 markings/sec, 555 secs
lola: 43395598 markings, 373424586 edges, 73431 markings/sec, 560 secs
lola: 43759177 markings, 376933927 edges, 72716 markings/sec, 565 secs
lola: 44115849 markings, 380485088 edges, 71334 markings/sec, 570 secs
lola: 44471045 markings, 384062339 edges, 71039 markings/sec, 575 secs
lola: 44818682 markings, 387660721 edges, 69527 markings/sec, 580 secs
lola: 45161642 markings, 391283378 edges, 68592 markings/sec, 585 secs
lola: 45498338 markings, 394916467 edges, 67339 markings/sec, 590 secs
lola: 45830462 markings, 398578587 edges, 66425 markings/sec, 595 secs
lola: 46161277 markings, 402265931 edges, 66163 markings/sec, 600 secs
lola: 46485673 markings, 405993430 edges, 64879 markings/sec, 605 secs
lola: 46807493 markings, 409694041 edges, 64364 markings/sec, 610 secs
lola: 47125937 markings, 413432713 edges, 63689 markings/sec, 615 secs
lola: 47440078 markings, 417149496 edges, 62828 markings/sec, 620 secs
lola: 47747255 markings, 420897562 edges, 61435 markings/sec, 625 secs
lola: 48047489 markings, 424739896 edges, 60047 markings/sec, 630 secs
lola: 48344119 markings, 428595415 edges, 59326 markings/sec, 635 secs
lola: 48636444 markings, 432483393 edges, 58465 markings/sec, 640 secs
lola: 48935274 markings, 436365595 edges, 59766 markings/sec, 645 secs
lola: 49228079 markings, 440227366 edges, 58561 markings/sec, 650 secs
lola: 49513230 markings, 444113917 edges, 57030 markings/sec, 655 secs
lola: 49795526 markings, 448059985 edges, 56459 markings/sec, 660 secs
lola: 50089421 markings, 452099125 edges, 58779 markings/sec, 665 secs
lola: 50389654 markings, 456114266 edges, 60047 markings/sec, 670 secs
lola: 50701216 markings, 460167439 edges, 62312 markings/sec, 675 secs
lola: 51016976 markings, 464196814 edges, 63152 markings/sec, 680 secs
lola: 51307948 markings, 468218103 edges, 58194 markings/sec, 685 secs
lola: 51484981 markings, 471877516 edges, 35407 markings/sec, 690 secs
lola: 51538385 markings, 475121095 edges, 10681 markings/sec, 695 secs
lola: 51564064 markings, 478261886 edges, 5136 markings/sec, 700 secs
lola: 51584843 markings, 481377720 edges, 4156 markings/sec, 705 secs
lola: 51591414 markings, 484458091 edges, 1314 markings/sec, 710 secs
lola: 51595279 markings, 487531485 edges, 773 markings/sec, 715 secs
lola: 51601667 markings, 490351973 edges, 1278 markings/sec, 720 secs
lola: 51604171 markings, 492826433 edges, 501 markings/sec, 725 secs
lola: 51606136 markings, 495309391 edges, 393 markings/sec, 730 secs
lola: 51608357 markings, 497802123 edges, 444 markings/sec, 735 secs
lola: 51610548 markings, 500303600 edges, 438 markings/sec, 740 secs
lola: 51611547 markings, 502808583 edges, 200 markings/sec, 745 secs
lola: 51612133 markings, 505315436 edges, 117 markings/sec, 750 secs
lola: 51612866 markings, 507835319 edges, 147 markings/sec, 755 secs
lola: 51613256 markings, 510371943 edges, 78 markings/sec, 760 secs
lola: 51613467 markings, 512959434 edges, 42 markings/sec, 765 secs
lola: 51613556 markings, 515644333 edges, 18 markings/sec, 770 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: 51622498 markings, 517170404 edges
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no no no no no no no
lola: ========================================
lola: memory consumption: 37264 KB
lola: time consumption: 1164 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="ShieldPPPt-PT-001B"
export BK_EXAMINATION="LTLFireability"
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 ShieldPPPt-PT-001B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r227-tall-162098231200350"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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