Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r189-tajo-162089432900314.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 RefineWMG-PT-010010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432900314
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K 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 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 24K 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 RefineWMG-PT-010010-00
FORMULA_NAME RefineWMG-PT-010010-01
FORMULA_NAME RefineWMG-PT-010010-02
FORMULA_NAME RefineWMG-PT-010010-03
FORMULA_NAME RefineWMG-PT-010010-04
FORMULA_NAME RefineWMG-PT-010010-05
FORMULA_NAME RefineWMG-PT-010010-06
FORMULA_NAME RefineWMG-PT-010010-07
FORMULA_NAME RefineWMG-PT-010010-08
FORMULA_NAME RefineWMG-PT-010010-09
FORMULA_NAME RefineWMG-PT-010010-10
FORMULA_NAME RefineWMG-PT-010010-11
FORMULA_NAME RefineWMG-PT-010010-12
FORMULA_NAME RefineWMG-PT-010010-13
FORMULA_NAME RefineWMG-PT-010010-14
FORMULA_NAME RefineWMG-PT-010010-15

=== Now, execution of the tool begins

BK_START 1621428661734

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 12:51:03] [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-19 12:51:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 12:51:03] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2021-05-19 12:51:03] [INFO ] Transformed 54 places.
[2021-05-19 12:51:03] [INFO ] Transformed 43 transitions.
[2021-05-19 12:51:03] [INFO ] Parsed PT model containing 54 places and 43 transitions in 70 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 4884 steps, including 0 resets, run visited all 29 properties in 18 ms. (steps per millisecond=271 )
[2021-05-19 12:51:03] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-19 12:51:03] [INFO ] Flatten gal took : 27 ms
FORMULA RefineWMG-PT-010010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010010-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 12:51:03] [INFO ] Flatten gal took : 7 ms
[2021-05-19 12:51:03] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-19 12:51:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-010010 @ 3570 seconds

FORMULA RefineWMG-PT-010010-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2999
rslt: Output for LTLFireability @ RefineWMG-PT-010010

