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.r166-smll-158987787600338.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 Angiogenesis-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787600338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 4.0K Apr 28 14:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 28 14:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 28 14:22 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 28 14:22 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 28 14:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 28 14:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 28 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 28 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 28 14:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 28 14:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 28 14:22 instance
-rw-r--r-- 1 mcc users 6 Apr 28 14:22 iscolored
-rw-r--r-- 1 mcc users 33K Apr 28 14:22 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 Angiogenesis-PT-15-00
FORMULA_NAME Angiogenesis-PT-15-01
FORMULA_NAME Angiogenesis-PT-15-02
FORMULA_NAME Angiogenesis-PT-15-03
FORMULA_NAME Angiogenesis-PT-15-04
FORMULA_NAME Angiogenesis-PT-15-05
FORMULA_NAME Angiogenesis-PT-15-06
FORMULA_NAME Angiogenesis-PT-15-07
FORMULA_NAME Angiogenesis-PT-15-08
FORMULA_NAME Angiogenesis-PT-15-09
FORMULA_NAME Angiogenesis-PT-15-10
FORMULA_NAME Angiogenesis-PT-15-11
FORMULA_NAME Angiogenesis-PT-15-12
FORMULA_NAME Angiogenesis-PT-15-13
FORMULA_NAME Angiogenesis-PT-15-14
FORMULA_NAME Angiogenesis-PT-15-15

=== Now, execution of the tool begins

BK_START 1591423475327

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 06:04:37] [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-06 06:04:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 06:04:37] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2020-06-06 06:04:37] [INFO ] Transformed 39 places.
[2020-06-06 06:04:37] [INFO ] Transformed 64 transitions.
[2020-06-06 06:04:37] [INFO ] Parsed PT model containing 39 places and 64 transitions in 105 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100013 steps, including 0 resets, run finished after 124 ms. (steps per millisecond=806 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0]
// Phase 1: matrix 64 rows 39 cols
[2020-06-06 06:04:37] [INFO ] Computed 8 place invariants in 6 ms
[2020-06-06 06:04:37] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2020-06-06 06:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:38] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2020-06-06 06:04:38] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 14 ms.
[2020-06-06 06:04:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 06:04:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2020-06-06 06:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:38] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2020-06-06 06:04:38] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 14 ms.
[2020-06-06 06:04:38] [INFO ] Added : 59 causal constraints over 12 iterations in 163 ms. Result :sat
[2020-06-06 06:04:38] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-06-06 06:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:38] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-06 06:04:38] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 10 ms.
[2020-06-06 06:04:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 06:04:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 06:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:38] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2020-06-06 06:04:38] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 7 ms.
[2020-06-06 06:04:38] [INFO ] Added : 58 causal constraints over 14 iterations in 126 ms. Result :sat
[2020-06-06 06:04:38] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-06-06 06:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:38] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-06-06 06:04:38] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 8 ms.
[2020-06-06 06:04:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 06:04:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 06:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:38] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2020-06-06 06:04:38] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 8 ms.
[2020-06-06 06:04:38] [INFO ] Added : 58 causal constraints over 12 iterations in 97 ms. Result :sat
[2020-06-06 06:04:38] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-06 06:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:38] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-06-06 06:04:38] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 6 ms.
[2020-06-06 06:04:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 06:04:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-06 06:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:39] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-06-06 06:04:39] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 7 ms.
[2020-06-06 06:04:39] [INFO ] Added : 50 causal constraints over 10 iterations in 84 ms. Result :sat
[2020-06-06 06:04:39] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-06-06 06:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:39] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-06 06:04:39] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 9 ms.
[2020-06-06 06:04:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 06:04:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 06:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:39] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-06 06:04:39] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 6 ms.
[2020-06-06 06:04:39] [INFO ] Added : 58 causal constraints over 12 iterations in 97 ms. Result :sat
[2020-06-06 06:04:39] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-06 06:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:39] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-06-06 06:04:39] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 7 ms.
[2020-06-06 06:04:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 06:04:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-06 06:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:39] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-06-06 06:04:39] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 7 ms.
[2020-06-06 06:04:39] [INFO ] Added : 50 causal constraints over 10 iterations in 75 ms. Result :sat
[2020-06-06 06:04:39] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-06-06 06:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:39] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-06-06 06:04:39] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 6 ms.
[2020-06-06 06:04:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 06:04:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 06:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:39] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2020-06-06 06:04:39] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 8 ms.
[2020-06-06 06:04:39] [INFO ] Added : 52 causal constraints over 11 iterations in 156 ms. Result :sat
[2020-06-06 06:04:39] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2020-06-06 06:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:39] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-06 06:04:39] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 6 ms.
[2020-06-06 06:04:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 06:04:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 06:04:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:39] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2020-06-06 06:04:39] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 5 ms.
[2020-06-06 06:04:40] [INFO ] Added : 56 causal constraints over 12 iterations in 85 ms. Result :sat
[2020-06-06 06:04:40] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-06-06 06:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:40] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-06-06 06:04:40] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 6 ms.
[2020-06-06 06:04:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 06:04:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-06 06:04:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 06:04:40] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2020-06-06 06:04:40] [INFO ] Computed and/alt/rep : 61/165/61 causal constraints in 11 ms.
[2020-06-06 06:04:40] [INFO ] Added : 57 causal constraints over 12 iterations in 95 ms. Result :sat
[2020-06-06 06:04:40] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-06 06:04:40] [INFO ] Flatten gal took : 47 ms
FORMULA Angiogenesis-PT-15-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-15-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Angiogenesis-PT-15-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 06:04:40] [INFO ] Flatten gal took : 16 ms
[2020-06-06 06:04:40] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-06 06:04:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Angiogenesis-PT-15 @ 3570 seconds

