Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r189-tajo-162089432900330.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 RefineWMG-PT-025025, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432900330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 134K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K 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 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 56K 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 RefineWMG-PT-025025-00
FORMULA_NAME RefineWMG-PT-025025-01
FORMULA_NAME RefineWMG-PT-025025-02
FORMULA_NAME RefineWMG-PT-025025-03
FORMULA_NAME RefineWMG-PT-025025-04
FORMULA_NAME RefineWMG-PT-025025-05
FORMULA_NAME RefineWMG-PT-025025-06
FORMULA_NAME RefineWMG-PT-025025-07
FORMULA_NAME RefineWMG-PT-025025-08
FORMULA_NAME RefineWMG-PT-025025-09
FORMULA_NAME RefineWMG-PT-025025-10
FORMULA_NAME RefineWMG-PT-025025-11
FORMULA_NAME RefineWMG-PT-025025-12
FORMULA_NAME RefineWMG-PT-025025-13
FORMULA_NAME RefineWMG-PT-025025-14
FORMULA_NAME RefineWMG-PT-025025-15

=== Now, execution of the tool begins

BK_START 1621429165479

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 12:59:27] [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-19 12:59:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 12:59:27] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2021-05-19 12:59:27] [INFO ] Transformed 129 places.
[2021-05-19 12:59:27] [INFO ] Transformed 103 transitions.
[2021-05-19 12:59:27] [INFO ] Parsed PT model containing 129 places and 103 transitions in 95 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100004 steps, including 0 resets, run finished after 175 ms. (steps per millisecond=571 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 103 rows 129 cols
[2021-05-19 12:59:27] [INFO ] Computed 52 place invariants in 9 ms
[2021-05-19 12:59:27] [INFO ] [Real]Absence check using 52 positive place invariants in 34 ms returned sat
[2021-05-19 12:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 12:59:27] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-19 12:59:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 12:59:27] [INFO ] [Nat]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-19 12:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 12:59:27] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-19 12:59:27] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 9 ms.
[2021-05-19 12:59:28] [INFO ] Added : 51 causal constraints over 11 iterations in 101 ms. Result :sat
[2021-05-19 12:59:28] [INFO ] [Real]Absence check using 52 positive place invariants in 11 ms returned sat
[2021-05-19 12:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 12:59:28] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-19 12:59:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 12:59:28] [INFO ] [Nat]Absence check using 52 positive place invariants in 16 ms returned sat
[2021-05-19 12:59:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 12:59:28] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-19 12:59:28] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 7 ms.
[2021-05-19 12:59:28] [INFO ] Added : 51 causal constraints over 11 iterations in 90 ms. Result :sat
[2021-05-19 12:59:28] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2021-05-19 12:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 12:59:28] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-19 12:59:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 12:59:28] [INFO ] [Nat]Absence check using 52 positive place invariants in 10 ms returned sat
[2021-05-19 12:59:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 12:59:28] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-19 12:59:28] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 6 ms.
[2021-05-19 12:59:28] [INFO ] Added : 55 causal constraints over 11 iterations in 61 ms. Result :sat
[2021-05-19 12:59:28] [INFO ] [Real]Absence check using 52 positive place invariants in 10 ms returned sat
[2021-05-19 12:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 12:59:28] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-19 12:59:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 12:59:28] [INFO ] [Nat]Absence check using 52 positive place invariants in 12 ms returned sat
[2021-05-19 12:59:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 12:59:28] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2021-05-19 12:59:28] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints in 5 ms.
[2021-05-19 12:59:28] [INFO ] Added : 51 causal constraints over 11 iterations in 60 ms. Result :sat
[2021-05-19 12:59:29] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-19 12:59:29] [INFO ] Flatten gal took : 49 ms
FORMULA RefineWMG-PT-025025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 12:59:29] [INFO ] Flatten gal took : 11 ms
[2021-05-19 12:59:29] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-19 12:59:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-025025 @ 3570 seconds

FORMULA RefineWMG-PT-025025-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025025-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2498
rslt: Output for LTLFireability @ RefineWMG-PT-025025