{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 12:51:03 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p22)",
"processed_size": 10,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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 (F (((1 <= p22) AND (1 <= p17))))",
"processed_size": 35,
"rewrites": 77
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 329
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 (X (((1 <= p15) OR (G ((p15 <= 0)) AND (p37 <= 0))))) U ((1 <= p37) U X ((1 <= p27)))))",
"processed_size": 93,
"rewrites": 77
},
"result":
{
"edges": 275,
"markings": 148,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 17
},
"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": 365
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 365
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p10 <= 0)))",
"processed_size": 18,
"rewrites": 77
},
"result":
{
"edges": 234,
"markings": 193,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 411
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p10 <= 0)))",
"processed_size": 18,
"rewrites": 77
},
"result":
{
"edges": 234,
"markings": 193,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 411
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(5 <= p4)",
"processed_size": 9,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 548
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "F (G (((1 <= p33) AND (1 <= p0) AND (1 <= p51) AND (1 <= p52))))",
"processed_size": 64,
"rewrites": 77
},
"result":
{
"edges": 13,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 658
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((((p45 <= 0) AND (1 <= p43)) OR (p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))))",
"processed_size": 82,
"rewrites": 77
},
"result":
{
"edges": 346,
"markings": 205,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 822
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"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 ((G ((p52 <= 0)) AND (p48 <= 0))))",
"processed_size": 39,
"rewrites": 77
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 1096
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 2,
"X": 0,
"aconj": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "((((1 <= p27) U G ((1 <= p27))) OR (G (F ((1 <= p52))) AND F (G ((1 <= p27))))) U (p52 <= 0))",
"processed_size": 93,
"rewrites": 77
},
"result":
{
"edges": 137,
"markings": 95,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"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": 1645
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((F (((1 <= p0) AND (1 <= p51) AND (1 <= p52))) OR (G (((1 <= p0) AND (1 <= p51) AND (1 <= p52))) AND F (((1 <= p0) AND (1 <= p51) AND (1 <= p52))))) U ((1 <= p46) AND (1 <= p47) AND (1 <= p49)))",
"processed_size": 195,
"rewrites": 77
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"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": 3290
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3290
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p31 <= 0) OR (p32 <= 0) OR (p34 <= 0)) AND ((p33 <= 0) OR (p25 <= 0)))",
"processed_size": 76,
"rewrites": 79
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3284,
"runtime": 571.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : (X((G(**) OR **)) OR (X(F(**)) AND **)) : G(((* R X(*)) OR X(G(*)))) : G(F((G(*) AND *))) : F(G(*)) : ((F(**) OR (G(**) AND F(**))) U **) : X(G((G(((* R *) AND **)) OR F(**)))) : X((X(X((** OR (G(*) AND **)))) U (** U X(**)))) : (F(**) OR (G(F(*)) AND F(**))) : (G(F(*)) AND (F((G(*) OR (X(*) AND *))) OR G(F(*)))) : (X(G(**)) OR **) : F(G(*)) : (((** U G(**)) OR (G(F(**)) AND F(G(**)))) U **)"
},
"net":
{
"arcs": 128,
"conflict_clusters": 33,
"places": 54,
"places_significant": 32,
"singleton_clusters": 0,
"transitions": 43
},
"result":
{
"preliminary_value": "no yes unknown no no no unknown yes no no no no no ",
"value": "no yes unknown no no no unknown yes 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: 97/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 43 transitions, 32 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: F (X (G (X (X (G (((1 <= p33) AND (1 <= p0) AND (1 <= p51) AND (1 <= p52)))))))) : ((G (X ((p8 <= 0))) OR X ((1 <= p22))) OR (X (F (((1 <= p22) AND (1 <= p17)))) AND (1 <= p22))) : NOT(F ((((p50 <= 0) U X ((5 <= p4))) AND X (F ((((5 <= p4) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9)) OR (1 <= p50))))))) : F (G (NOT(G (X (G ((F ((1 <= p52)) OR (1 <= p48)))))))) : X (NOT(G (((1 <= p18) U F ((1 <= p15)))))) : ((G (((1 <= p0) AND (1 <= p51) AND (1 <= p52))) U F (((1 <= p0) AND (1 <= p51) AND (1 <= p52)))) U ((1 <= p46) AND (1 <= p47) AND (1 <= p49))) : X (G ((G ((NOT((((1 <= p36) AND (1 <= p37) AND (1 <= p39)) U (1 <= p15))) AND (p45 <= 0))) OR F (((1 <= p36) AND (1 <= p37) AND (1 <= p39)))))) : X ((X (X (((1 <= p15) OR (NOT(F ((1 <= p15))) AND (p37 <= 0))))) U ((1 <= p37) U X ((1 <= p27))))) : (NOT(F (G ((1 <= p50)))) U F ((((1 <= p31) AND (1 <= p32) AND (1 <= p34)) OR ((1 <= p33) AND (1 <= p25))))) : NOT((G ((X (((1 <= p16) AND (1 <= p17) AND (1 <= p19))) U ((1 <= p16) AND (1 <= p17) AND (1 <= p19)))) U F (G ((1 <= p10))))) : (X (G ((1 <= p35))) OR (5 <= p4)) : G (F (NOT(X (F ((((1 <= p45) OR (p43 <= 0)) AND (1 <= p26) AND (1 <= p27) AND (1 <= p29))))))) : ((G (((1 <= p52) U F ((1 <= p52)))) U ((1 <= p27) U G ((1 <= p27)))) U (p52 <= 0))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k: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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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: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: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: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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:315
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G ((p8 <= 0)) OR (1 <= p22))) OR (X (F (((1 <= p22) AND (1 <= p17)))) AND (1 <= p22)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p22)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p22)
lola: processed formula length: 10
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p22) AND (1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p22) AND (1 <= p17))))
lola: processed formula length: 35
lola: 77 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 12 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p50) R X ((p4 <= 4))) OR X (G ((((p4 <= 4) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0)) AND (p50 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p50) R X ((p4 <= 4))) OR X (G ((((p4 <= 4) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0)) AND (p50 <= 0))))))
lola: processed formula length: 116
lola: 77 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: 3818687 markings, 5918929 edges, 763737 markings/sec, 0 secs
lola: 7459317 markings, 11561911 edges, 728126 markings/sec, 5 secs
lola: 11196066 markings, 17353864 edges, 747350 markings/sec, 10 secs
lola: 14855803 markings, 23026463 edges, 731947 markings/sec, 15 secs
lola: 18474852 markings, 28635980 edges, 723810 markings/sec, 20 secs
lola: 22223071 markings, 34445713 edges, 749644 markings/sec, 25 secs
lola: 26503505 markings, 41081156 edges, 856087 markings/sec, 30 secs
lola: 30755828 markings, 47671504 edges, 850465 markings/sec, 35 secs
lola: 34714405 markings, 53807287 edges, 791715 markings/sec, 40 secs
lola: 38918635 markings, 60323823 edges, 840846 markings/sec, 45 secs
lola: 43320187 markings, 67146241 edges, 880310 markings/sec, 50 secs
lola: 47661094 markings, 73874653 edges, 868181 markings/sec, 55 secs
lola: 51880914 markings, 80415370 edges, 843964 markings/sec, 60 secs
lola: 56074381 markings, 86915251 edges, 838693 markings/sec, 65 secs
lola: 60239865 markings, 93371737 edges, 833097 markings/sec, 70 secs
lola: 64422309 markings, 99854551 edges, 836489 markings/sec, 75 secs
lola: 68580577 markings, 106299843 edges, 831654 markings/sec, 80 secs
lola: 72647285 markings, 112603275 edges, 813342 markings/sec, 85 secs
lola: 76724392 markings, 118922792 edges, 815421 markings/sec, 90 secs
lola: 80824485 markings, 125279371 edges, 820019 markings/sec, 95 secs
lola: 83710769 markings, 129754081 edges, 577257 markings/sec, 100 secs
lola: 86253455 markings, 133694213 edges, 508537 markings/sec, 105 secs
lola: 88924572 markings, 137833043 edges, 534223 markings/sec, 110 secs
lola: 90796398 markings, 140734395 edges, 374365 markings/sec, 115 secs
lola: 93418585 markings, 144798773 edges, 524437 markings/sec, 120 secs
lola: 95422359 markings, 147904620 edges, 400755 markings/sec, 125 secs
lola: 98484224 markings, 152650509 edges, 612373 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0)) R (p15 <= 0)) AND (p45 <= 0))) OR F (((1 <= p36) AND (1 <= p37) AND (1 <= p39))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0)) R (p15 <= 0)) AND (p45 <= 0))) OR F (((1 <= p36) AND (1 <= p37) AND (1 <= p39))))))
lola: processed formula length: 138
lola: 77 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: 3913742 markings, 6066280 edges, 782748 markings/sec, 0 secs
lola: 8036364 markings, 12456346 edges, 824524 markings/sec, 5 secs
lola: 12187443 markings, 18890511 edges, 830216 markings/sec, 10 secs
lola: 16436335 markings, 25476297 edges, 849778 markings/sec, 15 secs
lola: 20737180 markings, 32142611 edges, 860169 markings/sec, 20 secs
lola: 24967966 markings, 38700319 edges, 846157 markings/sec, 25 secs
lola: 29085811 markings, 45082984 edges, 823569 markings/sec, 30 secs
lola: 33039540 markings, 51211262 edges, 790746 markings/sec, 35 secs
lola: 36902605 markings, 57199017 edges, 772613 markings/sec, 40 secs
lola: 40915313 markings, 63418728 edges, 802542 markings/sec, 45 secs
lola: 44415623 markings, 68844197 edges, 700062 markings/sec, 50 secs
lola: 48163927 markings, 74654059 edges, 749661 markings/sec, 55 secs
lola: 52271406 markings, 81020659 edges, 821496 markings/sec, 60 secs
lola: 56314629 markings, 87287659 edges, 808645 markings/sec, 65 secs
lola: 60423231 markings, 93655977 edges, 821720 markings/sec, 70 secs
lola: 64591488 markings, 100116784 edges, 833651 markings/sec, 75 secs
lola: 68642069 markings, 106395204 edges, 810116 markings/sec, 80 secs
lola: 72519335 markings, 112407090 edges, 775453 markings/sec, 85 secs
lola: 74877747 markings, 116063398 edges, 471682 markings/sec, 90 secs
lola: 77105585 markings, 119513638 edges, 445568 markings/sec, 95 secs
lola: 79503100 markings, 123231208 edges, 479503 markings/sec, 100 secs
lola: 81271430 markings, 125970694 edges, 353666 markings/sec, 105 secs
lola: 82414265 markings, 127742097 edges, 228567 markings/sec, 110 secs
lola: 84549416 markings, 131051567 edges, 427030 markings/sec, 115 secs
lola: 87060250 markings, 134943369 edges, 502167 markings/sec, 120 secs
lola: 88675919 markings, 137447648 edges, 323134 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (((1 <= p15) OR (G ((p15 <= 0)) AND (p37 <= 0))))) U ((1 <= p37) U X ((1 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (((1 <= p15) OR (G ((p15 <= 0)) AND (p37 <= 0))))) U ((1 <= p37) U X ((1 <= p27)))))
lola: processed formula length: 93
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 17 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 148 markings, 275 edges
lola: ========================================
lola: subprocess 4 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p10 <= 0))) AND (F ((G (((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))) OR (X (((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))) AND ((p16 <= 0) OR (p17 <= 0) OR (p19 <= 0))))) OR G (F ((p10 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p10 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p10 <= 0)))
lola: processed formula length: 18
lola: 77 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: 193 markings, 234 edges
lola: ========================================
lola: subprocess 5 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p10 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p10 <= 0)))
lola: processed formula length: 18
lola: 77 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: 193 markings, 234 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p35))) OR (5 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (5 <= p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (5 <= p4)
lola: processed formula length: 9
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p35)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p35)))
lola: processed formula length: 18
lola: 77 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p15 <= 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 ((p15 <= 0)))
lola: processed formula length: 18
lola: 77 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: add low 9
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: 174 markings, 214 edges
lola: ========================================
lola: subprocess 7 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p33) AND (1 <= p0) AND (1 <= p51) AND (1 <= p52))))
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 (((1 <= p33) AND (1 <= p0) AND (1 <= p51) AND (1 <= p52))))
lola: processed formula length: 64
lola: 77 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: add low 41
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: 12 markings, 13 edges
lola: ========================================
lola: subprocess 8 will run for 658 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p45 <= 0) AND (1 <= p43)) OR (p26 <= 0) OR (p27 <= 0) OR (p29 <= 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 ((((p45 <= 0) AND (1 <= p43)) OR (p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))))
lola: processed formula length: 82
lola: 77 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: add low 41
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: 205 markings, 346 edges
lola: ========================================
lola: subprocess 9 will run for 822 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p52 <= 0)) AND (p48 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p52 <= 0)) AND (p48 <= 0))))
lola: processed formula length: 39
lola: 77 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: 18 markings, 18 edges
lola: ========================================
lola: subprocess 10 will run for 1096 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p27) U G ((1 <= p27))) OR (G (F ((1 <= p52))) AND F (G ((1 <= p27))))) U (p52 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p27) U G ((1 <= p27))) OR (G (F ((1 <= p52))) AND F (G ((1 <= p27))))) U (p52 <= 0))
lola: processed formula length: 93
lola: 77 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 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: 95 markings, 137 edges
lola: ========================================
lola: subprocess 11 will run for 1645 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p0) AND (1 <= p51) AND (1 <= p52))) OR (G (((1 <= p0) AND (1 <= p51) AND (1 <= p52))) AND F (((1 <= p0) AND (1 <= p51) AND (1 <= p52))))) U ((1 <= p46) AND (1 <= p47) AND (1 <= p49)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F (((1 <= p0) AND (1 <= p51) AND (1 <= p52))) OR (G (((1 <= p0) AND (1 <= p51) AND (1 <= p52))) AND F (((1 <= p0) AND (1 <= p51) AND (1 <= p52))))) U ((1 <= p46) AND (1 <= p47) AND (1 <= p49)))
lola: processed formula length: 195
lola: 77 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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 12 will run for 3290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((1 <= p31) AND (1 <= p32) AND (1 <= p34)) OR ((1 <= p33) AND (1 <= p25)))) OR (G (F ((p50 <= 0))) AND F ((((1 <= p31) AND (1 <= p32) AND (1 <= p34)) OR ((1 <= p33) AND (1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p31) AND (1 <= p32) AND (1 <= p34)) OR ((1 <= p33) AND (1 <= p25))))
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: (((p31 <= 0) OR (p32 <= 0) OR (p34 <= 0)) AND ((p33 <= 0) OR (p25 <= 0)))
lola: processed formula length: 76
lola: 79 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: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p50) R X ((p4 <= 4))) OR X (G ((((p4 <= 4) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0)) AND (p50 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p50) R X ((p4 <= 4))) OR X (G ((((p4 <= 4) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0)) AND (p50 <= 0))))))
lola: processed formula length: 116
lola: 77 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: 3814910 markings, 5913074 edges, 762982 markings/sec, 0 secs
lola: 7830977 markings, 12137982 edges, 803213 markings/sec, 5 secs
lola: 11706146 markings, 18144492 edges, 775034 markings/sec, 10 secs
lola: 15681054 markings, 24305589 edges, 794982 markings/sec, 15 secs
lola: 19888938 markings, 30827810 edges, 841577 markings/sec, 20 secs
lola: 23517604 markings, 36452243 edges, 725733 markings/sec, 25 secs
lola: 27289093 markings, 42298045 edges, 754298 markings/sec, 30 secs
lola: 30744889 markings, 47654529 edges, 691159 markings/sec, 35 secs
lola: 34732850 markings, 53835892 edges, 797592 markings/sec, 40 secs
lola: 38627961 markings, 59873287 edges, 779022 markings/sec, 45 secs
lola: 42477168 markings, 65839568 edges, 769841 markings/sec, 50 secs
lola: 46266967 markings, 71713764 edges, 757960 markings/sec, 55 secs
lola: 49840938 markings, 77253427 edges, 714794 markings/sec, 60 secs
lola: 53680545 markings, 83204789 edges, 767921 markings/sec, 65 secs
lola: 57767008 markings, 89538810 edges, 817293 markings/sec, 70 secs
lola: 61823025 markings, 95825647 edges, 811203 markings/sec, 75 secs
lola: 65921994 markings, 102179048 edges, 819794 markings/sec, 80 secs
lola: 70019198 markings, 108529706 edges, 819441 markings/sec, 85 secs
lola: 74061016 markings, 114794531 edges, 808364 markings/sec, 90 secs
lola: 77713783 markings, 120456326 edges, 730553 markings/sec, 95 secs
lola: 81100801 markings, 125709250 edges, 677404 markings/sec, 100 secs
lola: 83048199 markings, 128726450 edges, 389480 markings/sec, 105 secs
lola: 85046713 markings, 131822384 edges, 399703 markings/sec, 110 secs
lola: 87270367 markings, 135269021 edges, 444731 markings/sec, 115 secs
lola: 89547036 markings, 138797869 edges, 455334 markings/sec, 120 secs
lola: 91692677 markings, 142123596 edges, 429128 markings/sec, 125 secs
lola: 92958278 markings, 144085289 edges, 253120 markings/sec, 130 secs
lola: 95287695 markings, 147695880 edges, 465883 markings/sec, 135 secs
lola: 97412959 markings, 150990045 edges, 425053 markings/sec, 140 secs
lola: 99581041 markings, 154350568 edges, 433616 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G ((G (((((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0)) R (p15 <= 0)) AND (p45 <= 0))) OR F (((1 <= p36) AND (1 <= p37) AND (1 <= p39))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((((p36 <= 0) OR (p37 <= 0) OR (p39 <= 0)) R (p15 <= 0)) AND (p45 <= 0))) OR F (((1 <= p36) AND (1 <= p37) AND (1 <= p39))))))
lola: processed formula length: 138
lola: 77 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: 3260352 markings, 5053531 edges, 652070 markings/sec, 0 secs
lola: 6980288 markings, 10819429 edges, 743987 markings/sec, 5 secs
lola: 11057706 markings, 17139429 edges, 815484 markings/sec, 10 secs
lola: 15113604 markings, 23426069 edges, 811180 markings/sec, 15 secs
lola: 19198644 markings, 29757869 edges, 817008 markings/sec, 20 secs
lola: 23269305 markings, 36067396 edges, 814132 markings/sec, 25 secs
lola: 27236281 markings, 42216207 edges, 793395 markings/sec, 30 secs
lola: 31160842 markings, 48299285 edges, 784912 markings/sec, 35 secs
lola: 35004592 markings, 54257098 edges, 768750 markings/sec, 40 secs
lola: 38862477 markings, 60236824 edges, 771577 markings/sec, 45 secs
lola: 42596160 markings, 66024030 edges, 746737 markings/sec, 50 secs
lola: 45994790 markings, 71291906 edges, 679726 markings/sec, 55 secs
lola: 49360101 markings, 76508134 edges, 673062 markings/sec, 60 secs
lola: 52770638 markings, 81794464 edges, 682107 markings/sec, 65 secs
lola: 56548954 markings, 87650860 edges, 755663 markings/sec, 70 secs
lola: 60219188 markings, 93339717 edges, 734047 markings/sec, 75 secs
lola: 64178483 markings, 99476626 edges, 791859 markings/sec, 80 secs
lola: 68041658 markings, 105464546 edges, 772635 markings/sec, 85 secs
lola: 71554802 markings, 110910734 edges, 702629 markings/sec, 90 secs
lola: 74543621 markings, 115543406 edges, 597764 markings/sec, 95 secs
lola: 76363812 markings, 118363888 edges, 364038 markings/sec, 100 secs
lola: 78748818 markings, 122060642 edges, 477001 markings/sec, 105 secs
lola: 81009270 markings, 125564345 edges, 452090 markings/sec, 110 secs
lola: 83273963 markings, 129074617 edges, 452939 markings/sec, 115 secs
lola: 85236030 markings, 132115833 edges, 392413 markings/sec, 120 secs
lola: 87123580 markings, 135041519 edges, 377510 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes unknown no no no unknown yes no no no no no
lola:
preliminary result: no yes unknown no no no unknown yes no no no no no
lola: memory consumption: 3284 KB
lola: time consumption: 571 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="RefineWMG-PT-010010"
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 RefineWMG-PT-010010, 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 r189-tajo-162089432900314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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