Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914100618.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is CSRepetitions-COL-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100618
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 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 CSRepetitions-COL-03-00
FORMULA_NAME CSRepetitions-COL-03-01
FORMULA_NAME CSRepetitions-COL-03-02
FORMULA_NAME CSRepetitions-COL-03-03
FORMULA_NAME CSRepetitions-COL-03-04
FORMULA_NAME CSRepetitions-COL-03-05
FORMULA_NAME CSRepetitions-COL-03-06
FORMULA_NAME CSRepetitions-COL-03-07
FORMULA_NAME CSRepetitions-COL-03-08
FORMULA_NAME CSRepetitions-COL-03-09
FORMULA_NAME CSRepetitions-COL-03-10
FORMULA_NAME CSRepetitions-COL-03-11
FORMULA_NAME CSRepetitions-COL-03-12
FORMULA_NAME CSRepetitions-COL-03-13
FORMULA_NAME CSRepetitions-COL-03-14
FORMULA_NAME CSRepetitions-COL-03-15

=== Now, execution of the tool begins

BK_START 1591168096367

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 07:08:17] [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]
[2020-06-03 07:08:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 07:08:17] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 07:08:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 447 ms
[2020-06-03 07:08:18] [INFO ] sort/places :
Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,

[2020-06-03 07:08:18] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 58 PT places and 81.0 transition bindings in 12 ms.
[2020-06-03 07:08:18] [INFO ] Computed order based on color domains.
[2020-06-03 07:08:18] [INFO ] Unfolded HLPN to a Petri net with 58 places and 81 transitions in 55 ms.
[2020-06-03 07:08:18] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 99 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 25 steps, including 0 resets, run visited all 28 properties in 3 ms. (steps per millisecond=8 )
[2020-06-03 07:08:18] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 07:08:18] [INFO ] Flatten gal took : 35 ms
FORMULA CSRepetitions-COL-03-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-03-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 07:08:18] [INFO ] Applying decomposition
[2020-06-03 07:08:18] [INFO ] Flatten gal took : 12 ms
[2020-06-03 07:08:18] [INFO ] Decomposing Gal with order
[2020-06-03 07:08:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 07:08:18] [INFO ] Removed a total of 118 redundant transitions.
[2020-06-03 07:08:18] [INFO ] Flatten gal took : 51 ms
[2020-06-03 07:08:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-06-03 07:08:18] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2020-06-03 07:08:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CSRepetitions-COL-03 @ 3570 seconds