{
"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": "Wed May 19 12:59:29 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 263
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 4,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X ((F (((1 <= p91) AND (1 <= p92) AND (1 <= p94))) OR (1 <= p98))) AND (X (X (G (((1 <= p91) AND (1 <= p92) AND (1 <= p94))))) OR (1 <= p98))))",
"processed_size": 147,
"rewrites": 116
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 317
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"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": "((X (F (((1 <= p31) AND (1 <= p32) AND (1 <= p34)))) OR (p120 <= 0)) R X ((p58 <= 0)))",
"processed_size": 86,
"rewrites": 116
},
"result":
{
"edges": 41,
"markings": 41,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 352
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X (G ((X ((1 <= p45)) OR (1 <= p127)))) OR F ((1 <= p53))))",
"processed_size": 63,
"rewrites": 116
},
"result":
{
"edges": 29,
"markings": 29,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X (X (G ((X (G ((1 <= p70))) AND ((1 <= p92) AND ((1 <= p6) AND ((1 <= p7) AND (1 <= p9)))))))))",
"processed_size": 99,
"rewrites": 116
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 453
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (G (((1 <= p41) AND (1 <= p42) AND (1 <= p44)))) AND F ((p97 <= 0))))",
"processed_size": 75,
"rewrites": 116
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 528
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p53) U X ((X (X (F ((1 <= p52)))) OR G ((F ((1 <= p25)) OR (1 <= p25))))))",
"processed_size": 81,
"rewrites": 116
},
"result":
{
"edges": 110413,
"markings": 21808,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 14
},
"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": 757
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p122 <= 0)))",
"processed_size": 19,
"rewrites": 116
},
"result":
{
"edges": 9,
"markings": 8,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1009
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((1 <= p47))",
"processed_size": 14,
"rewrites": 116
},
"result":
{
"edges": 1295,
"markings": 820,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3029
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p96) AND (1 <= p97) AND (1 <= p99))",
"processed_size": 42,
"rewrites": 116
},
"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": 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": "F (G (((p0 <= 0) OR (p126 <= 0) OR (p127 <= 0))))",
"processed_size": 51,
"rewrites": 116
},
"result":
{
"edges": 79,
"markings": 53,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 3156,
"runtime": 1072.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X((F((G(*) OR (* AND *))) OR (G(*) AND **)))) : F(G(*)) : X((X((F(**) OR **)) AND (X(X(G(**))) OR **))) : X((((G(**) R *) R X(X(G(*)))) OR **)) : (** OR (F(**) AND F(G(*)))) : F((((F(**) U **) AND **) OR **)) : X(X(F((G(**) OR G(F(*)))))) : ((X(F(**)) OR *) R X(*)) : G((X(G((X(**) OR **))) OR F(**))) : G(**) : X(X(X(G((X(G(**)) AND (** AND (** AND (** AND **)))))))) : X((X(G(**)) AND F(*))) : (** U X((X(X(F(**))) OR G((F(**) OR **))))) : G(F((G(*) OR (* AND X(*)))))"
},
"net":
{
"arcs": 308,
"conflict_clusters": 78,
"places": 129,
"places_significant": 77,
"singleton_clusters": 0,
"transitions": 103
},
"result":
{
"preliminary_value": "unknown no no unknown no no unknown no no no no no yes unknown ",
"value": "unknown no no unknown no no unknown no no no no no yes unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 232/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4128
lola: finding significant places
lola: 129 places, 103 transitions, 77 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: X (X ((NOT(G (((p73 <= 0) U ((1 <= p73) OR (1 <= p40))))) OR (NOT(F ((1 <= p47))) AND (p7 <= 0))))) : F (NOT(X (F ((1 <= p122))))) : X ((X ((F (((1 <= p91) AND (1 <= p92) AND (1 <= p94))) OR (1 <= p98))) AND (X (X (G (((1 <= p91) AND (1 <= p92) AND (1 <= p94))))) OR (1 <= p98)))) : X ((NOT(((NOT(G ((1 <= p92))) U (p88 <= 0)) U X (F (X ((1 <= p110)))))) OR (p92 <= 0))) : (NOT(G (F (((1 <= p23) U ((1 <= p0) AND (1 <= p126) AND (1 <= p127)))))) U ((1 <= p96) AND (1 <= p97) AND (1 <= p99))) : F ((((F (((5 <= p4) AND (3 <= p3))) U (5 <= p4)) AND (1 <= p118)) OR ((p7 <= 0) AND (p35 <= 0)))) : F (X (X ((G (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) OR G (NOT(G ((1 <= p45)))))))) : NOT(((NOT(X (F (((((F ((1 <= p73)) AND (1 <= p31)) AND (1 <= p32)) AND (1 <= p34)) U ((1 <= p31) AND (1 <= p32) AND (1 <= p34)))))) AND (1 <= p120)) U X ((1 <= p58)))) : G ((X (G ((X ((1 <= p45)) OR (1 <= p127)))) OR F ((1 <= p53)))) : G ((1 <= p47)) : X (NOT(F (NOT(X (X (((((X (G ((1 <= p70))) AND (1 <= p92)) AND (1 <= p6)) AND (1 <= p7)) AND (1 <= p9)))))))) : (NOT(X (X (NOT(G (((1 <= p41) AND (1 <= p42) AND (1 <= p44))))))) AND NOT(G (X ((1 <= p97))))) : ((1 <= p53) U X ((X (F (X ((1 <= p52)))) OR G ((F ((1 <= p25)) OR (1 <= p25)))))) : F (X (G (F (G (NOT(G (((((1 <= p91) AND (1 <= p92) AND (1 <= p94)) OR (1 <= p22)) U X ((1 <= p20))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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: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:434
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:428
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:318
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((G (((p73 <= 0) AND (p40 <= 0))) OR ((1 <= p73) AND ((p73 <= 0) AND (p40 <= 0))))) OR (G ((p47 <= 0)) AND (p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((G (((p73 <= 0) AND (p40 <= 0))) OR ((1 <= p73) AND ((p73 <= 0) AND (p40 <= 0))))) OR (G ((p47 <= 0)) AND (p7 <= 0)))))
lola: processed formula length: 129
lola: 116 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: 2937300 markings, 4464651 edges, 587460 markings/sec, 0 secs
lola: 5865413 markings, 8915386 edges, 585623 markings/sec, 5 secs
lola: 9076979 markings, 13796975 edges, 642313 markings/sec, 10 secs
lola: 12388124 markings, 18829903 edges, 662229 markings/sec, 15 secs
lola: 15579215 markings, 23680380 edges, 638218 markings/sec, 20 secs
lola: 18690751 markings, 28409889 edges, 622307 markings/sec, 25 secs
lola: 21770913 markings, 33091751 edges, 616032 markings/sec, 30 secs
lola: 24876325 markings, 37811982 edges, 621082 markings/sec, 35 secs
lola: 28048281 markings, 42633363 edges, 634391 markings/sec, 40 secs
lola: 31197901 markings, 47420764 edges, 629924 markings/sec, 45 secs
lola: 34370659 markings, 52243364 edges, 634552 markings/sec, 50 secs
lola: 37549212 markings, 57074773 edges, 635711 markings/sec, 55 secs
lola: 40583719 markings, 61687204 edges, 606901 markings/sec, 60 secs
lola: 43426686 markings, 66008514 edges, 568593 markings/sec, 65 secs
lola: 46275530 markings, 70338767 edges, 569769 markings/sec, 70 secs
lola: 49430339 markings, 75134089 edges, 630962 markings/sec, 75 secs
lola: 52569378 markings, 79905401 edges, 627808 markings/sec, 80 secs
lola: 54649762 markings, 83072573 edges, 416077 markings/sec, 85 secs
lola: 56101774 markings, 85274810 edges, 290402 markings/sec, 90 secs
lola: 57567219 markings, 87502696 edges, 293089 markings/sec, 95 secs
lola: 59375710 markings, 90251955 edges, 361698 markings/sec, 100 secs
lola: 60710861 markings, 92280456 edges, 267030 markings/sec, 105 secs
lola: 62136321 markings, 94447172 edges, 285092 markings/sec, 110 secs
lola: 63581247 markings, 96643445 edges, 288985 markings/sec, 115 secs
lola: 64878307 markings, 98615004 edges, 259412 markings/sec, 120 secs
lola: 66085336 markings, 100449678 edges, 241406 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((F (((1 <= p91) AND (1 <= p92) AND (1 <= p94))) OR (1 <= p98))) AND (X (X (G (((1 <= p91) AND (1 <= p92) AND (1 <= p94))))) OR (1 <= p98))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((F (((1 <= p91) AND (1 <= p92) AND (1 <= p94))) OR (1 <= p98))) AND (X (X (G (((1 <= p91) AND (1 <= p92) AND (1 <= p94))))) OR (1 <= p98))))
lola: processed formula length: 147
lola: 116 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 2 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((G ((1 <= p92)) R (1 <= p88)) R X (X (G ((p110 <= 0))))) OR (p92 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((G ((1 <= p92)) R (1 <= p88)) R X (X (G ((p110 <= 0))))) OR (p92 <= 0)))
lola: processed formula length: 77
lola: 116 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 19 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: 2829973 markings, 4301524 edges, 565995 markings/sec, 0 secs
lola: 5873618 markings, 8927863 edges, 608729 markings/sec, 5 secs
lola: 8980470 markings, 13650268 edges, 621370 markings/sec, 10 secs
lola: 12161165 markings, 18484934 edges, 636139 markings/sec, 15 secs
lola: 15071548 markings, 22908699 edges, 582077 markings/sec, 20 secs
lola: 17940946 markings, 27270203 edges, 573880 markings/sec, 25 secs
lola: 21003092 markings, 31924665 edges, 612429 markings/sec, 30 secs
lola: 24283695 markings, 36911186 edges, 656121 markings/sec, 35 secs
lola: 27515065 markings, 41822869 edges, 646274 markings/sec, 40 secs
lola: 30676282 markings, 46627896 edges, 632243 markings/sec, 45 secs
lola: 33716323 markings, 51248784 edges, 608008 markings/sec, 50 secs
lola: 36893861 markings, 56078615 edges, 635508 markings/sec, 55 secs
lola: 40074047 markings, 60912517 edges, 636037 markings/sec, 60 secs
lola: 42762522 markings, 64999001 edges, 537695 markings/sec, 65 secs
lola: 45354180 markings, 68938324 edges, 518332 markings/sec, 70 secs
lola: 47990718 markings, 72945857 edges, 527308 markings/sec, 75 secs
lola: 50911737 markings, 77385803 edges, 584204 markings/sec, 80 secs
lola: 53761424 markings, 81718337 edges, 569937 markings/sec, 85 secs
lola: 55176723 markings, 83869582 edges, 283060 markings/sec, 90 secs
lola: 56293738 markings, 85566432 edges, 223403 markings/sec, 95 secs
lola: 58312690 markings, 88635253 edges, 403790 markings/sec, 100 secs
lola: 59496541 markings, 90434698 edges, 236770 markings/sec, 105 secs
lola: 61059475 markings, 92810373 edges, 312587 markings/sec, 110 secs
lola: 62826224 markings, 95495819 edges, 353350 markings/sec, 115 secs
lola: 63686166 markings, 96802941 edges, 171988 markings/sec, 120 secs
lola: 65449882 markings, 99483776 edges, 352743 markings/sec, 125 secs
lola: 66080787 markings, 100442757 edges, 126181 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((G (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) OR G (F ((p45 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) OR G (F ((p45 <= 0)))))))
lola: processed formula length: 82
lola: 116 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: 3172363 markings, 4821957 edges, 634473 markings/sec, 0 secs
lola: 6474147 markings, 9840678 edges, 660357 markings/sec, 5 secs
lola: 9686897 markings, 14724033 edges, 642550 markings/sec, 10 secs
lola: 12780692 markings, 19426610 edges, 618759 markings/sec, 15 secs
lola: 15560247 markings, 23651541 edges, 555911 markings/sec, 20 secs
lola: 18272741 markings, 27774539 edges, 542499 markings/sec, 25 secs
lola: 21234360 markings, 32276210 edges, 592324 markings/sec, 30 secs
lola: 24550327 markings, 37316460 edges, 663193 markings/sec, 35 secs
lola: 27509995 markings, 41815154 edges, 591934 markings/sec, 40 secs
lola: 30558093 markings, 46448260 edges, 609620 markings/sec, 45 secs
lola: 33863095 markings, 51471863 edges, 661000 markings/sec, 50 secs
lola: 37235405 markings, 56597774 edges, 674462 markings/sec, 55 secs
lola: 40503412 markings, 61565152 edges, 653601 markings/sec, 60 secs
lola: 43760679 markings, 66516196 edges, 651453 markings/sec, 65 secs
lola: 46983369 markings, 71414687 edges, 644538 markings/sec, 70 secs
lola: 50315259 markings, 76479168 edges, 666378 markings/sec, 75 secs
lola: 53607440 markings, 81483431 edges, 658436 markings/sec, 80 secs
lola: 56219091 markings, 85453265 edges, 522330 markings/sec, 85 secs
lola: 57787785 markings, 87837387 edges, 313739 markings/sec, 90 secs
lola: 59007056 markings, 89690678 edges, 243854 markings/sec, 95 secs
lola: 60958894 markings, 92657480 edges, 390368 markings/sec, 100 secs
lola: 62941041 markings, 95670360 edges, 396429 markings/sec, 105 secs
lola: 64626689 markings, 98232526 edges, 337130 markings/sec, 110 secs
lola: 66251015 markings, 100701505 edges, 324865 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 317 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (F (((1 <= p31) AND (1 <= p32) AND (1 <= p34)))) OR (p120 <= 0)) R X ((p58 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (F (((1 <= p31) AND (1 <= p32) AND (1 <= p34)))) OR (p120 <= 0)) R X ((p58 <= 0)))
lola: processed formula length: 86
lola: 116 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 41 markings, 41 edges
lola: ========================================
lola: subprocess 5 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((X ((1 <= p45)) OR (1 <= p127)))) OR F ((1 <= p53))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((X ((1 <= p45)) OR (1 <= p127)))) OR F ((1 <= p53))))
lola: processed formula length: 63
lola: 116 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: 29 markings, 29 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((X (G ((1 <= p70))) AND ((1 <= p92) AND ((1 <= p6) AND ((1 <= p7) AND (1 <= p9)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((X (G ((1 <= p70))) AND ((1 <= p92) AND ((1 <= p6) AND ((1 <= p7) AND (1 <= p9)))))))))
lola: processed formula length: 99
lola: 116 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 7 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((1 <= p41) AND (1 <= p42) AND (1 <= p44)))) AND F ((p97 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((1 <= p41) AND (1 <= p42) AND (1 <= p44)))) AND F ((p97 <= 0))))
lola: processed formula length: 75
lola: 116 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 8 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p53) U X ((X (X (F ((1 <= p52)))) OR G ((F ((1 <= p25)) OR (1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p53) U X ((X (X (F ((1 <= p52)))) OR G ((F ((1 <= p25)) OR (1 <= p25))))))
lola: processed formula length: 81
lola: 116 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 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: 21808 markings, 110413 edges
lola: ========================================
lola: subprocess 9 will run for 634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p20 <= 0)) OR ((((p91 <= 0) OR (p92 <= 0) OR (p94 <= 0)) AND (p22 <= 0)) AND X ((p20 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p20 <= 0)) OR ((((p91 <= 0) OR (p92 <= 0) OR (p94 <= 0)) AND (p22 <= 0)) AND X ((p20 <= 0))))))
lola: processed formula length: 108
lola: 116 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: 2795342 markings, 3774534 edges, 559068 markings/sec, 0 secs
lola: 5950880 markings, 8035469 edges, 631108 markings/sec, 5 secs
lola: 9409534 markings, 12705706 edges, 691731 markings/sec, 10 secs
lola: 12899166 markings, 17417773 edges, 697926 markings/sec, 15 secs
lola: 16375638 markings, 22112070 edges, 695294 markings/sec, 20 secs
lola: 19828223 markings, 26774095 edges, 690517 markings/sec, 25 secs
lola: 22982626 markings, 31033524 edges, 630881 markings/sec, 30 secs
lola: 26307773 markings, 35523496 edges, 665029 markings/sec, 35 secs
lola: 29409113 markings, 39711246 edges, 620268 markings/sec, 40 secs
lola: 32716330 markings, 44177004 edges, 661443 markings/sec, 45 secs
lola: 35977598 markings, 48580722 edges, 652254 markings/sec, 50 secs
lola: 39445460 markings, 53263375 edges, 693572 markings/sec, 55 secs
lola: 42850408 markings, 57861112 edges, 680990 markings/sec, 60 secs
lola: 46246331 markings, 62446628 edges, 679185 markings/sec, 65 secs
lola: 49386052 markings, 66686209 edges, 627944 markings/sec, 70 secs
lola: 52622959 markings, 71057028 edges, 647381 markings/sec, 75 secs
lola: 55939410 markings, 75535244 edges, 663290 markings/sec, 80 secs
lola: 58683175 markings, 79241876 edges, 548753 markings/sec, 85 secs
lola: 60775729 markings, 82066658 edges, 418511 markings/sec, 90 secs
lola: 63314714 markings, 85495888 edges, 507797 markings/sec, 95 secs
lola: 64474648 markings, 87060433 edges, 231987 markings/sec, 100 secs
lola: 66571359 markings, 89891631 edges, 419342 markings/sec, 105 secs
lola: 68486403 markings, 92477517 edges, 383009 markings/sec, 110 secs
lola: 70186209 markings, 94772791 edges, 339961 markings/sec, 115 secs
lola: 71240846 markings, 96196862 edges, 210927 markings/sec, 120 secs
lola: 72294825 markings, 97620065 edges, 210796 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 757 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p122 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p122 <= 0)))
lola: processed formula length: 19
lola: 116 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 101
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, 9 edges
lola: ========================================
lola: subprocess 11 will run for 1009 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p47))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p47))
lola: processed formula length: 14
lola: 116 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: 820 markings, 1295 edges
lola: ========================================
lola: subprocess 12 will run for 1514 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((F (((5 <= p4) AND (3 <= p3))) U (5 <= p4)) AND (1 <= p118)) OR ((p7 <= 0) AND (p35 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((F (((5 <= p4) AND (3 <= p3))) U (5 <= p4)) AND (1 <= p118)) OR ((p7 <= 0) AND (p35 <= 0))))
lola: processed formula length: 97
lola: 116 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 13 will run for 3029 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p96) AND (1 <= p97) AND (1 <= p99)) OR (F (((1 <= p96) AND (1 <= p97) AND (1 <= p99))) AND F (G (((p0 <= 0) OR (p126 <= 0) OR (p127 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3029 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p96) AND (1 <= p97) AND (1 <= p99))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p96) AND (1 <= p97) AND (1 <= p99))
lola: processed formula length: 42
lola: 116 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 (((p0 <= 0) OR (p126 <= 0) OR (p127 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p0 <= 0) OR (p126 <= 0) OR (p127 <= 0))))
lola: processed formula length: 51
lola: 116 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 102
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: 53 markings, 79 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X ((F ((G (((p73 <= 0) AND (p40 <= 0))) OR ((1 <= p73) AND ((p73 <= 0) AND (p40 <= 0))))) OR (G ((p47 <= 0)) AND (p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((G (((p73 <= 0) AND (p40 <= 0))) OR ((1 <= p73) AND ((p73 <= 0) AND (p40 <= 0))))) OR (G ((p47 <= 0)) AND (p7 <= 0)))))
lola: processed formula length: 129
lola: 116 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: 3055811 markings, 4644802 edges, 611162 markings/sec, 0 secs
lola: 6289710 markings, 9560341 edges, 646780 markings/sec, 5 secs
lola: 9338859 markings, 14195017 edges, 609830 markings/sec, 10 secs
lola: 12530014 markings, 19045575 edges, 638231 markings/sec, 15 secs
lola: 15623728 markings, 23748034 edges, 618743 markings/sec, 20 secs
lola: 18673256 markings, 28383311 edges, 609906 markings/sec, 25 secs
lola: 21665606 markings, 32931689 edges, 598470 markings/sec, 30 secs
lola: 24666450 markings, 37492976 edges, 600169 markings/sec, 35 secs
lola: 27783384 markings, 42230709 edges, 623387 markings/sec, 40 secs
lola: 30874280 markings, 46928877 edges, 618179 markings/sec, 45 secs
lola: 33968303 markings, 51631771 edges, 618805 markings/sec, 50 secs
lola: 37088925 markings, 56375117 edges, 624124 markings/sec, 55 secs
lola: 40164459 markings, 61049931 edges, 615107 markings/sec, 60 secs
lola: 43193210 markings, 65653638 edges, 605750 markings/sec, 65 secs
lola: 46302888 markings, 70380359 edges, 621936 markings/sec, 70 secs
lola: 49386673 markings, 75067717 edges, 616757 markings/sec, 75 secs
lola: 52507859 markings, 79811902 edges, 624237 markings/sec, 80 secs
lola: 54515123 markings, 82863104 edges, 401453 markings/sec, 85 secs
lola: 56016697 markings, 85152781 edges, 300315 markings/sec, 90 secs
lola: 58072876 markings, 88272954 edges, 411236 markings/sec, 95 secs
lola: 59640569 markings, 90653628 edges, 313539 markings/sec, 100 secs
lola: 60824474 markings, 92453141 edges, 236781 markings/sec, 105 secs
lola: 62429275 markings, 94892461 edges, 320960 markings/sec, 110 secs
lola: 63541654 markings, 96583269 edges, 222476 markings/sec, 115 secs
lola: 64947553 markings, 98720244 edges, 281180 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X ((((G ((1 <= p92)) R (1 <= p88)) R X (X (G ((p110 <= 0))))) OR (p92 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((G ((1 <= p92)) R (1 <= p88)) R X (X (G ((p110 <= 0))))) OR (p92 <= 0)))
lola: processed formula length: 77
lola: 116 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 19 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: 3264030 markings, 4961311 edges, 652806 markings/sec, 0 secs
lola: 6744085 markings, 10250979 edges, 696011 markings/sec, 5 secs
lola: 10234758 markings, 15556802 edges, 698135 markings/sec, 10 secs
lola: 13652545 markings, 20751841 edges, 683557 markings/sec, 15 secs
lola: 16741584 markings, 25447165 edges, 617808 markings/sec, 20 secs
lola: 19648979 markings, 29866418 edges, 581479 markings/sec, 25 secs
lola: 22544776 markings, 34268045 edges, 579159 markings/sec, 30 secs
lola: 25923239 markings, 39403291 edges, 675693 markings/sec, 35 secs
lola: 29297663 markings, 44532412 edges, 674885 markings/sec, 40 secs
lola: 32655328 markings, 49636067 edges, 671533 markings/sec, 45 secs
lola: 36035772 markings, 54774326 edges, 676089 markings/sec, 50 secs
lola: 39399809 markings, 59887677 edges, 672807 markings/sec, 55 secs
lola: 42325723 markings, 64335075 edges, 585183 markings/sec, 60 secs
lola: 45360511 markings, 68947930 edges, 606958 markings/sec, 65 secs
lola: 48635853 markings, 73926466 edges, 655068 markings/sec, 70 secs
lola: 51778672 markings, 78703550 edges, 628564 markings/sec, 75 secs
lola: 54067185 markings, 82182783 edges, 457703 markings/sec, 80 secs
lola: 56097297 markings, 85269049 edges, 406022 markings/sec, 85 secs
lola: 57526958 markings, 87440926 edges, 285932 markings/sec, 90 secs
lola: 59031553 markings, 89727910 edges, 300919 markings/sec, 95 secs
lola: 60913552 markings, 92588548 edges, 376400 markings/sec, 100 secs
lola: 62012024 markings, 94258250 edges, 219694 markings/sec, 105 secs
lola: 64094504 markings, 97423608 edges, 416496 markings/sec, 110 secs
lola: 65456237 markings, 99493447 edges, 272347 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (X (F ((G (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) OR G (F ((p45 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G (((p26 <= 0) OR (p27 <= 0) OR (p29 <= 0))) OR G (F ((p45 <= 0)))))))
lola: processed formula length: 82
lola: 116 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: 2831738 markings, 4304216 edges, 566348 markings/sec, 0 secs
lola: 5876893 markings, 8932844 edges, 609031 markings/sec, 5 secs
lola: 9036693 markings, 13735744 edges, 631960 markings/sec, 10 secs
lola: 12152624 markings, 18471942 edges, 623186 markings/sec, 15 secs
lola: 15199408 markings, 23103057 edges, 609357 markings/sec, 20 secs
lola: 18308199 markings, 27828430 edges, 621758 markings/sec, 25 secs
lola: 21305748 markings, 32384711 edges, 599510 markings/sec, 30 secs
lola: 23877490 markings, 36293756 edges, 514348 markings/sec, 35 secs
lola: 26710774 markings, 40600340 edges, 566657 markings/sec, 40 secs
lola: 29538214 markings, 44898043 edges, 565488 markings/sec, 45 secs
lola: 32543203 markings, 49465625 edges, 600998 markings/sec, 50 secs
lola: 35454211 markings, 53890350 edges, 582202 markings/sec, 55 secs
lola: 38322041 markings, 58249465 edges, 573566 markings/sec, 60 secs
lola: 41124136 markings, 62508660 edges, 560419 markings/sec, 65 secs
lola: 43907956 markings, 66740070 edges, 556764 markings/sec, 70 secs
lola: 46689792 markings, 70968457 edges, 556367 markings/sec, 75 secs
lola: 49759298 markings, 75634087 edges, 613901 markings/sec, 80 secs
lola: 52655879 markings, 80036904 edges, 579316 markings/sec, 85 secs
lola: 55207087 markings, 83915532 edges, 510242 markings/sec, 90 secs
lola: 56990099 markings, 86631657 edges, 356602 markings/sec, 95 secs
lola: 58976372 markings, 89656179 edges, 397255 markings/sec, 100 secs
lola: 60859460 markings, 92506328 edges, 376618 markings/sec, 105 secs
lola: 62800865 markings, 95457271 edges, 388281 markings/sec, 110 secs
lola: 65005217 markings, 98807894 edges, 440870 markings/sec, 115 secs
lola: 66500871 markings, 101081298 edges, 299131 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p20 <= 0)) OR ((((p91 <= 0) OR (p92 <= 0) OR (p94 <= 0)) AND (p22 <= 0)) AND X ((p20 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p20 <= 0)) OR ((((p91 <= 0) OR (p92 <= 0) OR (p94 <= 0)) AND (p22 <= 0)) AND X ((p20 <= 0))))))
lola: processed formula length: 108
lola: 116 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: 3005802 markings, 4058705 edges, 601160 markings/sec, 0 secs
lola: 6139964 markings, 8290786 edges, 626832 markings/sec, 5 secs
lola: 9335039 markings, 12605119 edges, 639015 markings/sec, 10 secs
lola: 12810988 markings, 17298715 edges, 695190 markings/sec, 15 secs
lola: 16212730 markings, 21892085 edges, 680348 markings/sec, 20 secs
lola: 19378745 markings, 26167180 edges, 633203 markings/sec, 25 secs
lola: 22564845 markings, 30469391 edges, 637220 markings/sec, 30 secs
lola: 25907495 markings, 34982998 edges, 668530 markings/sec, 35 secs
lola: 29257975 markings, 39507175 edges, 670096 markings/sec, 40 secs
lola: 32235045 markings, 43527129 edges, 595414 markings/sec, 45 secs
lola: 35331887 markings, 47708806 edges, 619368 markings/sec, 50 secs
lola: 38752138 markings, 52327194 edges, 684050 markings/sec, 55 secs
lola: 42166405 markings, 56937493 edges, 682853 markings/sec, 60 secs
lola: 45574972 markings, 61540102 edges, 681713 markings/sec, 65 secs
lola: 48955074 markings, 66104247 edges, 676020 markings/sec, 70 secs
lola: 52364040 markings, 70707408 edges, 681793 markings/sec, 75 secs
lola: 55834745 markings, 75393901 edges, 694141 markings/sec, 80 secs
lola: 58521140 markings, 79022926 edges, 537279 markings/sec, 85 secs
lola: 60129837 markings, 81204681 edges, 321739 markings/sec, 90 secs
lola: 61073971 markings, 82469201 edges, 188827 markings/sec, 95 secs
lola: 62862792 markings, 84883924 edges, 357764 markings/sec, 100 secs
lola: 63700185 markings, 86014661 edges, 167479 markings/sec, 105 secs
lola: 65559055 markings, 88524691 edges, 371774 markings/sec, 110 secs
lola: 67281697 markings, 90850816 edges, 344528 markings/sec, 115 secs
lola: 69969877 markings, 94480676 edges, 537636 markings/sec, 120 secs
lola: 70733563 markings, 95511892 edges, 152737 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown no no unknown no no unknown no no no no no yes unknown
lola:
preliminary result: unknown no no unknown no no unknown no no no no no yes unknown
lola: memory consumption: 3156 KB
lola: time consumption: 1072 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="RefineWMG-PT-025025"
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 RefineWMG-PT-025025, 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 r189-tajo-162089432900330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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