Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r168-smll-158987806600314.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-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 itslola
Input is CloudDeployment-PT-5a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806600314
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 3.6K Mar 30 01:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 30 01:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 07:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 26 07:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 230K Mar 24 05:37 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 CloudDeployment-PT-5a-00
FORMULA_NAME CloudDeployment-PT-5a-01
FORMULA_NAME CloudDeployment-PT-5a-02
FORMULA_NAME CloudDeployment-PT-5a-03
FORMULA_NAME CloudDeployment-PT-5a-04
FORMULA_NAME CloudDeployment-PT-5a-05
FORMULA_NAME CloudDeployment-PT-5a-06
FORMULA_NAME CloudDeployment-PT-5a-07
FORMULA_NAME CloudDeployment-PT-5a-08
FORMULA_NAME CloudDeployment-PT-5a-09
FORMULA_NAME CloudDeployment-PT-5a-10
FORMULA_NAME CloudDeployment-PT-5a-11
FORMULA_NAME CloudDeployment-PT-5a-12
FORMULA_NAME CloudDeployment-PT-5a-13
FORMULA_NAME CloudDeployment-PT-5a-14
FORMULA_NAME CloudDeployment-PT-5a-15

=== Now, execution of the tool begins

BK_START 1591285267889

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 15:41:10] [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-04 15:41:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 15:41:11] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2020-06-04 15:41:11] [INFO ] Transformed 180 places.
[2020-06-04 15:41:11] [INFO ] Transformed 675 transitions.
[2020-06-04 15:41:11] [INFO ] Found NUPN structural information;
[2020-06-04 15:41:11] [INFO ] Parsed PT model containing 180 places and 675 transitions in 302 ms.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 60 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1327 resets, run finished after 749 ms. (steps per millisecond=133 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-04 15:41:11] [INFO ] Flow matrix only has 301 transitions (discarded 294 similar events)
// Phase 1: matrix 301 rows 180 cols
[2020-06-04 15:41:11] [INFO ] Computed 30 place invariants in 15 ms
[2020-06-04 15:41:12] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 43 ms returned sat
[2020-06-04 15:41:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:41:12] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2020-06-04 15:41:12] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-06-04 15:41:12] [INFO ] [Real]Added 132 Read/Feed constraints in 60 ms returned sat
[2020-06-04 15:41:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:41:13] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 325 ms returned sat
[2020-06-04 15:41:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:41:13] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2020-06-04 15:41:13] [INFO ] [Nat]Added 132 Read/Feed constraints in 48 ms returned sat
[2020-06-04 15:41:13] [INFO ] Computed and/alt/rep : 594/3899/300 causal constraints in 71 ms.
[2020-06-04 15:41:15] [INFO ] Added : 175 causal constraints over 35 iterations in 1591 ms. Result :sat
[2020-06-04 15:41:15] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 33 ms returned sat
[2020-06-04 15:41:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:41:15] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2020-06-04 15:41:15] [INFO ] [Real]Added 132 Read/Feed constraints in 44 ms returned sat
[2020-06-04 15:41:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:41:15] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 23 ms returned sat
[2020-06-04 15:41:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:41:15] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2020-06-04 15:41:15] [INFO ] [Nat]Added 132 Read/Feed constraints in 37 ms returned sat
[2020-06-04 15:41:16] [INFO ] Computed and/alt/rep : 594/3899/300 causal constraints in 80 ms.
[2020-06-04 15:41:17] [INFO ] Added : 167 causal constraints over 34 iterations in 1313 ms. Result :sat
[2020-06-04 15:41:17] [INFO ] [Real]Absence check using 0 positive and 30 generalized place invariants in 31 ms returned sat
[2020-06-04 15:41:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:41:17] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2020-06-04 15:41:17] [INFO ] [Real]Added 132 Read/Feed constraints in 35 ms returned sat
[2020-06-04 15:41:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:41:17] [INFO ] [Nat]Absence check using 0 positive and 30 generalized place invariants in 35 ms returned sat
[2020-06-04 15:41:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:41:18] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2020-06-04 15:41:18] [INFO ] [Nat]Added 132 Read/Feed constraints in 49 ms returned sat
[2020-06-04 15:41:18] [INFO ] Computed and/alt/rep : 594/3899/300 causal constraints in 46 ms.
[2020-06-04 15:41:19] [INFO ] Added : 175 causal constraints over 35 iterations in 1441 ms. Result :sat
[2020-06-04 15:41:20] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 15:41:20] [INFO ] Flatten gal took : 142 ms
FORMULA CloudDeployment-PT-5a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 15:41:20] [INFO ] Applying decomposition
[2020-06-04 15:41:20] [INFO ] Flatten gal took : 71 ms
[2020-06-04 15:41:20] [INFO ] Decomposing Gal with order
[2020-06-04 15:41:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 15:41:20] [INFO ] Removed a total of 1474 redundant transitions.
[2020-06-04 15:41:20] [INFO ] Flatten gal took : 163 ms
[2020-06-04 15:41:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 23 ms.
[2020-06-04 15:41:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2020-06-04 15:41:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 9 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudDeployment-PT-5a @ 3570 seconds

FORMULA CloudDeployment-PT-5a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-5a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-5a-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-5a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-5a-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-5a-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-5a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-5a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-5a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-5a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-5a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-5a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2598
rslt: Output for LTLFireability @ CloudDeployment-PT-5a

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G ((X (F (((p91 <= 0)))) AND (X (((1 <= p91))) OR ((1 <= p86) AND (1 <= p88) AND (1 <= p110) AND (1 <= p167) AND (1 <= p178))))))",
"processed_size": 132,
"rewrites": 92
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 4,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p60) AND (1 <= p65))) OR ((X (((p86 <= 0) OR (p88 <= 0) OR (p103 <= 0) OR (p167 <= 0) OR (p178 <= 0))) OR G (((p60 <= 0)))) AND ((p60 <= 0) OR (p114 <= 0))))))",
"processed_size": 181,
"rewrites": 92
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 356
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p116 <= 0) OR (p123 <= 0)))",
"processed_size": 33,
"rewrites": 92
},
"result":
{
"edges": 20888,
"markings": 960,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X ((((1 <= p4) AND (1 <= p32)) U G ((G (((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p168))) AND (((1 <= p116)) AND ((1 <= p123)))))))",
"processed_size": 139,
"rewrites": 92
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(((1 <= p30) AND (1 <= p32) AND (1 <= p47) AND (1 <= p167) AND (1 <= p178)) R X (((p4 <= 0) OR (p17 <= 0))))",
"processed_size": 109,
"rewrites": 92
},
"result":
{
"edges": 139985,
"markings": 3569,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 452
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((((p74 <= 0)) R (((p30 <= 0) OR (p60 <= 0)) R ((p32 <= 0) OR (p58 <= 0)))))",
"processed_size": 80,
"rewrites": 92
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 528
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 2,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p167) AND (1 <= p178)) U ((1 <= p77))) U X (X ((F (((p77 <= 0))) OR G (((p77 <= 0)))))))",
"processed_size": 140,
"rewrites": 92
},
"result":
{
"edges": 369,
"markings": 139,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 12
},
"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": 633
},
"child":
[

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3168
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p2 <= 0) OR (p4 <= 0) OR (p19 <= 0) OR (p167 <= 0) OR (p178 <= 0))",
"processed_size": 72,
"rewrites": 94
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 288
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3168
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((p131 <= 0))",
"processed_size": 13,
"rewrites": 94
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3168
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p2 <= 0) OR (p4 <= 0) OR (p28 <= 0) OR (p156 <= 0))",
"processed_size": 56,
"rewrites": 94
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 131
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 5,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((((p4 <= 0) OR (p32 <= 0)) R F (((p134 <= 0)))) R X (F ((G (((p58 <= 0) OR (p60 <= 0) OR (p73 <= 0) OR (p167 <= 0) OR (p178 <= 0))) AND (F (G (((p4 <= 0) OR (p32 <= 0)))) OR G (((p58 <= 0) OR (p60 <= 0) OR (p73 <= 0) OR (p167 <= 0) OR (p178 <= 0))))))))",
"processed_size": 264,
"rewrites": 92
},
"result":
{
"edges": 333896742,
"markings": 7587571,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 35
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 68548,
"runtime": 972.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(**) OR (F(**) OR **)) : F(G((X(F(*)) AND (X(**) OR **)))) : (G(F(**)) AND F(**)) : G(F((G(*) OR ((X(*) OR G(*)) AND *)))) : (X((** U G((G(**) AND (** AND **))))) OR G(**)) : ((* R F(*)) R X(F((G(*) AND (F(G(*)) OR G(*)))))) : ((* R X(*)) AND X((G(*) OR F(*)))) : X((* R (* R *))) : ((** U **) U X(X((F(*) OR G(*))))) : F(G(**)) : (** OR (G(F(**)) AND F(**))) : (G(*) OR X(((** U **) AND (** AND (** AND (** AND (** AND **)))))))"
},
"net":
{
"arcs": 3679,
"conflict_clusters": 44,
"places": 180,
"places_significant": 150,
"singleton_clusters": 0,
"transitions": 595
},
"result":
{
"preliminary_value": "no no no no no no no no yes no no no ",
"value": "no no no no no no no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 775/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 180
lola: finding significant places
lola: 180 places, 595 transitions, 150 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: ((G (((1 <= p116) AND (1 <= p120))) OR F (((1 <= p2) AND (1 <= p4) AND (1 <= p19) AND (1 <= p167) AND (1 <= p178)))) OR ((1 <= p114) AND (1 <= p116) AND (1 <= p118) AND (1 <= p167) AND (1 <= p178))) : X (F (G ((NOT(G (X (((1 <= p91))))) AND (X (((1 <= p91))) OR ((1 <= p86) AND (1 <= p88) AND (1 <= p110) AND (1 <= p167) AND (1 <= p178))))))) : (X (F (G (F (((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p156)))))) AND F (((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p156)))) : NOT(F ((G (F (((p60 <= 0) OR (p65 <= 0)))) AND G (((X (((1 <= p86) AND (1 <= p88) AND (1 <= p103) AND (1 <= p167) AND (1 <= p178))) AND F (((1 <= p60)))) OR ((1 <= p60) AND (1 <= p114))))))) : ((X (((1 <= p4) AND (1 <= p32))) U G (X (((G (((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p168))) AND ((1 <= p116))) AND ((1 <= p123)))))) OR G (((p116 <= 0) OR (p123 <= 0)))) : NOT(((((1 <= p4) AND (1 <= p32)) U G (((1 <= p134)))) U G (X ((G (F (((1 <= p4) AND (1 <= p32)))) U F (((1 <= p58) AND (1 <= p60) AND (1 <= p73) AND (1 <= p167) AND (1 <= p178)))))))) : (NOT((((p30 <= 0) OR (p32 <= 0) OR (p47 <= 0) OR (p167 <= 0) OR (p178 <= 0)) U X (((1 <= p4) AND (1 <= p17))))) AND (NOT(X (F (((1 <= p114) AND (1 <= p116) AND (1 <= p140) AND (1 <= p146))))) OR NOT(X (G (((1 <= p114) AND (1 <= p116) AND (1 <= p136) AND (1 <= p167) AND (1 <= p178))))))) : NOT(X ((((1 <= p74)) U (((1 <= p30) AND (1 <= p60)) U ((1 <= p32) AND (1 <= p58)))))) : ((((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p167) AND (1 <= p178)) U ((1 <= p77))) U NOT(X ((X (G (((1 <= p77)))) AND X (F (((1 <= p77)))))))) : F (G (((1 <= p15)))) : (G (F (X ((((1 <= p32) AND (1 <= p58)) U F (X ((((p132 <= 0)) U (((1 <= p132)) OR ((1 <= p32) AND (1 <= p58)))))))))) U ((1 <= p131))) : (NOT((((1 <= p32) AND (1 <= p36)) U F (((1 <= p32) AND (1 <= p36))))) OR X (((((((((1 <= p178)) U ((1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p167) AND (1 <= p178))) AND ((1 <= p86))) AND ((1 <= p88))) AND ((1 <= p99))) AND ((1 <= p167))) AND ((1 <= p178)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F (((p91 <= 0)))) AND (X (((1 <= p91))) OR ((1 <= p86) AND (1 <= p88) AND (1 <= p110) AND (1 <= p167) AND (1 <= p178))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F (((p91 <= 0)))) AND (X (((1 <= p91))) OR ((1 <= p86) AND (1 <= p88) AND (1 <= p110) AND (1 <= p167) AND (1 <= p178))))))
lola: processed formula length: 132
lola: 92 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: 8 markings, 9 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p60) AND (1 <= p65))) OR ((X (((p86 <= 0) OR (p88 <= 0) OR (p103 <= 0) OR (p167 <= 0) OR (p178 <= 0))) OR G (((p60 <= 0)))) AND ((p60 <= 0) OR (p114 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p60) AND (1 <= p65))) OR ((X (((p86 <= 0) OR (p88 <= 0) OR (p103 <= 0) OR (p167 <= 0) OR (p178 <= 0))) OR G (((p60 <= 0)))) AND ((p60 <= 0) OR (p114 <= 0))))))
lola: processed formula length: 181
lola: 92 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((1 <= p4) AND (1 <= p32)) U G ((G (((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p168))) AND (((1 <= p116)) AND ((1 <= p123))))))) OR G (((p116 <= 0) OR (p123 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p116 <= 0) OR (p123 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p116 <= 0) OR (p123 <= 0)))
lola: processed formula length: 33
lola: 92 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: 960 markings, 20888 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p4) AND (1 <= p32)) U G ((G (((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p168))) AND (((1 <= p116)) AND ((1 <= p123)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p4) AND (1 <= p32)) U G ((G (((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p168))) AND (((1 <= p116)) AND ((1 <= p123)))))))
lola: processed formula length: 139
lola: 92 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: 9 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p4 <= 0) OR (p32 <= 0)) R F (((p134 <= 0)))) R X (F ((G (((p58 <= 0) OR (p60 <= 0) OR (p73 <= 0) OR (p167 <= 0) OR (p178 <= 0))) AND (F (G (((p4 <= 0) OR (p32 <= 0)))) OR G (((p58 <= 0) OR (p60 <= 0) OR (p73 <= 0) OR (p167 <= 0) OR (p178 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p4 <= 0) OR (p32 <= 0)) R F (((p134 <= 0)))) R X (F ((G (((p58 <= 0) OR (p60 <= 0) OR (p73 <= 0) OR (p167 <= 0) OR (p178 <= 0))) AND (F (G (((p4 <= 0) OR (p32 <= 0)))) OR G (((p58 <= 0) OR (p60 <= 0) OR (p73 <= 0) OR (p167 <= 0) OR (p178 <= 0))))))))
lola: processed formula length: 264
lola: 92 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 35 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: 75522 markings, 3057533 edges, 15104 markings/sec, 0 secs
lola: 148798 markings, 6096150 edges, 14655 markings/sec, 5 secs
lola: 219417 markings, 9102668 edges, 14124 markings/sec, 10 secs
lola: 291969 markings, 12185906 edges, 14510 markings/sec, 15 secs
lola: 361049 markings, 15121542 edges, 13816 markings/sec, 20 secs
lola: 429845 markings, 18042805 edges, 13759 markings/sec, 25 secs
lola: 501641 markings, 21061304 edges, 14359 markings/sec, 30 secs
lola: 574258 markings, 24150419 edges, 14523 markings/sec, 35 secs
lola: 646500 markings, 27201757 edges, 14448 markings/sec, 40 secs
lola: 720137 markings, 30304011 edges, 14727 markings/sec, 45 secs
lola: 792717 markings, 33397377 edges, 14516 markings/sec, 50 secs
lola: 860260 markings, 36233247 edges, 13509 markings/sec, 55 secs
lola: 930794 markings, 39194556 edges, 14107 markings/sec, 60 secs
lola: 997149 markings, 42084990 edges, 13271 markings/sec, 65 secs
lola: 1063376 markings, 44965907 edges, 13245 markings/sec, 70 secs
lola: 1123445 markings, 47572445 edges, 12014 markings/sec, 75 secs
lola: 1190467 markings, 50466451 edges, 13404 markings/sec, 80 secs
lola: 1257920 markings, 53400497 edges, 13491 markings/sec, 85 secs
lola: 1326886 markings, 56373894 edges, 13793 markings/sec, 90 secs
lola: 1392343 markings, 59221398 edges, 13091 markings/sec, 95 secs
lola: 1464142 markings, 62234345 edges, 14360 markings/sec, 100 secs
lola: 1536922 markings, 65327419 edges, 14556 markings/sec, 105 secs
lola: 1608963 markings, 68391045 edges, 14408 markings/sec, 110 secs
lola: 1680796 markings, 71425617 edges, 14367 markings/sec, 115 secs
lola: 1749922 markings, 74415684 edges, 13825 markings/sec, 120 secs
lola: 1818867 markings, 77413949 edges, 13789 markings/sec, 125 secs
lola: 1886495 markings, 80349118 edges, 13526 markings/sec, 130 secs
lola: 1954210 markings, 83250256 edges, 13543 markings/sec, 135 secs
lola: 2021848 markings, 86127934 edges, 13528 markings/sec, 140 secs
lola: 2091090 markings, 89103125 edges, 13848 markings/sec, 145 secs
lola: 2161210 markings, 92150360 edges, 14024 markings/sec, 150 secs
lola: 2230760 markings, 95111303 edges, 13910 markings/sec, 155 secs
lola: 2298557 markings, 98057353 edges, 13559 markings/sec, 160 secs
lola: 2361427 markings, 100932443 edges, 12574 markings/sec, 165 secs
lola: 2422655 markings, 103732378 edges, 12246 markings/sec, 170 secs
lola: 2485214 markings, 106572375 edges, 12512 markings/sec, 175 secs
lola: 2551872 markings, 109551207 edges, 13332 markings/sec, 180 secs
lola: 2616980 markings, 112460436 edges, 13022 markings/sec, 185 secs
lola: 2680476 markings, 115281925 edges, 12699 markings/sec, 190 secs
lola: 2745295 markings, 118183072 edges, 12964 markings/sec, 195 secs
lola: 2809010 markings, 121030819 edges, 12743 markings/sec, 200 secs
lola: 2878479 markings, 123974605 edges, 13894 markings/sec, 205 secs
lola: 2943659 markings, 126847557 edges, 13036 markings/sec, 210 secs
lola: 3008296 markings, 129856919 edges, 12927 markings/sec, 215 secs
lola: 3075122 markings, 132921658 edges, 13365 markings/sec, 220 secs
lola: 3140545 markings, 135840105 edges, 13085 markings/sec, 225 secs
lola: 3205275 markings, 138727496 edges, 12946 markings/sec, 230 secs
lola: 3276742 markings, 141808239 edges, 14293 markings/sec, 235 secs
lola: 3345890 markings, 144858565 edges, 13830 markings/sec, 240 secs
lola: 3407852 markings, 147785353 edges, 12392 markings/sec, 245 secs
lola: 3468423 markings, 150482659 edges, 12114 markings/sec, 250 secs
lola: 3532302 markings, 153327883 edges, 12776 markings/sec, 255 secs
lola: 3596411 markings, 156126992 edges, 12822 markings/sec, 260 secs
lola: 3657221 markings, 158922109 edges, 12162 markings/sec, 265 secs
lola: 3722009 markings, 161805699 edges, 12958 markings/sec, 270 secs
lola: 3787350 markings, 164680275 edges, 13068 markings/sec, 275 secs
lola: 3845465 markings, 167329956 edges, 11623 markings/sec, 280 secs
lola: 3910724 markings, 170256229 edges, 13052 markings/sec, 285 secs
lola: 3974150 markings, 173071107 edges, 12685 markings/sec, 290 secs
lola: 4038524 markings, 175937446 edges, 12875 markings/sec, 295 secs
lola: 4101661 markings, 178753493 edges, 12627 markings/sec, 300 secs
lola: 4166192 markings, 181621926 edges, 12906 markings/sec, 305 secs
lola: 4226806 markings, 184298946 edges, 12123 markings/sec, 310 secs
lola: 4290265 markings, 187136492 edges, 12692 markings/sec, 315 secs
lola: 4353449 markings, 189939594 edges, 12637 markings/sec, 320 secs
lola: 4417738 markings, 192803698 edges, 12858 markings/sec, 325 secs
lola: 4479325 markings, 195605472 edges, 12317 markings/sec, 330 secs
lola: 4542239 markings, 198450760 edges, 12583 markings/sec, 335 secs
lola: 4606386 markings, 201304564 edges, 12829 markings/sec, 340 secs
lola: 4670492 markings, 204149091 edges, 12821 markings/sec, 345 secs
lola: 4734518 markings, 206984103 edges, 12805 markings/sec, 350 secs
lola: 4801570 markings, 209887319 edges, 13410 markings/sec, 355 secs
lola: 4872259 markings, 212988382 edges, 14138 markings/sec, 360 secs
lola: 4938399 markings, 215938888 edges, 13228 markings/sec, 365 secs
lola: 5005860 markings, 218954449 edges, 13492 markings/sec, 370 secs
lola: 5073039 markings, 221960538 edges, 13436 markings/sec, 375 secs
lola: 5140281 markings, 224969177 edges, 13448 markings/sec, 380 secs
lola: 5208582 markings, 228024321 edges, 13660 markings/sec, 385 secs
lola: 5279280 markings, 231132343 edges, 14140 markings/sec, 390 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no unknown no no unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 1564276 KB
lola: time consumption: 401 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p30) AND (1 <= p32) AND (1 <= p47) AND (1 <= p167) AND (1 <= p178)) R X (((p4 <= 0) OR (p17 <= 0)))) AND X ((G (((p114 <= 0) OR (p116 <= 0) OR (p140 <= 0) OR (p146 <= 0))) OR F (((p114 <= 0) OR (p116 <= 0) OR (p136 <= 0) OR (p167 <= 0) OR (p178 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p30) AND (1 <= p32) AND (1 <= p47) AND (1 <= p167) AND (1 <= p178)) R X (((p4 <= 0) OR (p17 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p30) AND (1 <= p32) AND (1 <= p47) AND (1 <= p167) AND (1 <= p178)) R X (((p4 <= 0) OR (p17 <= 0))))
lola: processed formula length: 109
lola: 92 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: 3569 markings, 139985 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p74 <= 0)) R (((p30 <= 0) OR (p60 <= 0)) R ((p32 <= 0) OR (p58 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p74 <= 0)) R (((p30 <= 0) OR (p60 <= 0)) R ((p32 <= 0) OR (p58 <= 0)))))
lola: processed formula length: 80
lola: 92 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p167) AND (1 <= p178)) U ((1 <= p77))) U X (X ((F (((p77 <= 0))) OR G (((p77 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p2) AND (1 <= p4) AND (1 <= p16) AND (1 <= p167) AND (1 <= p178)) U ((1 <= p77))) U X (X ((F (((p77 <= 0))) OR G (((p77 <= 0)))))))
lola: processed formula length: 140
lola: 92 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 139 markings, 369 edges
lola: ========================================
lola: subprocess 7 will run for 633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p32 <= 0) OR (p36 <= 0))) OR X (((((1 <= p178)) U ((1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p167) AND (1 <= p178))) AND (((1 <= p86)) AND (((1 <= p88)) AND (((1 <= p99)) AND (((1 <= p167)) AND ((1 <= p178)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p32 <= 0) OR (p36 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p32 <= 0) OR (p36 <= 0)))
lola: processed formula length: 31
lola: 92 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: 265 markings, 1007 edges
lola: ========================================
lola: subprocess 8 will run for 792 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p178)) U ((1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p167) AND (1 <= p178))) AND (((1 <= p86)) AND (((1 <= p88)) AND (((1 <= p99)) AND (((1 <= p167)) AND ((1 <= p178))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p178)) U ((1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p167) AND (1 <= p178))) AND (((1 <= p86)) AND (((1 <= p88)) AND (((1 <= p99)) AND (((1 <= p167)) AND ((1 <= p178))))))))
lola: processed formula length: 194
lola: 92 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: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 792 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p15))))
lola: processed formula length: 20
lola: 92 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: 15 markings, 16 edges
lola: ========================================
lola: subprocess 9 will run for 1056 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p116) AND (1 <= p120))) OR (F (((1 <= p2) AND (1 <= p4) AND (1 <= p19) AND (1 <= p167) AND (1 <= p178))) OR ((1 <= p114) AND (1 <= p116) AND (1 <= p118) AND (1 <= p167) AND (1 <= p178))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 1056 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p114) AND (1 <= p116) AND (1 <= p118) AND (1 <= p167) AND (1 <= p178))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p114) AND (1 <= p116) AND (1 <= p118) AND (1 <= p167) AND (1 <= p178))
lola: processed formula length: 77
lola: 92 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 5 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 10 will run for 1584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p116) AND (1 <= p120)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p116) AND (1 <= p120)))
lola: processed formula length: 33
lola: 92 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 14 edges
lola: ========================================
lola: subprocess 11 will run for 3168 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p2) AND (1 <= p4) AND (1 <= p19) AND (1 <= p167) AND (1 <= p178)))
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: ((p2 <= 0) OR (p4 <= 0) OR (p19 <= 0) OR (p167 <= 0) OR (p178 <= 0))
lola: processed formula length: 72
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 12 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 1584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p131)) OR (G (F ((((1 <= p132)) OR ((1 <= p32) AND (1 <= p58))))) AND F (((1 <= p131)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p131))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p131))
lola: processed formula length: 13
lola: 92 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 3168 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p131)))
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: ((p131 <= 0))
lola: processed formula length: 13
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 14 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 3168 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p156)))) AND F (((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p156))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3168 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p2) AND (1 <= p4) AND (1 <= p28) AND (1 <= p156)))
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: ((p2 <= 0) OR (p4 <= 0) OR (p28 <= 0) OR (p156 <= 0))
lola: processed formula length: 56
lola: 94 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((p4 <= 0) OR (p32 <= 0)) R F (((p134 <= 0)))) R X (F ((G (((p58 <= 0) OR (p60 <= 0) OR (p73 <= 0) OR (p167 <= 0) OR (p178 <= 0))) AND (F (G (((p4 <= 0) OR (p32 <= 0)))) OR G (((p58 <= 0) OR (p60 <= 0) OR (p73 <= 0) OR (p167 <= 0) OR (p178 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p4 <= 0) OR (p32 <= 0)) R F (((p134 <= 0)))) R X (F ((G (((p58 <= 0) OR (p60 <= 0) OR (p73 <= 0) OR (p167 <= 0) OR (p178 <= 0))) AND (F (G (((p4 <= 0) OR (p32 <= 0)))) OR G (((p58 <= 0) OR (p60 <= 0) OR (p73 <= 0) OR (p167 <= 0) OR (p178 <= 0))))))))
lola: processed formula length: 264
lola: 92 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 35 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: 74690 markings, 3023298 edges, 14938 markings/sec, 0 secs
lola: 147962 markings, 6059380 edges, 14654 markings/sec, 5 secs
lola: 219257 markings, 9096355 edges, 14259 markings/sec, 10 secs
lola: 291944 markings, 12179973 edges, 14537 markings/sec, 15 secs
lola: 361027 markings, 15120592 edges, 13817 markings/sec, 20 secs
lola: 430190 markings, 18058776 edges, 13833 markings/sec, 25 secs
lola: 502642 markings, 21103956 edges, 14490 markings/sec, 30 secs
lola: 570710 markings, 24000767 edges, 13614 markings/sec, 35 secs
lola: 643224 markings, 27063989 edges, 14503 markings/sec, 40 secs
lola: 717146 markings, 30176745 edges, 14784 markings/sec, 45 secs
lola: 789519 markings, 33260788 edges, 14475 markings/sec, 50 secs
lola: 862671 markings, 36333500 edges, 14630 markings/sec, 55 secs
lola: 931945 markings, 39247429 edges, 13855 markings/sec, 60 secs
lola: 998508 markings, 42128160 edges, 13313 markings/sec, 65 secs
lola: 1064266 markings, 45003498 edges, 13152 markings/sec, 70 secs
lola: 1128709 markings, 47805041 edges, 12889 markings/sec, 75 secs
lola: 1193718 markings, 50611334 edges, 13002 markings/sec, 80 secs
lola: 1258618 markings, 53431294 edges, 12980 markings/sec, 85 secs
lola: 1327574 markings, 56404319 edges, 13791 markings/sec, 90 secs
lola: 1395314 markings, 59349244 edges, 13548 markings/sec, 95 secs
lola: 1462573 markings, 62171004 edges, 13452 markings/sec, 100 secs
lola: 1535504 markings, 65266408 edges, 14586 markings/sec, 105 secs
lola: 1607347 markings, 68322408 edges, 14369 markings/sec, 110 secs
lola: 1678869 markings, 71345505 edges, 14304 markings/sec, 115 secs
lola: 1747420 markings, 74307510 edges, 13710 markings/sec, 120 secs
lola: 1812640 markings, 77142884 edges, 13044 markings/sec, 125 secs
lola: 1880003 markings, 80068578 edges, 13473 markings/sec, 130 secs
lola: 1947737 markings, 82973593 edges, 13547 markings/sec, 135 secs
lola: 2014964 markings, 85829393 edges, 13445 markings/sec, 140 secs
lola: 2078080 markings, 88546754 edges, 12623 markings/sec, 145 secs
lola: 2144758 markings, 91449067 edges, 13336 markings/sec, 150 secs
lola: 2213689 markings, 94460049 edges, 13786 markings/sec, 155 secs
lola: 2279607 markings, 97407901 edges, 13184 markings/sec, 160 secs
lola: 2345301 markings, 100307545 edges, 13139 markings/sec, 165 secs
lola: 2408011 markings, 103114241 edges, 12542 markings/sec, 170 secs
lola: 2470572 markings, 105911609 edges, 12512 markings/sec, 175 secs
lola: 2542433 markings, 108920839 edges, 14372 markings/sec, 180 secs
lola: 2607660 markings, 111894867 edges, 13045 markings/sec, 185 secs
lola: 2668890 markings, 114748826 edges, 12246 markings/sec, 190 secs
lola: 2733280 markings, 117622020 edges, 12878 markings/sec, 195 secs
lola: 2800117 markings, 120628128 edges, 13367 markings/sec, 200 secs
lola: 2865742 markings, 123558775 edges, 13125 markings/sec, 205 secs
lola: 2929671 markings, 126415982 edges, 12786 markings/sec, 210 secs
lola: 2997800 markings, 129386936 edges, 13626 markings/sec, 215 secs
lola: 3068578 markings, 132446012 edges, 14156 markings/sec, 220 secs
lola: 3130748 markings, 135394394 edges, 12434 markings/sec, 225 secs
lola: 3196668 markings, 138285887 edges, 13184 markings/sec, 230 secs
lola: 3263715 markings, 141336543 edges, 13409 markings/sec, 235 secs
lola: 3332409 markings, 144404723 edges, 13739 markings/sec, 240 secs
lola: 3394342 markings, 147157252 edges, 12387 markings/sec, 245 secs
lola: 3460335 markings, 150084199 edges, 13199 markings/sec, 250 secs
lola: 3523604 markings, 152945101 edges, 12654 markings/sec, 255 secs
lola: 3586042 markings, 155721006 edges, 12488 markings/sec, 260 secs
lola: 3648578 markings, 158513824 edges, 12507 markings/sec, 265 secs
lola: 3708790 markings, 161166084 edges, 12042 markings/sec, 270 secs
lola: 3771126 markings, 164013492 edges, 12467 markings/sec, 275 secs
lola: 3835076 markings, 166874719 edges, 12790 markings/sec, 280 secs
lola: 3901047 markings, 169815186 edges, 13194 markings/sec, 285 secs
lola: 3964083 markings, 172638565 edges, 12607 markings/sec, 290 secs
lola: 4028060 markings, 175478843 edges, 12795 markings/sec, 295 secs
lola: 4087855 markings, 178138566 edges, 11959 markings/sec, 300 secs
lola: 4152499 markings, 181014860 edges, 12929 markings/sec, 305 secs
lola: 4215732 markings, 183817259 edges, 12647 markings/sec, 310 secs
lola: 4279980 markings, 186677442 edges, 12850 markings/sec, 315 secs
lola: 4343327 markings, 189493618 edges, 12669 markings/sec, 320 secs
lola: 4407074 markings, 192330375 edges, 12749 markings/sec, 325 secs
lola: 4468111 markings, 195102449 edges, 12207 markings/sec, 330 secs
lola: 4530805 markings, 197945612 edges, 12539 markings/sec, 335 secs
lola: 4594395 markings, 200756586 edges, 12718 markings/sec, 340 secs
lola: 4653621 markings, 203399516 edges, 11845 markings/sec, 345 secs
lola: 4717251 markings, 206219759 edges, 12726 markings/sec, 350 secs
lola: 4783701 markings, 209125785 edges, 13290 markings/sec, 355 secs
lola: 4855886 markings, 212208612 edges, 14437 markings/sec, 360 secs
lola: 4923001 markings, 215213030 edges, 13423 markings/sec, 365 secs
lola: 4990154 markings, 218218597 edges, 13431 markings/sec, 370 secs
lola: 5057223 markings, 221201455 edges, 13414 markings/sec, 375 secs
lola: 5124497 markings, 224234142 edges, 13455 markings/sec, 380 secs
lola: 5193390 markings, 227325254 edges, 13779 markings/sec, 385 secs
lola: 5262396 markings, 230432816 edges, 13801 markings/sec, 390 secs
lola: 5329651 markings, 233442998 edges, 13451 markings/sec, 395 secs
lola: 5394647 markings, 236349064 edges, 12999 markings/sec, 400 secs
lola: 5460989 markings, 239323645 edges, 13268 markings/sec, 405 secs
lola: 5526988 markings, 242265249 edges, 13200 markings/sec, 410 secs
lola: 5592385 markings, 245181496 edges, 13079 markings/sec, 415 secs
lola: 5657163 markings, 248070321 edges, 12956 markings/sec, 420 secs
lola: 5720787 markings, 250936704 edges, 12725 markings/sec, 425 secs
lola: 5785823 markings, 253827332 edges, 13007 markings/sec, 430 secs
lola: 5853466 markings, 256802294 edges, 13529 markings/sec, 435 secs
lola: 5921737 markings, 259839554 edges, 13654 markings/sec, 440 secs
lola: 5985072 markings, 262655116 edges, 12667 markings/sec, 445 secs
lola: 6052164 markings, 265610420 edges, 13418 markings/sec, 450 secs
lola: 6121349 markings, 268671483 edges, 13837 markings/sec, 455 secs
lola: 6190341 markings, 271740419 edges, 13798 markings/sec, 460 secs
lola: 6257688 markings, 274730955 edges, 13469 markings/sec, 465 secs
lola: 6325521 markings, 277710376 edges, 13567 markings/sec, 470 secs
lola: 6392754 markings, 280698194 edges, 13447 markings/sec, 475 secs
lola: 6460350 markings, 283706544 edges, 13519 markings/sec, 480 secs
lola: 6525423 markings, 286596915 edges, 13015 markings/sec, 485 secs
lola: 6591000 markings, 289469603 edges, 13115 markings/sec, 490 secs
lola: 6659356 markings, 292496914 edges, 13671 markings/sec, 495 secs
lola: 6726634 markings, 295505523 edges, 13456 markings/sec, 500 secs
lola: 6793067 markings, 298459455 edges, 13287 markings/sec, 505 secs
lola: 6860409 markings, 301446850 edges, 13468 markings/sec, 510 secs
lola: 6926505 markings, 304464813 edges, 13219 markings/sec, 515 secs
lola: 6992071 markings, 307449823 edges, 13113 markings/sec, 520 secs
lola: 7056492 markings, 310378386 edges, 12884 markings/sec, 525 secs
lola: 7124426 markings, 313364024 edges, 13587 markings/sec, 530 secs
lola: 7192234 markings, 316380243 edges, 13562 markings/sec, 535 secs
lola: 7258484 markings, 319329005 edges, 13250 markings/sec, 540 secs
lola: 7324109 markings, 322244474 edges, 13125 markings/sec, 545 secs
lola: 7387979 markings, 325041560 edges, 12774 markings/sec, 550 secs
lola: 7456424 markings, 328084740 edges, 13689 markings/sec, 555 secs
lola: 7522919 markings, 331042024 edges, 13299 markings/sec, 560 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: 7587571 markings, 333896742 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes no no no
lola:
preliminary result: no no no no no no no no yes no no no
lola: memory consumption: 68548 KB
lola: time consumption: 972 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="CloudDeployment-PT-5a"
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 CloudDeployment-PT-5a, 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 r168-smll-158987806600314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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