fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of 2020-gold for DatabaseWithMutex-COL-02

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4279.260 3600000.00 9677.00 230.00 FFFFTTTTFTFFFTFT 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.r075-tall-162039097500338.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 DatabaseWithMutex-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097500338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 17:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 17:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 19K 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 DatabaseWithMutex-COL-02-00
FORMULA_NAME DatabaseWithMutex-COL-02-01
FORMULA_NAME DatabaseWithMutex-COL-02-02
FORMULA_NAME DatabaseWithMutex-COL-02-03
FORMULA_NAME DatabaseWithMutex-COL-02-04
FORMULA_NAME DatabaseWithMutex-COL-02-05
FORMULA_NAME DatabaseWithMutex-COL-02-06
FORMULA_NAME DatabaseWithMutex-COL-02-07
FORMULA_NAME DatabaseWithMutex-COL-02-08
FORMULA_NAME DatabaseWithMutex-COL-02-09
FORMULA_NAME DatabaseWithMutex-COL-02-10
FORMULA_NAME DatabaseWithMutex-COL-02-11
FORMULA_NAME DatabaseWithMutex-COL-02-12
FORMULA_NAME DatabaseWithMutex-COL-02-13
FORMULA_NAME DatabaseWithMutex-COL-02-14
FORMULA_NAME DatabaseWithMutex-COL-02-15

=== Now, execution of the tool begins

BK_START 1620567153952

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 13:32:35] [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-09 13:32:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 13:32:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-09 13:32:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 560 ms
[2021-05-09 13:32:36] [INFO ] sort/places :
site->all_active,all_passive,
file->Mutex,
SF->RecBuff,Active,Message,Modify,MesBuffReply,Acknowledge,updating,WaitMutex,

[2021-05-09 13:32:36] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 38 PT places and 32.0 transition bindings in 14 ms.
[2021-05-09 13:32:36] [INFO ] Computed order based on color domains.
[2021-05-09 13:32:36] [INFO ] Unfolded HLPN to a Petri net with 38 places and 32 transitions in 14 ms.
[2021-05-09 13:32:36] [INFO ] Unfolded HLPN properties in 0 ms.
[2021-05-09 13:32:36] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-09 13:32:36] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-09 13:32:36] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-09 13:32:36] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-09 13:32:36] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-09 13:32:36] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-09 13:32:36] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-09 13:32:36] [INFO ] Reduced 2 identical enabling conditions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 39 steps, including 0 resets, run visited all 34 properties in 3 ms. (steps per millisecond=13 )
[2021-05-09 13:32:36] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-09 13:32:36] [INFO ] Flatten gal took : 25 ms
FORMULA DatabaseWithMutex-COL-02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-02-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 13:32:36] [INFO ] Applying decomposition
[2021-05-09 13:32:36] [INFO ] Flatten gal took : 7 ms
[2021-05-09 13:32:36] [INFO ] Decomposing Gal with order
[2021-05-09 13:32:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 13:32:36] [INFO ] Removed a total of 12 redundant transitions.
[2021-05-09 13:32:36] [INFO ] Flatten gal took : 30 ms
[2021-05-09 13:32:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-09 13:32:36] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-09 13:32:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DatabaseWithMutex-COL-02 @ 3570 seconds

FORMULA DatabaseWithMutex-COL-02-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-COL-02-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-COL-02-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-COL-02-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-COL-02-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-COL-02-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-COL-02-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-COL-02-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-COL-02-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-COL-02-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-COL-02-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DatabaseWithMutex-COL-02-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ DatabaseWithMutex-COL-02

