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.r113-smll-162075355700098.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is GPPP-PT-C0001N0000010000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-162075355700098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 133K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 22 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620946764760

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 22:59:28] [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-13 22:59:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 22:59:28] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2021-05-13 22:59:28] [INFO ] Transformed 33 places.
[2021-05-13 22:59:28] [INFO ] Transformed 22 transitions.
[2021-05-13 22:59:28] [INFO ] Parsed PT model containing 33 places and 22 transitions in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 0 resets, run finished after 278 ms. (steps per millisecond=359 ) properties seen :[1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 22 rows 33 cols
[2021-05-13 22:59:28] [INFO ] Computed 13 place invariants in 8 ms
[2021-05-13 22:59:28] [INFO ] [Real]Absence check using 6 positive place invariants in 33 ms returned sat
[2021-05-13 22:59:28] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 9 ms returned sat
[2021-05-13 22:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:59:28] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-13 22:59:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:59:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2021-05-13 22:59:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 41 ms returned sat
[2021-05-13 22:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:59:29] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-13 22:59:29] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 7 ms.
[2021-05-13 22:59:29] [INFO ] Added : 19 causal constraints over 4 iterations in 54 ms. Result :sat
[2021-05-13 22:59:29] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-13 22:59:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-13 22:59:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 22:59:29] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2021-05-13 22:59:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 22:59:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-13 22:59:29] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-13 22:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 22:59:29] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2021-05-13 22:59:29] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints in 10 ms.
[2021-05-13 22:59:29] [INFO ] Added : 19 causal constraints over 4 iterations in 52 ms. Result :sat
[2021-05-13 22:59:29] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-13 22:59:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2021-05-13 22:59:29] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-13 22:59:29] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-13 22:59:29] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 22:59:29] [INFO ] Flatten gal took : 66 ms
FORMULA GPPP-PT-C0001N0000010000-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000010000-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 22:59:29] [INFO ] Flatten gal took : 16 ms
[2021-05-13 22:59:29] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2021-05-13 22:59:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ GPPP-PT-C0001N0000010000 @ 3570 seconds

FORMULA GPPP-PT-C0001N0000010000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000010000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000010000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000010000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000010000-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000010000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000010000-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000010000-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000010000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000010000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000010000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000010000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000010000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA GPPP-PT-C0001N0000010000-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2578
rslt: Output for LTLFireability @ GPPP-PT-C0001N0000010000

