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-162048902400142.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 DiscoveryGPU-PT-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902400142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K 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.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 17:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 32K 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 DiscoveryGPU-PT-09a-00
FORMULA_NAME DiscoveryGPU-PT-09a-01
FORMULA_NAME DiscoveryGPU-PT-09a-02
FORMULA_NAME DiscoveryGPU-PT-09a-03
FORMULA_NAME DiscoveryGPU-PT-09a-04
FORMULA_NAME DiscoveryGPU-PT-09a-05
FORMULA_NAME DiscoveryGPU-PT-09a-06
FORMULA_NAME DiscoveryGPU-PT-09a-07
FORMULA_NAME DiscoveryGPU-PT-09a-08
FORMULA_NAME DiscoveryGPU-PT-09a-09
FORMULA_NAME DiscoveryGPU-PT-09a-10
FORMULA_NAME DiscoveryGPU-PT-09a-11
FORMULA_NAME DiscoveryGPU-PT-09a-12
FORMULA_NAME DiscoveryGPU-PT-09a-13
FORMULA_NAME DiscoveryGPU-PT-09a-14
FORMULA_NAME DiscoveryGPU-PT-09a-15

=== Now, execution of the tool begins

BK_START 1620736832970

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 12:40:34] [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 12:40:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 12:40:34] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-11 12:40:34] [INFO ] Transformed 93 places.
[2021-05-11 12:40:34] [INFO ] Transformed 127 transitions.
[2021-05-11 12:40:34] [INFO ] Found NUPN structural information;
[2021-05-11 12:40:34] [INFO ] Parsed PT model containing 93 places and 127 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 510 steps, including 5 resets, run visited all 43 properties in 11 ms. (steps per millisecond=46 )
[2021-05-11 12:40:34] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-11 12:40:34] [INFO ] Flatten gal took : 36 ms
FORMULA DiscoveryGPU-PT-09a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 12:40:34] [INFO ] Applying decomposition
[2021-05-11 12:40:34] [INFO ] Flatten gal took : 14 ms
[2021-05-11 12:40:34] [INFO ] Decomposing Gal with order
[2021-05-11 12:40:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 12:40:34] [INFO ] Removed a total of 79 redundant transitions.
[2021-05-11 12:40:34] [INFO ] Flatten gal took : 34 ms
[2021-05-11 12:40:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 5 ms.
[2021-05-11 12:40:34] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-11 12:40:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DiscoveryGPU-PT-09a @ 3570 seconds

FORMULA DiscoveryGPU-PT-09a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2176
rslt: Output for LTLFireability @ DiscoveryGPU-PT-09a

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p50) AND (1 <= p91))))",
"processed_size": 35,
"rewrites": 71
},
"result":
{
"edges": 42,
"markings": 40,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((G (((1 <= p24) AND (1 <= p92))) OR ((1 <= p34))) U X (((1 <= p24) AND ((p50 <= 0) OR (p91 <= 0)) AND (1 <= p92))))",
"processed_size": 117,
"rewrites": 71
},
"result":
{
"edges": 47,
"markings": 47,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"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": "F ((X (((1 <= p16))) AND ((1 <= p11))))",
"processed_size": 39,
"rewrites": 71
},
"result":
{
"edges": 48,
"markings": 48,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(X (G (((1 <= p76) AND (1 <= p91)))) U (X (((1 <= p16))) AND ((1 <= p11))))",
"processed_size": 75,
"rewrites": 71
},
"result":
{
"edges": 47,
"markings": 47,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "X (((p55 <= 0) OR (p91 <= 0)))",
"processed_size": 31,
"rewrites": 71
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((G (F ((X (G (((1 <= p28) AND (1 <= p92)))) OR ((1 <= p22) AND (1 <= p91))))) AND F (((p28 <= 0) OR (p92 <= 0)))))",
"processed_size": 118,
"rewrites": 71
},
"result":
{
"edges": 47,
"markings": 47,
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((p46 <= 0)) OR X (F (((((1 <= p46)) U ((1 <= p56))) AND (((p37 <= 0) OR (p91 <= 0)) AND ((p46 <= 0))))))))",
"processed_size": 112,
"rewrites": 71
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((X (((1 <= p25) AND (1 <= p91))) OR ((1 <= p25) AND (1 <= p91))))",
"processed_size": 68,
"rewrites": 71
},
"result":
{
"edges": 47,
"markings": 47,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p13) AND (1 <= p92))) AND G (((1 <= p82) AND (1 <= p91)))))",
"processed_size": 73,
"rewrites": 71
},
"result":
{
"edges": 47,
"markings": 47,
"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": 719
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F (((1 <= p45) AND (1 <= p91))) OR G (((1 <= p33) AND (1 <= p92)))))",
"processed_size": 72,
"rewrites": 71
},
"result":
{
"edges": 47,
"markings": 47,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 959
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (((((1 <= p79) AND (1 <= p91)) U G (((1 <= p61)))) AND (((p61 <= 0)) AND (((1 <= p25)) AND (((1 <= p91)) AND ((p82 <= 0)))))))",
"processed_size": 128,
"rewrites": 71
},
"result":
{
"edges": 36,
"markings": 36,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"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": 1439
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1439
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "(((1 <= p29)) AND ((1 <= p91)))",
"processed_size": 31,
"rewrites": 72
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2879
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p13))))",
"processed_size": 20,
"rewrites": 71
},
"result":
{
"edges": 13,
"markings": 13,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p13))))",
"processed_size": 20,
"rewrites": 71
},
"result":
{
"edges": 13,
"markings": 13,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "G ((((1 <= p7) AND (1 <= p91)) AND F (((1 <= p13)))))",
"processed_size": 53,
"rewrites": 71
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3808,
"runtime": 1394.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((F(**) OR G(**))) : (F(G(**)) OR ((G(**) OR **) U X(**))) : ((X(G(**)) U (X(**) AND **)) OR (G((X(G(**)) AND **)) AND F((X(**) AND **)))) : (X(**) OR G(*)) : F(((** U G(**)) AND (** AND (** AND (** AND **))))) : (F(**) OR (F(*) AND (** AND **))) : X((G(F((X(G(**)) OR *))) AND F(*))) : X((* OR X(F(((** U **) AND (* AND *)))))) : (G((X(**) OR **)) OR **) : X((F(**) AND G(**))) : (G(F(**)) OR G((** AND F(**)))) : G(F((G(*) OR (X(*) AND *))))"
},
"net":
{
"arcs": 408,
"conflict_clusters": 12,
"places": 93,
"places_significant": 91,
"singleton_clusters": 0,
"transitions": 127
},
"result":
{
"preliminary_value": "no no no yes no no no yes no no no unknown ",
"value": "no no no yes no no no yes no no no unknown "
},
"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: 220/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 93
lola: finding significant places
lola: 93 places, 127 transitions, 91 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: F ((F (((1 <= p45) AND (1 <= p91))) OR G (((1 <= p33) AND (1 <= p92))))) : (G (F (G (((1 <= p50) AND (1 <= p91))))) OR ((G (((1 <= p24) AND (1 <= p92))) OR ((1 <= p34))) U X (((1 <= p24) AND ((p50 <= 0) OR (p91 <= 0)) AND (1 <= p92))))) : (G ((G (X (((1 <= p14)))) AND ((1 <= p11)))) U (G (X (((1 <= p76) AND (1 <= p91)))) U (X (((1 <= p16))) AND ((1 <= p11))))) : (X (((p55 <= 0) OR (p91 <= 0))) OR NOT(F (((1 <= p22) AND (1 <= p91))))) : F ((((((((1 <= p79) AND (1 <= p91)) U G (((1 <= p61)))) AND ((p61 <= 0))) AND ((1 <= p25))) AND ((1 <= p91))) AND ((p82 <= 0)))) : (F (((1 <= p1))) OR ((NOT(G (((1 <= p51)))) AND ((1 <= p29))) AND ((1 <= p91)))) : NOT(X ((X (F (G ((F (NOT(X (((1 <= p28) AND (1 <= p92))))) AND ((p22 <= 0) OR (p91 <= 0)))))) OR G (((1 <= p28) AND (1 <= p92)))))) : (NOT(X (((1 <= p46)))) OR NOT(X (G (X (((NOT((((1 <= p46)) U ((1 <= p56)))) OR ((1 <= p37) AND (1 <= p91))) OR ((1 <= p46)))))))) : (G ((X (((1 <= p25) AND (1 <= p91))) OR ((1 <= p25) AND (1 <= p91)))) OR ((1 <= p78) AND (1 <= p92))) : X ((F (((1 <= p13) AND (1 <= p92))) AND G (((1 <= p82) AND (1 <= p91))))) : (G (((1 <= p7) AND (1 <= p91))) U G (F ((F (((1 <= p8) AND (1 <= p92))) U G (F (((1 <= p13)))))))) : F (X (NOT(G (F (X (G ((X (((1 <= p58) AND (1 <= p92))) U ((1 <= p76))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p50) AND (1 <= p91)))) OR ((G (((1 <= p24) AND (1 <= p92))) OR ((1 <= p34))) U X (((1 <= p24) AND ((p50 <= 0) OR (p91 <= 0)) AND (1 <= p92)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p50) AND (1 <= p91))))
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 <= p50) AND (1 <= p91))))
lola: processed formula length: 35
lola: 71 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: add low 9
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: 40 markings, 42 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((1 <= p24) AND (1 <= p92))) OR ((1 <= p34))) U X (((1 <= p24) AND ((p50 <= 0) OR (p91 <= 0)) AND (1 <= p92))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((1 <= p24) AND (1 <= p92))) OR ((1 <= p34))) U X (((1 <= p24) AND ((p50 <= 0) OR (p91 <= 0)) AND (1 <= p92))))
lola: processed formula length: 117
lola: 71 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: 47 markings, 47 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (G (((1 <= p76) AND (1 <= p91)))) U (X (((1 <= p16))) AND ((1 <= p11)))) OR (G ((X (G (((1 <= p14)))) AND ((1 <= p11)))) AND F ((X (((1 <= p16))) AND ((1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((1 <= p16))) AND ((1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((1 <= p16))) AND ((1 <= p11))))
lola: processed formula length: 39
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 48 markings, 48 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p76) AND (1 <= p91)))) U (X (((1 <= p16))) AND ((1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((1 <= p76) AND (1 <= p91)))) U (X (((1 <= p16))) AND ((1 <= p11))))
lola: processed formula length: 75
lola: 71 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: 47 markings, 47 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p55 <= 0) OR (p91 <= 0))) OR G (((p22 <= 0) OR (p91 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p22 <= 0) OR (p91 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p22 <= 0) OR (p91 <= 0)))
lola: processed formula length: 31
lola: 71 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: 1273 markings, 4302 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p55 <= 0) OR (p91 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p55 <= 0) OR (p91 <= 0)))
lola: processed formula length: 31
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F ((X (G (((1 <= p28) AND (1 <= p92)))) OR ((1 <= p22) AND (1 <= p91))))) AND F (((p28 <= 0) OR (p92 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F ((X (G (((1 <= p28) AND (1 <= p92)))) OR ((1 <= p22) AND (1 <= p91))))) AND F (((p28 <= 0) OR (p92 <= 0)))))
lola: processed formula length: 118
lola: 71 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: 47 markings, 47 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p46 <= 0)) OR X (F (((((1 <= p46)) U ((1 <= p56))) AND (((p37 <= 0) OR (p91 <= 0)) AND ((p46 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p46 <= 0)) OR X (F (((((1 <= p46)) U ((1 <= p56))) AND (((p37 <= 0) OR (p91 <= 0)) AND ((p46 <= 0))))))))
lola: processed formula length: 112
lola: 71 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((X (((1 <= p25) AND (1 <= p91))) OR ((1 <= p25) AND (1 <= p91)))) OR ((1 <= p78) AND (1 <= p92)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p78) AND (1 <= p92))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p78) AND (1 <= p92))
lola: processed formula length: 27
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((1 <= p25) AND (1 <= p91))) OR ((1 <= p25) AND (1 <= p91))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((1 <= p25) AND (1 <= p91))) OR ((1 <= p25) AND (1 <= p91))))
lola: processed formula length: 68
lola: 71 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: 47 markings, 47 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p13) AND (1 <= p92))) AND G (((1 <= p82) AND (1 <= p91)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p13) AND (1 <= p92))) AND G (((1 <= p82) AND (1 <= p91)))))
lola: processed formula length: 73
lola: 71 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: 47 markings, 47 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p76 <= 0))) OR (X (((p58 <= 0) OR (p92 <= 0))) AND ((p76 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p76 <= 0))) OR (X (((p58 <= 0) OR (p92 <= 0))) AND ((p76 <= 0))))))
lola: processed formula length: 80
lola: 71 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: 1336208 markings, 4216655 edges, 267242 markings/sec, 0 secs
lola: 2592910 markings, 8404331 edges, 251340 markings/sec, 5 secs
lola: 3815395 markings, 12550674 edges, 244497 markings/sec, 10 secs
lola: 4932744 markings, 16694046 edges, 223470 markings/sec, 15 secs
lola: 6072826 markings, 20811796 edges, 228016 markings/sec, 20 secs
lola: 7251319 markings, 24964529 edges, 235699 markings/sec, 25 secs
lola: 8372490 markings, 29099884 edges, 224234 markings/sec, 30 secs
lola: 9508566 markings, 33247870 edges, 227215 markings/sec, 35 secs
lola: 10566344 markings, 37447928 edges, 211556 markings/sec, 40 secs
lola: 11612514 markings, 41617580 edges, 209234 markings/sec, 45 secs
lola: 12754058 markings, 45727376 edges, 228309 markings/sec, 50 secs
lola: 13868226 markings, 49842808 edges, 222834 markings/sec, 55 secs
lola: 14930672 markings, 53975266 edges, 212489 markings/sec, 60 secs
lola: 15970605 markings, 58065660 edges, 207987 markings/sec, 65 secs
lola: 17068098 markings, 62153257 edges, 219499 markings/sec, 70 secs
lola: 18131220 markings, 66244673 edges, 212624 markings/sec, 75 secs
lola: 19187905 markings, 70347872 edges, 211337 markings/sec, 80 secs
lola: 20201133 markings, 74419739 edges, 202646 markings/sec, 85 secs
lola: 21277868 markings, 78476808 edges, 215347 markings/sec, 90 secs
lola: 22411435 markings, 82542237 edges, 226713 markings/sec, 95 secs
lola: 23508595 markings, 86566182 edges, 219432 markings/sec, 100 secs
lola: 24656075 markings, 90580845 edges, 229496 markings/sec, 105 secs
lola: 25755727 markings, 94631499 edges, 219930 markings/sec, 110 secs
lola: 26809200 markings, 98698603 edges, 210695 markings/sec, 115 secs
lola: 27832001 markings, 102700740 edges, 204560 markings/sec, 120 secs
lola: 28887503 markings, 106695919 edges, 211100 markings/sec, 125 secs
lola: 29919839 markings, 110684208 edges, 206467 markings/sec, 130 secs
lola: 31061292 markings, 114658462 edges, 228291 markings/sec, 135 secs
lola: 32117177 markings, 118601659 edges, 211177 markings/sec, 140 secs
lola: 33215477 markings, 122550998 edges, 219660 markings/sec, 145 secs
lola: 34255743 markings, 126598219 edges, 208053 markings/sec, 150 secs
lola: 35252570 markings, 130623034 edges, 199365 markings/sec, 155 secs
lola: 36298249 markings, 134643321 edges, 209136 markings/sec, 160 secs
lola: 37341669 markings, 138729314 edges, 208684 markings/sec, 165 secs
lola: 38345694 markings, 142785663 edges, 200805 markings/sec, 170 secs
lola: 39377184 markings, 146852799 edges, 206298 markings/sec, 175 secs
lola: 40340012 markings, 150968872 edges, 192566 markings/sec, 180 secs
lola: 41271798 markings, 155055846 edges, 186357 markings/sec, 185 secs
lola: 42258777 markings, 159119771 edges, 197396 markings/sec, 190 secs
lola: 43292742 markings, 163139674 edges, 206793 markings/sec, 195 secs
lola: 44261869 markings, 167194880 edges, 193825 markings/sec, 200 secs
lola: 45222785 markings, 171217503 edges, 192183 markings/sec, 205 secs
lola: 46158808 markings, 175216669 edges, 187205 markings/sec, 210 secs
lola: 47163774 markings, 179238101 edges, 200993 markings/sec, 215 secs
lola: 48117668 markings, 183238125 edges, 190779 markings/sec, 220 secs
lola: 49079723 markings, 187250546 edges, 192411 markings/sec, 225 secs
lola: 49987844 markings, 191237198 edges, 181624 markings/sec, 230 secs
lola: 50913016 markings, 195209758 edges, 185034 markings/sec, 235 secs
lola: 51960118 markings, 199184341 edges, 209420 markings/sec, 240 secs
lola: 52937206 markings, 203156940 edges, 195418 markings/sec, 245 secs
lola: 53929134 markings, 207106438 edges, 198386 markings/sec, 250 secs
lola: 54968031 markings, 211054757 edges, 207779 markings/sec, 255 secs
lola: 55955747 markings, 215037551 edges, 197543 markings/sec, 260 secs
lola: 56897087 markings, 219016658 edges, 188268 markings/sec, 265 secs
lola: 57824881 markings, 222946112 edges, 185559 markings/sec, 270 secs
lola: 58769993 markings, 226876420 edges, 189022 markings/sec, 275 secs
lola: 59716878 markings, 230806008 edges, 189377 markings/sec, 280 secs
lola: 60808959 markings, 234729863 edges, 218416 markings/sec, 285 secs
lola: 61874400 markings, 238666405 edges, 213088 markings/sec, 290 secs
lola: 62938536 markings, 242565214 edges, 212827 markings/sec, 295 secs
lola: 64007271 markings, 246580893 edges, 213747 markings/sec, 300 secs
lola: 64991624 markings, 250591703 edges, 196871 markings/sec, 305 secs
lola: 65996322 markings, 254584189 edges, 200940 markings/sec, 310 secs
lola: 67070803 markings, 258651612 edges, 214896 markings/sec, 315 secs
lola: 68064174 markings, 262695760 edges, 198674 markings/sec, 320 secs
lola: 69092611 markings, 266735344 edges, 205687 markings/sec, 325 secs
lola: 70075789 markings, 270832110 edges, 196636 markings/sec, 330 secs
lola: 71000454 markings, 274898430 edges, 184933 markings/sec, 335 secs
lola: 71946941 markings, 278962567 edges, 189297 markings/sec, 340 secs
lola: 72993270 markings, 282962848 edges, 209266 markings/sec, 345 secs
lola: 73989625 markings, 286982700 edges, 199271 markings/sec, 350 secs
lola: 74942880 markings, 291003148 edges, 190651 markings/sec, 355 secs
lola: 75877575 markings, 294973380 edges, 186939 markings/sec, 360 secs
lola: 76842994 markings, 298954082 edges, 193084 markings/sec, 365 secs
lola: 77798734 markings, 302935344 edges, 191148 markings/sec, 370 secs
lola: 78771669 markings, 306905336 edges, 194587 markings/sec, 375 secs
lola: 79683224 markings, 310884000 edges, 182311 markings/sec, 380 secs
lola: 80601451 markings, 314836658 edges, 183645 markings/sec, 385 secs
lola: 81592646 markings, 318770219 edges, 198239 markings/sec, 390 secs
lola: 82588241 markings, 322740691 edges, 199119 markings/sec, 395 secs
lola: 83578068 markings, 326674033 edges, 197965 markings/sec, 400 secs
lola: 84595549 markings, 330582595 edges, 203496 markings/sec, 405 secs
lola: 85587139 markings, 334535886 edges, 198318 markings/sec, 410 secs
lola: 86534069 markings, 338499133 edges, 189386 markings/sec, 415 secs
lola: 87465006 markings, 342416842 edges, 186187 markings/sec, 420 secs
lola: 88387919 markings, 346312266 edges, 184583 markings/sec, 425 secs
lola: 89349152 markings, 350229362 edges, 192247 markings/sec, 430 secs
lola: 90321372 markings, 354122338 edges, 194444 markings/sec, 435 secs
lola: 91337901 markings, 358113901 edges, 203306 markings/sec, 440 secs
lola: 92307633 markings, 362043978 edges, 193946 markings/sec, 445 secs
lola: 93311358 markings, 365990933 edges, 200745 markings/sec, 450 secs
lola: 94261337 markings, 370038643 edges, 189996 markings/sec, 455 secs
lola: 95175624 markings, 374046326 edges, 182857 markings/sec, 460 secs
lola: 96123560 markings, 378060085 edges, 189587 markings/sec, 465 secs
lola: 97098269 markings, 382137507 edges, 194942 markings/sec, 470 secs
lola: 98020384 markings, 386187865 edges, 184423 markings/sec, 475 secs
lola: 98961655 markings, 390230068 edges, 188254 markings/sec, 480 secs
lola: 99895289 markings, 394327723 edges, 186727 markings/sec, 485 secs
lola: 100762598 markings, 398421899 edges, 173462 markings/sec, 490 secs
lola: 101640455 markings, 402497577 edges, 175571 markings/sec, 495 secs
lola: 102581704 markings, 406522774 edges, 188250 markings/sec, 500 secs
lola: 103516001 markings, 410547484 edges, 186859 markings/sec, 505 secs
lola: 104156534 markings, 413447061 edges, 128107 markings/sec, 510 secs
lola: 105031955 markings, 417399727 edges, 175084 markings/sec, 515 secs
lola: 105797959 markings, 420886056 edges, 153201 markings/sec, 520 secs
lola: 106655829 markings, 424767928 edges, 171574 markings/sec, 525 secs
lola: 107386666 markings, 427987140 edges, 146167 markings/sec, 530 secs
lola: 108124780 markings, 431306016 edges, 147623 markings/sec, 535 secs
lola: 108833923 markings, 434448775 edges, 141829 markings/sec, 540 secs
lola: 109472801 markings, 437443725 edges, 127776 markings/sec, 545 secs
lola: 110008312 markings, 440005189 edges, 107102 markings/sec, 550 secs
lola: 110646047 markings, 442921396 edges, 127547 markings/sec, 555 secs
lola: 111500811 markings, 446583299 edges, 170953 markings/sec, 560 secs
lola: 112417240 markings, 450510314 edges, 183286 markings/sec, 565 secs
lola: 113302699 markings, 454391454 edges, 177092 markings/sec, 570 secs
lola: 114222449 markings, 458261186 edges, 183950 markings/sec, 575 secs
lola: 115139801 markings, 462129952 edges, 183470 markings/sec, 580 secs
lola: 116030837 markings, 466049577 edges, 178207 markings/sec, 585 secs
lola: 116886058 markings, 469935426 edges, 171044 markings/sec, 590 secs
lola: 117747801 markings, 473851925 edges, 172349 markings/sec, 595 secs
lola: 118595689 markings, 477705207 edges, 169578 markings/sec, 600 secs
lola: 119416480 markings, 481327172 edges, 164158 markings/sec, 605 secs
lola: 120238641 markings, 484770784 edges, 164432 markings/sec, 610 secs
lola: 121163773 markings, 488064163 edges, 185026 markings/sec, 615 secs
lola: 121900256 markings, 490770267 edges, 147297 markings/sec, 620 secs
lola: 122477095 markings, 493059473 edges, 115368 markings/sec, 625 secs
lola: 123245201 markings, 496032528 edges, 153621 markings/sec, 630 secs
lola: 123904817 markings, 498595734 edges, 131923 markings/sec, 635 secs
lola: 124519636 markings, 500951525 edges, 122964 markings/sec, 640 secs
lola: 125225912 markings, 503568035 edges, 141255 markings/sec, 645 secs
lola: 125870930 markings, 506084807 edges, 129004 markings/sec, 650 secs
lola: 126585825 markings, 508745550 edges, 142979 markings/sec, 655 secs
lola: 126586617 markings, 508747915 edges, 158 markings/sec, 660 secs
lola: 127253852 markings, 511391698 edges, 133447 markings/sec, 665 secs
lola: 128042401 markings, 514625332 edges, 157710 markings/sec, 670 secs
lola: 128637482 markings, 517125087 edges, 119016 markings/sec, 675 secs
lola: 129355401 markings, 520165071 edges, 143584 markings/sec, 680 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 719 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p45) AND (1 <= p91))) OR G (((1 <= p33) AND (1 <= p92)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p45) AND (1 <= p91))) OR G (((1 <= p33) AND (1 <= p92)))))
lola: processed formula length: 72
lola: 71 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: 47 markings, 47 edges
lola: ========================================
lola: subprocess 9 will run for 959 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((1 <= p79) AND (1 <= p91)) U G (((1 <= p61)))) AND (((p61 <= 0)) AND (((1 <= p25)) AND (((1 <= p91)) AND ((p82 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((((1 <= p79) AND (1 <= p91)) U G (((1 <= p61)))) AND (((p61 <= 0)) AND (((1 <= p25)) AND (((1 <= p91)) AND ((p82 <= 0)))))))
lola: processed formula length: 128
lola: 71 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: 36 markings, 36 edges
lola: ========================================
lola: subprocess 10 will run for 1439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p1))) OR (F (((p51 <= 0))) AND (((1 <= p29)) AND ((1 <= p91)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p29)) AND ((1 <= p91)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: (((1 <= p29)) AND ((1 <= p91)))
lola: processed formula length: 31
lola: 72 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 2879 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p1)))
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: ((p1 <= 0))
lola: processed formula length: 11
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 2879 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p13)))) OR G ((((1 <= p7) AND (1 <= p91)) AND F (((1 <= p13))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 2879 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p13))))
lola: processed formula length: 20
lola: 71 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: 13 markings, 13 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p76 <= 0))) OR (X (((p58 <= 0) OR (p92 <= 0))) AND ((p76 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p76 <= 0))) OR (X (((p58 <= 0) OR (p92 <= 0))) AND ((p76 <= 0))))))
lola: processed formula length: 80
lola: 71 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: 1320674 markings, 4169537 edges, 264135 markings/sec, 0 secs
lola: 2583027 markings, 8371124 edges, 252471 markings/sec, 5 secs
lola: 3808585 markings, 12528443 edges, 245112 markings/sec, 10 secs
lola: 4930213 markings, 16684669 edges, 224326 markings/sec, 15 secs
lola: 6075158 markings, 20819181 edges, 228989 markings/sec, 20 secs
lola: 7257438 markings, 24985289 edges, 236456 markings/sec, 25 secs
lola: 8382630 markings, 29137440 edges, 225038 markings/sec, 30 secs
lola: 9523041 markings, 33301131 edges, 228082 markings/sec, 35 secs
lola: 10582800 markings, 37517606 edges, 211952 markings/sec, 40 secs
lola: 11632613 markings, 41703537 edges, 209963 markings/sec, 45 secs
lola: 12782958 markings, 45831877 edges, 230069 markings/sec, 50 secs
lola: 13900163 markings, 49969824 edges, 223441 markings/sec, 55 secs
lola: 14967765 markings, 54122208 edges, 213520 markings/sec, 60 secs
lola: 16008461 markings, 58228017 edges, 208139 markings/sec, 65 secs
lola: 17116517 markings, 62338839 edges, 221611 markings/sec, 70 secs
lola: 18186009 markings, 66442746 edges, 213898 markings/sec, 75 secs
lola: 19245372 markings, 70561021 edges, 211873 markings/sec, 80 secs
lola: 20260431 markings, 74654942 edges, 203012 markings/sec, 85 secs
lola: 21355565 markings, 78728183 edges, 219027 markings/sec, 90 secs
lola: 22482151 markings, 82806602 edges, 225317 markings/sec, 95 secs
lola: 23587831 markings, 86849271 edges, 221136 markings/sec, 100 secs
lola: 24742766 markings, 90886313 edges, 230987 markings/sec, 105 secs
lola: 25843124 markings, 94953084 edges, 220072 markings/sec, 110 secs
lola: 26890726 markings, 99027891 edges, 209520 markings/sec, 115 secs
lola: 27918907 markings, 103054801 edges, 205636 markings/sec, 120 secs
lola: 28995152 markings, 107085266 edges, 215249 markings/sec, 125 secs
lola: 30039856 markings, 111110287 edges, 208941 markings/sec, 130 secs
lola: 31180925 markings, 115124961 edges, 228214 markings/sec, 135 secs
lola: 32258579 markings, 119094255 edges, 215531 markings/sec, 140 secs
lola: 33366333 markings, 123085850 edges, 221551 markings/sec, 145 secs
lola: 34401108 markings, 127167921 edges, 206955 markings/sec, 150 secs
lola: 35406972 markings, 131221816 edges, 201173 markings/sec, 155 secs
lola: 36468456 markings, 135285892 edges, 212297 markings/sec, 160 secs
lola: 37506718 markings, 139403395 edges, 207652 markings/sec, 165 secs
lola: 38530680 markings, 143486463 edges, 204792 markings/sec, 170 secs
lola: 39553197 markings, 147598135 edges, 204503 markings/sec, 175 secs
lola: 40516646 markings, 151750444 edges, 192690 markings/sec, 180 secs
lola: 41467370 markings, 155862023 edges, 190145 markings/sec, 185 secs
lola: 42479133 markings, 159948694 edges, 202353 markings/sec, 190 secs
lola: 43509188 markings, 164013494 edges, 206011 markings/sec, 195 secs
lola: 44479377 markings, 168094439 edges, 194038 markings/sec, 200 secs
lola: 45444983 markings, 172130717 edges, 193121 markings/sec, 205 secs
lola: 46402295 markings, 176173437 edges, 191462 markings/sec, 210 secs
lola: 47395203 markings, 180229298 edges, 198582 markings/sec, 215 secs
lola: 48375569 markings, 184246113 edges, 196073 markings/sec, 220 secs
lola: 49322287 markings, 188296351 edges, 189344 markings/sec, 225 secs
lola: 50239282 markings, 192315722 edges, 183399 markings/sec, 230 secs
lola: 51206668 markings, 196321011 edges, 193477 markings/sec, 235 secs
lola: 52240415 markings, 200343462 edges, 206749 markings/sec, 240 secs
lola: 53230123 markings, 204334367 edges, 197942 markings/sec, 245 secs
lola: 54259593 markings, 208322821 edges, 205894 markings/sec, 250 secs
lola: 55284191 markings, 212305774 edges, 204920 markings/sec, 255 secs
lola: 56244776 markings, 216320100 edges, 192117 markings/sec, 260 secs
lola: 57197255 markings, 220305298 edges, 190496 markings/sec, 265 secs
lola: 58123401 markings, 224256678 edges, 185229 markings/sec, 270 secs
lola: 59113725 markings, 228232327 edges, 198065 markings/sec, 275 secs
lola: 60063268 markings, 232182570 edges, 189909 markings/sec, 280 secs
lola: 61193089 markings, 236171937 edges, 225964 markings/sec, 285 secs
lola: 62263707 markings, 240113113 edges, 214124 markings/sec, 290 secs
lola: 63362435 markings, 244071963 edges, 219746 markings/sec, 295 secs
lola: 64392855 markings, 248132736 edges, 206084 markings/sec, 300 secs
lola: 65389887 markings, 252159198 edges, 199406 markings/sec, 305 secs
lola: 66447056 markings, 256200508 edges, 211434 markings/sec, 310 secs
lola: 67480784 markings, 260294763 edges, 206746 markings/sec, 315 secs
lola: 68497856 markings, 264360018 edges, 203414 markings/sec, 320 secs
lola: 69515136 markings, 268443283 edges, 203456 markings/sec, 325 secs
lola: 70477663 markings, 272573721 edges, 192505 markings/sec, 330 secs
lola: 71416495 markings, 276660537 edges, 187766 markings/sec, 335 secs
lola: 72415432 markings, 280719488 edges, 199787 markings/sec, 340 secs
lola: 73446348 markings, 284758570 edges, 206183 markings/sec, 345 secs
lola: 74406097 markings, 288819568 edges, 191950 markings/sec, 350 secs
lola: 75373804 markings, 292835591 edges, 193541 markings/sec, 355 secs
lola: 76319988 markings, 296847885 edges, 189237 markings/sec, 360 secs
lola: 77311390 markings, 300872106 edges, 198280 markings/sec, 365 secs
lola: 78278294 markings, 304863944 edges, 193381 markings/sec, 370 secs
lola: 79221327 markings, 308879893 edges, 188607 markings/sec, 375 secs
lola: 80128219 markings, 312855159 edges, 181378 markings/sec, 380 secs
lola: 81070709 markings, 316828766 edges, 188498 markings/sec, 385 secs
lola: 82110461 markings, 320825470 edges, 207950 markings/sec, 390 secs
lola: 83084712 markings, 324784478 edges, 194850 markings/sec, 395 secs
lola: 84103119 markings, 328747124 edges, 203681 markings/sec, 400 secs
lola: 85128168 markings, 332702910 edges, 205010 markings/sec, 405 secs
lola: 86103096 markings, 336689101 edges, 194986 markings/sec, 410 secs
lola: 87045776 markings, 340652073 edges, 188536 markings/sec, 415 secs
lola: 87966528 markings, 344570879 edges, 184150 markings/sec, 420 secs
lola: 88935061 markings, 348502942 edges, 193707 markings/sec, 425 secs
lola: 89868078 markings, 352429668 edges, 186603 markings/sec, 430 secs
lola: 90916634 markings, 356411052 edges, 209711 markings/sec, 435 secs
lola: 91898682 markings, 360392184 edges, 196410 markings/sec, 440 secs
lola: 92888128 markings, 364341348 edges, 197889 markings/sec, 445 secs
lola: 93885439 markings, 368387524 edges, 199462 markings/sec, 450 secs
lola: 94811365 markings, 372444738 edges, 185185 markings/sec, 455 secs
lola: 95747612 markings, 376487506 edges, 187249 markings/sec, 460 secs
lola: 96737707 markings, 380559061 edges, 198019 markings/sec, 465 secs
lola: 97676801 markings, 384658004 edges, 187819 markings/sec, 470 secs
lola: 98623439 markings, 388739548 edges, 189328 markings/sec, 475 secs
lola: 99566455 markings, 392843794 edges, 188603 markings/sec, 480 secs
lola: 100460887 markings, 396988476 edges, 178886 markings/sec, 485 secs
lola: 101331376 markings, 401087695 edges, 174098 markings/sec, 490 secs
lola: 102248594 markings, 405167033 edges, 183444 markings/sec, 495 secs
lola: 103203274 markings, 409211087 edges, 190936 markings/sec, 500 secs
lola: 104114831 markings, 413247155 edges, 182311 markings/sec, 505 secs
lola: 104614111 markings, 415500314 edges, 99856 markings/sec, 510 secs
lola: 105472574 markings, 419406660 edges, 171693 markings/sec, 515 secs
lola: 106154391 markings, 422580728 edges, 136363 markings/sec, 520 secs
lola: 106956066 markings, 426038963 edges, 160335 markings/sec, 525 secs
lola: 107760038 markings, 429704093 edges, 160794 markings/sec, 530 secs
lola: 108459858 markings, 432759075 edges, 139964 markings/sec, 535 secs
lola: 109234650 markings, 436344694 edges, 154958 markings/sec, 540 secs
lola: 109779077 markings, 438898214 edges, 108885 markings/sec, 545 secs
lola: 110366460 markings, 441643859 edges, 117477 markings/sec, 550 secs
lola: 110963577 markings, 444426938 edges, 119423 markings/sec, 555 secs
lola: 111919592 markings, 448329035 edges, 191203 markings/sec, 560 secs
lola: 112814329 markings, 452256876 edges, 178947 markings/sec, 565 secs
lola: 113716836 markings, 456151428 edges, 180501 markings/sec, 570 secs
lola: 114658983 markings, 460029742 edges, 188429 markings/sec, 575 secs
lola: 115551909 markings, 463907405 edges, 178585 markings/sec, 580 secs
lola: 116379631 markings, 467700831 edges, 165544 markings/sec, 585 secs
lola: 117180096 markings, 471287311 edges, 160093 markings/sec, 590 secs
lola: 117939135 markings, 474762486 edges, 151808 markings/sec, 595 secs
lola: 118749908 markings, 478375877 edges, 162155 markings/sec, 600 secs
lola: 119604705 markings, 482208066 edges, 170959 markings/sec, 605 secs
lola: 120509847 markings, 485685919 edges, 181028 markings/sec, 610 secs
lola: 121365302 markings, 488768799 edges, 171091 markings/sec, 615 secs
lola: 121863786 markings, 490626890 edges, 99697 markings/sec, 620 secs
lola: 122614378 markings, 493558571 edges, 150118 markings/sec, 625 secs
lola: 123224348 markings, 495949831 edges, 121994 markings/sec, 630 secs
lola: 123894261 markings, 498550706 edges, 133983 markings/sec, 635 secs
lola: 124615824 markings, 501321144 edges, 144313 markings/sec, 640 secs
lola: 125346306 markings, 504035603 edges, 146096 markings/sec, 645 secs
lola: 125625644 markings, 505155632 edges, 55868 markings/sec, 650 secs
lola: 126129543 markings, 507038839 edges, 100780 markings/sec, 655 secs
lola: 126394632 markings, 508037103 edges, 53018 markings/sec, 660 secs
lola: 127053598 markings, 510607035 edges, 131793 markings/sec, 665 secs
lola: 127509104 markings, 512413118 edges, 91101 markings/sec, 670 secs
lola: 128233691 markings, 515472296 edges, 144917 markings/sec, 675 secs
lola: 128981125 markings, 518568489 edges, 149487 markings/sec, 680 secs
lola: 129529101 markings, 520899480 edges, 109595 markings/sec, 685 secs
lola: 129788086 markings, 521975648 edges, 51797 markings/sec, 690 secs
lola: 129889525 markings, 522428406 edges, 20288 markings/sec, 695 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p13)))) OR G ((((1 <= p7) AND (1 <= p91)) AND F (((1 <= p13))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p13))))
lola: processed formula length: 20
lola: 71 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: 13 markings, 13 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p7) AND (1 <= p91)) AND F (((1 <= p13)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p7) AND (1 <= p91)) AND F (((1 <= p13)))))
lola: processed formula length: 53
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no no yes no no no unknown
lola:
preliminary result: no no no yes no no no yes no no no unknown
lola: memory consumption: 3808 KB
lola: time consumption: 1394 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="DiscoveryGPU-PT-09a"
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 DiscoveryGPU-PT-09a, 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-162048902400142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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