{
"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": "Sun May 9 13:32:37 2021
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0)))",
"processed_size": 61,
"rewrites": 101
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)))",
"processed_size": 121,
"rewrites": 103
},
"result":
{
"edges": 86,
"markings": 79,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"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": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23)))",
"processed_size": 61,
"rewrites": 101
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"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": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 1,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X (G ((X ((((p11 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p35 <= 0)))) OR ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0)))))",
"processed_size": 200,
"rewrites": 101
},
"result":
{
"edges": 131,
"markings": 112,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 4,
"aconj": 9,
"adisj": 3,
"aneg": 2,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X (X ((X (X ((((p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)) OR (((p11 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p35 <= 0)))))) OR F ((((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)))))))",
"processed_size": 336,
"rewrites": 101
},
"result":
{
"edges": 16,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))))",
"processed_size": 189,
"rewrites": 101
},
"result":
{
"edges": 184,
"markings": 117,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 5,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F ((F ((((p3 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p28 <= 0)) AND ((p2 <= 0) OR (p29 <= 0)) AND ((p1 <= 0) OR (p28 <= 0)))) AND X (((1 <= p4) OR (1 <= p5)))))",
"processed_size": 165,
"rewrites": 101
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 5,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 9,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G ((G (F ((X (((1 <= p4) OR (1 <= p5))) OR ((1 <= p4) OR (1 <= p5))))) OR ((1 <= p12) OR ((1 <= p13) OR ((1 <= p14) OR ((1 <= p15) OR ((1 <= p4) OR ((1 <= p5) OR (((p11 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p35 <= 0)))))))))))",
"processed_size": 296,
"rewrites": 101
},
"result":
{
"edges": 1160,
"markings": 454,
"produced_by": "LTL model checker",
"value": true
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 4,
"aconj": 13,
"adisj": 7,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(X (X ((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))))) U (F ((((p3 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p28 <= 0)) AND ((p2 <= 0) OR (p29 <= 0)) AND ((p1 <= 0) OR (p28 <= 0)))) AND X (F ((X (G ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28))))) AND (((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28))))))))",
"processed_size": 535,
"rewrites": 101
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 1,
"aconj": 12,
"adisj": 5,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X (G ((F ((F (G ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28))))) AND ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23)))) AND (F ((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))) OR (F (G ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28))))) AND ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23)))))))",
"processed_size": 536,
"rewrites": 101
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G (((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0))))",
"processed_size": 65,
"rewrites": 101
},
"result":
{
"edges": 11,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))))",
"processed_size": 65,
"rewrites": 101
},
"result":
{
"edges": 329,
"markings": 181,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 3,
"aneg": 3,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 5,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "F (G ((G (F ((G ((((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)))) OR (((p4 <= 0) AND (p5 <= 0)) AND (((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0))))))) AND ((p12 <= 0) AND ((p13 <= 0) AND ((p14 <= 0) AND (p15 <= 0)))))))",
"processed_size": 368,
"rewrites": 101
},
"result":
{
"edges": 38,
"markings": 36,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 11,
"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": 46544,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((X(X(G(**))) AND (X(F(**)) OR (** OR (** OR (** OR **)))))) : (G(*) OR (F(**) AND X(**))) : X(G((X(*) OR **))) : X(X((X(X(*)) OR F(*)))) : X(F(**)) : F((F(**) AND X(**))) : F(G((G(F((G(*) OR (* AND *)))) AND (** AND (** AND (** AND **)))))) : G((G(F((X(**) OR (** OR **)))) OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))) : F(G(**)) : (X(X(**)) U (F(**) AND X(F((X(G(**)) AND **))))) : X(G((F((F(G(**)) AND **)) AND (F(**) OR (F(G(**)) AND **))))) : G(F(*))"
},
"net":
{
"arcs": 88,
"conflict_clusters": 26,
"places": 38,
"places_significant": 28,
"singleton_clusters": 0,
"transitions": 32
},
"result":
{
"preliminary_value": "no no no yes yes yes no yes no no no yes ",
"value": "no no no yes yes yes no yes no no no yes "
},
"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: 70/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1216
lola: finding significant places
lola: 38 places, 32 transitions, 28 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: G ((X (X (G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0))))) AND ((((F (X (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19)))) OR (1 <= p32)) OR (1 <= p33)) OR (1 <= p30)) OR (1 <= p31)))) : (G (NOT((((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23)) U F (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23)))))) OR ((((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23)) U F ((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27))))) AND X (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23))))) : G (X ((NOT(X ((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))))) OR ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0))))) : X (NOT(X ((X (X ((((1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15)) AND (((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35)))))) AND G ((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))))))) : F (X (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27))))) : F ((F ((((p3 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p28 <= 0)) AND ((p2 <= 0) OR (p29 <= 0)) AND ((p1 <= 0) OR (p28 <= 0)))) AND X (((1 <= p4) OR (1 <= p5))))) : F (G (F (G (((((F (NOT(F (G ((((1 <= p4) OR (1 <= p5)) U (((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))))))) AND (p12 <= 0)) AND (p13 <= 0)) AND (p14 <= 0)) AND (p15 <= 0)))))) : G ((((((((G (F (((X (((1 <= p4) OR (1 <= p5))) OR (1 <= p4)) OR (1 <= p5)))) OR (1 <= p12)) OR (1 <= p13)) OR (1 <= p14)) OR (1 <= p15)) OR (1 <= p4)) OR (1 <= p5)) OR (((p11 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p35 <= 0))))) : F (X (F (X (X (X (X (F (G (F (G (((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0))))))))))))) : (X (X ((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))))) U (F ((((p3 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p28 <= 0)) AND ((p2 <= 0) OR (p29 <= 0)) AND ((p1 <= 0) OR (p28 <= 0)))) AND F (X ((X (G ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28))))) AND (((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28)))))))) : G (NOT(X (NOT((F ((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))) U (F (G ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28))))) AND ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23)))))))) : G (NOT(G (X (G (((p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0))))) AND (X (F (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19)))) OR ((1 <= p32) OR ((1 <= p33) OR ((1 <= p30) OR (1 <= p31)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (G (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0))))) AND (X (F (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19)))) OR ((1 <= p32) OR ((1 <= p33) OR ((1 <= p30) OR (1 <= p31)))))))
lola: processed formula length: 209
lola: 101 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0))) OR (F ((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))) AND X (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23)))))
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: G (((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0)))
lola: processed formula length: 61
lola: 101 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27))))
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: (((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)))
lola: processed formula length: 121
lola: 103 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 79 markings, 86 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23)))
lola: processed formula length: 61
lola: 101 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: 10 markings, 10 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 (G ((X ((((p11 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p35 <= 0)))) OR ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((((p11 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p35 <= 0)))) OR ((p20 <= 0) AND (p21 <= 0) AND (p22 <= 0) AND (p23 <= 0)))))
lola: processed formula length: 200
lola: 101 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: 112 markings, 131 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (X ((((p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)) OR (((p11 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p35 <= 0)))))) OR F ((((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (X ((((p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p15 <= 0)) OR (((p11 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p35 <= 0)))))) OR F ((((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)))))))
lola: processed formula length: 336
lola: 101 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 13 markings, 16 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))))
lola: processed formula length: 189
lola: 101 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 117 markings, 184 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((((p3 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p28 <= 0)) AND ((p2 <= 0) OR (p29 <= 0)) AND ((p1 <= 0) OR (p28 <= 0)))) AND X (((1 <= p4) OR (1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((((p3 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p28 <= 0)) AND ((p2 <= 0) OR (p29 <= 0)) AND ((p1 <= 0) OR (p28 <= 0)))) AND X (((1 <= p4) OR (1 <= p5)))))
lola: processed formula length: 165
lola: 101 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (F ((X (((1 <= p4) OR (1 <= p5))) OR ((1 <= p4) OR (1 <= p5))))) OR ((1 <= p12) OR ((1 <= p13) OR ((1 <= p14) OR ((1 <= p15) OR ((1 <= p4) OR ((1 <= p5) OR (((p11 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p35 <= 0)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (F ((X (((1 <= p4) OR (1 <= p5))) OR ((1 <= p4) OR (1 <= p5))))) OR ((1 <= p12) OR ((1 <= p13) OR ((1 <= p14) OR ((1 <= p15) OR ((1 <= p4) OR ((1 <= p5) OR (((p11 <= 0) OR (p37 <= 0)) AND ((p10 <= 0) OR (p36 <= 0)) AND ((p10 <= 0) OR (p34 <= 0)) AND ((p11 <= 0) OR (p35 <= 0)))))))))))
lola: processed formula length: 296
lola: 101 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: 454 markings, 1160 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))))) U (F ((((p3 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p28 <= 0)) AND ((p2 <= 0) OR (p29 <= 0)) AND ((p1 <= 0) OR (p28 <= 0)))) AND X (F ((X (G ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X ((((1 <= p11) AND (1 <= p37)) OR ((1 <= p10) AND (1 <= p36)) OR ((1 <= p10) AND (1 <= p34)) OR ((1 <= p11) AND (1 <= p35))))) U (F ((((p3 <= 0) OR (p29 <= 0)) AND ((p0 <= 0) OR (p28 <= 0)) AND ((p2 <= 0) OR (p29 <= 0)) AND ((p1 <= 0) OR (p28 <= 0)))) AND X (F ((X (G ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28)... (shortened)
lola: processed formula length: 535
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((F (G ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28))))) AND ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23)))) AND (F ((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))) OR (F (G ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((F (G ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p28)) OR ((1 <= p2) AND (1 <= p29)) OR ((1 <= p1) AND (1 <= p28))))) AND ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23)))) AND (F ((((1 <= p8) AND (1 <= p24)) OR ((1 <= p9) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p27)))) OR (F (G ((((1 <= p3) AND (1 <= p29)) OR ((1 <= p0) AND (1 <= p... (shortened)
lola: processed formula length: 536
lola: 101 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 9 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 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 (((p32 <= 0) AND (p33 <= 0) AND (p30 <= 0) AND (p31 <= 0))))
lola: processed formula length: 65
lola: 101 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 17
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 11 edges
lola: ========================================
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))))
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 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p15))))
lola: processed formula length: 65
lola: 101 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: 181 markings, 329 edges
lola: ========================================
lola: subprocess 11 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F ((G ((((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)))) OR (((p4 <= 0) AND (p5 <= 0)) AND (((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0))))))) AND ((p12 <= 0) AND ((p13 <= 0) AND ((p14 <= 0) AND (p15 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F ((G ((((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)))) OR (((p4 <= 0) AND (p5 <= 0)) AND (((p8 <= 0) OR (p24 <= 0)) AND ((p9 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p27 <= 0))))))) AND ((p12 <= 0) AND ((p13 <= 0) AND ((p14 <= 0) AND (p15 <= 0)))))))
lola: processed formula length: 368
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 36 markings, 38 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes yes no yes no no no yes
lola:
preliminary result: no no no yes yes yes no yes no no no yes
lola: memory consumption: 46544 KB
lola: time consumption: 3 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="DatabaseWithMutex-COL-02"
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 DatabaseWithMutex-COL-02, 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 r075-tall-162039097500338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-COL-02.tgz
mv DatabaseWithMutex-COL-02 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 ;