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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 07:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 07:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 25K 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 MAPK-PT-10240-00
FORMULA_NAME MAPK-PT-10240-01
FORMULA_NAME MAPK-PT-10240-02
FORMULA_NAME MAPK-PT-10240-03
FORMULA_NAME MAPK-PT-10240-04
FORMULA_NAME MAPK-PT-10240-05
FORMULA_NAME MAPK-PT-10240-06
FORMULA_NAME MAPK-PT-10240-07
FORMULA_NAME MAPK-PT-10240-08
FORMULA_NAME MAPK-PT-10240-09
FORMULA_NAME MAPK-PT-10240-10
FORMULA_NAME MAPK-PT-10240-11
FORMULA_NAME MAPK-PT-10240-12
FORMULA_NAME MAPK-PT-10240-13
FORMULA_NAME MAPK-PT-10240-14
FORMULA_NAME MAPK-PT-10240-15

=== Now, execution of the tool begins

BK_START 1620937354925

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:22:36] [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 20:22:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:22:36] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2021-05-13 20:22:36] [INFO ] Transformed 22 places.
[2021-05-13 20:22:36] [INFO ] Transformed 30 transitions.
[2021-05-13 20:22:36] [INFO ] Parsed PT model containing 22 places and 30 transitions in 64 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 102432 steps, including 0 resets, run finished after 61 ms. (steps per millisecond=1679 ) properties seen :[0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1]
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 20:22:36] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-13 20:22:36] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2021-05-13 20:22:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:36] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-13 20:22:36] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 7 ms.
[2021-05-13 20:22:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:22:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2021-05-13 20:22:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:36] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-13 20:22:36] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 5 ms.
[2021-05-13 20:22:36] [INFO ] Added : 26 causal constraints over 6 iterations in 54 ms. Result :sat
[2021-05-13 20:22:36] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:22:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:36] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-13 20:22:36] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:22:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:22:37] [INFO ] Added : 26 causal constraints over 6 iterations in 29 ms. Result :sat
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:22:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:22:37] [INFO ] Added : 27 causal constraints over 7 iterations in 26 ms. Result :sat
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 4 ms.
[2021-05-13 20:22:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:22:37] [INFO ] Added : 25 causal constraints over 6 iterations in 23 ms. Result :sat
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:22:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:22:37] [INFO ] Added : 26 causal constraints over 6 iterations in 23 ms. Result :sat
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:22:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:22:37] [INFO ] Added : 25 causal constraints over 6 iterations in 21 ms. Result :sat
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:22:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:22:37] [INFO ] Added : 25 causal constraints over 7 iterations in 24 ms. Result :sat
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:22:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:22:37] [INFO ] Added : 22 causal constraints over 6 iterations in 26 ms. Result :sat
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:22:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:22:37] [INFO ] Added : 26 causal constraints over 6 iterations in 22 ms. Result :sat
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:22:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 1 ms.
[2021-05-13 20:22:37] [INFO ] Added : 25 causal constraints over 5 iterations in 16 ms. Result :sat
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 1 ms.
[2021-05-13 20:22:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:22:37] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:22:37] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:22:37] [INFO ] Added : 26 causal constraints over 6 iterations in 20 ms. Result :sat
[2021-05-13 20:22:37] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 20:22:37] [INFO ] Flatten gal took : 26 ms
FORMULA MAPK-PT-10240-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-10240-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 20:22:37] [INFO ] Flatten gal took : 6 ms
[2021-05-13 20:22:37] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2021-05-13 20:22:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ MAPK-PT-10240 @ 3570 seconds

