fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of 2020-gold for SmallOperatingSystem-PT-MT0512DC0256

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16255.647 3600000.00 472460.00 56030.30 FFFTFTFFFFFFF?FF 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.r265-tall-162106800300042.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 SmallOperatingSystem-PT-MT0512DC0256, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800300042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 10 09:44 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.4K Mar 28 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 27 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 25 19:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 19:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 8.2K May 5 16:52 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 SmallOperatingSystem-PT-MT0512DC0256-00
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0256-01
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0256-02
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0256-03
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0256-04
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0256-05
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0256-06
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0256-07
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0256-08
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0256-09
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0256-10
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0256-11
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0256-12
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0256-13
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0256-14
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0256-15

=== Now, execution of the tool begins

BK_START 1621195129076

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 19:58:50] [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-16 19:58:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 19:58:50] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2021-05-16 19:58:50] [INFO ] Transformed 9 places.
[2021-05-16 19:58:50] [INFO ] Transformed 8 transitions.
[2021-05-16 19:58:50] [INFO ] Parsed PT model containing 9 places and 8 transitions in 54 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100196 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=2226 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 8 rows 9 cols
[2021-05-16 19:58:50] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-16 19:58:50] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned unsat
[2021-05-16 19:58:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
[2021-05-16 19:58:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-16 19:58:50] [INFO ] Flatten gal took : 29 ms
FORMULA SmallOperatingSystem-PT-MT0512DC0256-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0512DC0256-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 19:58:50] [INFO ] Flatten gal took : 4 ms
[2021-05-16 19:58:50] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2021-05-16 19:58:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SmallOperatingSystem-PT-MT0512DC0256 @ 3570 seconds

FORMULA SmallOperatingSystem-PT-MT0512DC0256-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0256-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0256-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0256-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0256-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0256-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0256-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0256-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0256-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0256-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SmallOperatingSystem-PT-MT0512DC0256-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0256-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0256-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2941
rslt: Output for LTLFireability @ SmallOperatingSystem-PT-MT0512DC0256

