fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r094-tall-162048902300098
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for Diffusion2D-PT-D40N150

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4399.207 3600000.00 1139904.00 2100.00 FFFFTFFFFTTFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r094-tall-162048902300098.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is Diffusion2D-PT-D40N150, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902300098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 4.7M May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620731052989

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 11:04:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-11 11:04:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 11:04:14] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2021-05-11 11:04:14] [INFO ] Transformed 1600 places.
[2021-05-11 11:04:14] [INFO ] Transformed 12324 transitions.
[2021-05-11 11:04:14] [INFO ] Parsed PT model containing 1600 places and 12324 transitions in 382 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 114 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100115 steps, including 0 resets, run finished after 90 ms. (steps per millisecond=1112 ) properties seen :[1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 12324 rows 1600 cols
[2021-05-11 11:04:15] [INFO ] Computed 1 place invariants in 133 ms
[2021-05-11 11:04:15] [INFO ] [Real]Absence check using 1 positive place invariants in 31 ms returned sat
[2021-05-11 11:04:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:04:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:04:35] [INFO ] [Real]Absence check using state equation in 19725 ms returned (error "Failed to check-sat")
[2021-05-11 11:04:35] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:04:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:04:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:04:55] [INFO ] [Real]Absence check using state equation in 19847 ms returned unknown
[2021-05-11 11:04:55] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:04:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:05:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:05:15] [INFO ] [Real]Absence check using state equation in 19871 ms returned (error "Failed to check-sat")
[2021-05-11 11:05:15] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:05:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:05:35] [INFO ] [Real]Absence check using state equation in 19860 ms returned (error "Failed to check-sat")
[2021-05-11 11:05:35] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:05:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:05:55] [INFO ] [Real]Absence check using state equation in 19863 ms returned (error "Failed to check-sat")
[2021-05-11 11:05:55] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:05:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:06:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:06:15] [INFO ] [Real]Absence check using state equation in 19861 ms returned unknown
[2021-05-11 11:06:15] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:06:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:06:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:06:35] [INFO ] [Real]Absence check using state equation in 19857 ms returned (error "Failed to check-sat")
[2021-05-11 11:06:35] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 11:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:06:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:06:55] [INFO ] [Real]Absence check using state equation in 19858 ms returned unknown
[2021-05-11 11:06:55] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 11:06:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:07:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:07:15] [INFO ] [Real]Absence check using state equation in 19859 ms returned unknown
[2021-05-11 11:07:15] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:07:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:07:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:07:35] [INFO ] [Real]Absence check using state equation in 19861 ms returned unknown
[2021-05-11 11:07:35] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:07:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:07:55] [INFO ] [Real]Absence check using state equation in 19862 ms returned (error "Failed to check-sat")
[2021-05-11 11:07:55] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 11:07:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:08:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:08:15] [INFO ] [Real]Absence check using state equation in 19860 ms returned (error "Failed to check-sat")
[2021-05-11 11:08:15] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:08:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:08:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:08:35] [INFO ] [Real]Absence check using state equation in 19862 ms returned (error "Failed to check-sat")
[2021-05-11 11:08:35] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:08:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:08:55] [INFO ] [Real]Absence check using state equation in 19858 ms returned (error "Failed to check-sat")
[2021-05-11 11:08:55] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2021-05-11 11:08:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:09:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:09:15] [INFO ] [Real]Absence check using state equation in 19854 ms returned unknown
[2021-05-11 11:09:15] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:09:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:09:35] [INFO ] [Real]Absence check using state equation in 19861 ms returned unknown
[2021-05-11 11:09:35] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2021-05-11 11:09:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 11:09:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 11:09:55] [INFO ] [Real]Absence check using state equation in 19856 ms returned unknown
[2021-05-11 11:09:56] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-11 11:09:56] [INFO ] Flatten gal took : 445 ms
FORMULA Diffusion2D-PT-D40N150-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N150-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D40N150-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 11:09:56] [INFO ] Flatten gal took : 284 ms
[2021-05-11 11:09:56] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-11 11:09:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 43 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Diffusion2D-PT-D40N150 @ 3570 seconds