FORMULA CSRepetitions-COL-03-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-03-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3495
rslt: Output for LTLFireability @ CSRepetitions-COL-03

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 07:08:18 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 36,
"adisj": 2,
"aneg": 0,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "F (G ((F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8)))) AND (((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19))))))",
"processed_size": 1147,
"rewrites": 119
},
"result":
{
"edges": 18,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"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": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 2,
"aneg": 1,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X (G ((G (F (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)))) AND X (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30))))))",
"processed_size": 291,
"rewrites": 119
},
"result":
{
"edges": 70116687,
"markings": 7896265,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 317
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8))))",
"processed_size": 271,
"rewrites": 119
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 1,
"X": 0,
"aconj": 64,
"adisj": 12,
"aneg": 0,
"comp": 144,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 144,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "F ((F (G ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19))))) AND G (((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8))) OR ((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)) AND ((p0 <= 0) OR (p8 <= 0))) U G ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19)))))))))",
"processed_size": 2294,
"rewrites": 119
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 29
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 3,
"aconj": 27,
"adisj": 3,
"aneg": 0,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "X (X ((X (G (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30)))) AND (F ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19)))) U ((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30))))))",
"processed_size": 1157,
"rewrites": 119
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 388
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 388
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F (G (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0))))",
"processed_size": 140,
"rewrites": 119
},
"result":
{
"edges": 27,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 436
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 27,
"adisj": 1,
"aneg": 0,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19))))",
"processed_size": 865,
"rewrites": 119
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 436
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 3,
"aconj": 1,
"adisj": 28,
"aneg": 0,
"comp": 63,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 63,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30))) U X (X ((((p15 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p20 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p21 <= 0)) AND ((p17 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p21 <= 0)) AND ((p13 <= 0) OR (p19 <= 0)) AND ((p13 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p19 <= 0)) AND ((p13 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p20 <= 0)) AND ((p18 <= 0) OR (p21 <= 0)) AND ((p18 <= 0) OR (p20 <= 0)) AND ((p18 <= 0) OR (p19 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p14 <= 0) OR (p21 <= 0)) AND ((p14 <= 0) OR (p19 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p19 <= 0)))))))",
"processed_size": 1014,
"rewrites": 119
},
"result":
{
"edges": 38,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 499
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 9,
"adisj": 3,
"aneg": 1,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 28,
"visible_transitions": 0
},
"processed": "G (F ((G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))) OR (X (G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8))))) AND ((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30))))))",
"processed_size": 564,
"rewrites": 119
},
"result":
{
"edges": 38,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 582
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 54,
"adisj": 3,
"aneg": 1,
"comp": 126,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 126,
"taut": 0,
"tconj": 0,
"tdisj": 10,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 45,
"visible_transitions": 0
},
"processed": "X (((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53))) U (G (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0))) OR (F ((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53)))) OR ((1 <= p22) OR ((1 <= p23) OR ((1 <= p24) OR ((1 <= p25) OR ((1 <= p26) OR ((1 <= p27) OR ((1 <= p28) OR ((1 <= p29) OR (1 <= p30)))))))))))))",
"processed_size": 1967,
"rewrites": 119
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 699
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))",
"processed_size": 132,
"rewrites": 121
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 45
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 873
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (F (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))))",
"processed_size": 140,
"rewrites": 119
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 873
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G (F (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0))))",
"processed_size": 140,
"rewrites": 119
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1165
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)))",
"processed_size": 136,
"rewrites": 119
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1165
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 27,
"adisj": 1,
"aneg": 0,
"comp": 54,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 54,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19)))))",
"processed_size": 869,
"rewrites": 119
},
"result":
{
"edges": 4608,
"markings": 2816,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 1747
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 55,
"adisj": 3,
"aneg": 0,
"comp": 117,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 117,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X (G ((X ((((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)) AND (((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19))))) AND (((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19))))))",
"processed_size": 1880,
"rewrites": 119
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"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": 3495
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30)))",
"processed_size": 136,
"rewrites": 119
},
"result":
{
"edges": 32,
"markings": 32,
"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":
{
"error": null,
"memory": 198556,
"runtime": 75.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(G((F(**) AND **))) AND G((** OR X(G((F(**) AND **)))))) : X(G((G(F(*)) AND X(**)))) : (F((F(G(**)) AND G((** OR (** U G(**)))))) AND X(**)) : X(X((X(G(**)) AND (F(**) U **)))) : (X(**) OR F(G(**))) : X((F(**) U X(X(**)))) : G(F((G(*) OR (X(G(**)) AND **)))) : X((** U (G(*) OR (F(**) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))) : (X(F(*)) AND (X(G(**)) OR F(**))) : (G(F(*)) OR X(*)) : X(F(**)) : X(G((X(**) AND **))) : G(**)"
},
"net":
{
"arcs": 279,
"conflict_clusters": 11,
"places": 58,
"places_significant": 46,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "no no no no no no no yes yes yes yes no no ",
"value": "no no no no no no no yes yes yes yes 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: 139/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1856
lola: finding significant places
lola: 58 places, 81 transitions, 46 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: G (((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53))) U NOT(F (NOT(G (X ((F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8)))) AND (((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19))))))))))) : G (X ((NOT((F ((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53)))) U F (X (G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))))))) AND X (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30)))))) : (F (G (((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8))) U ((((p0 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p7 <= 0)) AND ((p0 <= 0) OR (p6 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)) AND ((p0 <= 0) OR (p9 <= 0)) AND ((p0 <= 0) OR (p8 <= 0))) U G ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19)))))))) AND X ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8))))) : X (X ((X (G (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30)))) AND (F ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19)))) U ((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30)))))) : (X ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19)))) OR F (G (X (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0)))))) : X ((F (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30))) U X (X ((((p15 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p20 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p21 <= 0)) AND ((p17 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p19 <= 0)) AND ((p17 <= 0) OR (p21 <= 0)) AND ((p13 <= 0) OR (p19 <= 0)) AND ((p13 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p19 <= 0)) AND ((p13 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p20 <= 0)) AND ((p18 <= 0) OR (p21 <= 0)) AND ((p18 <= 0) OR (p20 <= 0)) AND ((p18 <= 0) OR (p19 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p14 <= 0) OR (p21 <= 0)) AND ((p14 <= 0) OR (p19 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p19 <= 0))))))) : NOT(F (NOT(F ((NOT(F (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)))) OR (G (X ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8))))) AND ((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30)))))))) : (X ((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53)))) U X (((((((((((NOT(F (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30)))) OR F (((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53))) U (((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53)))))) OR (1 <= p22)) OR (1 <= p23)) OR (1 <= p24)) OR (1 <= p25)) OR (1 <= p26)) OR (1 <= p27)) OR (1 <= p28)) OR (1 <= p29)) OR (1 <= p30)))) : (X (NOT(G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))))) AND (X (G ((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53))))) OR F (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))))) : (G (NOT(X (G (F ((((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0)) U X (G (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30)))))))))) OR NOT(X (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))))) : F (((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p48)) OR ((1 <= p6) AND (1 <= p46)) OR ((1 <= p6) AND (1 <= p47)) OR ((1 <= p4) AND (1 <= p42)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p3) AND (1 <= p37)) OR ((1 <= p3) AND (1 <= p38)) OR ((1 <= p3) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p43)) OR ((1 <= p5) AND (1 <= p44)) OR ((1 <= p5) AND (1 <= p45)) OR ((1 <= p8) AND (1 <= p54)) OR ((1 <= p8) AND (1 <= p52)) OR ((1 <= p8) AND (1 <= p53))) U X ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19)))))) : G (X ((X ((((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)) AND (((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19))))) AND (((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p19)) OR ((1 <= p13) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p21)) OR ((1 <= p18) AND (1 <= p20)) OR ((1 <= p18) AND (1 <= p19)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p14) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p19)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p19)))))) : G (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30)))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8)))) AND (((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8)))) AND (((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8)))) AND (((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <... (shortened)
lola: processed formula length: 1147
lola: 119 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: 17 markings, 18 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (F (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)))) AND X (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)))) AND X (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30))))))
lola: processed formula length: 291
lola: 119 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: 976749 markings, 4832265 edges, 195350 markings/sec, 0 secs
lola: 1542178 markings, 8148153 edges, 113086 markings/sec, 5 secs
lola: 2045946 markings, 11323204 edges, 100754 markings/sec, 10 secs
lola: 2787780 markings, 16770650 edges, 148367 markings/sec, 15 secs
lola: 3440485 markings, 22366861 edges, 130541 markings/sec, 20 secs
lola: 4112187 markings, 28128729 edges, 134340 markings/sec, 25 secs
lola: 4730387 markings, 33487878 edges, 123640 markings/sec, 30 secs
lola: 5262935 markings, 38977974 edges, 106510 markings/sec, 35 secs
lola: 5867336 markings, 44836991 edges, 120880 markings/sec, 40 secs
lola: 6472371 markings, 50755824 edges, 121007 markings/sec, 45 secs
lola: 7025206 markings, 55546406 edges, 110567 markings/sec, 50 secs
lola: 7510889 markings, 60519511 edges, 97137 markings/sec, 55 secs
lola: 7861641 markings, 65557357 edges, 70150 markings/sec, 60 secs
lola: 7896251 markings, 69523609 edges, 6922 markings/sec, 65 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: 7896265 markings, 70116687 edges
lola: ========================================
lola: subprocess 2 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F (G ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <= p0) AND (1 <= p8))))
lola: processed formula length: 271
lola: 119 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 3 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <... (shortened)
lola: processed formula length: 2294
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 29 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: 17 markings, 17 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: lola: ========================================
========================================
lola: subprocess 3 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (G (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30)))) AND (F ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (G (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30)))) AND (F ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 ... (shortened)
lola: processed formula length: 1157
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 4 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0))))
lola: processed formula length: 140
lola: 119 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: 25 markings, 27 edges
lola: ========================================
lola: subprocess 5 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p17) ... (shortened)
lola: processed formula length: 865
lola: 119 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: 16 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30))) U X (X ((((p15 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p20 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30))) U X (X ((((p15 <= 0) OR (p19 <= 0)) AND ((p15 <= 0) OR (p20 <= 0)) AND ((p15 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p21 <= 0)) AND ((p16 <= 0) OR (p20 <= 0)) AND ((p16 <= 0) OR (p19 <= 0)) AND ((p12 <= 0) OR (p20 <= 0)... (shortened)
lola: processed formula length: 1014
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 38 markings, 38 edges
lola: ========================================
lola: subprocess 6 will run for 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))) OR (X (G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))) OR (X (G ((((1 <= p0) AND (1 <= p5)) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p7)) OR ((1 <= p0) AND (1 <= p6)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p0) AND (1 <= p9)) OR ((1 <... (shortened)
lola: processed formula length: 564
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 24 markings, 38 edges
lola: ========================================
lola: subprocess 7 will run for 582 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR ((1 <= p2) AND (1 <= p34)) OR ((1 <= p9) AND (1 <= p56)) OR ((1 <= p9) AND (1 <= p57)) OR ((1 <= p2) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p4... (shortened)
lola: processed formula length: 1967
lola: 119 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 8 will run for 699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)))) AND (X (G ((((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p1) AND (1 <= p33)) OR ((1 <= p1) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p1) AND (1 <= p31)) OR ((1 <= p9) AND (1 <= p55)) OR ((1 <= p2) AND (1 <= p36)) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))
lola: processed formula length: 132
lola: 121 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 9 will run for 873 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))))
lola: processed formula length: 140
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 873 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0)))) OR X (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 873 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p22 <= 0) AND (p23 <= 0) AND (p24 <= 0) AND (p25 <= 0) AND (p26 <= 0) AND (p27 <= 0) AND (p28 <= 0) AND (p29 <= 0) AND (p30 <= 0))))
lola: processed formula length: 140
lola: 119 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 10 will run for 1165 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)))
lola: processed formula length: 136
lola: 119 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 1165 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p21)) OR ((1 <= p17) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p19)) OR ((1 <= p17) AND (1 <= p19)) OR ((1 <= p1... (shortened)
lola: processed formula length: 869
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2816 markings, 4608 edges
lola: ========================================
lola: subprocess 11 will run for 1747 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)) AND (((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)) AND (((1 <= p15) AND (1 <= p19)) OR ((1 <= p15) AND (1 <= p20)) OR ((1 <= p15) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p21)) OR ((1 <= p16) AND (1 <= p20)) OR ((1 <= p16) AND (1 <= p19)) OR ((1 <= p12) AND (1 <= p20))... (shortened)
lola: processed formula length: 1880
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16 markings, 16 edges
lola: ========================================
lola: subprocess 12 will run for 3495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30)))
lola: processed formula length: 136
lola: 119 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: 32 markings, 32 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no yes yes yes yes no no
lola:
preliminary result: no no no no no no no yes yes yes yes no no
lola: memory consumption: 198556 KB
lola: time consumption: 75 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="CSRepetitions-COL-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is CSRepetitions-COL-03, 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 r182-oct2-158987914100618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-03.tgz
mv CSRepetitions-COL-03 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 ;