{
"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 16 19:58:51 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((X (((p4 <= 0) R (F ((p7 <= 0)) AND X (G ((1 <= p4)))))) OR ((p1 <= 0) OR (p2 <= 0)))))",
"processed_size": 93,
"rewrites": 109
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((X ((p7 <= 0)) OR (p7 <= 0))))",
"processed_size": 36,
"rewrites": 109
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((F ((1 <= p3)) AND (X (((p2 <= 0) OR (p5 <= 0))) R ((p4 <= 0) OR (p6 <= 0)))) U ((1 <= p4) AND (1 <= p6)))",
"processed_size": 109,
"rewrites": 109
},
"result":
{
"edges": 4,
"markings": 4,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 1,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X (F ((X (((p4 <= 0) OR (p6 <= 0))) AND (F ((1 <= p8)) OR X (G (((p4 <= 0) OR (p6 <= 0)))))))) OR ((1 <= p5) AND (1 <= p6))))",
"processed_size": 131,
"rewrites": 109
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((p3 <= 0) OR X (F (((1 <= p3))))))",
"processed_size": 38,
"rewrites": 109
},
"result":
{
"edges": 11,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (((1 <= p8) OR ((G (((1 <= p5) AND (1 <= p6))) AND F ((1 <= p8))) OR ((1 <= p1) AND (1 <= p2))))) AND (p8 <= 0)))",
"processed_size": 119,
"rewrites": 109
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 445
},
"child":
[

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

{
"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": 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": "((p2 <= 0) OR (p5 <= 0))",
"processed_size": 25,
"rewrites": 111
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G (((1 <= p5) AND (1 <= p6))))",
"processed_size": 33,
"rewrites": 109
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 653
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p4 <= 0)))",
"processed_size": 17,
"rewrites": 109
},
"result":
{
"edges": 5,
"markings": 4,
"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": 816
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "G ((F ((p4 <= 0)) AND F ((1 <= p3))))",
"processed_size": 37,
"rewrites": 109
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1089
},
"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 (((p5 <= 0) OR (p6 <= 0)))",
"processed_size": 29,
"rewrites": 109
},
"result":
{
"edges": 1030,
"markings": 1029,
"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": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3267
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"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": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p4)) AND (((1 <= p1) AND (1 <= p2)) OR (1 <= p4)))))",
"processed_size": 68,
"rewrites": 109
},
"result":
{
"edges": 11,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"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": 3436,
"runtime": 629.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((X((* R (F(*) AND X(G(**))))) OR (* OR *)))) : G((F(*) AND F(*))) : X(F((X(*) OR *))) : ((F(*) AND (X(*) R *)) U **) : F((X(F((X(*) AND (F(*) OR X(G(*)))))) OR *)) : G((* OR X(F(**)))) : F(G(*)) : X((X((** OR ((G(**) AND F(**)) OR **))) AND *)) : F(G((F(**) AND (** OR **)))) : (X(G(**)) OR (F(**) AND (F(**) AND (** AND **)))) : (X(G((F(**) AND (X(**) OR **)))) U (** U **)) : ((F(**) AND (** AND **)) U X(F((G(**) OR (** OR **))))) : G((G(**) OR (** OR **))) : G(*)"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no no yes no no no no no no no no unknown no no ",
"value": "no no yes no no no no no no no no unknown no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 17/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 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: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: G (NOT(X (((X (((1 <= p4) U (G ((1 <= p7)) OR X (NOT(G ((1 <= p4))))))) AND (1 <= p1)) AND (1 <= p2))))) : NOT(F ((G (((1 <= p4) U (1 <= p4))) OR G ((p3 <= 0))))) : NOT(X (G ((X ((1 <= p7)) AND (1 <= p7))))) : ((NOT(G ((p3 <= 0))) AND NOT((X (((1 <= p2) AND (1 <= p5))) U ((1 <= p4) AND (1 <= p6))))) U ((1 <= p4) AND (1 <= p6))) : NOT(G ((G (X ((G ((p8 <= 0)) U X (((1 <= p4) AND (1 <= p6)))))) AND ((p5 <= 0) OR (p6 <= 0))))) : NOT(F ((((1 <= p3) U (1 <= p3)) AND NOT(F (X (((1 <= p3)))))))) : F (X (NOT(X (G (X (G (F (((1 <= p7) U (1 <= p4)))))))))) : (X (X (((G (((1 <= p5) AND (1 <= p6))) U (1 <= p8)) OR ((1 <= p1) AND (1 <= p2))))) AND NOT(X ((1 <= p8)))) : NOT(X (G (X (F (X (NOT((((1 <= p1) AND (1 <= p2)) U (1 <= p4))))))))) : (G (X (((1 <= p5) AND (1 <= p6)))) OR (((F (((1 <= p1) AND (1 <= p2))) AND F (((1 <= p2) AND (1 <= p5)))) AND (1 <= p1)) AND (1 <= p2))) : (G (X ((X ((1 <= p7)) U (1 <= p7)))) U (((1 <= p2) AND (1 <= p5)) U ((1 <= p5) AND (1 <= p6)))) : (((F (((p1 <= 0) OR (p2 <= 0))) AND (1 <= p1)) AND (1 <= p2)) U F (X (((G (((1 <= p1) AND (1 <= p2))) OR (p1 <= 0)) OR (p2 <= 0))))) : G (((G ((1 <= p7)) OR (p4 <= 0)) OR (p6 <= 0))) : NOT(F (((1 <= p4) U ((1 <= p5) AND (1 <= p6)))))
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:416
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:329
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:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:416
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (((p4 <= 0) R (F ((p7 <= 0)) AND X (G ((1 <= p4)))))) OR ((p1 <= 0) OR (p2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (((p4 <= 0) R (F ((p7 <= 0)) AND X (G ((1 <= p4)))))) OR ((p1 <= 0) OR (p2 <= 0)))))
lola: processed formula length: 93
lola: 109 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((p7 <= 0)) OR (p7 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((p7 <= 0)) OR (p7 <= 0))))
lola: processed formula length: 36
lola: 109 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: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((1 <= p3)) AND (X (((p2 <= 0) OR (p5 <= 0))) R ((p4 <= 0) OR (p6 <= 0)))) U ((1 <= p4) AND (1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((1 <= p3)) AND (X (((p2 <= 0) OR (p5 <= 0))) R ((p4 <= 0) OR (p6 <= 0)))) U ((1 <= p4) AND (1 <= p6)))
lola: processed formula length: 109
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((X (((p4 <= 0) OR (p6 <= 0))) AND (F ((1 <= p8)) OR X (G (((p4 <= 0) OR (p6 <= 0)))))))) OR ((1 <= p5) AND (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((X (((p4 <= 0) OR (p6 <= 0))) AND (F ((1 <= p8)) OR X (G (((p4 <= 0) OR (p6 <= 0)))))))) OR ((1 <= p5) AND (1 <= p6))))
lola: processed formula length: 131
lola: 109 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p3 <= 0) OR X (F (((1 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p3 <= 0) OR X (F (((1 <= p3))))))
lola: processed formula length: 38
lola: 109 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: 9 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((1 <= p8) OR ((G (((1 <= p5) AND (1 <= p6))) AND F ((1 <= p8))) OR ((1 <= p1) AND (1 <= p2))))) AND (p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((1 <= p8) OR ((G (((1 <= p5) AND (1 <= p6))) AND F ((1 <= p8))) OR ((1 <= p1) AND (1 <= p2))))) AND (p8 <= 0)))
lola: processed formula length: 119
lola: 109 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p5) AND (1 <= p6)))) OR (F (((1 <= p1) AND (1 <= p2))) AND (F (((1 <= p2) AND (1 <= p5))) AND ((1 <= p1) AND (1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1) AND (1 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p1) AND (1 <= p2))
lola: processed formula length: 25
lola: 110 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p2) AND (1 <= p5)))
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: ((p2 <= 0) OR (p5 <= 0))
lola: processed formula length: 25
lola: 111 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p5) AND (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p5) AND (1 <= p6))))
lola: processed formula length: 33
lola: 109 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((F ((1 <= p7)) AND (X ((1 <= p7)) OR (1 <= p7))))) U (((1 <= p2) AND (1 <= p5)) U ((1 <= p5) AND (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((F ((1 <= p7)) AND (X ((1 <= p7)) OR (1 <= p7))))) U (((1 <= p2) AND (1 <= p5)) U ((1 <= p5) AND (1 <= p6))))
lola: processed formula length: 116
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((p1 <= 0) OR (p2 <= 0))) AND ((1 <= p1) AND (1 <= p2))) U X (F ((G (((1 <= p1) AND (1 <= p2))) OR ((p1 <= 0) OR (p2 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F (((p1 <= 0) OR (p2 <= 0))) AND ((1 <= p1) AND (1 <= p2))) U X (F ((G (((1 <= p1) AND (1 <= p2))) OR ((p1 <= 0) OR (p2 <= 0))))))
lola: processed formula length: 133
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 3851287 markings, 8969183 edges, 770257 markings/sec, 0 secs
lola: 6518450 markings, 16620403 edges, 533433 markings/sec, 5 secs
lola: 9092104 markings, 24050846 edges, 514731 markings/sec, 10 secs
lola: 11608256 markings, 31345021 edges, 503230 markings/sec, 15 secs
lola: 14102473 markings, 38611729 edges, 498843 markings/sec, 20 secs
lola: 16566618 markings, 45776567 edges, 492829 markings/sec, 25 secs
lola: 19057982 markings, 53051204 edges, 498273 markings/sec, 30 secs
lola: 21492856 markings, 60168774 edges, 486975 markings/sec, 35 secs
lola: 23898678 markings, 67214423 edges, 481164 markings/sec, 40 secs
lola: 26281918 markings, 74169631 edges, 476648 markings/sec, 45 secs
lola: 28641478 markings, 81070444 edges, 471912 markings/sec, 50 secs
lola: 31011709 markings, 88006786 edges, 474046 markings/sec, 55 secs
lola: 33402164 markings, 94969476 edges, 478091 markings/sec, 60 secs
lola: 35719821 markings, 101789017 edges, 463531 markings/sec, 65 secs
lola: 38032284 markings, 108571308 edges, 462493 markings/sec, 70 secs
lola: 40372485 markings, 115431490 edges, 468040 markings/sec, 75 secs
lola: 42723379 markings, 122285366 edges, 470179 markings/sec, 80 secs
lola: 45035199 markings, 129046573 edges, 462364 markings/sec, 85 secs
lola: 47310222 markings, 135732986 edges, 455005 markings/sec, 90 secs
lola: 49615150 markings, 142464122 edges, 460986 markings/sec, 95 secs
lola: 51948617 markings, 149276933 edges, 466693 markings/sec, 100 secs
lola: 54216311 markings, 155930696 edges, 453539 markings/sec, 105 secs
lola: 56471163 markings, 162544059 edges, 450970 markings/sec, 110 secs
lola: 58764269 markings, 169266121 edges, 458621 markings/sec, 115 secs
lola: 61023981 markings, 175892810 edges, 451942 markings/sec, 120 secs
lola: 63279719 markings, 182502974 edges, 451148 markings/sec, 125 secs
lola: 65593198 markings, 189269010 edges, 462696 markings/sec, 130 secs
lola: 67880831 markings, 195974900 edges, 457527 markings/sec, 135 secs
lola: 70146135 markings, 202617805 edges, 453061 markings/sec, 140 secs
lola: 72394768 markings, 209244875 edges, 449727 markings/sec, 145 secs
lola: 74700645 markings, 215978248 edges, 461175 markings/sec, 150 secs
lola: 76970065 markings, 222643883 edges, 453884 markings/sec, 155 secs
lola: 79147169 markings, 229089467 edges, 435421 markings/sec, 160 secs
lola: 81450337 markings, 235798421 edges, 460634 markings/sec, 165 secs
lola: 83741238 markings, 242538562 edges, 458180 markings/sec, 170 secs
lola: 85954854 markings, 249050718 edges, 442723 markings/sec, 175 secs
lola: 87235312 markings, 252798835 edges, 256092 markings/sec, 180 secs
lola: 88493522 markings, 256537416 edges, 251642 markings/sec, 185 secs
lola: 90125765 markings, 261331713 edges, 326449 markings/sec, 190 secs
lola: 91591329 markings, 265613913 edges, 293113 markings/sec, 195 secs
lola: 92988836 markings, 269740524 edges, 279501 markings/sec, 200 secs
lola: 94964694 markings, 275571288 edges, 395172 markings/sec, 205 secs
lola: 95493468 markings, 277118703 edges, 105755 markings/sec, 210 secs
lola: 95493468 markings, 277118703 edges, 0 markings/sec, 215 secs
lola: 96237940 markings, 279298620 edges, 148894 markings/sec, 220 secs
lola: 97294304 markings, 282423486 edges, 211273 markings/sec, 225 secs
lola: 97625940 markings, 283399610 edges, 66327 markings/sec, 230 secs
lola: 99654437 markings, 289394244 edges, 405699 markings/sec, 235 secs
lola: 99910111 markings, 290151098 edges, 51135 markings/sec, 240 secs
lola: 99910111 markings, 290151098 edges, 0 markings/sec, 245 secs
lola: 101616289 markings, 295151852 edges, 341236 markings/sec, 250 secs
lola: 102310617 markings, 297179029 edges, 138866 markings/sec, 255 secs
lola: 102949105 markings, 299052167 edges, 127698 markings/sec, 260 secs
lola: 103611964 markings, 300997709 edges, 132572 markings/sec, 265 secs
lola: 105226542 markings, 305746849 edges, 322916 markings/sec, 270 secs
lola: 106137507 markings, 308428521 edges, 182193 markings/sec, 275 secs
lola: 107656832 markings, 312896917 edges, 303865 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 653 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p4 <= 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 ((p4 <= 0)))
lola: processed formula length: 17
lola: 109 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: 4 markings, 5 edges
lola: ========================================
lola: subprocess 10 will run for 816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p4 <= 0)) AND F ((1 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p4 <= 0)) AND F ((1 <= p3))))
lola: processed formula length: 37
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 11 will run for 1089 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p5 <= 0) OR (p6 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p5 <= 0) OR (p6 <= 0)))
lola: processed formula length: 29
lola: 109 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: 1029 markings, 1030 edges
lola: ========================================
lola: subprocess 12 will run for 1633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((1 <= p7)) OR ((p4 <= 0) OR (p6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((1 <= p7)) OR ((p4 <= 0) OR (p6 <= 0))))
lola: processed formula length: 47
lola: 109 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 13 will run for 3267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p4)) AND (((1 <= p1) AND (1 <= p2)) OR (1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p4)) AND (((1 <= p1) AND (1 <= p2)) OR (1 <= p4)))))
lola: processed formula length: 68
lola: 109 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: 9 markings, 11 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((F (((p1 <= 0) OR (p2 <= 0))) AND ((1 <= p1) AND (1 <= p2))) U X (F ((G (((1 <= p1) AND (1 <= p2))) OR ((p1 <= 0) OR (p2 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F (((p1 <= 0) OR (p2 <= 0))) AND ((1 <= p1) AND (1 <= p2))) U X (F ((G (((1 <= p1) AND (1 <= p2))) OR ((p1 <= 0) OR (p2 <= 0))))))
lola: processed formula length: 133
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 3838829 markings, 8931725 edges, 767766 markings/sec, 0 secs
lola: 6524939 markings, 16637203 edges, 537222 markings/sec, 5 secs
lola: 9106710 markings, 24095276 edges, 516354 markings/sec, 10 secs
lola: 11632863 markings, 31415513 edges, 505231 markings/sec, 15 secs
lola: 14132427 markings, 38699551 edges, 499913 markings/sec, 20 secs
lola: 16609276 markings, 45896888 edges, 495370 markings/sec, 25 secs
lola: 19101170 markings, 53180251 edges, 498379 markings/sec, 30 secs
lola: 21547286 markings, 60331799 edges, 489223 markings/sec, 35 secs
lola: 23979828 markings, 67449980 edges, 486508 markings/sec, 40 secs
lola: 26398223 markings, 74515046 edges, 483679 markings/sec, 45 secs
lola: 28794330 markings, 81521191 edges, 479221 markings/sec, 50 secs
lola: 31197573 markings, 88562141 edges, 480649 markings/sec, 55 secs
lola: 33620545 markings, 95616590 edges, 484594 markings/sec, 60 secs
lola: 35982718 markings, 102563007 edges, 472435 markings/sec, 65 secs
lola: 38307887 markings, 109387669 edges, 465034 markings/sec, 70 secs
lola: 40707196 markings, 116409926 edges, 479862 markings/sec, 75 secs
lola: 43090158 markings, 123370955 edges, 476592 markings/sec, 80 secs
lola: 45437416 markings, 130240669 edges, 469452 markings/sec, 85 secs
lola: 47745355 markings, 136997897 edges, 461588 markings/sec, 90 secs
lola: 50100383 markings, 143883175 edges, 471006 markings/sec, 95 secs
lola: 52464861 markings, 150775820 edges, 472896 markings/sec, 100 secs
lola: 54783397 markings, 157585434 edges, 463707 markings/sec, 105 secs
lola: 57080517 markings, 164322122 edges, 459424 markings/sec, 110 secs
lola: 59350823 markings, 170999876 edges, 454061 markings/sec, 115 secs
lola: 61668063 markings, 177790274 edges, 463448 markings/sec, 120 secs
lola: 64002264 markings, 184589648 edges, 466840 markings/sec, 125 secs
lola: 66328225 markings, 191419899 edges, 465192 markings/sec, 130 secs
lola: 68657160 markings, 198251171 edges, 465787 markings/sec, 135 secs
lola: 70926188 markings, 204916842 edges, 453806 markings/sec, 140 secs
lola: 73208649 markings, 211644366 edges, 456492 markings/sec, 145 secs
lola: 75582488 markings, 218554338 edges, 474768 markings/sec, 150 secs
lola: 77824023 markings, 225183408 edges, 448307 markings/sec, 155 secs
lola: 80094242 markings, 231849483 edges, 454044 markings/sec, 160 secs
lola: 82457018 markings, 238742842 edges, 472555 markings/sec, 165 secs
lola: 85517569 markings, 247758163 edges, 612110 markings/sec, 170 secs
lola: 86744530 markings, 251351262 edges, 245392 markings/sec, 175 secs
lola: 87694423 markings, 254159049 edges, 189979 markings/sec, 180 secs
lola: 87850914 markings, 254625170 edges, 31298 markings/sec, 185 secs
lola: 87850914 markings, 254625170 edges, 0 markings/sec, 190 secs
lola: 88846982 markings, 257581923 edges, 199214 markings/sec, 195 secs
lola: 90143743 markings, 261384814 edges, 259352 markings/sec, 200 secs
lola: 92280971 markings, 267646669 edges, 427446 markings/sec, 205 secs
lola: 92412765 markings, 268024363 edges, 26359 markings/sec, 210 secs
lola: 92412765 markings, 268024363 edges, 0 markings/sec, 215 secs
lola: 93341228 markings, 270766776 edges, 185693 markings/sec, 220 secs
lola: 94690770 markings, 274755579 edges, 269908 markings/sec, 225 secs
lola: 94690770 markings, 274755579 edges, 0 markings/sec, 230 secs
lola: 94690770 markings, 274755579 edges, 0 markings/sec, 235 secs
lola: 96595410 markings, 280356487 edges, 380928 markings/sec, 240 secs
lola: 96928012 markings, 281326003 edges, 66520 markings/sec, 245 secs
lola: 96945899 markings, 281381635 edges, 3577 markings/sec, 250 secs
lola: 97644660 markings, 283453112 edges, 139752 markings/sec, 255 secs
lola: 99235635 markings, 288144409 edges, 318195 markings/sec, 260 secs
lola: 101346305 markings, 294353182 edges, 422134 markings/sec, 265 secs
lola: 101504850 markings, 294822837 edges, 31709 markings/sec, 270 secs
lola: 102806295 markings, 298631339 edges, 260289 markings/sec, 275 secs
lola: 103818691 markings, 301612948 edges, 202479 markings/sec, 280 secs
lola: 104595405 markings, 303898217 edges, 155343 markings/sec, 285 secs
lola: 106436917 markings, 309317061 edges, 368302 markings/sec, 290 secs
lola: 107685879 markings, 312982359 edges, 249792 markings/sec, 295 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no no no unknown no no
lola:
preliminary result: no no yes no no no no no no no no unknown no no
lola: memory consumption: 3436 KB
lola: time consumption: 629 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="SmallOperatingSystem-PT-MT0512DC0256"
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 SmallOperatingSystem-PT-MT0512DC0256, 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 r265-tall-162106800300042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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