FORMULA Diffusion2D-PT-D40N150-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D40N150-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D40N150-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D40N150-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D40N150-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D40N150-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D40N150-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D40N150-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Diffusion2D-PT-D40N150-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D40N150-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D40N150-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D40N150-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2787
rslt: Output for LTLFireability @ Diffusion2D-PT-D40N150

{
"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": "Tue May 11 11:09:57 2021
",
"timelimit": 3570
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 292
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"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": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((G ((1 <= p2)) OR (G (F ((1 <= p1251))) AND F (G ((1 <= p2))))))",
"processed_size": 67,
"rewrites": 115
},
"result":
{
"edges": 2256,
"markings": 2256,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 319
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p262) U X ((((p291 <= 0) R (p262 <= 0)) AND (F ((1 <= p500)) AND (p262 <= 0)))))",
"processed_size": 87,
"rewrites": 115
},
"result":
{
"edges": 2258,
"markings": 2258,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 351
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G ((G ((p1515 <= 0)) OR (p391 <= 0))) OR ((p1454 <= 0) AND (F ((p1515 <= 0)) OR G ((p1454 <= 0))))))",
"processed_size": 104,
"rewrites": 115
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 11
},
"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": 390
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 390
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"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 ((p586 <= 0)) OR ((p813 <= 0) AND (p586 <= 0))))",
"processed_size": 54,
"rewrites": 115
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 438
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 2,
"visible_transitions": 0
},
"processed": "((1 <= p1349) U X (G ((F ((1 <= p1349)) AND G ((1 <= p813))))))",
"processed_size": 63,
"rewrites": 115
},
"result":
{
"edges": 2256,
"markings": 2256,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 438
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X ((G ((1 <= p680)) OR X ((1 <= p79))))",
"processed_size": 39,
"rewrites": 115
},
"result":
{
"edges": 2256,
"markings": 2256,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 501
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p382) U X (F ((1 <= p699))))",
"processed_size": 35,
"rewrites": 115
},
"result":
{
"edges": 2256,
"markings": 2256,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 585
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "X (X (((p666 <= 0) R X ((p519 <= 0)))))",
"processed_size": 39,
"rewrites": 115
},
"result":
{
"edges": 1328,
"markings": 403,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 702
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 5,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((G ((G ((1 <= p63)) OR (G (F ((1 <= p611))) AND F (G ((1 <= p63)))))) AND (X ((1 <= p63)) OR (p63 <= 0)))))",
"processed_size": 113,
"rewrites": 115
},
"result":
{
"edges": 2256,
"markings": 2256,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 877
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p1321 <= 0)",
"processed_size": 12,
"rewrites": 117
},
"result":
{
"edges": 4651,
"markings": 4651,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1170
},
"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 <= p664)))",
"processed_size": 19,
"rewrites": 115
},
"result":
{
"edges": 4653,
"markings": 4652,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1755
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p1540 <= 0)))",
"processed_size": 20,
"rewrites": 115
},
"result":
{
"edges": 3335820,
"markings": 682593,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 3448
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((p1103 <= 0) AND (F ((G (((1 <= p1434) OR (1 <= p247))) AND F ((p453 <= 0)))) OR G ((p1103 <= 0)))))",
"processed_size": 105,
"rewrites": 115
},
"result":
{
"edges": 39941955,
"markings": 7320656,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 141552,
"runtime": 783.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(G(**)) OR (X(*) U **)) : X((G(**) OR (G(F(**)) AND F(G(**))))) : (** U X(((* R *) AND (F(**) AND **)))) : X((G((G(*) OR *)) OR (* AND (F(*) OR G(*))))) : ((** U X(G((F(**) AND G(**))))) AND F((G(*) OR (* AND *)))) : X((G(**) OR X(**))) : F(G(*)) : G((* AND (F((G(**) AND F(*))) OR G(*)))) : (** U X(F(**))) : F(**) : X(X((* R X(*)))) : F(G(**)) : X(G((G((G(**) OR (G(F(**)) AND F(G(**))))) AND (X(**) OR **))))"
},
"net":
{
"arcs": 24648,
"conflict_clusters": 1600,
"places": 1600,
"places_significant": 1599,
"singleton_clusters": 0,
"transitions": 12324
},
"result":
{
"preliminary_value": "no no no yes no no no no no no yes no no ",
"value": "no no no yes no no no no no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 13924/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 51200
lola: finding significant places
lola: 1600 places, 12324 transitions, 1599 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: (X (G ((1 <= p248))) OR (NOT(X ((1 <= p395))) U (1 <= p248))) : X ((G (F (X ((1 <= p1251)))) U G ((1 <= p2)))) : ((1 <= p262) U X (((NOT(((1 <= p291) U (1 <= p262))) AND F ((1 <= p500))) AND (p262 <= 0)))) : (NOT(F (X ((F ((1 <= p1515)) AND (1 <= p391))))) OR NOT(X ((G ((1 <= p1515)) U (1 <= p1454))))) : (((1 <= p1349) U G (X ((F ((1 <= p1349)) AND G ((1 <= p813)))))) AND NOT(G (((1 <= p813) U (1 <= p586))))) : (G (X ((1 <= p680))) OR X (X ((1 <= p79)))) : F (G (NOT(X (X (X (F (X ((NOT((F ((1 <= p728)) U (1 <= p728))) U (1 <= p1540)))))))))) : G (NOT(F ((G ((NOT(G (((1 <= p1434) OR (1 <= p247)))) OR G ((1 <= p453)))) U (1 <= p1103))))) : ((1 <= p382) U F (NOT(X (NOT(((p382 <= 0) U (1 <= p699))))))) : F (((1 <= p1374) U (1 <= p1321))) : X (NOT(X (((1 <= p666) U X ((1 <= p519)))))) : G (X (F (NOT(X (G (NOT((NOT(X ((1 <= p389))) U G ((1 <= p664)))))))))) : X (G ((G ((G (F ((1 <= p611))) U G ((1 <= p63)))) AND (X ((1 <= p63)) OR (p63 <= 0)))))
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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: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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p248))) OR (X ((p395 <= 0)) U (1 <= p248)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p248)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p248)))
lola: processed formula length: 19
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2256 markings, 2256 edges
lola: ========================================
lola: subprocess 1 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p395 <= 0)) U (1 <= p248))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((p395 <= 0)) U (1 <= p248))
lola: processed formula length: 31
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4511 markings, 4512 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((1 <= p2)) OR (G (F ((1 <= p1251))) AND F (G ((1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((1 <= p2)) OR (G (F ((1 <= p1251))) AND F (G ((1 <= p2))))))
lola: processed formula length: 67
lola: 115 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: 2256 markings, 2256 edges
lola: ========================================
lola: subprocess 2 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p262) U X ((((p291 <= 0) R (p262 <= 0)) AND (F ((1 <= p500)) AND (p262 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p262) U X ((((p291 <= 0) R (p262 <= 0)) AND (F ((1 <= p500)) AND (p262 <= 0)))))
lola: processed formula length: 87
lola: 115 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: 2258 markings, 2258 edges
lola: ========================================
lola: subprocess 3 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((G ((p1515 <= 0)) OR (p391 <= 0))) OR ((p1454 <= 0) AND (F ((p1515 <= 0)) OR G ((p1454 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((G ((p1515 <= 0)) OR (p391 <= 0))) OR ((p1454 <= 0) AND (F ((p1515 <= 0)) OR G ((p1454 <= 0))))))
lola: processed formula length: 104
lola: 115 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 4 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p1349) U X (G ((F ((1 <= p1349)) AND G ((1 <= p813)))))) AND F ((G ((p586 <= 0)) OR ((p813 <= 0) AND (p586 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p586 <= 0)) OR ((p813 <= 0) AND (p586 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p586 <= 0)) OR ((p813 <= 0) AND (p586 <= 0))))
lola: processed formula length: 54
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1349) U X (G ((F ((1 <= p1349)) AND G ((1 <= p813))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p1349) U X (G ((F ((1 <= p1349)) AND G ((1 <= p813))))))
lola: processed formula length: 63
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 2256 markings, 2256 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((1 <= p680)) OR X ((1 <= p79))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((1 <= p680)) OR X ((1 <= p79))))
lola: processed formula length: 39
lola: 115 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: 2256 markings, 2256 edges
lola: ========================================
lola: subprocess 6 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p382) U X (F ((1 <= p699))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p382) U X (F ((1 <= p699))))
lola: processed formula length: 35
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2256 markings, 2256 edges
lola: ========================================
lola: subprocess 7 will run for 585 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((p666 <= 0) R X ((p519 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((p666 <= 0) R X ((p519 <= 0)))))
lola: processed formula length: 39
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 403 markings, 1328 edges
lola: ========================================
lola: subprocess 8 will run for 702 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((G ((1 <= p63)) OR (G (F ((1 <= p611))) AND F (G ((1 <= p63)))))) AND (X ((1 <= p63)) OR (p63 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((G ((1 <= p63)) OR (G (F ((1 <= p611))) AND F (G ((1 <= p63)))))) AND (X ((1 <= p63)) OR (p63 <= 0)))))
lola: processed formula length: 113
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 2256 markings, 2256 edges
lola: ========================================
lola: subprocess 9 will run for 877 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p1321))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p1321 <= 0)
lola: processed formula length: 12
lola: 117 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 4651 markings, 4651 edges
lola: ========================================
lola: subprocess 10 will run for 1170 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p664)))
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 <= p664)))
lola: processed formula length: 19
lola: 115 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: 4652 markings, 4653 edges
lola: ========================================
lola: subprocess 11 will run for 1755 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p1540 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p1540 <= 0)))
lola: processed formula length: 20
lola: 115 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: 111890 markings, 261659 edges, 22378 markings/sec, 0 secs
lola: 192551 markings, 530151 edges, 16132 markings/sec, 5 secs
lola: 259452 markings, 803265 edges, 13380 markings/sec, 10 secs
lola: 309828 markings, 1077756 edges, 10075 markings/sec, 15 secs
lola: 360146 markings, 1352648 edges, 10064 markings/sec, 20 secs
lola: 410328 markings, 1627189 edges, 10036 markings/sec, 25 secs
lola: 463324 markings, 1897948 edges, 10599 markings/sec, 30 secs
lola: 505699 markings, 2173491 edges, 8475 markings/sec, 35 secs
lola: 547303 markings, 2449980 edges, 8321 markings/sec, 40 secs
lola: 589743 markings, 2724991 edges, 8488 markings/sec, 45 secs
lola: 631569 markings, 2998719 edges, 8365 markings/sec, 50 secs
lola: 673014 markings, 3273198 edges, 8289 markings/sec, 55 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 682593 markings, 3335820 edges
lola: ========================================
lola: subprocess 12 will run for 3448 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p1103 <= 0) AND (F ((G (((1 <= p1434) OR (1 <= p247))) AND F ((p453 <= 0)))) OR G ((p1103 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p1103 <= 0) AND (F ((G (((1 <= p1434) OR (1 <= p247))) AND F ((p453 <= 0)))) OR G ((p1103 <= 0)))))
lola: processed formula length: 105
lola: 115 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 68839 markings, 317352 edges, 13768 markings/sec, 0 secs
lola: 132433 markings, 637435 edges, 12719 markings/sec, 5 secs
lola: 191836 markings, 958870 edges, 11881 markings/sec, 10 secs
lola: 250991 markings, 1278312 edges, 11831 markings/sec, 15 secs
lola: 309955 markings, 1596597 edges, 11793 markings/sec, 20 secs
lola: 368902 markings, 1914660 edges, 11789 markings/sec, 25 secs
lola: 427848 markings, 2232314 edges, 11789 markings/sec, 30 secs
lola: 486718 markings, 2550412 edges, 11774 markings/sec, 35 secs
lola: 545926 markings, 2869579 edges, 11842 markings/sec, 40 secs
lola: 605117 markings, 3189266 edges, 11838 markings/sec, 45 secs
lola: 664242 markings, 3506394 edges, 11825 markings/sec, 50 secs
lola: 722733 markings, 3819974 edges, 11698 markings/sec, 55 secs
lola: 781171 markings, 4133203 edges, 11688 markings/sec, 60 secs
lola: 839644 markings, 4446665 edges, 11695 markings/sec, 65 secs
lola: 898209 markings, 4760650 edges, 11713 markings/sec, 70 secs
lola: 956768 markings, 5074620 edges, 11712 markings/sec, 75 secs
lola: 1015322 markings, 5388005 edges, 11711 markings/sec, 80 secs
lola: 1073669 markings, 5700846 edges, 11669 markings/sec, 85 secs
lola: 1129237 markings, 6006080 edges, 11114 markings/sec, 90 secs
lola: 1183594 markings, 6307827 edges, 10871 markings/sec, 95 secs
lola: 1237878 markings, 6609718 edges, 10857 markings/sec, 100 secs
lola: 1292350 markings, 6911745 edges, 10894 markings/sec, 105 secs
lola: 1346789 markings, 7214066 edges, 10888 markings/sec, 110 secs
lola: 1401272 markings, 7516659 edges, 10897 markings/sec, 115 secs
lola: 1455786 markings, 7818885 edges, 10903 markings/sec, 120 secs
lola: 1510234 markings, 8121287 edges, 10890 markings/sec, 125 secs
lola: 1564644 markings, 8423448 edges, 10882 markings/sec, 130 secs
lola: 1619146 markings, 8725777 edges, 10900 markings/sec, 135 secs
lola: 1673509 markings, 9028161 edges, 10873 markings/sec, 140 secs
lola: 1728062 markings, 9330616 edges, 10911 markings/sec, 145 secs
lola: 1782611 markings, 9633673 edges, 10910 markings/sec, 150 secs
lola: 1837322 markings, 9937132 edges, 10942 markings/sec, 155 secs
lola: 1892012 markings, 10240430 edges, 10938 markings/sec, 160 secs
lola: 1946676 markings, 10543641 edges, 10933 markings/sec, 165 secs
lola: 2001311 markings, 10846653 edges, 10927 markings/sec, 170 secs
lola: 2055888 markings, 11149318 edges, 10915 markings/sec, 175 secs
lola: 2110522 markings, 11452307 edges, 10927 markings/sec, 180 secs
lola: 2165165 markings, 11755344 edges, 10929 markings/sec, 185 secs
lola: 2219924 markings, 12059138 edges, 10952 markings/sec, 190 secs
lola: 2275387 markings, 12364872 edges, 11093 markings/sec, 195 secs
lola: 2331104 markings, 12669307 edges, 11143 markings/sec, 200 secs
lola: 2386731 markings, 12973245 edges, 11125 markings/sec, 205 secs
lola: 2441802 markings, 13275934 edges, 11014 markings/sec, 210 secs
lola: 2497258 markings, 13578652 edges, 11091 markings/sec, 215 secs
lola: 2552670 markings, 13881902 edges, 11082 markings/sec, 220 secs
lola: 2607701 markings, 14183456 edges, 11006 markings/sec, 225 secs
lola: 2663327 markings, 14486870 edges, 11125 markings/sec, 230 secs
lola: 2718667 markings, 14789553 edges, 11068 markings/sec, 235 secs
lola: 2774060 markings, 15092188 edges, 11079 markings/sec, 240 secs
lola: 2829399 markings, 15394234 edges, 11068 markings/sec, 245 secs
lola: 2884778 markings, 15696616 edges, 11076 markings/sec, 250 secs
lola: 2939583 markings, 15997835 edges, 10961 markings/sec, 255 secs
lola: 2994840 markings, 16299678 edges, 11051 markings/sec, 260 secs
lola: 3050215 markings, 16602127 edges, 11075 markings/sec, 265 secs
lola: 3105099 markings, 16903637 edges, 10977 markings/sec, 270 secs
lola: 3160542 markings, 17206167 edges, 11089 markings/sec, 275 secs
lola: 3215831 markings, 17508513 edges, 11058 markings/sec, 280 secs
lola: 3271140 markings, 17810576 edges, 11062 markings/sec, 285 secs
lola: 3326449 markings, 18112461 edges, 11062 markings/sec, 290 secs
lola: 3381617 markings, 18414057 edges, 11034 markings/sec, 295 secs
lola: 3436672 markings, 18715516 edges, 11011 markings/sec, 300 secs
lola: 3491659 markings, 19016493 edges, 10997 markings/sec, 305 secs
lola: 3546808 markings, 19318014 edges, 11030 markings/sec, 310 secs
lola: 3601896 markings, 19619693 edges, 11018 markings/sec, 315 secs
lola: 3656709 markings, 19919932 edges, 10963 markings/sec, 320 secs
lola: 3712000 markings, 20221835 edges, 11058 markings/sec, 325 secs
lola: 3767094 markings, 20522987 edges, 11019 markings/sec, 330 secs
lola: 3822261 markings, 20824141 edges, 11033 markings/sec, 335 secs
lola: 3877419 markings, 21125647 edges, 11032 markings/sec, 340 secs
lola: 3932620 markings, 21427356 edges, 11040 markings/sec, 345 secs
lola: 3987704 markings, 21729091 edges, 11017 markings/sec, 350 secs
lola: 4042587 markings, 22029354 edges, 10977 markings/sec, 355 secs
lola: 4097713 markings, 22330731 edges, 11025 markings/sec, 360 secs
lola: 4152761 markings, 22632205 edges, 11010 markings/sec, 365 secs
lola: 4207558 markings, 22932337 edges, 10959 markings/sec, 370 secs
lola: 4262572 markings, 23232469 edges, 11003 markings/sec, 375 secs
lola: 4317665 markings, 23533664 edges, 11019 markings/sec, 380 secs
lola: 4372660 markings, 23834284 edges, 10999 markings/sec, 385 secs
lola: 4427770 markings, 24134941 edges, 11022 markings/sec, 390 secs
lola: 4482701 markings, 24435652 edges, 10986 markings/sec, 395 secs
lola: 4537795 markings, 24736804 edges, 11019 markings/sec, 400 secs
lola: 4592386 markings, 25036451 edges, 10918 markings/sec, 405 secs
lola: 4647457 markings, 25336768 edges, 11014 markings/sec, 410 secs
lola: 4702443 markings, 25637322 edges, 10997 markings/sec, 415 secs
lola: 4757191 markings, 25937967 edges, 10950 markings/sec, 420 secs
lola: 4812446 markings, 26239315 edges, 11051 markings/sec, 425 secs
lola: 4867577 markings, 26540697 edges, 11026 markings/sec, 430 secs
lola: 4922613 markings, 26841536 edges, 11007 markings/sec, 435 secs
lola: 4977529 markings, 27141635 edges, 10983 markings/sec, 440 secs
lola: 5032526 markings, 27442161 edges, 10999 markings/sec, 445 secs
lola: 5087534 markings, 27742698 edges, 11002 markings/sec, 450 secs
lola: 5142201 markings, 28042921 edges, 10933 markings/sec, 455 secs
lola: 5197157 markings, 28343087 edges, 10991 markings/sec, 460 secs
lola: 5252190 markings, 28643859 edges, 11007 markings/sec, 465 secs
lola: 5306976 markings, 28944267 edges, 10957 markings/sec, 470 secs
lola: 5361756 markings, 29243731 edges, 10956 markings/sec, 475 secs
lola: 5416823 markings, 29544210 edges, 11013 markings/sec, 480 secs
lola: 5471656 markings, 29844296 edges, 10967 markings/sec, 485 secs
lola: 5526540 markings, 30144197 edges, 10977 markings/sec, 490 secs
lola: 5581755 markings, 30445549 edges, 11043 markings/sec, 495 secs
lola: 5636831 markings, 30746536 edges, 11015 markings/sec, 500 secs
lola: 5691857 markings, 31047859 edges, 11005 markings/sec, 505 secs
lola: 5746500 markings, 31347263 edges, 10929 markings/sec, 510 secs
lola: 5801570 markings, 31648184 edges, 11014 markings/sec, 515 secs
lola: 5856584 markings, 31948913 edges, 11003 markings/sec, 520 secs
lola: 5911152 markings, 32248445 edges, 10914 markings/sec, 525 secs
lola: 5966316 markings, 32549190 edges, 11033 markings/sec, 530 secs
lola: 6021410 markings, 32850624 edges, 11019 markings/sec, 535 secs
lola: 6076501 markings, 33151551 edges, 11018 markings/sec, 540 secs
lola: 6130823 markings, 33450511 edges, 10864 markings/sec, 545 secs
lola: 6184754 markings, 33746144 edges, 10786 markings/sec, 550 secs
lola: 6238885 markings, 34041949 edges, 10826 markings/sec, 555 secs
lola: 6292632 markings, 34336278 edges, 10749 markings/sec, 560 secs
lola: 6346558 markings, 34631676 edges, 10785 markings/sec, 565 secs
lola: 6400175 markings, 34925494 edges, 10723 markings/sec, 570 secs
lola: 6453962 markings, 35220016 edges, 10757 markings/sec, 575 secs
lola: 6507580 markings, 35513316 edges, 10724 markings/sec, 580 secs
lola: 6561239 markings, 35807541 edges, 10732 markings/sec, 585 secs
lola: 6614887 markings, 36100653 edges, 10730 markings/sec, 590 secs
lola: 6668389 markings, 36394282 edges, 10700 markings/sec, 595 secs
lola: 6721917 markings, 36686514 edges, 10706 markings/sec, 600 secs
lola: 6775326 markings, 36979667 edges, 10682 markings/sec, 605 secs
lola: 6828722 markings, 37271517 edges, 10679 markings/sec, 610 secs
lola: 6882097 markings, 37564026 edges, 10675 markings/sec, 615 secs
lola: 6935428 markings, 37855505 edges, 10666 markings/sec, 620 secs
lola: 6988954 markings, 38148899 edges, 10705 markings/sec, 625 secs
lola: 7042402 markings, 38441109 edges, 10690 markings/sec, 630 secs
lola: 7095910 markings, 38734397 edges, 10702 markings/sec, 635 secs
lola: 7149354 markings, 39026594 edges, 10689 markings/sec, 640 secs
lola: 7202930 markings, 39320317 edges, 10715 markings/sec, 645 secs
lola: 7256396 markings, 39612639 edges, 10693 markings/sec, 650 secs
lola: 7309939 markings, 39906164 edges, 10709 markings/sec, 655 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7320656 markings, 39941955 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no no no no no yes no no
lola:
preliminary result: no no no yes no no no no no no yes no no
lola: memory consumption: 141552 KB
lola: time consumption: 783 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="Diffusion2D-PT-D40N150"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is Diffusion2D-PT-D40N150, 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 r094-tall-162048902300098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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