Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987883000898.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 ERK-PT-000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987883000898
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.8K Mar 31 14:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 14:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 31 14:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 31 14:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 31 14:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 14:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 31 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 31 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 31 14:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 31 14:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 ERK-PT-000100-00
FORMULA_NAME ERK-PT-000100-01
FORMULA_NAME ERK-PT-000100-02
FORMULA_NAME ERK-PT-000100-03
FORMULA_NAME ERK-PT-000100-04
FORMULA_NAME ERK-PT-000100-05
FORMULA_NAME ERK-PT-000100-06
FORMULA_NAME ERK-PT-000100-07
FORMULA_NAME ERK-PT-000100-08
FORMULA_NAME ERK-PT-000100-09
FORMULA_NAME ERK-PT-000100-10
FORMULA_NAME ERK-PT-000100-11
FORMULA_NAME ERK-PT-000100-12
FORMULA_NAME ERK-PT-000100-13
FORMULA_NAME ERK-PT-000100-14
FORMULA_NAME ERK-PT-000100-15

=== Now, execution of the tool begins

BK_START 1591250675384

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 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-04 06:04:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 06:04:37] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2020-06-04 06:04:37] [INFO ] Transformed 11 places.
[2020-06-04 06:04:37] [INFO ] Transformed 11 transitions.
[2020-06-04 06:04:37] [INFO ] Parsed PT model containing 11 places and 11 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 1218 steps, including 0 resets, run visited all 18 properties in 4 ms. (steps per millisecond=304 )
[2020-06-04 06:04:37] [INFO ] Flatten gal took : 20 ms
[2020-06-04 06:04:37] [INFO ] Flatten gal took : 6 ms
[2020-06-04 06:04:37] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2020-06-04 06:04:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ERK-PT-000100 @ 3570 seconds

