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-162106800300062.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-MT4096DC1024, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800300062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K 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.5K Mar 28 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 28 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Mar 27 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 27 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 19:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 19:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K 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.1K 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-MT4096DC1024-00
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-01
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-02
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-03
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-04
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-05
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-06
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-07
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-08
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-09
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-10
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-11
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-12
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-13
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-14
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC1024-15

=== Now, execution of the tool begins

BK_START 1621195803352

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

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

FORMULA SmallOperatingSystem-PT-MT4096DC1024-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SmallOperatingSystem-PT-MT4096DC1024-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SmallOperatingSystem-PT-MT4096DC1024-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SmallOperatingSystem-PT-MT4096DC1024-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SmallOperatingSystem-PT-MT4096DC1024-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT4096DC1024-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2972
rslt: Output for LTLFireability @ SmallOperatingSystem-PT-MT4096DC1024

{
"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 20:10:08 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((X ((X ((1 <= p8)) OR (p4 <= 0))) OR G ((1 <= p8)))))",
"processed_size": 59,
"rewrites": 60
},
"result":
{
"edges": 46,
"markings": 30,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((X ((1 <= p4)) AND (1 <= p8))))",
"processed_size": 37,
"rewrites": 60
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 396
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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 <= p4) AND (1 <= p6))",
"processed_size": 25,
"rewrites": 61
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X ((p3 <= 0)) AND F (((p1 <= 0) OR (p2 <= 0)))))",
"processed_size": 53,
"rewrites": 60
},
"result":
{
"edges": 5,
"markings": 5,
"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": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((1 <= p4)))",
"processed_size": 17,
"rewrites": 60
},
"result":
{
"edges": 2048,
"markings": 2049,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (X ((F ((1 <= p3)) U G (((1 <= p1) AND (1 <= p2)))))))",
"processed_size": 59,
"rewrites": 60
},
"result":
{
"edges": 50319369,
"markings": 25165830,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 590
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 708
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((p8 <= 0))",
"processed_size": 13,
"rewrites": 60
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 885
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((1 <= p8)))",
"processed_size": 17,
"rewrites": 60
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1622
},
"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": 61
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3245
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p1) AND (1 <= p2))))",
"processed_size": 33,
"rewrites": 60
},
"result":
{
"edges": 13614802,
"markings": 6286435,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1618
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((F ((1 <= p3)) U (1 <= p4)) OR (1 <= p4))))",
"processed_size": 50,
"rewrites": 60
},
"result":
{
"edges": 11,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p3)",
"processed_size": 9,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p3)",
"processed_size": 9,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p3 <= 0)",
"processed_size": 9,
"rewrites": 62
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3596,
"runtime": 598.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((X((X(**) OR *)) OR G(*)))) : X(G((X(**) AND **))) : F(G(((F(**) U **) OR **))) : (F((X(*) AND F(*))) OR (X((X(**) U **)) AND (** AND **))) : X(F(**)) : X(X(X((F(**) U G(*))))) : (** OR ((G(F(**)) AND F(**)) OR **)) : (X(F(**)) OR (G(*) OR **)) : X(G((F(**) AND (F((** AND ((* R *) OR X(*)))) OR **)))) : F((F((G(*) AND *)) OR X(F(*)))) : ((G(**) OR (G((X(*) OR **)) AND F(G(**)))) AND (** AND **))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no no no no yes no no yes unknown no no ",
"value": "no no no no yes no no yes 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: 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(G (((NOT(X (X ((1 <= p8)))) AND X ((1 <= p4))) AND F ((p8 <= 0)))))) : G (X ((X ((1 <= p4)) AND (1 <= p8)))) : G (F (G (((F ((1 <= p3)) U (1 <= p4)) OR (1 <= p4))))) : (F ((NOT(X ((1 <= p3))) AND NOT(G (((1 <= p1) AND (1 <= p2)))))) OR ((X ((X (((1 <= p2) AND (1 <= p5))) U (1 <= p3))) AND (1 <= p4)) AND (1 <= p6))) : F (X ((1 <= p4))) : X (X ((X (F ((1 <= p3))) U G (X (G (NOT(F (((p1 <= 0) OR (p2 <= 0)))))))))) : ((G (X (F ((1 <= p3)))) U (1 <= p3)) OR (1 <= p3)) : ((X (F ((1 <= p8))) OR NOT(F ((NOT(X ((1 <= p8))) U (1 <= p8))))) OR (1 <= p8)) : X (G ((F ((((p2 <= 0) OR (p5 <= 0)) AND (NOT((((1 <= p1) AND (1 <= p2)) U ((1 <= p2) AND (1 <= p5)))) OR NOT(X (((1 <= p1) AND (1 <= p2))))))) U ((1 <= p1) AND (1 <= p2))))) : F ((NOT(G ((NOT(G (NOT(F ((1 <= p4))))) OR ((1 <= p1) AND (1 <= p2))))) OR X (NOT(G (((1 <= p1) AND (1 <= p2))))))) : (((G ((NOT(X (((1 <= p1) AND (1 <= p2)))) OR (1 <= p7))) U G (((1 <= p1) AND (1 <= p2)))) AND (1 <= p1)) AND (1 <= p2))
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:525
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((X ((1 <= p8)) OR (p4 <= 0))) OR G ((1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((X ((1 <= p8)) OR (p4 <= 0))) OR G ((1 <= p8)))))
lola: processed formula length: 59
lola: 60 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: 30 markings, 46 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((1 <= p4)) AND (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((1 <= p4)) AND (1 <= p8))))
lola: processed formula length: 37
lola: 60 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X ((p3 <= 0)) AND F (((p1 <= 0) OR (p2 <= 0))))) OR (X ((X (((1 <= p2) AND (1 <= p5))) U (1 <= p3))) AND ((1 <= p4) AND (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p4) AND (1 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((1 <= p4) AND (1 <= p6))
lola: processed formula length: 25
lola: 61 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((p3 <= 0)) AND F (((p1 <= 0) OR (p2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p3 <= 0)) AND F (((p1 <= 0) OR (p2 <= 0)))))
lola: processed formula length: 53
lola: 60 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 3 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p4)))
lola: processed formula length: 17
lola: 60 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: 2049 markings, 2048 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X ((F ((1 <= p3)) U G (((1 <= p1) AND (1 <= p2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X ((F ((1 <= p3)) U G (((1 <= p1) AND (1 <= p2)))))))
lola: processed formula length: 59
lola: 60 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: 4527169 markings, 9049937 edges, 905434 markings/sec, 0 secs
lola: 8902215 markings, 17799384 edges, 875009 markings/sec, 5 secs
lola: 13729853 markings, 27452496 edges, 965528 markings/sec, 10 secs
lola: 18573953 markings, 37138597 edges, 968820 markings/sec, 15 secs
lola: 23516891 markings, 47022297 edges, 988588 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25165830 markings, 50319369 edges
lola: ========================================
lola: subprocess 5 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((1 <= p8))) OR (G ((p8 <= 0)) OR (1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 60 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p8 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p8 <= 0))
lola: processed formula length: 13
lola: 60 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p8)))
lola: processed formula length: 17
lola: 60 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: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (((1 <= p1) AND (1 <= p2))) AND (F ((((p2 <= 0) OR (p5 <= 0)) AND ((((p1 <= 0) OR (p2 <= 0)) R ((p2 <= 0) OR (p5 <= 0))) OR X (((p1 <= 0) OR (p2 <= 0)))))) OR ((1 <= p1) AND (1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (((1 <= p1) AND (1 <= p2))) AND (F ((((p2 <= 0) OR (p5 <= 0)) AND ((((p1 <= 0) OR (p2 <= 0)) R ((p2 <= 0) OR (p5 <= 0))) OR X (((p1 <= 0) OR (p2 <= 0)))))) OR ((1 <= p1) AND (1 <= p2))))))
lola: processed formula length: 201
lola: 60 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: 3099794 markings, 7704667 edges, 619959 markings/sec, 0 secs
lola: 6015627 markings, 14969521 edges, 583167 markings/sec, 5 secs
lola: 8958284 markings, 22305332 edges, 588531 markings/sec, 10 secs
lola: 11802705 markings, 29398083 edges, 568884 markings/sec, 15 secs
lola: 14625438 markings, 36438679 edges, 564547 markings/sec, 20 secs
lola: 17401946 markings, 43364677 edges, 555302 markings/sec, 25 secs
lola: 20152352 markings, 50225945 edges, 550081 markings/sec, 30 secs
lola: 22936944 markings, 57173945 edges, 556918 markings/sec, 35 secs
lola: 25633886 markings, 63902596 edges, 539388 markings/sec, 40 secs
lola: 28312054 markings, 70585993 edges, 535634 markings/sec, 45 secs
lola: 30937421 markings, 77138000 edges, 525073 markings/sec, 50 secs
lola: 33635525 markings, 83871165 edges, 539621 markings/sec, 55 secs
lola: 36272563 markings, 90452360 edges, 527408 markings/sec, 60 secs
lola: 38893886 markings, 96995064 edges, 524265 markings/sec, 65 secs
lola: 41499029 markings, 103496795 edges, 521029 markings/sec, 70 secs
lola: 44078403 markings, 109935341 edges, 515875 markings/sec, 75 secs
lola: 46688842 markings, 116451065 edges, 522088 markings/sec, 80 secs
lola: 49451320 markings, 123346590 edges, 552496 markings/sec, 85 secs
lola: 52155996 markings, 130099138 edges, 540935 markings/sec, 90 secs
lola: 54821668 markings, 136753545 edges, 533134 markings/sec, 95 secs
lola: 57539156 markings, 143537179 edges, 543498 markings/sec, 100 secs
lola: 60212093 markings, 150209094 edges, 534587 markings/sec, 105 secs
lola: 62866113 markings, 156835065 edges, 530804 markings/sec, 110 secs
lola: 65498309 markings, 163406264 edges, 526439 markings/sec, 115 secs
lola: 68191703 markings, 170130371 edges, 538679 markings/sec, 120 secs
lola: 70815054 markings, 176680596 edges, 524670 markings/sec, 125 secs
lola: 73442544 markings, 183241457 edges, 525498 markings/sec, 130 secs
lola: 76039698 markings, 189723706 edges, 519431 markings/sec, 135 secs
lola: 78671146 markings, 196295895 edges, 526290 markings/sec, 140 secs
lola: 81269086 markings, 202781480 edges, 519588 markings/sec, 145 secs
lola: 83412732 markings, 208132643 edges, 428729 markings/sec, 150 secs
lola: 85500350 markings, 213434787 edges, 417524 markings/sec, 155 secs
lola: 87636763 markings, 218680339 edges, 427283 markings/sec, 160 secs
lola: 88706209 markings, 221349703 edges, 213889 markings/sec, 165 secs
lola: 88912938 markings, 221867062 edges, 41346 markings/sec, 170 secs
lola: 90152503 markings, 224962017 edges, 247913 markings/sec, 175 secs
lola: 90152503 markings, 224962017 edges, 0 markings/sec, 180 secs
lola: 92058053 markings, 229719139 edges, 381110 markings/sec, 185 secs
lola: 92438855 markings, 230669795 edges, 76160 markings/sec, 190 secs
lola: 92447287 markings, 230690908 edges, 1686 markings/sec, 195 secs
lola: 94334978 markings, 235405063 edges, 377538 markings/sec, 200 secs
lola: 96379345 markings, 240509121 edges, 408873 markings/sec, 205 secs
lola: 97086685 markings, 242276774 edges, 141468 markings/sec, 210 secs
lola: 98497685 markings, 245798164 edges, 282200 markings/sec, 215 secs
lola: 99764674 markings, 248963820 edges, 253398 markings/sec, 220 secs
lola: 101953448 markings, 254428834 edges, 437755 markings/sec, 225 secs
lola: 103258983 markings, 257688453 edges, 261107 markings/sec, 230 secs
lola: 104065114 markings, 259700810 edges, 161226 markings/sec, 235 secs
lola: 104389662 markings, 260510491 edges, 64910 markings/sec, 240 secs
lola: 104389787 markings, 260510827 edges, 25 markings/sec, 245 secs
lola: 104390665 markings, 260513143 edges, 176 markings/sec, 250 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 813 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((G ((p4 <= 0)) AND ((p1 <= 0) OR (p2 <= 0)))) OR X (F (((p1 <= 0) OR (p2 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((G ((p4 <= 0)) AND ((p1 <= 0) OR (p2 <= 0)))) OR X (F (((p1 <= 0) OR (p2 <= 0))))))
lola: processed formula length: 92
lola: 60 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 8 will run for 1084 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((1 <= p1) AND (1 <= p2))) OR (G ((X (((p1 <= 0) OR (p2 <= 0))) OR (1 <= p7))) AND F (G (((1 <= p1) AND (1 <= p2)))))) AND ((1 <= p1) AND (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1084 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p1) AND (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p1) AND (1 <= p2)))
lola: processed formula length: 29
lola: 60 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: 4227058 markings, 9154724 edges, 845412 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6276196 markings, 13590235 edges
lola: ========================================
lola: subprocess 9 will run for 1622 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: 61 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 10 will run for 3245 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p1) AND (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p1) AND (1 <= p2))))
lola: processed formula length: 33
lola: 60 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: 4268939 markings, 9245217 edges, 853788 markings/sec, 0 secs
lola: add low 6
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: 6286435 markings, 13614802 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 1618 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((F ((1 <= p3)) U (1 <= p4)) 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 <= p3)) U (1 <= p4)) OR (1 <= p4))))
lola: processed formula length: 50
lola: 60 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: 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: subprocess 10 will run for 3237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p3) OR ((G (F ((1 <= p3))) AND F ((1 <= p3))) OR (1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p3)
lola: processed formula length: 9
lola: 60 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p3))
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: (p3 <= 0)
lola: processed formula length: 9
lola: 62 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((F (((1 <= p1) AND (1 <= p2))) AND (F ((((p2 <= 0) OR (p5 <= 0)) AND ((((p1 <= 0) OR (p2 <= 0)) R ((p2 <= 0) OR (p5 <= 0))) OR X (((p1 <= 0) OR (p2 <= 0)))))) OR ((1 <= p1) AND (1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (((1 <= p1) AND (1 <= p2))) AND (F ((((p2 <= 0) OR (p5 <= 0)) AND ((((p1 <= 0) OR (p2 <= 0)) R ((p2 <= 0) OR (p5 <= 0))) OR X (((p1 <= 0) OR (p2 <= 0)))))) OR ((1 <= p1) AND (1 <= p2))))))
lola: processed formula length: 201
lola: 60 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: 3119617 markings, 7754357 edges, 623923 markings/sec, 0 secs
lola: 6059526 markings, 15079559 edges, 587982 markings/sec, 5 secs
lola: 9026764 markings, 22475875 edges, 593448 markings/sec, 10 secs
lola: 11889789 markings, 29615080 edges, 572605 markings/sec, 15 secs
lola: 14728284 markings, 36694977 edges, 567699 markings/sec, 20 secs
lola: 17520223 markings, 43659508 edges, 558388 markings/sec, 25 secs
lola: 20291364 markings, 50572632 edges, 554228 markings/sec, 30 secs
lola: 23093463 markings, 57564371 edges, 560420 markings/sec, 35 secs
lola: 25846091 markings, 64432270 edges, 550526 markings/sec, 40 secs
lola: 28566288 markings, 71221016 edges, 544039 markings/sec, 45 secs
lola: 31259859 markings, 77942028 edges, 538714 markings/sec, 50 secs
lola: 33991803 markings, 84759834 edges, 546389 markings/sec, 55 secs
lola: 36687145 markings, 91486812 edges, 539068 markings/sec, 60 secs
lola: 39359036 markings, 98156017 edges, 534378 markings/sec, 65 secs
lola: 42009192 markings, 104770245 edges, 530031 markings/sec, 70 secs
lola: 44631337 markings, 111315570 edges, 524429 markings/sec, 75 secs
lola: 47349528 markings, 118100907 edges, 543638 markings/sec, 80 secs
lola: 50135050 markings, 125054216 edges, 557104 markings/sec, 85 secs
lola: 52918046 markings, 132000671 edges, 556599 markings/sec, 90 secs
lola: 55645461 markings, 138809446 edges, 545483 markings/sec, 95 secs
lola: 58408485 markings, 145707042 edges, 552605 markings/sec, 100 secs
lola: 63815058 markings, 159203889 edges, 1081315 markings/sec, 105 secs
lola: 66523530 markings, 165965739 edges, 541694 markings/sec, 110 secs
lola: 70271459 markings, 175322378 edges, 749586 markings/sec, 115 secs
lola: 72945599 markings, 181999764 edges, 534828 markings/sec, 120 secs
lola: 75584634 markings, 188589077 edges, 527807 markings/sec, 125 secs
lola: 80270571 markings, 200287332 edges, 937187 markings/sec, 130 secs
lola: 82878876 markings, 206801064 edges, 521661 markings/sec, 135 secs
lola: 85941795 markings, 214448833 edges, 612584 markings/sec, 140 secs
lola: 86684264 markings, 216301538 edges, 148494 markings/sec, 145 secs
lola: 86704695 markings, 216352417 edges, 4086 markings/sec, 150 secs
lola: 87114868 markings, 217376669 edges, 82035 markings/sec, 155 secs
lola: 89088688 markings, 222304701 edges, 394764 markings/sec, 160 secs
lola: 91458947 markings, 228224347 edges, 474052 markings/sec, 165 secs
lola: 91579057 markings, 228522785 edges, 24022 markings/sec, 170 secs
lola: 91579057 markings, 228522785 edges, 0 markings/sec, 175 secs
lola: 92656948 markings, 231215232 edges, 215578 markings/sec, 180 secs
lola: 94463244 markings, 235725973 edges, 361259 markings/sec, 185 secs
lola: 94463244 markings, 235725973 edges, 0 markings/sec, 190 secs
lola: 96044518 markings, 239673482 edges, 316255 markings/sec, 195 secs
lola: 96990838 markings, 242036931 edges, 189264 markings/sec, 200 secs
lola: 98145506 markings, 244919118 edges, 230934 markings/sec, 205 secs
lola: 99506812 markings, 248318550 edges, 272261 markings/sec, 210 secs
lola: 100115107 markings, 249838171 edges, 121659 markings/sec, 215 secs
lola: 101917324 markings, 254338463 edges, 360443 markings/sec, 220 secs
lola: 103366686 markings, 257958004 edges, 289872 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((1 <= p3) OR ((G (F ((1 <= p3))) AND F ((1 <= p3))) OR (1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p3)
lola: processed formula length: 9
lola: 60 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (1 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p3)
lola: processed formula length: 9
lola: 60 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((1 <= p3))
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: (p3 <= 0)
lola: processed formula length: 9
lola: 62 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes unknown no no
lola:
preliminary result: no no no no yes no no yes unknown no no
lola: ========================================
lola: memory consumption: 3596 KB
lola: time consumption: 598 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-MT4096DC1024"
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-MT4096DC1024, 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-162106800300062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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