MCC'2021- Execution of r113-smll-162075355700102

About the Execution of 2020-gold for GPPP-PT-C0001N0000100000

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16256.371	3600000.00	609582.00	30260.60	FTF?FFFFFFFFFTFF	normal

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.r113-smll-162075355700102.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is GPPP-PT-C0001N0000100000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-162075355700102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000100000-00
FORMULA_NAME GPPP-PT-C0001N0000100000-01
FORMULA_NAME GPPP-PT-C0001N0000100000-02
FORMULA_NAME GPPP-PT-C0001N0000100000-03
FORMULA_NAME GPPP-PT-C0001N0000100000-04
FORMULA_NAME GPPP-PT-C0001N0000100000-05
FORMULA_NAME GPPP-PT-C0001N0000100000-06
FORMULA_NAME GPPP-PT-C0001N0000100000-07
FORMULA_NAME GPPP-PT-C0001N0000100000-08
FORMULA_NAME GPPP-PT-C0001N0000100000-09
FORMULA_NAME GPPP-PT-C0001N0000100000-10
FORMULA_NAME GPPP-PT-C0001N0000100000-11
FORMULA_NAME GPPP-PT-C0001N0000100000-12
FORMULA_NAME GPPP-PT-C0001N0000100000-13
FORMULA_NAME GPPP-PT-C0001N0000100000-14
FORMULA_NAME GPPP-PT-C0001N0000100000-15

=== Now, execution of the tool begins

BK_START 1620948141722

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 23:22:25] [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-13 23:22:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 23:22:25] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-13 23:22:25] [INFO ] Transformed 33 places.
[2021-05-13 23:22:25] [INFO ] Transformed 22 transitions.
[2021-05-13 23:22:25] [INFO ] Parsed PT model containing 33 places and 22 transitions in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 0 resets, run finished after 218 ms. (steps per millisecond=458 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 22 rows 33 cols
[2021-05-13 23:22:25] [INFO ] Computed 13 place invariants in 9 ms
[2021-05-13 23:22:25] [INFO ] [Real]Absence check using 6 positive place invariants in 34 ms returned sat
[2021-05-13 23:22:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 10 ms returned unsat
[2021-05-13 23:22:25] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned sat
[2021-05-13 23:22:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-13 23:22:26] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 23:22:26] [INFO ] Flatten gal took : 58 ms
FORMULA GPPP-PT-C0001N0000100000-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000100000-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 23:22:26] [INFO ] Flatten gal took : 16 ms
[2021-05-13 23:22:26] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2021-05-13 23:22:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ GPPP-PT-C0001N0000100000 @ 3570 seconds

