Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038176700002.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is BridgeAndVehicles-COL-V04P05N02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038176700002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 15:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 15:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 02:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 02:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Mar 22 11:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Mar 22 11:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 37K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620925069368

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 16:57:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 16:57:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 16:57:51] [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.
[2021-05-13 16:57:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 618 ms
[2021-05-13 16:57:51] [INFO ] sort/places :
sens->CONTROLEUR,CHOIX,VIDANGE,
compteur->COMPTEUR,
Dot->CAPACITE,SORTI_A,ROUTE_A,ATTENTE_A,SUR_PONT_A,SUR_PONT_B,ATTENTE_B,ROUTE_B,SORTI_B,
voitureA->NB_ATTENTE_A,
voitureB->NB_ATTENTE_B,

[2021-05-13 16:57:51] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 32 ms.
[2021-05-13 16:57:51] [INFO ] Computed order based on color domains.
[2021-05-13 16:57:51] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions in 7 ms.
[2021-05-13 16:57:51] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2299 resets, run finished after 175 ms. (steps per millisecond=571 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
[2021-05-13 16:57:52] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2021-05-13 16:57:52] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-13 16:57:52] [INFO ] [Real]Absence check using 7 positive place invariants in 20 ms returned sat
[2021-05-13 16:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:57:52] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-13 16:57:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-13 16:57:52] [INFO ] [Real]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-13 16:57:52] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 8 ms.
[2021-05-13 16:57:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 16:57:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 14 ms returned sat
[2021-05-13 16:57:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 16:57:52] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-13 16:57:52] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-13 16:57:52] [INFO ] Computed and/alt/rep : 49/245/31 causal constraints in 8 ms.
[2021-05-13 16:57:52] [INFO ] Added : 26 causal constraints over 6 iterations in 45 ms. Result :sat
[2021-05-13 16:57:52] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 16:57:52] [INFO ] Flatten gal took : 32 ms
FORMULA BridgeAndVehicles-COL-V04P05N02-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 16:57:52] [INFO ] Applying decomposition
[2021-05-13 16:57:52] [INFO ] Flatten gal took : 13 ms
[2021-05-13 16:57:52] [INFO ] Decomposing Gal with order
[2021-05-13 16:57:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 16:57:52] [INFO ] Removed a total of 190 redundant transitions.
[2021-05-13 16:57:52] [INFO ] Flatten gal took : 47 ms
[2021-05-13 16:57:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-13 16:57:52] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2021-05-13 16:57:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ BridgeAndVehicles-COL-V04P05N02 @ 3570 seconds