FORMULA ERK-PT-000100-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-000100-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-000100-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-000100-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-000100-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-000100-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-000100-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-000100-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-000100-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-000100-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-000100-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ERK-PT-000100-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-000100-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-000100-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-000100-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2792
rslt: Output for LTLFireability @ ERK-PT-000100

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(G ((p5 <= 0)) R X (((p0 <= 0) OR (p1 <= 0))))",
"processed_size": 47,
"rewrites": 132
},
"result":
{
"edges": 205,
"markings": 205,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 5,
"G": 7,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((F (G ((1 <= p5))) OR ((G ((1 <= p5)) AND F (G ((1 <= p5)))) OR (G ((1 <= p5)) AND F ((F (G ((1 <= p5))) OR (G ((1 <= p5)) AND F (G ((1 <= p5))))))))))",
"processed_size": 154,
"rewrites": 132
},
"result":
{
"edges": 205,
"markings": 205,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 49
},
"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": 254
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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 (((p9 <= 0) OR (p10 <= 0)))",
"processed_size": 30,
"rewrites": 132
},
"result":
{
"edges": 1003,
"markings": 903,
"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": 274
},
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((F ((1 <= p2)) AND G ((1 <= p5))))",
"processed_size": 37,
"rewrites": 132
},
"result":
{
"edges": 205,
"markings": 205,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 274
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((F (G ((1 <= p4))) AND ((1 <= p7) AND (1 <= p8)))))",
"processed_size": 57,
"rewrites": 132
},
"result":
{
"edges": 207,
"markings": 206,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 4,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (F ((X (X (F ((p4 <= 0)))) AND G (F (((1 <= p7) AND (1 <= p8))))))))",
"processed_size": 73,
"rewrites": 132
},
"result":
{
"edges": 613,
"markings": 417,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X (X ((F (((1 <= p9) AND (1 <= p10))) OR G (((1 <= p9) AND (1 <= p10)))))) U (1 <= p5))",
"processed_size": 88,
"rewrites": 132
},
"result":
{
"edges": 204,
"markings": 204,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (X (F (((1 <= p5) AND (1 <= p9) AND (1 <= p10))))))",
"processed_size": 56,
"rewrites": 132
},
"result":
{
"edges": 205,
"markings": 205,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((G ((1 <= p6)) OR F (((1 <= p5) OR (G ((1 <= p5)) AND F ((1 <= p5)))))))",
"processed_size": 75,
"rewrites": 132
},
"result":
{
"edges": 205,
"markings": 205,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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 ((X (F ((p4 <= 0))) OR (G (F ((1 <= p5))) AND X (F ((p4 <= 0)))))))",
"processed_size": 72,
"rewrites": 132
},
"result":
{
"edges": 238,
"markings": 231,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 4,
"aconj": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "F ((X (X (((1 <= p4) AND (1 <= p9) AND (1 <= p10)))) OR (X (X (F (((1 <= p4) AND (1 <= p9) AND (1 <= p10))))) AND F (G ((p4 <= 0))))))",
"processed_size": 134,
"rewrites": 132
},
"result":
{
"edges": 210,
"markings": 207,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 795
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((X (G ((p4 <= 0))) OR ((p9 <= 0) OR (p10 <= 0)))))",
"processed_size": 56,
"rewrites": 132
},
"result":
{
"edges": 227,
"markings": 221,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1060
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p5)))",
"processed_size": 17,
"rewrites": 132
},
"result":
{
"edges": 309,
"markings": 308,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"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": 1590
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((G (((p7 <= 0) OR (p8 <= 0))) OR ((p5 <= 0) AND ((p7 <= 0) OR (p8 <= 0))))))",
"processed_size": 84,
"rewrites": 132
},
"result":
{
"edges": 305,
"markings": 305,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 14,
"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": 3180
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((((p2 <= 0) OR (p3 <= 0)) AND (F (((p6 <= 0) OR G ((1 <= p5)))) OR G (((p2 <= 0) OR (p3 <= 0))))))",
"processed_size": 103,
"rewrites": 132
},
"result":
{
"edges": 307,
"markings": 307,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3292,
"runtime": 778.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(*) R X(*)) : X((F(G(**)) OR ((G(**) AND F(G(**))) OR (G(**) AND F((F(G(**)) OR (G(**) AND F(G(**))))))))) : (G(**) OR X((F(**) AND G(**)))) : X(G((F(G(**)) AND (** AND **)))) : X(X(F((X(X(F(*))) AND G(F(**)))))) : (X(X((F(**) OR G(**)))) U **) : X(X(X(F(**)))) : X((G(**) OR F((** OR (G(**) AND F(**)))))) : F(G((X(F(*)) OR (G(F(**)) AND X(F(*)))))) : F((X(X(**)) OR (X(X(F(**))) AND F(G(*))))) : F(G(**)) : X((X((G(**) OR **)) AND (** AND (** AND (X(**) OR **))))) : X((X(G(**)) U **)) : G((* AND (F((** OR G(**))) OR G(*)))) : G(F((G(*) OR (* AND *)))) : G(F((X(G(*)) OR (* OR *))))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 7,
"places": 11,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no no no no no no no no no no no unknown yes no no no ",
"value": "no no no no no no no no no no no unknown 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: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 11 places, 11 transitions, 6 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: NOT((F ((1 <= p5)) U X (((1 <= p0) AND (1 <= p1))))) : X ((G ((1 <= p5)) U (G ((1 <= p5)) U F (X (G (X (G ((1 <= p5))))))))) : (G (((p9 <= 0) OR (p10 <= 0))) OR X ((F ((1 <= p2)) AND G ((1 <= p5))))) : X (G (((F (X ((X (X ((1 <= p4))) U G ((1 <= p4))))) AND (1 <= p7)) AND (1 <= p8)))) : F (X (X ((NOT(X (G (X ((1 <= p4))))) AND NOT(F (NOT(G (F (((1 <= p7) AND (1 <= p8))))))))))) : (NOT(X ((X (NOT(F (((1 <= p9) AND (1 <= p10))))) AND F (NOT(X (((1 <= p9) AND (1 <= p10)))))))) U (1 <= p5)) : X (X (F (X (((1 <= p5) AND (1 <= p9) AND (1 <= p10)))))) : (NOT(F (NOT(X ((1 <= p6))))) OR F (X ((((1 <= p5) U G ((1 <= p5))) U (1 <= p5))))) : F (G ((G (F ((1 <= p5))) U F (NOT(X ((1 <= p4))))))) : F ((F (NOT(F (X ((1 <= p4))))) U X (X (((1 <= p4) AND (1 <= p9) AND (1 <= p10)))))) : G (F (((1 <= p5) U ((1 <= p5) U G (X ((1 <= p5))))))) : X ((((X ((G (((1 <= p0) AND (1 <= p1))) OR (1 <= p4))) AND (1 <= p0)) AND (1 <= p1)) AND (X (((1 <= p0) AND (1 <= p1))) OR (1 <= p4)))) : X ((G (X ((1 <= p5))) U ((1 <= p0) AND (1 <= p1)))) : NOT(F (((NOT(F ((p6 <= 0))) AND NOT(F (G (F (G ((1 <= p5))))))) U ((1 <= p2) AND (1 <= p3))))) : F (G (NOT(((1 <= p6) U F ((F ((1 <= p6)) U G (((1 <= p5) U ((1 <= p7) AND (1 <= p8)))))))))) : G (X (NOT(G (X (((F (X ((1 <= p4))) AND (1 <= p9)) AND (1 <= p10)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:300
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: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:485
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k: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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p5 <= 0)) R X (((p0 <= 0) OR (p1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (G ((p5 <= 0)) R X (((p0 <= 0) OR (p1 <= 0))))
lola: processed formula length: 47
lola: 132 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: 205 markings, 205 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((1 <= p5))) OR ((G ((1 <= p5)) AND F (G ((1 <= p5)))) OR (G ((1 <= p5)) AND F ((F (G ((1 <= p5))) OR (G ((1 <= p5)) AND F (G ((1 <= p5))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((1 <= p5))) OR ((G ((1 <= p5)) AND F (G ((1 <= p5)))) OR (G ((1 <= p5)) AND F ((F (G ((1 <= p5))) OR (G ((1 <= p5)) AND F (G ((1 <= p5))))))))))
lola: processed formula length: 154
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 49 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: 205 markings, 205 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p9 <= 0) OR (p10 <= 0))) OR X ((F ((1 <= p2)) AND G ((1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p9 <= 0) OR (p10 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p9 <= 0) OR (p10 <= 0)))
lola: processed formula length: 30
lola: 132 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: 903 markings, 1003 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((1 <= p2)) AND G ((1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((1 <= p2)) AND G ((1 <= p5))))
lola: processed formula length: 37
lola: 132 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: 205 markings, 205 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (G ((1 <= p4))) AND ((1 <= p7) AND (1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (G ((1 <= p4))) AND ((1 <= p7) AND (1 <= p8)))))
lola: processed formula length: 57
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 206 markings, 207 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X (X (F ((p4 <= 0)))) AND G (F (((1 <= p7) AND (1 <= p8))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X (X (F ((p4 <= 0)))) AND G (F (((1 <= p7) AND (1 <= p8))))))))
lola: processed formula length: 73
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 417 markings, 613 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((F (((1 <= p9) AND (1 <= p10))) OR G (((1 <= p9) AND (1 <= p10)))))) U (1 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X ((F (((1 <= p9) AND (1 <= p10))) OR G (((1 <= p9) AND (1 <= p10)))))) U (1 <= p5))
lola: processed formula length: 88
lola: 132 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: 204 markings, 204 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F (((1 <= p5) AND (1 <= p9) AND (1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F (((1 <= p5) AND (1 <= p9) AND (1 <= p10))))))
lola: processed formula length: 56
lola: 132 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: 205 markings, 205 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((1 <= p6)) OR F (((1 <= p5) OR (G ((1 <= p5)) AND F ((1 <= p5)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((1 <= p6)) OR F (((1 <= p5) OR (G ((1 <= p5)) AND F ((1 <= p5)))))))
lola: processed formula length: 75
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 205 markings, 205 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F ((p4 <= 0))) OR (G (F ((1 <= p5))) AND X (F ((p4 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F ((p4 <= 0))) OR (G (F ((1 <= p5))) AND X (F ((p4 <= 0)))))))
lola: processed formula length: 72
lola: 132 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: 231 markings, 238 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (((1 <= p4) AND (1 <= p9) AND (1 <= p10)))) OR (X (X (F (((1 <= p4) AND (1 <= p9) AND (1 <= p10))))) AND F (G ((p4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (((1 <= p4) AND (1 <= p9) AND (1 <= p10)))) OR (X (X (F (((1 <= p4) AND (1 <= p9) AND (1 <= p10))))) AND F (G ((p4 <= 0))))))
lola: processed formula length: 134
lola: 132 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: 207 markings, 210 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((G (((1 <= p0) AND (1 <= p1))) OR (1 <= p4))) AND ((1 <= p0) AND ((1 <= p1) AND (X (((1 <= p0) AND (1 <= p1))) OR (1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((G (((1 <= p0) AND (1 <= p1))) OR (1 <= p4))) AND ((1 <= p0) AND ((1 <= p1) AND (X (((1 <= p0) AND (1 <= p1))) OR (1 <= p4))))))
lola: processed formula length: 135
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2598107 markings, 10862385 edges, 519621 markings/sec, 0 secs
lola: 4867431 markings, 20755854 edges, 453865 markings/sec, 5 secs
lola: 6983774 markings, 29981684 edges, 423269 markings/sec, 10 secs
lola: 9069490 markings, 39194735 edges, 417143 markings/sec, 15 secs
lola: 11131445 markings, 48270318 edges, 412391 markings/sec, 20 secs
lola: 13147836 markings, 57229214 edges, 403278 markings/sec, 25 secs
lola: 15102875 markings, 65940280 edges, 391008 markings/sec, 30 secs
lola: 17017004 markings, 74414211 edges, 382826 markings/sec, 35 secs
lola: 18666000 markings, 81784967 edges, 329799 markings/sec, 40 secs
lola: 20108248 markings, 88231658 edges, 288450 markings/sec, 45 secs
lola: 21470919 markings, 94323176 edges, 272534 markings/sec, 50 secs
lola: 22793530 markings, 100267830 edges, 264522 markings/sec, 55 secs
lola: 24472782 markings, 107729870 edges, 335850 markings/sec, 60 secs
lola: 26248867 markings, 115708907 edges, 355217 markings/sec, 65 secs
lola: 28023213 markings, 123616121 edges, 354869 markings/sec, 70 secs
lola: 29699538 markings, 131159881 edges, 335265 markings/sec, 75 secs
lola: 31045323 markings, 137220833 edges, 269157 markings/sec, 80 secs
lola: 32494965 markings, 143745196 edges, 289928 markings/sec, 85 secs
lola: 33916881 markings, 150170503 edges, 284383 markings/sec, 90 secs
lola: 35313096 markings, 156457032 edges, 279243 markings/sec, 95 secs
lola: 36730809 markings, 162841349 edges, 283543 markings/sec, 100 secs
lola: 38150359 markings, 169260877 edges, 283910 markings/sec, 105 secs
lola: 39609793 markings, 175847884 edges, 291887 markings/sec, 110 secs
lola: 41073005 markings, 182498160 edges, 292642 markings/sec, 115 secs
lola: 42567666 markings, 189252200 edges, 298932 markings/sec, 120 secs
lola: 44125288 markings, 196297628 edges, 311524 markings/sec, 125 secs
lola: 45759681 markings, 203698972 edges, 326879 markings/sec, 130 secs
lola: 47356492 markings, 210905583 edges, 319362 markings/sec, 135 secs
lola: 48930553 markings, 218045047 edges, 314812 markings/sec, 140 secs
lola: 50586120 markings, 225532972 edges, 331113 markings/sec, 145 secs
lola: 52176980 markings, 232719218 edges, 318172 markings/sec, 150 secs
lola: 53470209 markings, 238609920 edges, 258646 markings/sec, 155 secs
lola: 54852471 markings, 244839911 edges, 276452 markings/sec, 160 secs
lola: 56214661 markings, 251034752 edges, 272438 markings/sec, 165 secs
lola: 57681017 markings, 257681911 edges, 293271 markings/sec, 170 secs
lola: 59135428 markings, 264316846 edges, 290882 markings/sec, 175 secs
lola: 60537949 markings, 270697286 edges, 280504 markings/sec, 180 secs
lola: 61904215 markings, 276893362 edges, 273253 markings/sec, 185 secs
lola: 63254692 markings, 283013453 edges, 270095 markings/sec, 190 secs
lola: 64669763 markings, 289440031 edges, 283014 markings/sec, 195 secs
lola: 66025874 markings, 295611159 edges, 271222 markings/sec, 200 secs
lola: 67446758 markings, 302061172 edges, 284177 markings/sec, 205 secs
lola: 68862820 markings, 308510402 edges, 283212 markings/sec, 210 secs
lola: 70264268 markings, 314883255 edges, 280290 markings/sec, 215 secs
lola: 71679825 markings, 321324995 edges, 283111 markings/sec, 220 secs
lola: 73103095 markings, 327792617 edges, 284654 markings/sec, 225 secs
lola: 74555197 markings, 334393703 edges, 290420 markings/sec, 230 secs
lola: 75983181 markings, 340922109 edges, 285597 markings/sec, 235 secs
lola: 77425819 markings, 347482448 edges, 288528 markings/sec, 240 secs
lola: 78890232 markings, 354153214 edges, 292883 markings/sec, 245 secs
lola: 80359883 markings, 360848657 edges, 293930 markings/sec, 250 secs
lola: 81418480 markings, 365677065 edges, 211719 markings/sec, 255 secs
lola: 82587110 markings, 370996446 edges, 233726 markings/sec, 260 secs
lola: 83357860 markings, 374495998 edges, 154150 markings/sec, 265 secs
lola: 84616409 markings, 380245405 edges, 251710 markings/sec, 270 secs
lola: 85470774 markings, 384128715 edges, 170873 markings/sec, 275 secs
lola: 86313376 markings, 387966019 edges, 168520 markings/sec, 280 secs
lola: 87068261 markings, 391411736 edges, 150977 markings/sec, 285 secs
lola: 88114524 markings, 396196708 edges, 209253 markings/sec, 290 secs
lola: 88686413 markings, 398795823 edges, 114378 markings/sec, 295 secs
lola: 89714265 markings, 403465925 edges, 205570 markings/sec, 300 secs
lola: 90604934 markings, 407545331 edges, 178134 markings/sec, 305 secs
lola: 91673787 markings, 412428965 edges, 213771 markings/sec, 310 secs
lola: 92489916 markings, 416146721 edges, 163226 markings/sec, 315 secs
lola: 93125859 markings, 419047582 edges, 127189 markings/sec, 320 secs
lola: 94109958 markings, 423545652 edges, 196820 markings/sec, 325 secs
lola: 95155360 markings, 428343962 edges, 209080 markings/sec, 330 secs
lola: 96273412 markings, 433452402 edges, 223610 markings/sec, 335 secs
lola: 97397883 markings, 438596005 edges, 224894 markings/sec, 340 secs
lola: 98367365 markings, 443035901 edges, 193896 markings/sec, 345 secs
lola: 99051676 markings, 446112656 edges, 136862 markings/sec, 350 secs
lola: 100216422 markings, 451451740 edges, 232949 markings/sec, 355 secs
lola: 100656724 markings, 453462062 edges, 88060 markings/sec, 360 secs
lola: 101696272 markings, 458213046 edges, 207910 markings/sec, 365 secs
lola: 101773561 markings, 458553407 edges, 15458 markings/sec, 370 secs
lola: 102112775 markings, 460123655 edges, 67843 markings/sec, 375 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 636 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((1 <= p5))) U ((1 <= p0) AND (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((1 <= p5))) U ((1 <= p0) AND (1 <= p1))))
lola: processed formula length: 51
lola: 132 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 12 will run for 795 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (G ((p4 <= 0))) OR ((p9 <= 0) OR (p10 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (G ((p4 <= 0))) OR ((p9 <= 0) OR (p10 <= 0)))))
lola: processed formula length: 56
lola: 132 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: 221 markings, 227 edges
lola: ========================================
lola: subprocess 13 will run for 1060 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p5)))
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 <= p5)))
lola: processed formula length: 17
lola: 132 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: 308 markings, 309 edges
lola: ========================================
lola: subprocess 14 will run for 1590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p7 <= 0) OR (p8 <= 0))) OR ((p5 <= 0) AND ((p7 <= 0) OR (p8 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p7 <= 0) OR (p8 <= 0))) OR ((p5 <= 0) AND ((p7 <= 0) OR (p8 <= 0))))))
lola: processed formula length: 84
lola: 132 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: 305 markings, 305 edges
lola: ========================================
lola: subprocess 15 will run for 3180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p2 <= 0) OR (p3 <= 0)) AND (F (((p6 <= 0) OR G ((1 <= p5)))) OR G (((p2 <= 0) OR (p3 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p2 <= 0) OR (p3 <= 0)) AND (F (((p6 <= 0) OR G ((1 <= p5)))) OR G (((p2 <= 0) OR (p3 <= 0))))))
lola: processed formula length: 103
lola: 132 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: 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: 307 markings, 307 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((X ((G (((1 <= p0) AND (1 <= p1))) OR (1 <= p4))) AND ((1 <= p0) AND ((1 <= p1) AND (X (((1 <= p0) AND (1 <= p1))) OR (1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((G (((1 <= p0) AND (1 <= p1))) OR (1 <= p4))) AND ((1 <= p0) AND ((1 <= p1) AND (X (((1 <= p0) AND (1 <= p1))) OR (1 <= p4))))))
lola: processed formula length: 135
lola: 132 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2163338 markings, 8981540 edges, 432668 markings/sec, 0 secs
lola: 3900128 markings, 16523062 edges, 347358 markings/sec, 5 secs
lola: 5489723 markings, 23477378 edges, 317919 markings/sec, 10 secs
lola: 7100919 markings, 30500909 edges, 322239 markings/sec, 15 secs
lola: 8714761 markings, 37624414 edges, 322768 markings/sec, 20 secs
lola: 10263819 markings, 44470421 edges, 309812 markings/sec, 25 secs
lola: 11876566 markings, 51578998 edges, 322549 markings/sec, 30 secs
lola: 13441523 markings, 58544506 edges, 312991 markings/sec, 35 secs
lola: 14956724 markings, 65291348 edges, 303040 markings/sec, 40 secs
lola: 16514524 markings, 72170302 edges, 311560 markings/sec, 45 secs
lola: 18030768 markings, 78937796 edges, 303249 markings/sec, 50 secs
lola: 19542166 markings, 85719927 edges, 302280 markings/sec, 55 secs
lola: 21050322 markings, 92450287 edges, 301631 markings/sec, 60 secs
lola: 22475942 markings, 98836412 edges, 285124 markings/sec, 65 secs
lola: 23926218 markings, 105276470 edges, 290055 markings/sec, 70 secs
lola: 25382673 markings, 111818893 edges, 291291 markings/sec, 75 secs
lola: 27007562 markings, 119115526 edges, 324978 markings/sec, 80 secs
lola: 28657696 markings, 126467813 edges, 330027 markings/sec, 85 secs
lola: 30208434 markings, 133453053 edges, 310148 markings/sec, 90 secs
lola: 31582897 markings, 139644992 edges, 274893 markings/sec, 95 secs
lola: 33080668 markings, 146388952 edges, 299554 markings/sec, 100 secs
lola: 34565458 markings, 153090811 edges, 296958 markings/sec, 105 secs
lola: 36018833 markings, 159639558 edges, 290675 markings/sec, 110 secs
lola: 37413903 markings, 165953663 edges, 279014 markings/sec, 115 secs
lola: 38879665 markings, 172555472 edges, 293152 markings/sec, 120 secs
lola: 40344935 markings, 179182947 edges, 293054 markings/sec, 125 secs
lola: 41816286 markings, 185842359 edges, 294270 markings/sec, 130 secs
lola: 43278531 markings, 192469078 edges, 292449 markings/sec, 135 secs
lola: 44726018 markings, 199023285 edges, 289497 markings/sec, 140 secs
lola: 46178305 markings, 205581169 edges, 290457 markings/sec, 145 secs
lola: 47641875 markings, 212204559 edges, 292714 markings/sec, 150 secs
lola: 48971005 markings, 218224976 edges, 265826 markings/sec, 155 secs
lola: 50470123 markings, 225005893 edges, 299824 markings/sec, 160 secs
lola: 51995556 markings, 231906603 edges, 305087 markings/sec, 165 secs
lola: 53510733 markings, 238794843 edges, 303035 markings/sec, 170 secs
lola: 55062173 markings, 245783707 edges, 310288 markings/sec, 175 secs
lola: 56541789 markings, 252509528 edges, 295923 markings/sec, 180 secs
lola: 58020609 markings, 259229366 edges, 295764 markings/sec, 185 secs
lola: 59411449 markings, 265570494 edges, 278168 markings/sec, 190 secs
lola: 60816413 markings, 271948895 edges, 280993 markings/sec, 195 secs
lola: 62212071 markings, 278287284 edges, 279132 markings/sec, 200 secs
lola: 63646466 markings, 284792976 edges, 286879 markings/sec, 205 secs
lola: 65137723 markings, 291571777 edges, 298251 markings/sec, 210 secs
lola: 66612419 markings, 298273956 edges, 294939 markings/sec, 215 secs
lola: 67988218 markings, 304532942 edges, 275160 markings/sec, 220 secs
lola: 69380157 markings, 310870273 edges, 278388 markings/sec, 225 secs
lola: 70742474 markings, 317047929 edges, 272463 markings/sec, 230 secs
lola: 72117033 markings, 323322804 edges, 274912 markings/sec, 235 secs
lola: 73511663 markings, 329634488 edges, 278926 markings/sec, 240 secs
lola: 74878440 markings, 335879280 edges, 273355 markings/sec, 245 secs
lola: 76133037 markings, 341604402 edges, 250919 markings/sec, 250 secs
lola: 77486661 markings, 347761396 edges, 270725 markings/sec, 255 secs
lola: 78829216 markings, 353871252 edges, 268511 markings/sec, 260 secs
lola: 80150010 markings, 359893780 edges, 264159 markings/sec, 265 secs
lola: 81458404 markings, 365855612 edges, 261679 markings/sec, 270 secs
lola: 82515191 markings, 370671506 edges, 211357 markings/sec, 275 secs
lola: 83371305 markings, 374559594 edges, 171223 markings/sec, 280 secs
lola: 84130889 markings, 378023574 edges, 151917 markings/sec, 285 secs
lola: 84781655 markings, 380984879 edges, 130153 markings/sec, 290 secs
lola: 85720732 markings, 385271043 edges, 187815 markings/sec, 295 secs
lola: 86594827 markings, 389236316 edges, 174819 markings/sec, 300 secs
lola: 87506554 markings, 393422850 edges, 182345 markings/sec, 305 secs
lola: 88641351 markings, 398587679 edges, 226959 markings/sec, 310 secs
lola: 89804774 markings, 403884601 edges, 232685 markings/sec, 315 secs
lola: 90896250 markings, 408887820 edges, 218295 markings/sec, 320 secs
lola: 91875457 markings, 413349671 edges, 195841 markings/sec, 325 secs
lola: 92606642 markings, 416670431 edges, 146237 markings/sec, 330 secs
lola: 93628370 markings, 421348347 edges, 204346 markings/sec, 335 secs
lola: 94572530 markings, 425657807 edges, 188832 markings/sec, 340 secs
lola: 95649771 markings, 430594191 edges, 215448 markings/sec, 345 secs
lola: 96856899 markings, 436129886 edges, 241426 markings/sec, 350 secs
lola: 97833051 markings, 440586208 edges, 195230 markings/sec, 355 secs
lola: 98859311 markings, 445236627 edges, 205252 markings/sec, 360 secs
lola: 100041270 markings, 450650847 edges, 236392 markings/sec, 365 secs
lola: 101139103 markings, 455670452 edges, 219567 markings/sec, 370 secs
lola: 101962625 markings, 459426095 edges, 164704 markings/sec, 375 secs
lola: 102196280 markings, 460492427 edges, 46731 markings/sec, 380 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no unknown yes no no no
lola:
preliminary result: no no no no no no no no no no no unknown yes no no no
lola: memory consumption: 3292 KB
lola: time consumption: 778 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="ERK-PT-000100"
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 ERK-PT-000100, 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 r178-tajo-158987883000898"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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