{
"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": "Thu May 13 22:59:31 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": "(p20 <= 0)",
"processed_size": 10,
"rewrites": 108
},
"result":
{
"edges": 30,
"markings": 30,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 276
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "X ((((1 <= p15) AND (3 <= p27)) OR (G ((1 <= p21)) AND ((p18 <= 0) OR (p19 <= 0)))))",
"processed_size": 85,
"rewrites": 106
},
"result":
{
"edges": 38,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 301
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"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": "X (X (G (((1 <= p14)))))",
"processed_size": 24,
"rewrites": 106
},
"result":
{
"edges": 38,
"markings": 38,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 331
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 2,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((X (G (((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0)))) OR ((1 <= p8) AND (2 <= p29)))))",
"processed_size": 89,
"rewrites": 106
},
"result":
{
"edges": 140,
"markings": 117,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 414
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p11) AND (1 <= p12) AND (7 <= p31))) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p32))))",
"processed_size": 97,
"rewrites": 106
},
"result":
{
"edges": 46,
"markings": 46,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 473
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"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 ((F (((p25 <= 6))) AND X (((p15 <= 0) OR (p27 <= 2)))))",
"processed_size": 58,
"rewrites": 106
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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": 552
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (F (((1 <= p26)))) OR ((p26 <= 0) OR (G (((1 <= p9) AND (1 <= p13))) AND F ((X (F (((1 <= p26)))) OR (p26 <= 0)))))))",
"processed_size": 123,
"rewrites": 106
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 662
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((2 <= p7)) AND (((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0)) OR X ((2 <= p7))))))",
"processed_size": 88,
"rewrites": 106
},
"result":
{
"edges": 41,
"markings": 40,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 828
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p20)))",
"processed_size": 18,
"rewrites": 106
},
"result":
{
"edges": 30,
"markings": 30,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1104
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p15) AND (3 <= p27))) AND (p21 <= 0)))",
"processed_size": 52,
"rewrites": 106
},
"result":
{
"edges": 27,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1656
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((G ((((p25 <= 6)) AND (F (((p19 <= 0) OR (p22 <= 0))) OR G (((p25 <= 6)))))) AND ((p21 <= 0) OR (p14 <= 0)))))",
"processed_size": 118,
"rewrites": 106
},
"result":
{
"edges": 98,
"markings": 91,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 3313
},
"child":
[

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

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

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (((1 <= p26)))",
"processed_size": 16,
"rewrites": 106
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3112,
"runtime": 991.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : ((X(**) U G(*)) AND (X(**) OR **)) : (F(**) AND (X(F((X(**) AND F(**)))) OR G(**))) : X((** OR (G(**) AND **))) : G((F(**) AND **)) : X(X(G(*))) : F(G((X(G(**)) OR *))) : X(F((X(**) AND **))) : X((F(**) OR **)) : F((F(**) AND X(*))) : X((X(F(**)) OR (** OR (G(**) AND F((X(F(**)) OR **)))))) : (** OR (F(**) AND F(G(**)))) : F(G((F(**) AND (** OR X(**))))) : G(F((G((* AND (F(*) OR G(*)))) AND *)))"
},
"net":
{
"arcs": 83,
"conflict_clusters": 14,
"places": 33,
"places_significant": 20,
"singleton_clusters": 0,
"transitions": 22
},
"result":
{
"preliminary_value": "no unknown no no no no no yes no yes yes no no no ",
"value": "no unknown no no no no no yes no yes yes no 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: 55/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 20 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 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p2)
lola: LP says that atomic proposition is always true: (7 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (7 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: LP says that atomic proposition is always true: (7 <= p1)
lola: LP says that atomic proposition is always true: (1 <= p1)
lola: G (X (X (X (NOT(G (NOT(X (X (F (NOT(X (NOT(F ((1 <= p20))))))))))))))) : ((X (((1 <= p9) AND (1 <= p13))) U NOT(F ((((2 <= p4) AND (1 <= p15) AND (1 <= p28)) U ((1 <= p26) AND (1 <= p20)))))) AND (X (((1 <= p26))) OR ((1 <= p9) AND (1 <= p13)))) : (F ((1 <= p20)) AND (F (X ((X (((1 <= p9) AND (1 <= p10))) AND F ((1 <= p20))))) OR G (((2 <= p4) AND (1 <= p15) AND (1 <= p28) AND (1 <= p9) AND (1 <= p10))))) : X ((((1 <= p15) AND (3 <= p27)) OR (G ((1 <= p21)) AND ((p18 <= 0) OR (p19 <= 0))))) : (NOT(X (NOT(G (X (F (((1 <= p15) AND (3 <= p27)))))))) AND G ((p21 <= 0))) : G (NOT(X (X (((p14 <= 0)))))) : X (F (NOT(F ((NOT(G (X (((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0))))) AND ((p8 <= 0) OR (p29 <= 1))))))) : F (X ((X (((1 <= p15) AND (3 <= p27))) AND ((p11 <= 0) OR (p12 <= 0) OR (p31 <= 6))))) : X ((F ((F (X (((1 <= p18) AND (1 <= p19)))) U F (((1 <= p12) U F (((1 <= p11) AND (1 <= p12) AND (7 <= p31))))))) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p32)))) : F ((F (((p25 <= 6))) AND NOT(X (((1 <= p15) AND (3 <= p27)))))) : X ((G (((1 <= p9) AND (1 <= p13))) U (F (X (((1 <= p26)))) OR (p26 <= 0)))) : (F ((X (((7 <= p25))) U X (G (X (((1 <= p26))))))) U ((1 <= p8) AND (1 <= p30))) : (((1 <= p17) U ((1 <= p8) AND (1 <= p30))) U F (G (X ((((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0)) U X ((2 <= p7))))))) : G (NOT(X (G ((F ((G (((1 <= p19) AND (1 <= p22))) U ((7 <= p25)))) OR ((1 <= p21) AND (1 <= p14)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k: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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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 (((1 <= p9) AND (1 <= p13))) U G (((p26 <= 0) OR (p20 <= 0)))) AND (X (((1 <= p26))) OR ((1 <= p9) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p9) AND (1 <= p13))) U G (((p26 <= 0) OR (p20 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((1 <= p9) AND (1 <= p13))) U G (((p26 <= 0) OR (p20 <= 0))))
lola: processed formula length: 66
lola: 106 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: 2736755 markings, 5384817 edges, 547351 markings/sec, 0 secs
lola: 5136988 markings, 10427729 edges, 480047 markings/sec, 5 secs
lola: 7272857 markings, 14955081 edges, 427174 markings/sec, 10 secs
lola: 9412821 markings, 20231249 edges, 427993 markings/sec, 15 secs
lola: 10403380 markings, 26086090 edges, 198112 markings/sec, 20 secs
lola: 11386461 markings, 31896646 edges, 196616 markings/sec, 25 secs
lola: 12380952 markings, 37776584 edges, 198898 markings/sec, 30 secs
lola: 13367597 markings, 43609102 edges, 197329 markings/sec, 35 secs
lola: 14351924 markings, 49427356 edges, 196865 markings/sec, 40 secs
lola: 15325316 markings, 55180560 edges, 194678 markings/sec, 45 secs
lola: 16195031 markings, 60321623 edges, 173943 markings/sec, 50 secs
lola: 17151516 markings, 65975070 edges, 191297 markings/sec, 55 secs
lola: 18116375 markings, 71679014 edges, 192972 markings/sec, 60 secs
lola: 19067648 markings, 77303123 edges, 190255 markings/sec, 65 secs
lola: 19910214 markings, 82285105 edges, 168513 markings/sec, 70 secs
lola: 20831194 markings, 87727175 edges, 184196 markings/sec, 75 secs
lola: 21693574 markings, 92827431 edges, 172476 markings/sec, 80 secs
lola: 22650419 markings, 98483117 edges, 191369 markings/sec, 85 secs
lola: 23634098 markings, 104297488 edges, 196736 markings/sec, 90 secs
lola: 24608451 markings, 110056206 edges, 194871 markings/sec, 95 secs
lola: 25572674 markings, 115758231 edges, 192845 markings/sec, 100 secs
lola: 26529654 markings, 121413947 edges, 191396 markings/sec, 105 secs
lola: 27438289 markings, 126782751 edges, 181727 markings/sec, 110 secs
lola: 28388397 markings, 132401740 edges, 190022 markings/sec, 115 secs
lola: 29305798 markings, 137823950 edges, 183480 markings/sec, 120 secs
lola: 30313772 markings, 143781752 edges, 201595 markings/sec, 125 secs
lola: 31329213 markings, 149784463 edges, 203088 markings/sec, 130 secs
lola: 32327483 markings, 155685458 edges, 199654 markings/sec, 135 secs
lola: 33240910 markings, 161086311 edges, 182685 markings/sec, 140 secs
lola: 34225212 markings, 166904545 edges, 196860 markings/sec, 145 secs
lola: 35202420 markings, 172680256 edges, 195442 markings/sec, 150 secs
lola: 36160061 markings, 178342035 edges, 191528 markings/sec, 155 secs
lola: 37122445 markings, 184031900 edges, 192477 markings/sec, 160 secs
lola: 38100760 markings, 189813493 edges, 195663 markings/sec, 165 secs
lola: 38985990 markings, 195047669 edges, 177046 markings/sec, 170 secs
lola: 39919919 markings, 200566445 edges, 186786 markings/sec, 175 secs
lola: 40842314 markings, 206020005 edges, 184479 markings/sec, 180 secs
lola: 41790430 markings, 211623787 edges, 189623 markings/sec, 185 secs
lola: 42685406 markings, 216913991 edges, 178995 markings/sec, 190 secs
lola: 43683828 markings, 222817632 edges, 199684 markings/sec, 195 secs
lola: 44539801 markings, 227876753 edges, 171195 markings/sec, 200 secs
lola: 45508424 markings, 233602086 edges, 193725 markings/sec, 205 secs
lola: 46437140 markings, 239092034 edges, 185743 markings/sec, 210 secs
lola: 47398160 markings, 244772963 edges, 192204 markings/sec, 215 secs
lola: 48311863 markings, 250174529 edges, 182741 markings/sec, 220 secs
lola: 49245647 markings, 255696015 edges, 186757 markings/sec, 225 secs
lola: 50139908 markings, 260980761 edges, 178852 markings/sec, 230 secs
lola: 51093152 markings, 266614193 edges, 190649 markings/sec, 235 secs
lola: 52036006 markings, 272190106 edges, 188571 markings/sec, 240 secs
lola: 52971578 markings, 277718519 edges, 187114 markings/sec, 245 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: local time limit reached - aborting
lola: memory consumption: 7996596 KB
lola: time consumption: 257 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 7996596 KB
lola: time consumption: 257 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p20)) AND (X (F ((X (((1 <= p9) AND (1 <= p10))) AND F ((1 <= p20))))) OR G (((2 <= p4) AND (1 <= p15) AND (1 <= p28) AND (1 <= p9) AND (1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p20))
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: (p20 <= 0)
lola: processed formula length: 10
lola: 108 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: 30 markings, 30 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p15) AND (3 <= p27)) OR (G ((1 <= p21)) AND ((p18 <= 0) OR (p19 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p15) AND (3 <= p27)) OR (G ((1 <= p21)) AND ((p18 <= 0) OR (p19 <= 0)))))
lola: processed formula length: 85
lola: 106 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 38 markings, 38 edges
lola: ========================================
lola: subprocess 3 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p14)))))
lola: processed formula length: 24
lola: 106 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: 38 markings, 38 edges
lola: ========================================
lola: subprocess 4 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (G (((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0)))) OR ((1 <= p8) AND (2 <= p29)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (G (((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0)))) OR ((1 <= p8) AND (2 <= p29)))))
lola: processed formula length: 89
lola: 106 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: 117 markings, 140 edges
lola: ========================================
lola: subprocess 5 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (((1 <= p15) AND (3 <= p27))) AND ((p11 <= 0) OR (p12 <= 0) OR (p31 <= 6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (((1 <= p15) AND (3 <= p27))) AND ((p11 <= 0) OR (p12 <= 0) OR (p31 <= 6)))))
lola: processed formula length: 88
lola: 106 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p11) AND (1 <= p12) AND (7 <= p31))) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p32))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p11) AND (1 <= p12) AND (7 <= p31))) OR ((1 <= p0) AND (1 <= p12) AND (1 <= p32))))
lola: processed formula length: 97
lola: 106 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: 46 markings, 46 edges
lola: ========================================
lola: subprocess 7 will run for 473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((p25 <= 6))) AND X (((p15 <= 0) OR (p27 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((p25 <= 6))) AND X (((p15 <= 0) OR (p27 <= 2)))))
lola: processed formula length: 58
lola: 106 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 8 will run for 552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F (((1 <= p26)))) OR ((p26 <= 0) OR (G (((1 <= p9) AND (1 <= p13))) AND F ((X (F (((1 <= p26)))) OR (p26 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F (((1 <= p26)))) OR ((p26 <= 0) OR (G (((1 <= p9) AND (1 <= p13))) AND F ((X (F (((1 <= p26)))) OR (p26 <= 0)))))))
lola: processed formula length: 123
lola: 106 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((2 <= p7)) AND (((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0)) OR X ((2 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((2 <= p7)) AND (((p4 <= 1) OR (p15 <= 0) OR (p28 <= 0)) OR X ((2 <= p7))))))
lola: processed formula length: 88
lola: 106 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: 40 markings, 41 edges
lola: ========================================
lola: subprocess 10 will run for 828 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p20)))
lola: processed formula length: 18
lola: 106 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: 30 markings, 30 edges
lola: ========================================
lola: subprocess 11 will run for 1104 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p15) AND (3 <= p27))) AND (p21 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p15) AND (3 <= p27))) AND (p21 <= 0)))
lola: processed formula length: 52
lola: 106 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: 26 markings, 27 edges
lola: ========================================
lola: subprocess 12 will run for 1656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((((p25 <= 6)) AND (F (((p19 <= 0) OR (p22 <= 0))) OR G (((p25 <= 6)))))) AND ((p21 <= 0) OR (p14 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((((p25 <= 6)) AND (F (((p19 <= 0) OR (p22 <= 0))) OR G (((p25 <= 6)))))) AND ((p21 <= 0) OR (p14 <= 0)))))
lola: processed formula length: 118
lola: 106 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: 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: 91 markings, 98 edges
lola: ========================================
lola: subprocess 13 will run for 3313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p8) AND (1 <= p30)) OR (F (((1 <= p8) AND (1 <= p30))) AND F (G (((1 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p8) AND (1 <= p30))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p8) AND (1 <= p30))
lola: processed formula length: 26
lola: 106 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: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p26))))
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 <= p26))))
lola: processed formula length: 20
lola: 106 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 2
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: 32 markings, 34 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((X (((1 <= p9) AND (1 <= p13))) U G (((p26 <= 0) OR (p20 <= 0)))) AND (X (((1 <= p26))) OR ((1 <= p9) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p9) AND (1 <= p13))) U G (((p26 <= 0) OR (p20 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((1 <= p9) AND (1 <= p13))) U G (((p26 <= 0) OR (p20 <= 0))))
lola: processed formula length: 66
lola: 106 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: 2544746 markings, 4978711 edges, 508949 markings/sec, 0 secs
lola: 4940768 markings, 10012704 edges, 479204 markings/sec, 5 secs
lola: 7270321 markings, 14949619 edges, 465911 markings/sec, 10 secs
lola: 9402459 markings, 20168966 edges, 426428 markings/sec, 15 secs
lola: 10462493 markings, 26434575 edges, 212007 markings/sec, 20 secs
lola: 11452841 markings, 32289312 edges, 198070 markings/sec, 25 secs
lola: 12443258 markings, 38145692 edges, 198083 markings/sec, 30 secs
lola: 13376749 markings, 43662092 edges, 186698 markings/sec, 35 secs
lola: 14360156 markings, 49474110 edges, 196681 markings/sec, 40 secs
lola: 15344786 markings, 55294773 edges, 196926 markings/sec, 45 secs
lola: 16317782 markings, 61049551 edges, 194599 markings/sec, 50 secs
lola: 17359325 markings, 67204404 edges, 208309 markings/sec, 55 secs
lola: 18335435 markings, 72975377 edges, 195222 markings/sec, 60 secs
lola: 19295930 markings, 78651051 edges, 192099 markings/sec, 65 secs
lola: 20303032 markings, 84605566 edges, 201420 markings/sec, 70 secs
lola: 21292416 markings, 90454233 edges, 197877 markings/sec, 75 secs
lola: 22278784 markings, 96284534 edges, 197274 markings/sec, 80 secs
lola: 23263853 markings, 102107798 edges, 197014 markings/sec, 85 secs
lola: 24263476 markings, 108017055 edges, 199925 markings/sec, 90 secs
lola: 25245248 markings, 113820319 edges, 196354 markings/sec, 95 secs
lola: 26206704 markings, 119503591 edges, 192291 markings/sec, 100 secs
lola: 27192403 markings, 125330702 edges, 197140 markings/sec, 105 secs
lola: 28108864 markings, 130747685 edges, 183292 markings/sec, 110 secs
lola: 29059406 markings, 136368403 edges, 190108 markings/sec, 115 secs
lola: 30053176 markings, 142240483 edges, 198754 markings/sec, 120 secs
lola: 31034612 markings, 148042789 edges, 196287 markings/sec, 125 secs
lola: 32003279 markings, 153770563 edges, 193733 markings/sec, 130 secs
lola: 33000404 markings, 159663640 edges, 199425 markings/sec, 135 secs
lola: 33962621 markings, 165351128 edges, 192443 markings/sec, 140 secs
lola: 34946568 markings, 171169080 edges, 196789 markings/sec, 145 secs
lola: 35910386 markings, 176867305 edges, 192764 markings/sec, 150 secs
lola: 36907406 markings, 182759056 edges, 199404 markings/sec, 155 secs
lola: 37892083 markings, 188579395 edges, 196935 markings/sec, 160 secs
lola: 38870585 markings, 194364302 edges, 195700 markings/sec, 165 secs
lola: 39842930 markings, 200111336 edges, 194469 markings/sec, 170 secs
lola: 40812717 markings, 205844729 edges, 193957 markings/sec, 175 secs
lola: 41767277 markings, 211487064 edges, 190912 markings/sec, 180 secs
lola: 42703945 markings, 217025501 edges, 187334 markings/sec, 185 secs
lola: 43715959 markings, 223007313 edges, 202403 markings/sec, 190 secs
lola: 44703483 markings, 228842741 edges, 197505 markings/sec, 195 secs
lola: 45670661 markings, 234561039 edges, 193436 markings/sec, 200 secs
lola: 46645849 markings, 240326406 edges, 195038 markings/sec, 205 secs
lola: 47602552 markings, 245981179 edges, 191341 markings/sec, 210 secs
lola: 48554347 markings, 251606177 edges, 190359 markings/sec, 215 secs
lola: 49493038 markings, 257156469 edges, 187738 markings/sec, 220 secs
lola: 50473896 markings, 262955073 edges, 196172 markings/sec, 225 secs
lola: 51427542 markings, 268591624 edges, 190729 markings/sec, 230 secs
lola: 52360030 markings, 274103326 edges, 186498 markings/sec, 235 secs
lola: 53297256 markings, 279645283 edges, 187445 markings/sec, 240 secs
lola: 54225333 markings, 285131082 edges, 185615 markings/sec, 245 secs
lola: 55154978 markings, 290625446 edges, 185929 markings/sec, 250 secs
lola: 56076522 markings, 296073123 edges, 184309 markings/sec, 255 secs
lola: 57121844 markings, 302253537 edges, 209064 markings/sec, 260 secs
lola: 58140379 markings, 308272566 edges, 203707 markings/sec, 265 secs
lola: 59135312 markings, 314154547 edges, 198987 markings/sec, 270 secs
lola: 60140531 markings, 320096508 edges, 201044 markings/sec, 275 secs
lola: 61123267 markings, 325906762 edges, 196547 markings/sec, 280 secs
lola: 62091712 markings, 331631206 edges, 193689 markings/sec, 285 secs
lola: 63073225 markings, 337433462 edges, 196303 markings/sec, 290 secs
lola: 64062162 markings, 343278076 edges, 197787 markings/sec, 295 secs
lola: 65035668 markings, 349035242 edges, 194701 markings/sec, 300 secs
lola: 65991660 markings, 354685795 edges, 191198 markings/sec, 305 secs
lola: 66971729 markings, 360478226 edges, 196014 markings/sec, 310 secs
lola: 67924973 markings, 366113660 edges, 190649 markings/sec, 315 secs
lola: 68866476 markings, 371678406 edges, 188301 markings/sec, 320 secs
lola: 69847285 markings, 377475112 edges, 196162 markings/sec, 325 secs
lola: 70825706 markings, 383260750 edges, 195684 markings/sec, 330 secs
lola: 71798611 markings, 389011876 edges, 194581 markings/sec, 335 secs
lola: 72753577 markings, 394657269 edges, 190993 markings/sec, 340 secs
lola: 73716607 markings, 400349581 edges, 192606 markings/sec, 345 secs
lola: 74665649 markings, 405958809 edges, 189808 markings/sec, 350 secs
lola: 75595832 markings, 411458455 edges, 186037 markings/sec, 355 secs
lola: 76559589 markings, 417155786 edges, 192751 markings/sec, 360 secs
lola: 77507175 markings, 422755637 edges, 189517 markings/sec, 365 secs
lola: 78453306 markings, 428348132 edges, 189226 markings/sec, 370 secs
lola: 79389624 markings, 433883846 edges, 187264 markings/sec, 375 secs
lola: 80330529 markings, 439446312 edges, 188181 markings/sec, 380 secs
lola: 81257984 markings, 444928190 edges, 185491 markings/sec, 385 secs
lola: 82177430 markings, 450363258 edges, 183889 markings/sec, 390 secs
lola: 83157227 markings, 456154511 edges, 195959 markings/sec, 395 secs
lola: 84140667 markings, 461967579 edges, 196688 markings/sec, 400 secs
lola: 85112740 markings, 467715821 edges, 194415 markings/sec, 405 secs
lola: 86072455 markings, 473389729 edges, 191943 markings/sec, 410 secs
lola: 87033456 markings, 479067797 edges, 192200 markings/sec, 415 secs
lola: 87978493 markings, 484655236 edges, 189007 markings/sec, 420 secs
lola: 88907666 markings, 490148602 edges, 185835 markings/sec, 425 secs
lola: 89872257 markings, 495851599 edges, 192918 markings/sec, 430 secs
lola: 90808127 markings, 501380822 edges, 187174 markings/sec, 435 secs
lola: 91749451 markings, 506946908 edges, 188265 markings/sec, 440 secs
lola: 92682988 markings, 512465859 edges, 186707 markings/sec, 445 secs
lola: 93619696 markings, 518003293 edges, 187342 markings/sec, 450 secs
lola: 94542867 markings, 523459162 edges, 184634 markings/sec, 455 secs
lola: 95447783 markings, 528809436 edges, 180983 markings/sec, 460 secs
lola: 96409198 markings, 534492988 edges, 192283 markings/sec, 465 secs
lola: 97281796 markings, 539649521 edges, 174520 markings/sec, 470 secs
lola: 98226105 markings, 545231337 edges, 188862 markings/sec, 475 secs
lola: 99155771 markings, 550727466 edges, 185933 markings/sec, 480 secs
lola: 100093162 markings, 556268077 edges, 187478 markings/sec, 485 secs
lola: 100966966 markings, 561433034 edges, 174761 markings/sec, 490 secs
lola: 101871638 markings, 566781646 edges, 180934 markings/sec, 495 secs
lola: 102795497 markings, 572243695 edges, 184772 markings/sec, 500 secs
lola: 103724695 markings, 577736242 edges, 185840 markings/sec, 505 secs
lola: 104639592 markings, 583144295 edges, 182979 markings/sec, 510 secs
lola: 105534565 markings, 588435746 edges, 178995 markings/sec, 515 secs
lola: 106454403 markings, 593871401 edges, 183968 markings/sec, 520 secs
lola: 107350184 markings, 599166816 edges, 179156 markings/sec, 525 secs
lola: 108247242 markings, 604471256 edges, 179412 markings/sec, 530 secs
lola: 109158042 markings, 609852705 edges, 182160 markings/sec, 535 secs
lola: 110144975 markings, 615687854 edges, 197387 markings/sec, 540 secs
lola: 111093937 markings, 621299005 edges, 189792 markings/sec, 545 secs
lola: 111761460 markings, 625246113 edges, 133505 markings/sec, 550 secs
lola: 112514461 markings, 629694547 edges, 150600 markings/sec, 555 secs
lola: 113413627 markings, 635010826 edges, 179833 markings/sec, 560 secs
lola: 114311170 markings, 640315292 edges, 179509 markings/sec, 565 secs
lola: 115120313 markings, 645100134 edges, 161829 markings/sec, 570 secs
lola: 115930515 markings, 649886904 edges, 162040 markings/sec, 575 secs
lola: 116760014 markings, 654790640 edges, 165900 markings/sec, 580 secs
lola: 117646139 markings, 660030251 edges, 177225 markings/sec, 585 secs
lola: 118446950 markings, 664763057 edges, 160162 markings/sec, 590 secs
lola: 119327020 markings, 669966481 edges, 176014 markings/sec, 595 secs
lola: 120179734 markings, 675007121 edges, 170543 markings/sec, 600 secs
lola: 121037605 markings, 680077683 edges, 171574 markings/sec, 605 secs
lola: 121766997 markings, 684388699 edges, 145878 markings/sec, 610 secs
lola: 122645032 markings, 689579062 edges, 175607 markings/sec, 615 secs
lola: 123485487 markings, 694547231 edges, 168091 markings/sec, 620 secs
lola: 124006848 markings, 697630292 edges, 104272 markings/sec, 625 secs
lola: 124742935 markings, 701979468 edges, 147217 markings/sec, 630 secs
lola: 125438001 markings, 706088822 edges, 139013 markings/sec, 635 secs
lola: 126178804 markings, 710468938 edges, 148161 markings/sec, 640 secs
lola: 126830097 markings, 714319947 edges, 130259 markings/sec, 645 secs
lola: 127516394 markings, 718374888 edges, 137259 markings/sec, 650 secs
lola: 128251730 markings, 722723408 edges, 147067 markings/sec, 655 secs
lola: 128928896 markings, 726724046 edges, 135433 markings/sec, 660 secs
lola: 129747631 markings, 731566778 edges, 163747 markings/sec, 665 secs
lola: 130368242 markings, 735234565 edges, 124122 markings/sec, 670 secs
lola: 131030277 markings, 739147403 edges, 132407 markings/sec, 675 secs
lola: 131714679 markings, 743194075 edges, 136880 markings/sec, 680 secs
lola: 132496812 markings, 747815765 edges, 156427 markings/sec, 685 secs
lola: 133228298 markings, 752140500 edges, 146297 markings/sec, 690 secs
lola: 134081570 markings, 757183705 edges, 170654 markings/sec, 695 secs
lola: 134916479 markings, 762121229 edges, 166982 markings/sec, 700 secs
lola: 135796271 markings, 767321299 edges, 175958 markings/sec, 705 secs
lola: 136590649 markings, 772016190 edges, 158876 markings/sec, 710 secs
lola: 137133939 markings, 775228457 edges, 108658 markings/sec, 715 secs
lola: 137769574 markings, 778985582 edges, 127127 markings/sec, 720 secs
lola: 137770893 markings, 778992474 edges, 264 markings/sec, 725 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((1 <= p9) AND (1 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p9) AND (1 <= p13))
lola: processed formula length: 26
lola: 106 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: ========================================
lola: ...considering subproblem: X (((1 <= p26)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p26)))
lola: processed formula length: 16
lola: 106 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no no no no no yes no yes yes no no no
lola:
preliminary result: no unknown no no no no no yes no yes yes no no no
lola: memory consumption: 3112 KB
lola: time consumption: 991 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="GPPP-PT-C0001N0000010000"
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 GPPP-PT-C0001N0000010000, 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 r113-smll-162075355700098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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