FORMULA BridgeAndVehicles-COL-V04P05N02-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BridgeAndVehicles-COL-V04P05N02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3555
rslt: Output for LTLFireability @ BridgeAndVehicles-COL-V04P05N02

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 12,
"adisj": 3,
"aneg": 1,
"comp": 49,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 49,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (G ((((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20))) OR (F ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20)))) AND F (G ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20))))))) R (1 <= p15))))",
"processed_size": 771,
"rewrites": 86
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 296
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 16,
"adisj": 2,
"aneg": 1,
"comp": 66,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 66,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X ((G ((((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p19 <= 0) OR (p23 <= 0)))) OR G (((1 <= p9) OR (G ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20)))) AND F ((1 <= p9)))))))",
"processed_size": 1027,
"rewrites": 86
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 6,
"adisj": 1,
"aneg": 0,
"comp": 21,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "((F (G ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20))))) OR (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))) U X (X (F ((1 <= p15)))))",
"processed_size": 342,
"rewrites": 86
},
"result":
{
"edges": 7512,
"markings": 1658,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 1,
"aconj": 28,
"adisj": 4,
"aneg": 0,
"comp": 104,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 104,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G (F ((G ((F ((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))) AND (X ((((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p23)))) OR (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))))) OR F ((((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p23)))))))",
"processed_size": 1623,
"rewrites": 86
},
"result":
{
"edges": 786,
"markings": 399,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (F ((G ((1 <= p15)) OR G ((F ((((p21 <= 0) OR (p25 <= 0)) AND ((p22 <= 0) OR (p25 <= 0)) AND (p15 <= 0))) AND (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))))))))",
"processed_size": 184,
"rewrites": 86
},
"result":
{
"edges": 243,
"markings": 149,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 444
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))))",
"processed_size": 69,
"rewrites": 86
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 1,
"aneg": 1,
"comp": 17,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (F (((((p0 <= 0) OR (p13 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR (p20 <= 0))) OR (p9 <= 0))))",
"processed_size": 265,
"rewrites": 86
},
"result":
{
"edges": 3,
"markings": 4,
"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": 7,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 1,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X ((G ((1 <= p9)) OR F ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7))))))",
"processed_size": 174,
"rewrites": 86
},
"result":
{
"edges": 3,
"markings": 4,
"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": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 17,
"adisj": 14,
"aneg": 2,
"comp": 104,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 104,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X ((F ((G ((((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p19 <= 0) OR (p23 <= 0)))) R (((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p23))))) AND G ((((1 <= p21) AND (1 <= p24)) OR ((1 <= p21) AND (1 <= p23)) OR ((1 <= p22) AND (1 <= p24)) OR ((1 <= p22) AND (1 <= p23))))))",
"processed_size": 1611,
"rewrites": 86
},
"result":
{
"edges": 51,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 1,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G ((((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)))))",
"processed_size": 155,
"rewrites": 86
},
"result":
{
"edges": 28361,
"markings": 5437,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 1185
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 1,
"aneg": 1,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G (F ((((p0 <= 4) OR (p27 <= 0)) AND ((p0 <= 4) OR (p26 <= 0)) AND ((p13 <= 0) OR (p17 <= 0)) AND ((p12 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p17 <= 0)) AND ((p10 <= 0) OR (p17 <= 0)) AND ((p11 <= 0) OR (p17 <= 0)))))",
"processed_size": 227,
"rewrites": 86
},
"result":
{
"edges": 17212,
"markings": 5451,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 1778
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 5,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 3,
"aneg": 0,
"comp": 44,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 44,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "F ((G ((G ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20)))) AND (1 <= p9))) OR ((1 <= p9) OR (G ((((1 <= p21) AND (1 <= p24)) OR ((1 <= p21) AND (1 <= p23)) OR ((1 <= p22) AND (1 <= p24)) OR ((1 <= p22) AND (1 <= p23)))) AND F ((G ((G ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20)))) AND (1 <= p9))) OR (1 <= p9)))))))",
"processed_size": 710,
"rewrites": 86
},
"result":
{
"edges": 415525,
"markings": 20324,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 36
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3556
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 25,
"adisj": 6,
"aneg": 0,
"comp": 112,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 112,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "F (G ((F ((((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)))) AND ((((p0 <= 0) OR (p13 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR (p20 <= 0))) OR (((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)))))))",
"processed_size": 1724,
"rewrites": 86
},
"result":
{
"edges": 53,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"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": 151452,
"runtime": 14.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(*)) : X((X(G(((X(**) AND **) OR (G(**) AND **)))) OR F(**))) : X(G(((** OR (F(**) AND F(G(**)))) R *))) : F((G((G(**) AND **)) OR (** OR (G(**) AND F((G((G(**) AND **)) OR **)))))) : F(G((F(**) AND (** OR **)))) : X((G(*) OR G((** OR (G(**) AND F(**)))))) : ((F(G(**)) OR (** OR **)) U X(X(F(**)))) : G(F((G((F(**) AND (X(**) OR **))) OR F(**)))) : X(X(F((G(**) OR G((F(*) AND **)))))) : X(G(**)) : (X(F(**)) AND (X(F(*)) OR (** OR **))) : (X((G(**) OR F(**))) AND ((** U **) AND **)) : F(G(*)) : X((F((G(*) R *)) AND G(**)))"
},
"net":
{
"arcs": 326,
"conflict_clusters": 5,
"places": 28,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 52
},
"result":
{
"preliminary_value": "yes yes no yes no no yes no no no yes yes yes no ",
"value": "yes yes no yes no no yes no no no yes yes yes 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: 80/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 896
lola: finding significant places
lola: 28 places, 52 transitions, 21 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: ((((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25))) U NOT(F (G ((((5 <= p0) AND (1 <= p27)) OR ((5 <= p0) AND (1 <= p26)) OR ((1 <= p13) AND (1 <= p17)) OR ((1 <= p12) AND (1 <= p17)) OR ((1 <= p14) AND (1 <= p17)) OR ((1 <= p10) AND (1 <= p17)) OR ((1 <= p11) AND (1 <= p17))))))) : X ((G (X (((X ((1 <= p9)) AND (((5 <= p0) AND (1 <= p27)) OR ((5 <= p0) AND (1 <= p26)))) OR (G ((1 <= p9)) AND (((5 <= p0) AND (1 <= p27)) OR ((5 <= p0) AND (1 <= p26))))))) OR F ((((1 <= p13) AND (1 <= p17)) OR ((1 <= p12) AND (1 <= p17)) OR ((1 <= p14) AND (1 <= p17)) OR ((1 <= p10) AND (1 <= p17)) OR ((1 <= p11) AND (1 <= p17)))))) : G (X (NOT((NOT((X (F (G ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20)))))) U (((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20))))) U (p15 <= 0))))) : F ((G ((((1 <= p21) AND (1 <= p24)) OR ((1 <= p21) AND (1 <= p23)) OR ((1 <= p22) AND (1 <= p24)) OR ((1 <= p22) AND (1 <= p23)))) U (G ((G ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20)))) AND (1 <= p9))) OR (1 <= p9)))) : F ((F (((((F (G ((((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25))))) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p8) AND (1 <= p19))) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p8) AND (1 <= p19))) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p19))) OR ((1 <= p0) AND (1 <= p3) AND (1 <= p8) AND (1 <= p19)))) U F (G (((((p0 <= 0) OR (p13 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR (p20 <= 0))) U (((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)))))))) : (NOT(X (F ((((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p23)))))) OR G ((X (G ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20))))) U X ((1 <= p9))))) : (((X (F (G ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20)))))) OR ((1 <= p21) AND (1 <= p25))) OR ((1 <= p22) AND (1 <= p25))) U F (X (F (X (F ((1 <= p15))))))) : G (X (F ((G ((X ((((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p23)))) U (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25))))) OR F (((((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25))) U (((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p23))))))))) : F (X ((G (X ((1 <= p15))) OR X (G ((NOT(G ((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)) OR (1 <= p15)))) AND (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25))))))))) : G (X ((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25))))) : (F (X (F ((1 <= p9)))) AND ((X (NOT(G (((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20))) AND (1 <= p9))))) OR ((5 <= p0) AND (1 <= p27))) OR ((5 <= p0) AND (1 <= p26)))) : ((X ((G ((1 <= p9)) OR F ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)))))) AND ((1 <= p9) U (p15 <= 0))) AND (((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)))) : (NOT(F (X (F ((((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25))))))) U F (NOT(X (F (((((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p2) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p3) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25))) U (((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7))))))))) : X ((F (NOT((F ((((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p14) AND (1 <= p19) AND (1 <= p23)))) U (((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p14 <= 0) OR (p19 <= 0) OR (p23 <= 0)))))) AND G ((((1 <= p21) AND (1 <= p24)) OR ((1 <= p21) AND (1 <= p23)) OR ((1 <= p22) AND (1 <= p24)) OR ((1 <= p22) AND (1 <= p23))))))
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:425
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((X ((1 <= p9)) AND (((5 <= p0) AND (1 <= p27)) OR ((5 <= p0) AND (1 <= p26)))) OR (G ((1 <= p9)) AND (((5 <= p0) AND (1 <= p27)) OR ((5 <= p0) AND (1 <= p26))))))) OR F ((((1 <= p13) AND (1 <= p17)) OR ((1 <= p12) AND (1 <= p17)) OR ((1 <= p14) AND (1 <= p17)) OR ((1 <= p10) AND (1 <= p17)) OR ((1 <= p11) AND (1 <= p17))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((X ((1 <= p9)) AND (((5 <= p0) AND (1 <= p27)) OR ((5 <= p0) AND (1 <= p26)))) OR (G ((1 <= p9)) AND (((5 <= p0) AND (1 <= p27)) OR ((5 <= p0) AND (1 <= p26))))))) OR F ((((1 <= p13) AND (1 <= p17)) OR ((1 <= p12) AND (1 <= p17)) OR ((1 <= p14) AND (1 <= p17)) OR ((1 <= p10) AND (1 <= p17)) OR ((1 <= p11) AND (1 <= p17))))))
lola: processed formula length: 343
lola: 86 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 1 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20))) OR (F ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20))) OR (F ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <=... (shortened)
lola: processed formula length: 771
lola: 86 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 2 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) ... (shortened)
lola: processed formula length: 1027
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 51 markings, 51 edges
lola: ========================================
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (G ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20))))) OR (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))) U X (X (F ((1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F (G ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20))))) OR (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))) U X (X (F ((1 <= p15)))))
lola: processed formula length: 342
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1658 markings, 7512 edges
lola: ========================================
lola: subprocess 4 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((F ((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))) AND (X ((((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((F ((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))) AND (X ((((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p23)) OR ((1 <= p1) AND (1 <= p11) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p1) AND (1 <= p12) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1) AND (1 <= p13) AND (1 <= p19) AND (1 <= p24)) OR ((1 <= p1... (shortened)
lola: processed formula length: 1623
lola: 86 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: 399 markings, 786 edges
lola: ========================================
lola: subprocess 5 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((G ((1 <= p15)) OR G ((F ((((p21 <= 0) OR (p25 <= 0)) AND ((p22 <= 0) OR (p25 <= 0)) AND (p15 <= 0))) AND (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G ((1 <= p15)) OR G ((F ((((p21 <= 0) OR (p25 <= 0)) AND ((p22 <= 0) OR (p25 <= 0)) AND (p15 <= 0))) AND (((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))))))))
lola: processed formula length: 184
lola: 86 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: 149 markings, 243 edges
lola: ========================================
lola: subprocess 6 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p21) AND (1 <= p25)) OR ((1 <= p22) AND (1 <= p25)))))
lola: processed formula length: 69
lola: 86 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 7 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((1 <= p9))) AND (X (F (((((p0 <= 0) OR (p13 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR (p20 <= 0))) OR (p9 <= 0)))) OR (((5 <= p0) AND (1 <= p27)) OR ((5 <= p0) AND (1 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((5 <= p0) AND (1 <= p27)) OR ((5 <= p0) AND (1 <= p26)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((5 <= p0) AND (1 <= p27)) OR ((5 <= p0) AND (1 <= p26)))
lola: processed formula length: 58
lola: 87 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p9)))
lola: processed formula length: 17
lola: 86 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: 576 markings, 1341 edges
lola: ========================================
lola: subprocess 9 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((((p0 <= 0) OR (p13 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR (p20 <= 0))) OR (p9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((((p0 <= 0) OR (p13 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p14 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p0 <= 0) OR (p12 <= 0) OR (p16 <= 0) OR (p20 <= 0))) OR (p9 <= 0))))
lola: processed formula length: 265
lola: 86 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: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G ((1 <= p9)) OR F ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)))))) AND (((1 <= p9) U (p15 <= 0)) AND (((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p9) U (p15 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p9) U (p15 <= 0))
lola: processed formula length: 24
lola: 86 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7)))
lola: processed formula length: 147
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 10 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((1 <= p9)) OR F ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((1 <= p9)) OR F ((((1 <= p3) AND (1 <= p7)) OR ((1 <= p4) AND (1 <= p7)) OR ((1 <= p5) AND (1 <= p7)) OR ((1 <= p2) AND (1 <= p7)) OR ((1 <= p1) AND (1 <= p7))))))
lola: processed formula length: 174
lola: 86 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: 4 markings, 3 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((G ((((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p13 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((G ((((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p11 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p1 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p24 <= 0)) AND ((p1 <= 0) OR (p13 <= 0) OR (p19 <= 0) OR (p23 <= 0)) AND ((p1 <= 0) OR (p13 <=... (shortened)
lola: processed formula length: 1611
lola: 86 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 10 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 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 ((((p3 <= 0) OR (p7 <= 0)) AND ((p4 <= 0) OR (p7 <= 0)) AND ((p5 <= 0) OR (p7 <= 0)) AND ((p2 <= 0) OR (p7 <= 0)) AND ((p1 <= 0) OR (p7 <= 0)))))
lola: processed formula length: 155
lola: 86 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5437 markings, 28361 edges
lola: ========================================
lola: subprocess 11 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p0 <= 4) OR (p27 <= 0)) AND ((p0 <= 4) OR (p26 <= 0)) AND ((p13 <= 0) OR (p17 <= 0)) AND ((p12 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p17 <= 0)) AND ((p10 <= 0) OR (p17 <= 0)) AND ((p11 <= 0) OR (p17 <= 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 ((((p0 <= 4) OR (p27 <= 0)) AND ((p0 <= 4) OR (p26 <= 0)) AND ((p13 <= 0) OR (p17 <= 0)) AND ((p12 <= 0) OR (p17 <= 0)) AND ((p14 <= 0) OR (p17 <= 0)) AND ((p10 <= 0) OR (p17 <= 0)) AND ((p11 <= 0) OR (p17 <= 0)))))
lola: processed formula length: 227
lola: 86 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5451 markings, 17212 edges
lola: ========================================
lola: subprocess 12 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((G ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20)))) AND (1 <= p9))) OR ((1 <= p9) OR (G ((((1 <= p21) AND (1 <= p24)) OR ((1 <= p21) AND (1 <= p23)) OR ((1 <= p22) AND (1 <= p24)) OR ((1 <= p22) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((G ((((1 <= p0) AND (1 <= p13) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p14) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p16) AND (1 <= p20)))) AND (1 <= p9))) OR ((1 <= p9) OR (G ((((1 <= p21) AND (1 <= p24)) OR ((1 <= p21) AND (1 <= p23)) OR ((1 <= p22) AND (1 <= p24)) OR ((1 <= p22) ... (shortened)
lola: processed formula length: 710
lola: 86 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 36 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 20324 markings, 415525 edges
lola: ========================================
lola: subprocess 13 will run for 3556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p23)) OR ((1 <= p5) AND (1 <= p10) AND (1 <= p20) AND (1 <= p24)) OR ((1 <= p2) AND (1 <= p1... (shortened)
lola: processed formula length: 1724
lola: 86 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: 52 markings, 53 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes no no yes no no no yes yes yes no
lola:
preliminary result: yes yes no yes no no yes no no no yes yes yes no
lola: memory consumption: 151452 KB
lola: time consumption: 14 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="BridgeAndVehicles-COL-V04P05N02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is BridgeAndVehicles-COL-V04P05N02, 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 r037-tajo-162038176700002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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