FORMULA Angiogenesis-PT-15-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-15-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-15-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-15-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-15-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-15-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-15-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-15-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Angiogenesis-PT-15-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-15-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-15-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-15-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2879
rslt: Output for LTLFireability @ Angiogenesis-PT-15

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (G (((p6 <= 0) OR (p11 <= 0)))) OR (p4 <= 0)))",
"processed_size": 53,
"rewrites": 64
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X (F ((G (((1 <= p14) AND (1 <= p33))) AND ((1 <= p8) AND (1 <= p11))))))",
"processed_size": 76,
"rewrites": 64
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F ((G (((1 <= p8) AND (1 <= p34))) OR ((1 <= p8) AND (1 <= p34)))) AND (X (((1 <= p8) AND (1 <= p34))) OR (G (((1 <= p8) AND (1 <= p34))) OR ((1 <= p8) AND (1 <= p34))))))",
"processed_size": 175,
"rewrites": 64
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 806
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 3,
"X": 3,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "X ((((1 <= p38) OR ((1 <= p20) AND (1 <= p31))) U (((1 <= p15) U ((1 <= p20) AND (1 <= p31))) U X (X (F ((1 <= p15)))))))",
"processed_size": 122,
"rewrites": 64
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1074
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p17)) AND ((1 <= p37) OR (1 <= p17)))))",
"processed_size": 55,
"rewrites": 64
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1612
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G (((p4 <= 0) AND (p1 <= 0))) AND (F ((p38 <= 0)) AND (1 <= p13))))",
"processed_size": 71,
"rewrites": 64
},
"result":
{
"edges": 123,
"markings": 108,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((G (((1 <= p24) AND (1 <= p31))) AND ((1 <= p24) AND (1 <= p31))))",
"processed_size": 69,
"rewrites": 64
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F (((1 <= p8) AND (1 <= p33))) AND ((1 <= p7) AND (1 <= p11))))",
"processed_size": 67,
"rewrites": 64
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3552,
"runtime": 691.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G((G(**) AND (** AND **))) OR F((F(**) AND (** AND **)))) : X((G(**) AND F(G((** OR (G(*) AND F(**))))))) : G(F((X(**) OR **))) : F(G((F(**) AND (** OR **)))) : F((G(*) AND (F(*) AND **))) : ((** U **) U G((G(**) OR (X(**) OR **)))) : (** U (X(G(**)) U **)) : X(((** U **) AND **)) : X((X(G(*)) OR **)) : X(X(F((G(**) AND (** AND **))))) : G((F((G(**) OR **)) AND (X(**) OR (G(**) OR **)))) : X(X(X((F(*) OR G(**))))) : X((** U ((** U **) U X(X(F(**))))))"
},
"net":
{
"arcs": 185,
"conflict_clusters": 19,
"places": 39,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"preliminary_value": "no no no no no no no no yes no no unknown no ",
"value": "no no no no no no no no yes no no unknown 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: 103/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 64 transitions, 31 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: (G (((G (((1 <= p24) AND (1 <= p31))) AND (1 <= p24)) AND (1 <= p31))) OR F (((F (((1 <= p8) AND (1 <= p33))) AND (1 <= p7)) AND (1 <= p11)))) : X ((G ((((1 <= p15) AND (1 <= p34)) OR (1 <= p28))) AND F (G ((NOT(F (((1 <= p32) AND (1 <= p36)))) U ((1 <= p32) AND (1 <= p35))))))) : X (F (X (G (X (F ((X ((1 <= p16)) OR (1 <= p9)))))))) : X (F (G (((1 <= p37) U (1 <= p17))))) : F (((NOT(F (((1 <= p4) OR (1 <= p1)))) AND F (NOT(G ((1 <= p38))))) AND (1 <= p13))) : (((1 <= p28) U (1 <= p37)) U G (((G ((1 <= p27)) OR X ((1 <= p4))) OR (1 <= p17)))) : (((p3 <= 0) OR (p5 <= 0)) U (X (G (((1 <= p3) AND (1 <= p5)))) U ((1 <= p3) AND (1 <= p5)))) : X ((((1 <= p19) U (1 <= p27)) AND ((p27 <= 0) OR (p9 <= 0) OR (p11 <= 0)))) : X ((G (NOT(X (((1 <= p6) AND (1 <= p11))))) OR (p4 <= 0))) : F (X (X (F (((G (((1 <= p14) AND (1 <= p33))) AND (1 <= p8)) AND (1 <= p11)))))) : G (NOT(F (NOT((X (((1 <= p8) AND (1 <= p34))) U (G (((1 <= p8) AND (1 <= p34))) OR ((1 <= p8) AND (1 <= p34)))))))) : X (NOT(X ((NOT(F (NOT(X ((1 <= p22))))) AND NOT(X (G ((1 <= p22)))))))) : X ((((1 <= p38) OR ((1 <= p20) AND (1 <= p31))) U (((1 <= p15) U ((1 <= p20) AND (1 <= p31))) U F (X (X ((1 <= p15)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((1 <= p15) AND (1 <= p34)) OR (1 <= p28))) AND F (G ((((1 <= p32) AND (1 <= p35)) OR (G (((p32 <= 0) OR (p36 <= 0))) AND F (((1 <= p32) AND (1 <= p35)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((1 <= p15) AND (1 <= p34)) OR (1 <= p28))) AND F (G ((((1 <= p32) AND (1 <= p35)) OR (G (((p32 <= 0) OR (p36 <= 0))) AND F (((1 <= p32) AND (1 <= p35)))))))))
lola: processed formula length: 169
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((1 <= p16)) OR (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((1 <= p16)) OR (1 <= p9))))
lola: processed formula length: 37
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p28) U (1 <= p37)) U G ((G ((1 <= p27)) OR (X ((1 <= p4)) OR (1 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p28) U (1 <= p37)) U G ((G ((1 <= p27)) OR (X ((1 <= p4)) OR (1 <= p17)))))
lola: processed formula length: 83
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 18 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p3 <= 0) OR (p5 <= 0)) U (X (G (((1 <= p3) AND (1 <= p5)))) U ((1 <= p3) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p3 <= 0) OR (p5 <= 0)) U (X (G (((1 <= p3) AND (1 <= p5)))) U ((1 <= p3) AND (1 <= p5))))
lola: processed formula length: 93
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p19) U (1 <= p27)) AND ((p27 <= 0) OR (p9 <= 0) OR (p11 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p19) U (1 <= p27)) AND ((p27 <= 0) OR (p9 <= 0) OR (p11 <= 0))))
lola: processed formula length: 77
lola: 64 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((p6 <= 0) OR (p11 <= 0)))) OR (p4 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((p6 <= 0) OR (p11 <= 0)))) OR (p4 <= 0)))
lola: processed formula length: 53
lola: 64 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 6 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((G (((1 <= p14) AND (1 <= p33))) AND ((1 <= p8) AND (1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G (((1 <= p14) AND (1 <= p33))) AND ((1 <= p8) AND (1 <= p11))))))
lola: processed formula length: 76
lola: 64 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((G (((1 <= p8) AND (1 <= p34))) OR ((1 <= p8) AND (1 <= p34)))) AND (X (((1 <= p8) AND (1 <= p34))) OR (G (((1 <= p8) AND (1 <= p34))) OR ((1 <= p8) AND (1 <= p34))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((G (((1 <= p8) AND (1 <= p34))) OR ((1 <= p8) AND (1 <= p34)))) AND (X (((1 <= p8) AND (1 <= p34))) OR (G (((1 <= p8) AND (1 <= p34))) OR ((1 <= p8) AND (1 <= p34))))))
lola: processed formula length: 175
lola: 64 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 8 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((F ((p22 <= 0)) OR G ((1 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((F ((p22 <= 0)) OR G ((1 <= p22))))))
lola: processed formula length: 46
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2184142 markings, 4596376 edges, 436828 markings/sec, 0 secs
lola: 4286892 markings, 8911079 edges, 420550 markings/sec, 5 secs
lola: 6151722 markings, 12866112 edges, 372966 markings/sec, 10 secs
lola: 7914030 markings, 16669741 edges, 352462 markings/sec, 15 secs
lola: 9713230 markings, 20512395 edges, 359840 markings/sec, 20 secs
lola: 11469789 markings, 24326211 edges, 351312 markings/sec, 25 secs
lola: 13335683 markings, 28186104 edges, 373179 markings/sec, 30 secs
lola: 15091793 markings, 31783234 edges, 351222 markings/sec, 35 secs
lola: 16855728 markings, 35445364 edges, 352787 markings/sec, 40 secs
lola: 18634590 markings, 39093876 edges, 355772 markings/sec, 45 secs
lola: 20333905 markings, 42700022 edges, 339863 markings/sec, 50 secs
lola: 21938716 markings, 46184184 edges, 320962 markings/sec, 55 secs
lola: 23633905 markings, 49761257 edges, 339038 markings/sec, 60 secs
lola: 25254893 markings, 53192491 edges, 324198 markings/sec, 65 secs
lola: 26921512 markings, 56678799 edges, 333324 markings/sec, 70 secs
lola: 28521066 markings, 60118628 edges, 319911 markings/sec, 75 secs
lola: 30099140 markings, 63532894 edges, 315615 markings/sec, 80 secs
lola: 31671965 markings, 66919157 edges, 314565 markings/sec, 85 secs
lola: 33320899 markings, 70350391 edges, 329787 markings/sec, 90 secs
lola: 34903642 markings, 73718643 edges, 316549 markings/sec, 95 secs
lola: 36527311 markings, 77154586 edges, 324734 markings/sec, 100 secs
lola: 38109762 markings, 80447684 edges, 316490 markings/sec, 105 secs
lola: 39655160 markings, 83787498 edges, 309080 markings/sec, 110 secs
lola: 41225864 markings, 87147446 edges, 314141 markings/sec, 115 secs
lola: 42649263 markings, 90300065 edges, 284680 markings/sec, 120 secs
lola: 44184569 markings, 93624458 edges, 307061 markings/sec, 125 secs
lola: 45779561 markings, 96945435 edges, 318998 markings/sec, 130 secs
lola: 47329172 markings, 100252250 edges, 309922 markings/sec, 135 secs
lola: 48849930 markings, 103531453 edges, 304152 markings/sec, 140 secs
lola: 50308088 markings, 106747718 edges, 291632 markings/sec, 145 secs
lola: 51852268 markings, 110040078 edges, 308836 markings/sec, 150 secs
lola: 53455343 markings, 113415704 edges, 320615 markings/sec, 155 secs
lola: 54994877 markings, 116698937 edges, 307907 markings/sec, 160 secs
lola: 56452580 markings, 119909970 edges, 291541 markings/sec, 165 secs
lola: 57976575 markings, 123162392 edges, 304799 markings/sec, 170 secs
lola: 59482660 markings, 126399262 edges, 301217 markings/sec, 175 secs
lola: 60832837 markings, 129515173 edges, 270035 markings/sec, 180 secs
lola: 62251746 markings, 132683564 edges, 283782 markings/sec, 185 secs
lola: 63833737 markings, 135989362 edges, 316398 markings/sec, 190 secs
lola: 65297027 markings, 139173613 edges, 292658 markings/sec, 195 secs
lola: 66779586 markings, 142325934 edges, 296512 markings/sec, 200 secs
lola: 68164557 markings, 145449265 edges, 276994 markings/sec, 205 secs
lola: 69695051 markings, 148699478 edges, 306099 markings/sec, 210 secs
lola: 71069940 markings, 151820408 edges, 274978 markings/sec, 215 secs
lola: 72581030 markings, 155058463 edges, 302218 markings/sec, 220 secs
lola: 73948389 markings, 158144971 edges, 273472 markings/sec, 225 secs
lola: 75339044 markings, 161140907 edges, 278131 markings/sec, 230 secs
lola: 76379527 markings, 163322688 edges, 208097 markings/sec, 235 secs
lola: 77577832 markings, 165969081 edges, 239661 markings/sec, 240 secs
lola: 78259079 markings, 167540201 edges, 136249 markings/sec, 245 secs
lola: 79232897 markings, 169640914 edges, 194764 markings/sec, 250 secs
lola: 80171424 markings, 171556482 edges, 187705 markings/sec, 255 secs
lola: 81096483 markings, 173443548 edges, 185012 markings/sec, 260 secs
lola: 81926552 markings, 175250821 edges, 166014 markings/sec, 265 secs
lola: 82665578 markings, 176921149 edges, 147805 markings/sec, 270 secs
lola: 83694117 markings, 179132014 edges, 205708 markings/sec, 275 secs
lola: 84391712 markings, 180775056 edges, 139519 markings/sec, 280 secs
lola: 85299652 markings, 182798507 edges, 181588 markings/sec, 285 secs
lola: 86056878 markings, 184515127 edges, 151445 markings/sec, 290 secs
lola: 86979758 markings, 186534760 edges, 184576 markings/sec, 295 secs
lola: 88093786 markings, 188819168 edges, 222806 markings/sec, 300 secs
lola: 88772118 markings, 190238792 edges, 135666 markings/sec, 305 secs
lola: 89713401 markings, 192301157 edges, 188257 markings/sec, 310 secs
lola: 90816421 markings, 194681540 edges, 220604 markings/sec, 315 secs
lola: 91777915 markings, 196837881 edges, 192299 markings/sec, 320 secs
lola: 92675180 markings, 198741386 edges, 179453 markings/sec, 325 secs
lola: 93321294 markings, 200227598 edges, 129223 markings/sec, 330 secs
lola: 93370767 markings, 200326579 edges, 9895 markings/sec, 335 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 806 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p38) OR ((1 <= p20) AND (1 <= p31))) U (((1 <= p15) U ((1 <= p20) AND (1 <= p31))) U X (X (F ((1 <= p15)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p38) OR ((1 <= p20) AND (1 <= p31))) U (((1 <= p15) U ((1 <= p20) AND (1 <= p31))) U X (X (F ((1 <= p15)))))))
lola: processed formula length: 122
lola: 64 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 10 will run for 1074 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p17)) AND ((1 <= p37) OR (1 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p17)) AND ((1 <= p37) OR (1 <= p17)))))
lola: processed formula length: 55
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 1
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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 11 will run for 1612 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p4 <= 0) AND (p1 <= 0))) AND (F ((p38 <= 0)) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p4 <= 0) AND (p1 <= 0))) AND (F ((p38 <= 0)) AND (1 <= p13))))
lola: processed formula length: 71
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 108 markings, 123 edges
lola: ========================================
lola: subprocess 12 will run for 3224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((G (((1 <= p24) AND (1 <= p31))) AND ((1 <= p24) AND (1 <= p31)))) OR F ((F (((1 <= p8) AND (1 <= p33))) AND ((1 <= p7) AND (1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((1 <= p24) AND (1 <= p31))) AND ((1 <= p24) AND (1 <= p31))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((1 <= p24) AND (1 <= p31))) AND ((1 <= p24) AND (1 <= p31))))
lola: processed formula length: 69
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (X ((F ((p22 <= 0)) OR G ((1 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((F ((p22 <= 0)) OR G ((1 <= p22))))))
lola: processed formula length: 46
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2336779 markings, 4917402 edges, 467356 markings/sec, 0 secs
lola: 4449851 markings, 9255696 edges, 422614 markings/sec, 5 secs
lola: 6347222 markings, 13282114 edges, 379474 markings/sec, 10 secs
lola: 8155923 markings, 17192770 edges, 361740 markings/sec, 15 secs
lola: 9978726 markings, 21051756 edges, 364561 markings/sec, 20 secs
lola: 11697227 markings, 24831718 edges, 343700 markings/sec, 25 secs
lola: 13573969 markings, 28667409 edges, 375348 markings/sec, 30 secs
lola: 15370389 markings, 32375042 edges, 359284 markings/sec, 35 secs
lola: 17167777 markings, 36075113 edges, 359478 markings/sec, 40 secs
lola: 18948877 markings, 39752218 edges, 356220 markings/sec, 45 secs
lola: 20578942 markings, 43248494 edges, 326013 markings/sec, 50 secs
lola: 22204454 markings, 46784005 edges, 325102 markings/sec, 55 secs
lola: 23916510 markings, 50372378 edges, 342411 markings/sec, 60 secs
lola: 25620851 markings, 53924885 edges, 340868 markings/sec, 65 secs
lola: 27255814 markings, 57431433 edges, 326993 markings/sec, 70 secs
lola: 28904615 markings, 60937962 edges, 329760 markings/sec, 75 secs
lola: 30495478 markings, 64386479 edges, 318173 markings/sec, 80 secs
lola: 32123863 markings, 67868850 edges, 325677 markings/sec, 85 secs
lola: 33776622 markings, 71259711 edges, 330552 markings/sec, 90 secs
lola: 35384669 markings, 74721777 edges, 321609 markings/sec, 95 secs
lola: 37037826 markings, 78165261 edges, 330631 markings/sec, 100 secs
lola: 38612010 markings, 81580898 edges, 314837 markings/sec, 105 secs
lola: 40179042 markings, 84871621 edges, 313406 markings/sec, 110 secs
lola: 41700817 markings, 88195823 edges, 304355 markings/sec, 115 secs
lola: 43062476 markings, 91266569 edges, 272332 markings/sec, 120 secs
lola: 44682929 markings, 94700572 edges, 324091 markings/sec, 125 secs
lola: 46310267 markings, 98082101 edges, 325468 markings/sec, 130 secs
lola: 47894604 markings, 101431367 edges, 316867 markings/sec, 135 secs
lola: 49423194 markings, 104754865 edges, 305718 markings/sec, 140 secs
lola: 50982823 markings, 108132387 edges, 311926 markings/sec, 145 secs
lola: 52582907 markings, 111554581 edges, 320017 markings/sec, 150 secs
lola: 54202153 markings, 114975437 edges, 323849 markings/sec, 155 secs
lola: 55700972 markings, 118248109 edges, 299764 markings/sec, 160 secs
lola: 57205146 markings, 121470978 edges, 300835 markings/sec, 165 secs
lola: 58661524 markings, 124660513 edges, 291276 markings/sec, 170 secs
lola: 60077720 markings, 127742000 edges, 283239 markings/sec, 175 secs
lola: 61451379 markings, 130918361 edges, 274732 markings/sec, 180 secs
lola: 62950694 markings, 134221107 edges, 299863 markings/sec, 185 secs
lola: 64577420 markings, 137581420 edges, 325345 markings/sec, 190 secs
lola: 66065734 markings, 140811197 edges, 297663 markings/sec, 195 secs
lola: 67557752 markings, 144038228 edges, 298404 markings/sec, 200 secs
lola: 69028210 markings, 147299683 edges, 294092 markings/sec, 205 secs
lola: 70502457 markings, 150544964 edges, 294849 markings/sec, 210 secs
lola: 72045917 markings, 153863309 edges, 308692 markings/sec, 215 secs
lola: 73450779 markings, 157042281 edges, 280972 markings/sec, 220 secs
lola: 74825913 markings, 160042237 edges, 275027 markings/sec, 225 secs
lola: 75724958 markings, 161992986 edges, 179809 markings/sec, 230 secs
lola: 76703918 markings, 164083504 edges, 195792 markings/sec, 235 secs
lola: 77608040 markings, 166036174 edges, 180824 markings/sec, 240 secs
lola: 78308516 markings, 167649463 edges, 140095 markings/sec, 245 secs
lola: 79320227 markings, 169834159 edges, 202342 markings/sec, 250 secs
lola: 80260826 markings, 171750183 edges, 188120 markings/sec, 255 secs
lola: 81343070 markings, 173933803 edges, 216449 markings/sec, 260 secs
lola: 82014891 markings, 175471534 edges, 134364 markings/sec, 265 secs
lola: 82872243 markings, 177385161 edges, 171470 markings/sec, 270 secs
lola: 83694391 markings, 179132617 edges, 164430 markings/sec, 275 secs
lola: 84365136 markings, 180721617 edges, 134149 markings/sec, 280 secs
lola: 85214057 markings, 182607338 edges, 169784 markings/sec, 285 secs
lola: 85987592 markings, 184359285 edges, 154707 markings/sec, 290 secs
lola: 86932528 markings, 186426351 edges, 188987 markings/sec, 295 secs
lola: 87751979 markings, 188143091 edges, 163890 markings/sec, 300 secs
lola: 88723962 markings, 190143237 edges, 194397 markings/sec, 305 secs
lola: 89557519 markings, 191949860 edges, 166711 markings/sec, 310 secs
lola: 90475406 markings, 193952160 edges, 183577 markings/sec, 315 secs
lola: 91282800 markings, 195718542 edges, 161479 markings/sec, 320 secs
lola: 92038496 markings, 197383757 edges, 151139 markings/sec, 325 secs
lola: 92896871 markings, 199245301 edges, 171675 markings/sec, 330 secs
lola: 93337785 markings, 200263980 edges, 88183 markings/sec, 335 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G ((G (((1 <= p24) AND (1 <= p31))) AND ((1 <= p24) AND (1 <= p31)))) OR F ((F (((1 <= p8) AND (1 <= p33))) AND ((1 <= p7) AND (1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((G (((1 <= p24) AND (1 <= p31))) AND ((1 <= p24) AND (1 <= p31))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((1 <= p24) AND (1 <= p31))) AND ((1 <= p24) AND (1 <= p31))))
lola: processed formula length: 69
lola: 64 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p8) AND (1 <= p33))) AND ((1 <= p7) AND (1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p8) AND (1 <= p33))) AND ((1 <= p7) AND (1 <= p11))))
lola: processed formula length: 67
lola: 64 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: 3 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes no no unknown no
lola:
preliminary result: no no no no no no no no yes no no unknown no
lola: memory consumption: 3552 KB
lola: time consumption: 691 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="Angiogenesis-PT-15"
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 Angiogenesis-PT-15, 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 r166-smll-158987787600338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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