FORMULA GPPP-PT-C0001N0000100000-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000100000-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2966
rslt: Output for LTLFireability @ GPPP-PT-C0001N0000100000

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((X ((1 <= p12)) OR (G (((1 <= p26))) AND X (F ((1 <= p12))))) U X ((G (((2 <= p4) AND (1 <= p15) AND (1 <= p28))) OR ((1 <= p20) OR ((1 <= p26))))))",
"processed_size": 149,
"rewrites": 78
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 12
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (((X (((1 <= p26))) OR ((p8 <= 0) OR (p30 <= 0))) AND G (((1 <= p16) OR ((1 <= p11) AND (1 <= p12) AND (7 <= p31)) OR ((1 <= p26))))))",
"processed_size": 138,
"rewrites": 78
},
"result":
{
"edges": 39,
"markings": 39,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 326
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(X (X (F (((p15 <= 0) OR (p27 <= 2))))) U (X (F (((1 <= p11) AND (1 <= p12) AND (7 <= p31)))) AND ((1 <= p15) AND (3 <= p27))))",
"processed_size": 128,
"rewrites": 78
},
"result":
{
"edges": 178,
"markings": 169,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 363
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 408
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((((1 <= p5) AND (1 <= p6)) OR ((1 <= p15) AND (3 <= p27))) U X ((X (F (((1 <= p8) AND (1 <= p30)))) AND ((1 <= p15) AND (3 <= p27)))))",
"processed_size": 136,
"rewrites": 78
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 466
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "G (((p5 <= 0) OR (p6 <= 0)))",
"processed_size": 29,
"rewrites": 78
},
"result":
{
"edges": 30,
"markings": 30,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 544
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p24) U ((1 <= p8) AND (1 <= p30))) U ((1 <= p8) AND (1 <= p30)))",
"processed_size": 72,
"rewrites": 78
},
"result":
{
"edges": 30,
"markings": 30,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 653
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 (((1 <= p8) AND (1 <= p30)))",
"processed_size": 30,
"rewrites": 78
},
"result":
{
"edges": 38,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 544
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 4,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (((2 <= p7) R ((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0)))) OR (G (F ((p17 <= 0))) AND X (F (((2 <= p7) R ((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0))))))))",
"processed_size": 157,
"rewrites": 78
},
"result":
{
"edges": 5066578,
"markings": 4413470,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 652
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"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 <= p12) AND (1 <= p32)) U (1 <= p21)) AND G ((F (((p0 <= 0) OR (p12 <= 0) OR (p32 <= 0))) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p32) AND (1 <= p19) AND (1 <= p22))))))",
"processed_size": 193,
"rewrites": 78
},
"result":
{
"edges": 39,
"markings": 39,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 8,
"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": 815
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 815
},
"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": "(p17 <= 0)",
"processed_size": 10,
"rewrites": 78
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1087
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "G (F (((1 <= p8) AND (2 <= p29))))",
"processed_size": 34,
"rewrites": 78
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1087
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0))",
"processed_size": 41,
"rewrites": 78
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1631
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "F (G (((p8 <= 0) OR (p29 <= 1))))",
"processed_size": 34,
"rewrites": 78
},
"result":
{
"edges": 791,
"markings": 610,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1631
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p19) AND (1 <= p22)) OR ((1 <= p15) AND (3 <= p27)))",
"processed_size": 60,
"rewrites": 79
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3262
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p21) OR ((1 <= p19) AND (1 <= p22)))) OR (1 <= p12)))",
"processed_size": 68,
"rewrites": 78
},
"result":
{
"edges": 20,
"markings": 20,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3262
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p14))",
"processed_size": 12,
"rewrites": 78
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "F ((((1 <= p17) U (1 <= p20)) AND (1 <= p17)))",
"processed_size": 46,
"rewrites": 78
},
"result":
{
"edges": 38,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3180,
"runtime": 604.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(F(**)) AND **) : ((X(**) OR (G(**) AND X(F(**)))) U X((G(**) OR (** OR **)))) : (G(*) AND (F(((** U **) AND **)) OR **)) : G((G(*) OR X(G((* OR *))))) : (G((F(**) OR **)) OR (** OR **)) : X(((X(**) OR (* OR *)) AND G(**))) : (F(G(*)) AND **) : (X(X(F(*))) U (X(F(**)) AND (** AND **))) : (((X(F(*)) OR **) U **) AND X(**)) : (** U X((X(F(**)) AND (** AND **)))) : (((** U **) U **) OR (G(**) OR X(**))) : X((X((* R *)) OR (G(F(**)) AND X(F((* R *)))))) : F(((** U **) AND G((F(*) OR **))))"
},
"net":
{
"arcs": 83,
"conflict_clusters": 14,
"places": 33,
"places_significant": 20,
"singleton_clusters": 0,
"transitions": 22
},
"result":
{
"preliminary_value": "no yes no unknown no no no no no no no no no ",
"value": "no yes no unknown 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: 55/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 20 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: (1 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p2)
lola: LP says that atomic proposition is always true: (1 <= p2)
lola: LP says that atomic proposition is always true: (1 <= p2)
lola: LP says that atomic proposition is always true: (1 <= p2)
lola: LP says that atomic proposition is always true: (1 <= p2)
lola: (NOT(F (G (NOT(X (X (F (((1 <= p8) AND (2 <= p29))))))))) AND (p17 <= 0)) : ((G (((1 <= p26))) U X ((1 <= p12))) U X (((G (((2 <= p4) AND (1 <= p15) AND (1 <= p28))) OR (1 <= p20)) OR ((1 <= p26))))) : (G (NOT(F (((1 <= p9) AND (1 <= p10))))) AND (F ((((1 <= p17) U (1 <= p20)) AND (1 <= p17))) OR ((1 <= p14)))) : NOT(F ((F (((1 <= p18) AND (1 <= p19))) AND F ((X ((((1 <= p21) AND (1 <= p18) AND (1 <= p19)) OR ((1 <= p18) AND (1 <= p19)))) AND X (((1 <= p15) AND (3 <= p27)))))))) : ((G ((F (((1 <= p21) OR ((1 <= p19) AND (1 <= p22)))) OR (1 <= p12))) OR ((1 <= p19) AND (1 <= p22))) OR ((1 <= p15) AND (3 <= p27))) : NOT(X ((((NOT(X (((1 <= p26)))) AND (1 <= p8)) AND (1 <= p30)) OR NOT(G (((1 <= p16) OR ((1 <= p11) AND (1 <= p12) AND (7 <= p31)) OR ((1 <= p26)))))))) : (NOT(X (F (G (F (X (((1 <= p8) AND (2 <= p29)))))))) AND ((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0))) : (F (NOT(X (X (((1 <= p15) AND (3 <= p27)))))) U ((F (X (F (((1 <= p11) AND (1 <= p12) AND (7 <= p31))))) AND (1 <= p15)) AND (3 <= p27))) : (((NOT(X (G (((1 <= p11) AND (1 <= p12) AND (7 <= p31))))) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p32))) U (1 <= p12)) AND X ((((1 <= p0) AND (1 <= p12) AND (1 <= p32)) OR ((1 <= p11) AND (1 <= p12) AND (7 <= p31))))) : ((((1 <= p5) AND (1 <= p6)) OR ((1 <= p15) AND (3 <= p27))) U X (((F ((((1 <= p8) AND (1 <= p30)) U X (((1 <= p8) AND (1 <= p30))))) AND (1 <= p15)) AND (3 <= p27)))) : (((((1 <= p24) U ((1 <= p8) AND (1 <= p30))) U ((1 <= p8) AND (1 <= p30))) OR G (((p5 <= 0) OR (p6 <= 0)))) OR X (((1 <= p8) AND (1 <= p30)))) : X ((G (F ((((2 <= p4) AND (1 <= p15) AND (1 <= p28)) U (p17 <= 0)))) U X (NOT(((p7 <= 1) U ((2 <= p4) AND (1 <= p15) AND (1 <= p28))))))) : F (((((1 <= p0) AND (1 <= p12) AND (1 <= p32)) U (1 <= p21)) AND G ((NOT(G (((1 <= p0) AND (1 <= p12) AND (1 <= p32)))) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p32) AND (1 <= p19) AND (1 <= p22))))))
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:297
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:380
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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 ((1 <= p12)) OR (G (((1 <= p26))) AND X (F ((1 <= p12))))) U X ((G (((2 <= p4) AND (1 <= p15) AND (1 <= p28))) OR ((1 <= p20) OR ((1 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X ((1 <= p12)) OR (G (((1 <= p26))) AND X (F ((1 <= p12))))) U X ((G (((2 <= p4) AND (1 <= p15) AND (1 <= p28))) OR ((1 <= p20) OR ((1 <= p26))))))
lola: processed formula length: 149
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((p18 <= 0) OR (p19 <= 0))) OR X (G (((((p21 <= 0) OR (p18 <= 0) OR (p19 <= 0)) AND ((p18 <= 0) OR (p19 <= 0))) OR ((p15 <= 0) OR (p27 <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p18 <= 0) OR (p19 <= 0))) OR X (G (((((p21 <= 0) OR (p18 <= 0) OR (p19 <= 0)) AND ((p18 <= 0) OR (p19 <= 0))) OR ((p15 <= 0) OR (p27 <= 2)))))))
lola: processed formula length: 158
lola: 78 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: 2891399 markings, 4876515 edges, 578280 markings/sec, 0 secs
lola: 5868429 markings, 9884240 edges, 595406 markings/sec, 5 secs
lola: 8904783 markings, 14991762 edges, 607271 markings/sec, 10 secs
lola: 11327778 markings, 19940233 edges, 484599 markings/sec, 15 secs
lola: 13620009 markings, 24788426 edges, 458446 markings/sec, 20 secs
lola: 15912605 markings, 29637410 edges, 458519 markings/sec, 25 secs
lola: 18342625 markings, 34665444 edges, 486004 markings/sec, 30 secs
lola: 20439898 markings, 39101315 edges, 419455 markings/sec, 35 secs
lola: 22606938 markings, 43684724 edges, 433408 markings/sec, 40 secs
lola: 24680769 markings, 48071009 edges, 414766 markings/sec, 45 secs
lola: 26921462 markings, 52810198 edges, 448139 markings/sec, 50 secs
lola: 29216772 markings, 57553319 edges, 459062 markings/sec, 55 secs
lola: 31400111 markings, 62171206 edges, 436668 markings/sec, 60 secs
lola: 33546138 markings, 66710182 edges, 429205 markings/sec, 65 secs
lola: 35792402 markings, 71461160 edges, 449253 markings/sec, 70 secs
lola: 38068749 markings, 76164189 edges, 455269 markings/sec, 75 secs
lola: 40204747 markings, 80681943 edges, 427200 markings/sec, 80 secs
lola: 42328304 markings, 85173397 edges, 424711 markings/sec, 85 secs
lola: 44497816 markings, 89762047 edges, 433902 markings/sec, 90 secs
lola: 46769828 markings, 94465748 edges, 454402 markings/sec, 95 secs
lola: 48764661 markings, 98704230 edges, 398967 markings/sec, 100 secs
lola: 50876235 markings, 103190759 edges, 422315 markings/sec, 105 secs
lola: 52983153 markings, 107667399 edges, 421384 markings/sec, 110 secs
lola: 55260845 markings, 112391810 edges, 455538 markings/sec, 115 secs
lola: 57340428 markings, 116790256 edges, 415917 markings/sec, 120 secs
lola: 59421159 markings, 121191117 edges, 416146 markings/sec, 125 secs
lola: 61494008 markings, 125575317 edges, 414570 markings/sec, 130 secs
lola: 63651966 markings, 130139529 edges, 431592 markings/sec, 135 secs
lola: 65809401 markings, 134591041 edges, 431487 markings/sec, 140 secs
lola: 67854514 markings, 138916572 edges, 409023 markings/sec, 145 secs
lola: 69882880 markings, 143206691 edges, 405673 markings/sec, 150 secs
lola: 71972054 markings, 147625421 edges, 417835 markings/sec, 155 secs
lola: 74178966 markings, 152181566 edges, 441382 markings/sec, 160 secs
lola: 76212580 markings, 156482789 edges, 406723 markings/sec, 165 secs
lola: 78252331 markings, 160796989 edges, 407950 markings/sec, 170 secs
lola: 80304219 markings, 165136852 edges, 410378 markings/sec, 175 secs
lola: 82508168 markings, 169686740 edges, 440790 markings/sec, 180 secs
lola: 84518866 markings, 173939484 edges, 402140 markings/sec, 185 secs
lola: 86511557 markings, 178154155 edges, 398538 markings/sec, 190 secs
lola: 88488586 markings, 182335683 edges, 395406 markings/sec, 195 secs
lola: 90556875 markings, 186710234 edges, 413658 markings/sec, 200 secs
lola: 92184721 markings, 190070035 edges, 325569 markings/sec, 205 secs
lola: 93176387 markings, 192212869 edges, 198333 markings/sec, 210 secs
lola: 94672372 markings, 195448241 edges, 299197 markings/sec, 215 secs
lola: 95970179 markings, 198250805 edges, 259561 markings/sec, 220 secs
lola: 97204388 markings, 200918408 edges, 246842 markings/sec, 225 secs
lola: 98411906 markings, 203528333 edges, 241504 markings/sec, 230 secs
lola: 99912892 markings, 206772562 edges, 300197 markings/sec, 235 secs
lola: 101464790 markings, 210002466 edges, 310380 markings/sec, 240 secs
lola: 102581034 markings, 212374198 edges, 223249 markings/sec, 245 secs
lola: 104156131 markings, 215720856 edges, 315019 markings/sec, 250 secs
lola: 105595219 markings, 218778524 edges, 287818 markings/sec, 255 secs
lola: 106804491 markings, 221347908 edges, 241854 markings/sec, 260 secs
lola: 108349728 markings, 224631130 edges, 309047 markings/sec, 265 secs
lola: 109640964 markings, 227374660 edges, 258247 markings/sec, 270 secs
lola: 111313154 markings, 230807116 edges, 334438 markings/sec, 275 secs
lola: 112516751 markings, 233352789 edges, 240719 markings/sec, 280 secs
lola: 113698435 markings, 235852136 edges, 236337 markings/sec, 285 secs
lola: 113958632 markings, 236402455 edges, 52039 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (((1 <= p26))) OR ((p8 <= 0) OR (p30 <= 0))) AND G (((1 <= p16) OR ((1 <= p11) AND (1 <= p12) AND (7 <= p31)) OR ((1 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (((1 <= p26))) OR ((p8 <= 0) OR (p30 <= 0))) AND G (((1 <= p16) OR ((1 <= p11) AND (1 <= p12) AND (7 <= p31)) OR ((1 <= p26))))))
lola: processed formula length: 138
lola: 78 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: 39 markings, 39 edges
lola: ========================================
lola: subprocess 3 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F (((p15 <= 0) OR (p27 <= 2))))) U (X (F (((1 <= p11) AND (1 <= p12) AND (7 <= p31)))) AND ((1 <= p15) AND (3 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (F (((p15 <= 0) OR (p27 <= 2))))) U (X (F (((1 <= p11) AND (1 <= p12) AND (7 <= p31)))) AND ((1 <= p15) AND (3 <= p27))))
lola: processed formula length: 128
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 169 markings, 178 edges
lola: ========================================
lola: subprocess 4 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((X (F (((p11 <= 0) OR (p12 <= 0) OR (p31 <= 6)))) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p32))) U (1 <= p12)) AND X ((((1 <= p0) AND (1 <= p12) AND (1 <= p32)) OR ((1 <= p11) AND (1 <= p12) AND (7 <= p31)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p0) AND (1 <= p12) AND (1 <= p32)) OR ((1 <= p11) AND (1 <= p12) AND (7 <= p31))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p0) AND (1 <= p12) AND (1 <= p32)) OR ((1 <= p11) AND (1 <= p12) AND (7 <= p31))))
lola: processed formula length: 94
lola: 78 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: 38 markings, 38 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p5) AND (1 <= p6)) OR ((1 <= p15) AND (3 <= p27))) U X ((X (F (((1 <= p8) AND (1 <= p30)))) AND ((1 <= p15) AND (3 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p5) AND (1 <= p6)) OR ((1 <= p15) AND (3 <= p27))) U X ((X (F (((1 <= p8) AND (1 <= p30)))) AND ((1 <= p15) AND (3 <= p27)))))
lola: processed formula length: 136
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 6 will run for 466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p24) U ((1 <= p8) AND (1 <= p30))) U ((1 <= p8) AND (1 <= p30))) OR (G (((p5 <= 0) OR (p6 <= 0))) OR X (((1 <= p8) AND (1 <= p30)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p5 <= 0) OR (p6 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p5 <= 0) OR (p6 <= 0)))
lola: processed formula length: 29
lola: 78 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: 30 markings, 30 edges
lola: ========================================
lola: subprocess 7 will run for 544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p24) U ((1 <= p8) AND (1 <= p30))) U ((1 <= p8) AND (1 <= p30)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p24) U ((1 <= p8) AND (1 <= p30))) U ((1 <= p8) AND (1 <= p30)))
lola: processed formula length: 72
lola: 78 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: 30 markings, 30 edges
lola: ========================================
lola: subprocess 8 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p8) AND (1 <= p30)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p8) AND (1 <= p30)))
lola: processed formula length: 30
lola: 78 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: 38 markings, 38 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 544 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((2 <= p7) R ((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0)))) OR (G (F ((p17 <= 0))) AND X (F (((2 <= p7) R ((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((2 <= p7) R ((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0)))) OR (G (F ((p17 <= 0))) AND X (F (((2 <= p7) R ((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0))))))))
lola: processed formula length: 157
lola: 78 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: 3561053 markings, 4073629 edges, 712211 markings/sec, 0 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: 4413470 markings, 5066578 edges
lola: ========================================
lola: subprocess 8 will run for 652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((1 <= p0) AND (1 <= p12) AND (1 <= p32)) U (1 <= p21)) AND G ((F (((p0 <= 0) OR (p12 <= 0) OR (p32 <= 0))) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p32) AND (1 <= p19) AND (1 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((((1 <= p0) AND (1 <= p12) AND (1 <= p32)) U (1 <= p21)) AND G ((F (((p0 <= 0) OR (p12 <= 0) OR (p32 <= 0))) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p32) AND (1 <= p19) AND (1 <= p22))))))
lola: processed formula length: 193
lola: 78 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: 39 markings, 39 edges
lola: ========================================
lola: subprocess 9 will run for 815 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p8) AND (2 <= p29)))) AND (p17 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 815 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p17 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p17 <= 0)
lola: processed formula length: 10
lola: 78 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 10 will run for 1087 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p8) AND (2 <= p29))))
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 (((1 <= p8) AND (2 <= p29))))
lola: processed formula length: 34
lola: 78 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: 14 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 1087 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((p8 <= 0) OR (p29 <= 1)))) AND ((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1087 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0))
lola: processed formula length: 41
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 11 will run for 1631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p8 <= 0) OR (p29 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p8 <= 0) OR (p29 <= 1))))
lola: processed formula length: 34
lola: 78 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: add low 7
lola: add low 7
lola: add low 8
lola: add low 8
lola: add low 10
lola: add low 6
lola: add low 4
lola: add low 3
lola: add low 1
lola: add low 21
lola: add low 12
lola: add low 0
lola: add low 14
lola: add low 15
lola: add low 16
lola: add low 0
lola: add low 17
lola: add low 18
lola: add low 14
lola: add low 15
lola: add low 16
lola: add low 17
lola: add low 18
lola: add low 9
lola: add low 7
lola: add low 7
lola: add low 8
lola: add low 8
lola: add low 10
lola: add low 4
lola: add low 3
lola: add low 1
lola: add low 0
lola: add low 14
lola: add low 15
lola: add low 16
lola: add low 0
lola: add low 17
lola: add low 18
lola: add low 14
lola: add low 15
lola: add low 16
lola: add low 17
lola: add low 18
lola: add low 13
lola: add low 0
lola: add low 14
lola: add low 15
lola: add low 16
lola: add low 4
lola: add low 3
lola: add low 1
lola: add low 0
lola: add low 17
lola: add low 18
lola: add low 14
lola: add low 15
lola: add low 16
lola: add low 0
lola: add low 17
lola: add low 18
lola: add low 14
lola: add low 15
lola: add low 16
lola: add low 17
lola: add low 18
lola: add low 19
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: 610 markings, 791 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 1631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F (((1 <= p21) OR ((1 <= p19) AND (1 <= p22)))) OR (1 <= p12))) OR (((1 <= p19) AND (1 <= p22)) OR ((1 <= p15) AND (3 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p19) AND (1 <= p22)) OR ((1 <= p15) AND (3 <= p27)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((1 <= p19) AND (1 <= p22)) OR ((1 <= p15) AND (3 <= p27)))
lola: processed formula length: 60
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 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 12 will run for 3262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p21) OR ((1 <= p19) AND (1 <= p22)))) OR (1 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p21) OR ((1 <= p19) AND (1 <= p22)))) OR (1 <= p12)))
lola: processed formula length: 68
lola: 78 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: 20 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 3262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p9 <= 0) OR (p10 <= 0))) AND (F ((((1 <= p17) U (1 <= p20)) AND (1 <= p17))) OR ((1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p14))
lola: processed formula length: 12
lola: 78 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: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p17) U (1 <= p20)) AND (1 <= p17)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((1 <= p17) U (1 <= p20)) AND (1 <= p17)))
lola: processed formula length: 46
lola: 78 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: 38 markings, 38 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((G (((p18 <= 0) OR (p19 <= 0))) OR X (G (((((p21 <= 0) OR (p18 <= 0) OR (p19 <= 0)) AND ((p18 <= 0) OR (p19 <= 0))) OR ((p15 <= 0) OR (p27 <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p18 <= 0) OR (p19 <= 0))) OR X (G (((((p21 <= 0) OR (p18 <= 0) OR (p19 <= 0)) AND ((p18 <= 0) OR (p19 <= 0))) OR ((p15 <= 0) OR (p27 <= 2)))))))
lola: processed formula length: 158
lola: 78 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: 2587277 markings, 4364937 edges, 517455 markings/sec, 0 secs
lola: 5571197 markings, 9384263 edges, 596784 markings/sec, 5 secs
lola: 8580754 markings, 14446706 edges, 601911 markings/sec, 10 secs
lola: 11060285 markings, 19374460 edges, 495906 markings/sec, 15 secs
lola: 13360084 markings, 24238680 edges, 459960 markings/sec, 20 secs
lola: 15652500 markings, 29087261 edges, 458483 markings/sec, 25 secs
lola: 18020640 markings, 34096035 edges, 473628 markings/sec, 30 secs
lola: 20294792 markings, 38794396 edges, 454830 markings/sec, 35 secs
lola: 22471934 markings, 43399173 edges, 435428 markings/sec, 40 secs
lola: 24648843 markings, 48003477 edges, 435382 markings/sec, 45 secs
lola: 26903357 markings, 52771905 edges, 450903 markings/sec, 50 secs
lola: 29220442 markings, 57561073 edges, 463417 markings/sec, 55 secs
lola: 31426489 markings, 62227003 edges, 441209 markings/sec, 60 secs
lola: 33605699 markings, 66836154 edges, 435842 markings/sec, 65 secs
lola: 35870370 markings, 71626066 edges, 452934 markings/sec, 70 secs
lola: 38155589 markings, 76347857 edges, 457044 markings/sec, 75 secs
lola: 40309310 markings, 80903106 edges, 430744 markings/sec, 80 secs
lola: 42443691 markings, 85417443 edges, 426876 markings/sec, 85 secs
lola: 44635414 markings, 90053073 edges, 438345 markings/sec, 90 secs
lola: 46898345 markings, 94738814 edges, 452586 markings/sec, 95 secs
lola: 48984511 markings, 99171355 edges, 417233 markings/sec, 100 secs
lola: 51109681 markings, 103686781 edges, 425034 markings/sec, 105 secs
lola: 53165043 markings, 108053867 edges, 411072 markings/sec, 110 secs
lola: 55452206 markings, 112796546 edges, 457433 markings/sec, 115 secs
lola: 57468489 markings, 117061097 edges, 403257 markings/sec, 120 secs
lola: 59562856 markings, 121490825 edges, 418873 markings/sec, 125 secs
lola: 61659243 markings, 125924799 edges, 419277 markings/sec, 130 secs
lola: 63846143 markings, 130550227 edges, 437380 markings/sec, 135 secs
lola: 66020281 markings, 135037063 edges, 434828 markings/sec, 140 secs
lola: 68089534 markings, 139413663 edges, 413851 markings/sec, 145 secs
lola: 70138851 markings, 143748080 edges, 409863 markings/sec, 150 secs
lola: 72279449 markings, 148275584 edges, 428120 markings/sec, 155 secs
lola: 74491166 markings, 152841891 edges, 442343 markings/sec, 160 secs
lola: 76538021 markings, 157171115 edges, 409371 markings/sec, 165 secs
lola: 78584745 markings, 161500065 edges, 409345 markings/sec, 170 secs
lola: 80656361 markings, 165881655 edges, 414323 markings/sec, 175 secs
lola: 82876074 markings, 170464879 edges, 443943 markings/sec, 180 secs
lola: 84893246 markings, 174731313 edges, 403434 markings/sec, 185 secs
lola: 86905324 markings, 178986987 edges, 402416 markings/sec, 190 secs
lola: 88927794 markings, 183264634 edges, 404494 markings/sec, 195 secs
lola: 91034941 markings, 187721371 edges, 421429 markings/sec, 200 secs
lola: 92952987 markings, 191730237 edges, 383609 markings/sec, 205 secs
lola: 93951356 markings, 193887324 edges, 199674 markings/sec, 210 secs
lola: 95203377 markings, 196593435 edges, 250404 markings/sec, 215 secs
lola: 96410513 markings, 199202542 edges, 241427 markings/sec, 220 secs
lola: 97720696 markings, 202034352 edges, 262037 markings/sec, 225 secs
lola: 99263578 markings, 205369147 edges, 308576 markings/sec, 230 secs
lola: 100733549 markings, 208546327 edges, 293994 markings/sec, 235 secs
lola: 102094198 markings, 211339792 edges, 272130 markings/sec, 240 secs
lola: 103650028 markings, 214645526 edges, 311166 markings/sec, 245 secs
lola: 104991720 markings, 217496260 edges, 268338 markings/sec, 250 secs
lola: 106307360 markings, 220291639 edges, 263128 markings/sec, 255 secs
lola: 107985248 markings, 223856710 edges, 335578 markings/sec, 260 secs
lola: 109332059 markings, 226718313 edges, 269362 markings/sec, 265 secs
lola: 110722695 markings, 229558270 edges, 278127 markings/sec, 270 secs
lola: 111832439 markings, 231905437 edges, 221949 markings/sec, 275 secs
lola: 113184247 markings, 234764596 edges, 270362 markings/sec, 280 secs
lola: 114076022 markings, 236650748 edges, 178355 markings/sec, 285 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes no unknown no no no no no no no no no
lola:
preliminary result: no yes no unknown no no no no no no no no no
lola: memory consumption: 3180 KB
lola: time consumption: 604 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="GPPP-PT-C0001N0000100000"
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 GPPP-PT-C0001N0000100000, 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 r113-smll-162075355700102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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