FORMULA MAPK-PT-10240-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-10240-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2710
rslt: Output for LTLFireability @ MAPK-PT-10240

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

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((G ((1 <= p0)) AND X ((G (((p2 <= 0) OR (p16 <= 0))) AND X ((p19 <= 0))))))",
"processed_size": 79,
"rewrites": 96
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 401
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p17) AND (1 <= p13))))",
"processed_size": 35,
"rewrites": 96
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 458
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p8) AND (1 <= p10))))",
"processed_size": 34,
"rewrites": 96
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 642
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((X (F ((G (((p9 <= 0) OR (p11 <= 0))) OR (((p7 <= 0) OR (p15 <= 0)) AND X (((p9 <= 0) OR (p11 <= 0))))))) AND G ((1 <= p18)))))",
"processed_size": 136,
"rewrites": 96
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 802
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F (G ((1 <= p13))) OR X ((F ((1 <= p13)) AND (1 <= p17)))))",
"processed_size": 63,
"rewrites": 96
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 10,
"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": 1070
},
"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": "G (F ((p1 <= 0)))",
"processed_size": 17,
"rewrites": 96
},
"result":
{
"edges": 151050,
"markings": 94726,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1604
},
"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": "F (G ((p14 <= 0)))",
"processed_size": 18,
"rewrites": 96
},
"result":
{
"edges": 158737,
"markings": 97290,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"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": 3209
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "((G (((1 <= p12) OR (1 <= p13))) AND (1 <= p17)) U G ((p13 <= 0)))",
"processed_size": 67,
"rewrites": 96
},
"result":
{
"edges": 20487,
"markings": 20486,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3424,
"runtime": 860.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X((** OR (G(F(**)) AND F(**)))) U **) : F(G(((X(G(*)) AND **) OR **))) : X(((G(**) OR (** OR **)) U (F(**) AND **))) : (X(X(**)) OR (G(**) AND (G(**) OR **))) : G(F(*)) : X((G(**) OR X((X(G(*)) R *)))) : X((G(**) AND X((G(*) AND X(*))))) : ((G(**) AND **) U G(*)) : X(F(**)) : X(F(**)) : X(F((X(**) OR **))) : F(G(**)) : X(G((X(F((G(*) OR (* AND X(*))))) AND G(**)))) : G((F(G(**)) OR X((F(**) AND **))))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no no no no no unknown no no no no no no no no ",
"value": "no no no no no unknown no no no no no 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: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 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 ((NOT(G (X (NOT(F (G (F (X ((1 <= p1))))))))) U (p1 <= 0))) U (1 <= p18)) : G (NOT(G (X (NOT(G (((G (NOT(F (X ((1 <= p19))))) AND (1 <= p17)) OR (1 <= p1)))))))) : X ((((G ((1 <= p12)) OR (p7 <= 0)) OR (p15 <= 0)) U (F ((1 <= p14)) AND (1 <= p5)))) : (X (X (((1 <= p2) AND (1 <= p16)))) OR (G (((1 <= p20) AND (1 <= p21))) AND (G ((1 <= p4)) OR (1 <= p4)))) : NOT((F ((NOT(X (((1 <= p6) AND (1 <= p9)))) AND G ((1 <= p13)))) U F (X (G ((1 <= p1)))))) : X ((G (((p7 <= 0) OR (p8 <= 0))) OR X (NOT((F (X (((1 <= p3) AND (1 <= p16)))) U ((1 <= p7) AND (1 <= p8))))))) : (X (G ((1 <= p0))) AND NOT(X (X ((F (((1 <= p2) AND (1 <= p16))) OR X ((1 <= p19))))))) : ((NOT(F (NOT(G (((1 <= p12) OR (1 <= p13)))))) AND (1 <= p17)) U NOT(F ((1 <= p13)))) : ((X (X ((1 <= p0))) OR X (F (X ((p17 <= 0))))) U F (X (((1 <= p17) AND (1 <= p13))))) : F (X ((G (X (((1 <= p8) AND (1 <= p10)))) U F (((1 <= p8) AND (1 <= p10)))))) : X (F ((X ((1 <= p18)) OR ((1 <= p9) AND (1 <= p11))))) : X (F (G ((p14 <= 0)))) : G (X ((NOT(X (G ((((1 <= p7) AND (1 <= p15)) U X (((1 <= p9) AND (1 <= p11))))))) AND G ((1 <= p18))))) : G ((F (G ((1 <= p13))) OR X ((((1 <= p14) U F ((1 <= p13))) AND (1 <= p17)))))
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:371
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:374
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
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:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:528
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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 (((p1 <= 0) OR (G (F ((1 <= p1))) AND F ((p1 <= 0))))) U (1 <= p18))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((p1 <= 0) OR (G (F ((1 <= p1))) AND F ((p1 <= 0))))) U (1 <= p18))
lola: processed formula length: 71
lola: 96 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: 10 markings, 12 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((X (G ((p19 <= 0))) AND (1 <= p17)) OR (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((X (G ((p19 <= 0))) AND (1 <= p17)) OR (1 <= p1))))
lola: processed formula length: 58
lola: 96 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G ((1 <= p12)) OR ((p7 <= 0) OR (p15 <= 0))) U (F ((1 <= p14)) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G ((1 <= p12)) OR ((p7 <= 0) OR (p15 <= 0))) U (F ((1 <= p14)) AND (1 <= p5))))
lola: processed formula length: 84
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (((1 <= p2) AND (1 <= p16)))) OR (G (((1 <= p20) AND (1 <= p21))) AND (G ((1 <= p4)) OR (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p4)
lola: processed formula length: 9
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p4))
lola: processed formula length: 13
lola: 96 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: 20482 markings, 20482 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((1 <= p2) AND (1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((1 <= p2) AND (1 <= p16))))
lola: processed formula length: 34
lola: 96 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((p7 <= 0) OR (p8 <= 0))) OR X ((X (G (((p3 <= 0) OR (p16 <= 0)))) R ((p7 <= 0) OR (p8 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p7 <= 0) OR (p8 <= 0))) OR X ((X (G (((p3 <= 0) OR (p16 <= 0)))) R ((p7 <= 0) OR (p8 <= 0))))))
lola: processed formula length: 107
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 2343748 markings, 4221318 edges, 468750 markings/sec, 0 secs
lola: 3931925 markings, 7080614 edges, 317635 markings/sec, 5 secs
lola: 5314944 markings, 9569868 edges, 276604 markings/sec, 10 secs
lola: 6622969 markings, 11924578 edges, 261605 markings/sec, 15 secs
lola: 7882741 markings, 14194125 edges, 251954 markings/sec, 20 secs
lola: 9110859 markings, 16403546 edges, 245624 markings/sec, 25 secs
lola: 10318476 markings, 18578532 edges, 241523 markings/sec, 30 secs
lola: 11532872 markings, 20764442 edges, 242879 markings/sec, 35 secs
lola: 12706245 markings, 22875305 edges, 234675 markings/sec, 40 secs
lola: 13878496 markings, 24985704 edges, 234450 markings/sec, 45 secs
lola: 15026107 markings, 27053376 edges, 229522 markings/sec, 50 secs
lola: 16187865 markings, 29143381 edges, 232352 markings/sec, 55 secs
lola: 17505734 markings, 31515220 edges, 263574 markings/sec, 60 secs
lola: 18634584 markings, 33548550 edges, 225770 markings/sec, 65 secs
lola: 19785750 markings, 35620166 edges, 230233 markings/sec, 70 secs
lola: 21283293 markings, 38316120 edges, 299509 markings/sec, 75 secs
lola: 22733885 markings, 40926970 edges, 290118 markings/sec, 80 secs
lola: 24178815 markings, 43527802 edges, 288986 markings/sec, 85 secs
lola: 25628319 markings, 46137722 edges, 289901 markings/sec, 90 secs
lola: 27065482 markings, 48727509 edges, 287433 markings/sec, 95 secs
lola: 28503375 markings, 51315924 edges, 287579 markings/sec, 100 secs
lola: 29949799 markings, 53918153 edges, 289285 markings/sec, 105 secs
lola: 31367169 markings, 56469758 edges, 283474 markings/sec, 110 secs
lola: 32788215 markings, 59027938 edges, 284209 markings/sec, 115 secs
lola: 34214839 markings, 61594058 edges, 285325 markings/sec, 120 secs
lola: 35627955 markings, 64139820 edges, 282623 markings/sec, 125 secs
lola: 37060184 markings, 66716670 edges, 286446 markings/sec, 130 secs
lola: 38479961 markings, 69272192 edges, 283955 markings/sec, 135 secs
lola: 39875866 markings, 71784228 edges, 279181 markings/sec, 140 secs
lola: 41268905 markings, 74292290 edges, 278608 markings/sec, 145 secs
lola: 42660730 markings, 76797970 edges, 278365 markings/sec, 150 secs
lola: 44048858 markings, 79295390 edges, 277626 markings/sec, 155 secs
lola: 45408688 markings, 81747999 edges, 271966 markings/sec, 160 secs
lola: 46785470 markings, 84222624 edges, 275356 markings/sec, 165 secs
lola: 47922694 markings, 86269736 edges, 227445 markings/sec, 170 secs
lola: 49009024 markings, 88227396 edges, 217266 markings/sec, 175 secs
lola: 50092149 markings, 90176255 edges, 216625 markings/sec, 180 secs
lola: 51186337 markings, 92147794 edges, 218838 markings/sec, 185 secs
lola: 52250855 markings, 94063229 edges, 212904 markings/sec, 190 secs
lola: 53361652 markings, 96061328 edges, 222159 markings/sec, 195 secs
lola: 54461435 markings, 98040994 edges, 219957 markings/sec, 200 secs
lola: 55564086 markings, 100028912 edges, 220530 markings/sec, 205 secs
lola: 56633172 markings, 101950058 edges, 213817 markings/sec, 210 secs
lola: 57751087 markings, 103964630 edges, 223583 markings/sec, 215 secs
lola: 58857830 markings, 105954180 edges, 221349 markings/sec, 220 secs
lola: 59984082 markings, 107984716 edges, 225250 markings/sec, 225 secs
lola: 61208550 markings, 110187538 edges, 244894 markings/sec, 230 secs
lola: 62492092 markings, 112495381 edges, 256708 markings/sec, 235 secs
lola: 63822847 markings, 114893642 edges, 266151 markings/sec, 240 secs
lola: 65200221 markings, 117368341 edges, 275475 markings/sec, 245 secs
lola: 66518519 markings, 119746473 edges, 263660 markings/sec, 250 secs
lola: 67893627 markings, 122219072 edges, 275022 markings/sec, 255 secs
lola: 68960619 markings, 124142283 edges, 213398 markings/sec, 260 secs
lola: 70055240 markings, 126109162 edges, 218924 markings/sec, 265 secs
lola: 71146214 markings, 128074503 edges, 218195 markings/sec, 270 secs
lola: 72231931 markings, 130029923 edges, 217143 markings/sec, 275 secs
lola: 73299781 markings, 131952389 edges, 213570 markings/sec, 280 secs
lola: 74380675 markings, 133896460 edges, 216179 markings/sec, 285 secs
lola: 75462959 markings, 135844336 edges, 216457 markings/sec, 290 secs
lola: 76559490 markings, 137817491 edges, 219306 markings/sec, 295 secs
lola: 77673909 markings, 139827409 edges, 222884 markings/sec, 300 secs
lola: 78850251 markings, 141941670 edges, 235268 markings/sec, 305 secs
lola: 80074096 markings, 144146103 edges, 244769 markings/sec, 310 secs
lola: 81295135 markings, 146343377 edges, 244208 markings/sec, 315 secs
lola: 82528739 markings, 148565746 edges, 246721 markings/sec, 320 secs
lola: 83752888 markings, 150770798 edges, 244830 markings/sec, 325 secs
lola: 84692184 markings, 152462259 edges, 187859 markings/sec, 330 secs
lola: 85612887 markings, 154115132 edges, 184141 markings/sec, 335 secs
lola: 86404320 markings, 155539373 edges, 158287 markings/sec, 340 secs
lola: 87325987 markings, 157197884 edges, 184333 markings/sec, 345 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((1 <= p0)) AND X ((G (((p2 <= 0) OR (p16 <= 0))) AND X ((p19 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((1 <= p0)) AND X ((G (((p2 <= 0) OR (p16 <= 0))) AND X ((p19 <= 0))))))
lola: processed formula length: 79
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p17) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p17) AND (1 <= p13))))
lola: processed formula length: 35
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p8) AND (1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p8) AND (1 <= p10))))
lola: processed formula length: 34
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 8 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((1 <= p18)) OR ((1 <= p9) AND (1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((1 <= p18)) OR ((1 <= p9) AND (1 <= p11)))))
lola: processed formula length: 54
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (F ((G (((p9 <= 0) OR (p11 <= 0))) OR (((p7 <= 0) OR (p15 <= 0)) AND X (((p9 <= 0) OR (p11 <= 0))))))) AND G ((1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (F ((G (((p9 <= 0) OR (p11 <= 0))) OR (((p7 <= 0) OR (p15 <= 0)) AND X (((p9 <= 0) OR (p11 <= 0))))))) AND G ((1 <= p18)))))
lola: processed formula length: 136
lola: 96 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((1 <= p13))) OR X ((F ((1 <= p13)) AND (1 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((1 <= p13))) OR X ((F ((1 <= p13)) AND (1 <= p17)))))
lola: processed formula length: 63
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 11 will run for 1070 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p1 <= 0)))
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 ((p1 <= 0)))
lola: processed formula length: 17
lola: 96 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: 94726 markings, 151050 edges
lola: ========================================
lola: subprocess 12 will run for 1604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p14 <= 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 ((p14 <= 0)))
lola: processed formula length: 18
lola: 96 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 29
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: 97290 markings, 158737 edges
lola: ========================================
lola: subprocess 13 will run for 3209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((1 <= p12) OR (1 <= p13))) AND (1 <= p17)) U G ((p13 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((1 <= p12) OR (1 <= p13))) AND (1 <= p17)) U G ((p13 <= 0)))
lola: processed formula length: 67
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20486 markings, 20487 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((G (((p7 <= 0) OR (p8 <= 0))) OR X ((X (G (((p3 <= 0) OR (p16 <= 0)))) R ((p7 <= 0) OR (p8 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p7 <= 0) OR (p8 <= 0))) OR X ((X (G (((p3 <= 0) OR (p16 <= 0)))) R ((p7 <= 0) OR (p8 <= 0))))))
lola: processed formula length: 107
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 2136685 markings, 3848255 edges, 427337 markings/sec, 0 secs
lola: 3720998 markings, 6700922 edges, 316863 markings/sec, 5 secs
lola: 5078448 markings, 9144706 edges, 271490 markings/sec, 10 secs
lola: 6338467 markings, 11412422 edges, 252004 markings/sec, 15 secs
lola: 7569165 markings, 13628855 edges, 246140 markings/sec, 20 secs
lola: 8767322 markings, 15785427 edges, 239631 markings/sec, 25 secs
lola: 9946303 markings, 17908562 edges, 235796 markings/sec, 30 secs
lola: 11104916 markings, 19992752 edges, 231723 markings/sec, 35 secs
lola: 12245529 markings, 22046515 edges, 228123 markings/sec, 40 secs
lola: 13386576 markings, 24100726 edges, 228209 markings/sec, 45 secs
lola: 14513886 markings, 26130957 edges, 225462 markings/sec, 50 secs
lola: 15625158 markings, 28131549 edges, 222254 markings/sec, 55 secs
lola: 16729098 markings, 30117669 edges, 220788 markings/sec, 60 secs
lola: 17823061 markings, 32086887 edges, 218793 markings/sec, 65 secs
lola: 18896823 markings, 34019184 edges, 214752 markings/sec, 70 secs
lola: 19965094 markings, 35943086 edges, 213654 markings/sec, 75 secs
lola: 21027017 markings, 37855622 edges, 212385 markings/sec, 80 secs
lola: 22082976 markings, 39757407 edges, 211192 markings/sec, 85 secs
lola: 23134682 markings, 41648325 edges, 210341 markings/sec, 90 secs
lola: 24172303 markings, 43517786 edges, 207524 markings/sec, 95 secs
lola: 25234433 markings, 45429452 edges, 212426 markings/sec, 100 secs
lola: 26292440 markings, 47332512 edges, 211601 markings/sec, 105 secs
lola: 27352698 markings, 49241479 edges, 212052 markings/sec, 110 secs
lola: 28412970 markings, 51151548 edges, 212054 markings/sec, 115 secs
lola: 29627298 markings, 53336877 edges, 242866 markings/sec, 120 secs
lola: 31070434 markings, 55935602 edges, 288627 markings/sec, 125 secs
lola: 32516525 markings, 58537118 edges, 289218 markings/sec, 130 secs
lola: 33956040 markings, 61128650 edges, 287903 markings/sec, 135 secs
lola: 35388439 markings, 63709045 edges, 286480 markings/sec, 140 secs
lola: 36815357 markings, 66275813 edges, 285384 markings/sec, 145 secs
lola: 38234506 markings, 68829393 edges, 283830 markings/sec, 150 secs
lola: 39648048 markings, 71374676 edges, 282708 markings/sec, 155 secs
lola: 41050644 markings, 73899708 edges, 280519 markings/sec, 160 secs
lola: 42453217 markings, 76424615 edges, 280515 markings/sec, 165 secs
lola: 43848998 markings, 78938896 edges, 279156 markings/sec, 170 secs
lola: 45243580 markings, 81445357 edges, 278916 markings/sec, 175 secs
lola: 46558165 markings, 83813915 edges, 262917 markings/sec, 180 secs
lola: 47844957 markings, 86131872 edges, 257358 markings/sec, 185 secs
lola: 49086613 markings, 88365019 edges, 248331 markings/sec, 190 secs
lola: 50323068 markings, 90591597 edges, 247291 markings/sec, 195 secs
lola: 51539757 markings, 92785026 edges, 243338 markings/sec, 200 secs
lola: 52626945 markings, 94737294 edges, 217438 markings/sec, 205 secs
lola: 53729928 markings, 96721349 edges, 220597 markings/sec, 210 secs
lola: 54826990 markings, 98701040 edges, 219412 markings/sec, 215 secs
lola: 55925020 markings, 100677690 edges, 219606 markings/sec, 220 secs
lola: 57019815 markings, 102645618 edges, 218959 markings/sec, 225 secs
lola: 58112414 markings, 104612957 edges, 218520 markings/sec, 230 secs
lola: 59550696 markings, 107199126 edges, 287656 markings/sec, 235 secs
lola: 60593152 markings, 109078763 edges, 208491 markings/sec, 240 secs
lola: 61601712 markings, 110892628 edges, 201712 markings/sec, 245 secs
lola: 62617457 markings, 112722605 edges, 203149 markings/sec, 250 secs
lola: 63625699 markings, 114537476 edges, 201648 markings/sec, 255 secs
lola: 64632986 markings, 116351202 edges, 201457 markings/sec, 260 secs
lola: 65608004 markings, 118107077 edges, 195004 markings/sec, 265 secs
lola: 66586083 markings, 119865118 edges, 195616 markings/sec, 270 secs
lola: 67583968 markings, 121663007 edges, 199577 markings/sec, 275 secs
lola: 68590803 markings, 123476661 edges, 201367 markings/sec, 280 secs
lola: 69620786 markings, 125328987 edges, 205997 markings/sec, 285 secs
lola: 70660853 markings, 127199958 edges, 208013 markings/sec, 290 secs
lola: 71691195 markings, 129059438 edges, 206068 markings/sec, 295 secs
lola: 72757144 markings, 130977844 edges, 213190 markings/sec, 300 secs
lola: 73826889 markings, 132903343 edges, 213949 markings/sec, 305 secs
lola: 74900396 markings, 134835075 edges, 214701 markings/sec, 310 secs
lola: 75973539 markings, 136762835 edges, 214629 markings/sec, 315 secs
lola: 77055796 markings, 138713805 edges, 216451 markings/sec, 320 secs
lola: 78134204 markings, 140650885 edges, 215682 markings/sec, 325 secs
lola: 79155513 markings, 142493220 edges, 204262 markings/sec, 330 secs
lola: 80181849 markings, 144341424 edges, 205267 markings/sec, 335 secs
lola: 81178749 markings, 146135161 edges, 199380 markings/sec, 340 secs
lola: 82165246 markings, 147911776 edges, 197299 markings/sec, 345 secs
lola: 83142855 markings, 149671333 edges, 195522 markings/sec, 350 secs
lola: 83931095 markings, 151085018 edges, 157648 markings/sec, 355 secs
lola: 84836603 markings, 152717075 edges, 181102 markings/sec, 360 secs
lola: 85710470 markings, 154302415 edges, 174773 markings/sec, 365 secs
lola: 86751773 markings, 156167795 edges, 208261 markings/sec, 370 secs
lola: 87642727 markings, 157771216 edges, 178191 markings/sec, 375 secs
lola: 88357276 markings, 159057737 edges, 142910 markings/sec, 380 secs
lola: 88956321 markings, 160133760 edges, 119809 markings/sec, 385 secs
lola: 90092502 markings, 162181077 edges, 227236 markings/sec, 390 secs
lola: 90583961 markings, 163066401 edges, 98292 markings/sec, 395 secs
lola: 91246446 markings, 164255712 edges, 132497 markings/sec, 400 secs
lola: 92123163 markings, 165837601 edges, 175343 markings/sec, 405 secs
lola: 92702049 markings, 166877191 edges, 115777 markings/sec, 410 secs
lola: 93623097 markings, 168536037 edges, 184210 markings/sec, 415 secs
lola: 94262028 markings, 169684108 edges, 127786 markings/sec, 420 secs
lola: 95071130 markings, 171142698 edges, 161820 markings/sec, 425 secs
lola: 95797641 markings, 172448519 edges, 145302 markings/sec, 430 secs
lola: 96621978 markings, 173932316 edges, 164867 markings/sec, 435 secs
lola: 97630196 markings, 175749264 edges, 201644 markings/sec, 440 secs
lola: 98419080 markings, 177171378 edges, 157777 markings/sec, 445 secs
lola: 99169049 markings, 178518522 edges, 149994 markings/sec, 450 secs
lola: 100083671 markings, 180163783 edges, 182924 markings/sec, 455 secs
lola: 101010368 markings, 181834948 edges, 185339 markings/sec, 460 secs
lola: 101845361 markings, 183336588 edges, 166999 markings/sec, 465 secs
lola: 102782914 markings, 185022262 edges, 187511 markings/sec, 470 secs
lola: 103651540 markings, 186584421 edges, 173725 markings/sec, 475 secs
lola: 104620418 markings, 188329178 edges, 193776 markings/sec, 480 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no unknown no no no no no no no no
lola:
preliminary result: no no no no no unknown no no no no no no no no
lola: memory consumption: 3424 KB
lola: time consumption: 860 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="MAPK-PT-10240"
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 MAPK-PT-10240, 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 r132-tall-162075428600390"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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