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.r227-tall-162098231200358.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 ShieldPPPt-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098231200358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 12:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 12:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 18:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 18:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 37K May 5 16:52 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621176174927

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 14:42:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-16 14:42:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 14:42:56] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-16 14:42:56] [INFO ] Transformed 159 places.
[2021-05-16 14:42:56] [INFO ] Transformed 145 transitions.
[2021-05-16 14:42:56] [INFO ] Found NUPN structural information;
[2021-05-16 14:42:56] [INFO ] Parsed PT model containing 159 places and 145 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 4 resets, run finished after 297 ms. (steps per millisecond=336 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 145 rows 159 cols
[2021-05-16 14:42:56] [INFO ] Computed 23 place invariants in 7 ms
[2021-05-16 14:42:57] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2021-05-16 14:42:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:42:57] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-16 14:42:57] [INFO ] Deduced a trap composed of 21 places in 68 ms
[2021-05-16 14:42:57] [INFO ] Deduced a trap composed of 18 places in 40 ms
[2021-05-16 14:42:57] [INFO ] Deduced a trap composed of 20 places in 30 ms
[2021-05-16 14:42:57] [INFO ] Deduced a trap composed of 17 places in 16 ms
[2021-05-16 14:42:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 200 ms
[2021-05-16 14:42:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:42:57] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2021-05-16 14:42:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:42:57] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-16 14:42:57] [INFO ] Deduced a trap composed of 21 places in 44 ms
[2021-05-16 14:42:57] [INFO ] Deduced a trap composed of 20 places in 27 ms
[2021-05-16 14:42:57] [INFO ] Deduced a trap composed of 18 places in 18 ms
[2021-05-16 14:42:57] [INFO ] Deduced a trap composed of 17 places in 11 ms
[2021-05-16 14:42:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 135 ms
[2021-05-16 14:42:57] [INFO ] Computed and/alt/rep : 144/215/144 causal constraints in 10 ms.
[2021-05-16 14:42:57] [INFO ] Added : 139 causal constraints over 28 iterations in 290 ms. Result :sat
[2021-05-16 14:42:58] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2021-05-16 14:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:42:58] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-16 14:42:58] [INFO ] Deduced a trap composed of 12 places in 37 ms
[2021-05-16 14:42:58] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2021-05-16 14:42:58] [INFO ] Deduced a trap composed of 22 places in 48 ms
[2021-05-16 14:42:58] [INFO ] Deduced a trap composed of 18 places in 19 ms
[2021-05-16 14:42:58] [INFO ] Deduced a trap composed of 20 places in 16 ms
[2021-05-16 14:42:58] [INFO ] Deduced a trap composed of 20 places in 12 ms
[2021-05-16 14:42:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 221 ms
[2021-05-16 14:42:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:42:58] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2021-05-16 14:42:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:42:58] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2021-05-16 14:42:58] [INFO ] Deduced a trap composed of 12 places in 35 ms
[2021-05-16 14:42:58] [INFO ] Deduced a trap composed of 25 places in 47 ms
[2021-05-16 14:42:58] [INFO ] Deduced a trap composed of 22 places in 35 ms
[2021-05-16 14:42:58] [INFO ] Deduced a trap composed of 18 places in 35 ms
[2021-05-16 14:42:58] [INFO ] Deduced a trap composed of 20 places in 23 ms
[2021-05-16 14:42:58] [INFO ] Deduced a trap composed of 18 places in 18 ms
[2021-05-16 14:42:58] [INFO ] Deduced a trap composed of 20 places in 13 ms
[2021-05-16 14:42:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 255 ms
[2021-05-16 14:42:58] [INFO ] Computed and/alt/rep : 144/215/144 causal constraints in 9 ms.
[2021-05-16 14:42:58] [INFO ] Added : 135 causal constraints over 27 iterations in 245 ms. Result :sat
[2021-05-16 14:42:58] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned unsat
[2021-05-16 14:42:59] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2021-05-16 14:42:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:42:59] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-16 14:42:59] [INFO ] Deduced a trap composed of 22 places in 19 ms
[2021-05-16 14:42:59] [INFO ] Deduced a trap composed of 18 places in 14 ms
[2021-05-16 14:42:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2021-05-16 14:42:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:42:59] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2021-05-16 14:42:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:42:59] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-16 14:42:59] [INFO ] Deduced a trap composed of 22 places in 15 ms
[2021-05-16 14:42:59] [INFO ] Deduced a trap composed of 18 places in 25 ms
[2021-05-16 14:42:59] [INFO ] Deduced a trap composed of 21 places in 31 ms
[2021-05-16 14:42:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 92 ms
[2021-05-16 14:42:59] [INFO ] Computed and/alt/rep : 144/215/144 causal constraints in 9 ms.
[2021-05-16 14:42:59] [INFO ] Added : 136 causal constraints over 28 iterations in 251 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-16 14:42:59] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-16 14:42:59] [INFO ] Flatten gal took : 49 ms
FORMULA ShieldPPPt-PT-002B-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 14:42:59] [INFO ] Applying decomposition
[2021-05-16 14:42:59] [INFO ] Flatten gal took : 13 ms
[2021-05-16 14:42:59] [INFO ] Decomposing Gal with order
[2021-05-16 14:42:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 14:42:59] [INFO ] Flatten gal took : 34 ms
[2021-05-16 14:42:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-16 14:42:59] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-16 14:42:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldPPPt-PT-002B @ 3570 seconds

FORMULA ShieldPPPt-PT-002B-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002B-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002B-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002B-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002B-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002B-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002B-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002B-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002B-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002B-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002B-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-002B-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1930
rslt: Output for LTLFireability @ ShieldPPPt-PT-002B

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 16 14:43:00 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p135 <= 0))",
"processed_size": 13,
"rewrites": 80
},
"result":
{
"edges": 53,
"markings": 53,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 453
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((((1 <= p18)) AND (X (G (((p142 <= 0)))) OR F ((((p142 <= 0)) AND (F (((p142 <= 0))) OR G (((p142 <= 0)))))))))",
"processed_size": 114,
"rewrites": 78
},
"result":
{
"edges": 62,
"markings": 62,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 528
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p4) AND (1 <= p23) AND (1 <= p138))))",
"processed_size": 50,
"rewrites": 78
},
"result":
{
"edges": 176,
"markings": 175,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1057
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 3,
"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": 2,
"visible_transitions": 0
},
"processed": "F (((((p114 <= 0)) R (((p154 <= 0)) AND ((p114 <= 0)))) AND G (((p154 <= 0)))))",
"processed_size": 79,
"rewrites": 78
},
"result":
{
"edges": 300,
"markings": 300,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3171
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((1 <= p8)))",
"processed_size": 15,
"rewrites": 78
},
"result":
{
"edges": 56,
"markings": 56,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3171
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((1 <= p144)))",
"processed_size": 17,
"rewrites": 78
},
"result":
{
"edges": 56,
"markings": 56,
"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": 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": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((p20 <= 0) OR (p22 <= 0))))",
"processed_size": 35,
"rewrites": 78
},
"result":
{
"edges": 319,
"markings": 314,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((1 <= p8)))",
"processed_size": 15,
"rewrites": 78
},
"result":
{
"edges": 56,
"markings": 56,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((p74 <= 0))",
"processed_size": 12,
"rewrites": 80
},
"result":
{
"edges": 56,
"markings": 56,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3972,
"runtime": 1640.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : F(G((F(**) AND **))) : (F(**) OR (** OR (G(**) AND F((F(**) OR **))))) : (G(**) OR (G(F(*)) AND F(G(**)))) : (X((G((G(**) AND *)) AND X(F(*)))) AND F(**)) : G(*) : X(F((F(**) OR X(**)))) : X((G(F(**)) OR (** OR **))) : G((F(G((X(*) OR (* OR (* OR *))))) OR (* R *))) : G((G(*) AND (X(**) AND **))) : X((** AND (X(G(*)) OR F((* AND (F(*) OR G(*))))))) : F(((* R *) AND G(*)))"
},
"net":
{
"arcs": 362,
"conflict_clusters": 131,
"places": 159,
"places_significant": 136,
"singleton_clusters": 0,
"transitions": 145
},
"result":
{
"preliminary_value": "no no no no no no no no unknown no no no ",
"value": "no no no no no no no no unknown 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: 304/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 159
lola: finding significant places
lola: 159 places, 145 transitions, 136 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p97 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: F (G (((1 <= p4) AND (1 <= p23) AND (1 <= p138)))) : F (G ((F (((1 <= p101))) AND ((1 <= p60))))) : (G (((1 <= p8))) U (F (((1 <= p74))) OR ((1 <= p65)))) : (G (X (F ((X (X (((1 <= p27) AND (1 <= p29)))) U NOT(X (G (((1 <= p20) AND (1 <= p22))))))))) U G (((1 <= p144)))) : (NOT(X ((F ((NOT(G (((1 <= p104) AND (1 <= p106)))) OR ((p64 <= 0)))) OR G (X (((1 <= p144))))))) AND F (((1 <= p135)))) : NOT(((F (((1 <= p134))) U F (((1 <= p151) AND (1 <= p134)))) U (((1 <= p109)) U F (((1 <= p151)))))) : (NOT(X (((1 <= p122)))) U X (F ((F (((1 <= p27) AND (1 <= p29))) OR X (((1 <= p27) AND (1 <= p29))))))) : X (((G (F (X (F (((1 <= p155) AND (1 <= p59)))))) OR ((1 <= p143))) OR ((1 <= p77) AND (1 <= p66)))) : G ((NOT(G (F ((((X (((1 <= p97) AND (1 <= p99))) AND ((1 <= p4))) AND ((1 <= p23))) AND ((1 <= p156)))))) OR NOT((((1 <= p156)) U ((1 <= p97) AND (1 <= p99)))))) : G (((NOT(F (((1 <= p150)))) AND X (((p130 <= 0)))) AND ((p58 <= 0)))) : X ((((1 <= p18)) AND (NOT(X (F ((((1 <= p120)) U ((1 <= p142)))))) OR NOT(G ((G (((1 <= p142))) U ((1 <= p142)))))))) : F ((NOT((((1 <= p114)) U (((1 <= p154)) OR ((1 <= p114))))) AND NOT(F (((1 <= p154))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:318
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:410
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k: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:338
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: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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G ((G (((1 <= p104) AND (1 <= p106))) AND ((1 <= p64)))) AND X (F (((p144 <= 0)))))) AND F (((1 <= p135))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p135)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p135 <= 0))
lola: processed formula length: 13
lola: 80 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 53 markings, 53 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (((1 <= p27) AND (1 <= p29))) OR X (((1 <= p27) AND (1 <= p29))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (((1 <= p27) AND (1 <= p29))) OR X (((1 <= p27) AND (1 <= p29))))))
lola: processed formula length: 76
lola: 78 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: 62 markings, 62 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F (((1 <= p155) AND (1 <= p59)))) OR (((1 <= p143)) OR ((1 <= p77) AND (1 <= p66)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F (((1 <= p155) AND (1 <= p59)))) OR (((1 <= p143)) OR ((1 <= p77) AND (1 <= p66)))))
lola: processed formula length: 92
lola: 78 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: 62 markings, 62 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((X (((p97 <= 0) OR (p99 <= 0))) OR (((p4 <= 0)) OR (((p23 <= 0)) OR ((p156 <= 0))))))) OR (((p156 <= 0)) R ((p97 <= 0) OR (p99 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((X (((p97 <= 0) OR (p99 <= 0))) OR (((p4 <= 0)) OR (((p23 <= 0)) OR ((p156 <= 0))))))) OR (((p156 <= 0)) R ((p97 <= 0) OR (p99 <= 0)))))
lola: processed formula length: 148
lola: 78 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: 846280 markings, 2869564 edges, 169256 markings/sec, 0 secs
lola: 1638514 markings, 5697709 edges, 158447 markings/sec, 5 secs
lola: 2348380 markings, 8492474 edges, 141973 markings/sec, 10 secs
lola: 3061976 markings, 11271154 edges, 142719 markings/sec, 15 secs
lola: 3797247 markings, 14039006 edges, 147054 markings/sec, 20 secs
lola: 4498496 markings, 16823788 edges, 140250 markings/sec, 25 secs
lola: 5166795 markings, 19554493 edges, 133660 markings/sec, 30 secs
lola: 5778629 markings, 22287413 edges, 122367 markings/sec, 35 secs
lola: 6424092 markings, 25062002 edges, 129093 markings/sec, 40 secs
lola: 7058291 markings, 27852982 edges, 126840 markings/sec, 45 secs
lola: 7884947 markings, 30612826 edges, 165331 markings/sec, 50 secs
lola: 8629300 markings, 33295331 edges, 148871 markings/sec, 55 secs
lola: 9366178 markings, 35977945 edges, 147376 markings/sec, 60 secs
lola: 10063242 markings, 38647582 edges, 139413 markings/sec, 65 secs
lola: 10828520 markings, 41383143 edges, 153056 markings/sec, 70 secs
lola: 11621330 markings, 44141297 edges, 158562 markings/sec, 75 secs
lola: 12396789 markings, 46857601 edges, 155092 markings/sec, 80 secs
lola: 13077310 markings, 49532215 edges, 136104 markings/sec, 85 secs
lola: 13735250 markings, 52205144 edges, 131588 markings/sec, 90 secs
lola: 14378322 markings, 54871078 edges, 128614 markings/sec, 95 secs
lola: 14987626 markings, 57512153 edges, 121861 markings/sec, 100 secs
lola: 15653688 markings, 60206602 edges, 133212 markings/sec, 105 secs
lola: 16316651 markings, 62887834 edges, 132593 markings/sec, 110 secs
lola: 16992207 markings, 65533467 edges, 135111 markings/sec, 115 secs
lola: 17725046 markings, 68246373 edges, 146568 markings/sec, 120 secs
lola: 18364019 markings, 70898404 edges, 127795 markings/sec, 125 secs
lola: 19040232 markings, 73577859 edges, 135243 markings/sec, 130 secs
lola: 19630388 markings, 76226459 edges, 118031 markings/sec, 135 secs
lola: 20288062 markings, 78886795 edges, 131535 markings/sec, 140 secs
lola: 20957458 markings, 81579362 edges, 133879 markings/sec, 145 secs
lola: 21621070 markings, 84252837 edges, 132722 markings/sec, 150 secs
lola: 22336700 markings, 86926015 edges, 143126 markings/sec, 155 secs
lola: 23002654 markings, 89585815 edges, 133191 markings/sec, 160 secs
lola: 23644014 markings, 92210979 edges, 128272 markings/sec, 165 secs
lola: 24253769 markings, 94732635 edges, 121951 markings/sec, 170 secs
lola: 24816524 markings, 97150345 edges, 112551 markings/sec, 175 secs
lola: 25421330 markings, 99624050 edges, 120961 markings/sec, 180 secs
lola: 26020082 markings, 102090498 edges, 119750 markings/sec, 185 secs
lola: 26670631 markings, 104624708 edges, 130110 markings/sec, 190 secs
lola: 27295837 markings, 107133202 edges, 125041 markings/sec, 195 secs
lola: 27844339 markings, 109620227 edges, 109700 markings/sec, 200 secs
lola: 28418837 markings, 112209519 edges, 114900 markings/sec, 205 secs
lola: 28957945 markings, 114670170 edges, 107822 markings/sec, 210 secs
lola: 29432671 markings, 117068378 edges, 94945 markings/sec, 215 secs
lola: 29986061 markings, 119539455 edges, 110678 markings/sec, 220 secs
lola: 30535195 markings, 122095654 edges, 109827 markings/sec, 225 secs
lola: 31109331 markings, 124695441 edges, 114827 markings/sec, 230 secs
lola: 31691686 markings, 127243170 edges, 116471 markings/sec, 235 secs
lola: 32303865 markings, 129789336 edges, 122436 markings/sec, 240 secs
lola: 32822576 markings, 132177376 edges, 103742 markings/sec, 245 secs
lola: 33367675 markings, 134617964 edges, 109020 markings/sec, 250 secs
lola: 33920039 markings, 137144084 edges, 110473 markings/sec, 255 secs
lola: 34420869 markings, 139658180 edges, 100166 markings/sec, 260 secs
lola: 34996118 markings, 142215718 edges, 115050 markings/sec, 265 secs
lola: 35527576 markings, 144735661 edges, 106292 markings/sec, 270 secs
lola: 36083850 markings, 147230318 edges, 111255 markings/sec, 275 secs
lola: 36643239 markings, 149650593 edges, 111878 markings/sec, 280 secs
lola: 37275030 markings, 152037307 edges, 126358 markings/sec, 285 secs
lola: 37922295 markings, 154502199 edges, 129453 markings/sec, 290 secs
lola: 38543120 markings, 156953151 edges, 124165 markings/sec, 295 secs
lola: 39210748 markings, 159411382 edges, 133526 markings/sec, 300 secs
lola: 39805969 markings, 161771841 edges, 119044 markings/sec, 305 secs
lola: 40368680 markings, 164165107 edges, 112542 markings/sec, 310 secs
lola: 40897771 markings, 166540349 edges, 105818 markings/sec, 315 secs
lola: 41465496 markings, 168958503 edges, 113545 markings/sec, 320 secs
lola: 42131099 markings, 171489821 edges, 133121 markings/sec, 325 secs
lola: 42873806 markings, 174273103 edges, 148541 markings/sec, 330 secs
lola: 43563398 markings, 177004784 edges, 137918 markings/sec, 335 secs
lola: 44300360 markings, 179730869 edges, 147392 markings/sec, 340 secs
lola: 44990458 markings, 182482550 edges, 138020 markings/sec, 345 secs
lola: 45616687 markings, 185210618 edges, 125246 markings/sec, 350 secs
lola: 46230765 markings, 187904684 edges, 122816 markings/sec, 355 secs
lola: 46860773 markings, 190555914 edges, 126002 markings/sec, 360 secs
lola: 47574848 markings, 193266140 edges, 142815 markings/sec, 365 secs
lola: 48279718 markings, 196039699 edges, 140974 markings/sec, 370 secs
lola: 48905040 markings, 198770781 edges, 125064 markings/sec, 375 secs
lola: 49544575 markings, 201513086 edges, 127907 markings/sec, 380 secs
lola: 50149719 markings, 204203047 edges, 121029 markings/sec, 385 secs
lola: 50780037 markings, 206854249 edges, 126064 markings/sec, 390 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown no unknown no no unknown unknown unknown unknown
lola: memory consumption: 7402424 KB
lola: time consumption: 399 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((p150 <= 0))) AND (X (((p130 <= 0))) AND ((p58 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p150 <= 0))) AND (X (((p130 <= 0))) AND ((p58 <= 0)))))
lola: processed formula length: 64
lola: 78 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: 66 markings, 66 edges
lola: ========================================
lola: subprocess 5 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p18)) AND (X (G (((p142 <= 0)))) OR F ((((p142 <= 0)) AND (F (((p142 <= 0))) OR G (((p142 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p18)) AND (X (G (((p142 <= 0)))) OR F ((((p142 <= 0)) AND (F (((p142 <= 0))) OR G (((p142 <= 0)))))))))
lola: processed formula length: 114
lola: 78 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: 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: 62 markings, 62 edges
lola: ========================================
lola: subprocess 6 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p4) AND (1 <= p23) AND (1 <= p138))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p4) AND (1 <= p23) AND (1 <= p138))))
lola: processed formula length: 50
lola: 78 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: 175 markings, 176 edges
lola: ========================================
lola: subprocess 7 will run for 634 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p151 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p151 <= 0)))
lola: processed formula length: 17
lola: 78 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: 356 markings, 358 edges
lola: ========================================
lola: subprocess 8 will run for 792 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p101))) AND ((1 <= p60)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p101))) AND ((1 <= p60)))))
lola: processed formula length: 44
lola: 78 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: 57 markings, 58 edges
lola: ========================================
lola: subprocess 9 will run for 1057 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((p114 <= 0)) R (((p154 <= 0)) AND ((p114 <= 0)))) AND G (((p154 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((((p114 <= 0)) R (((p154 <= 0)) AND ((p114 <= 0)))) AND G (((p154 <= 0)))))
lola: processed formula length: 79
lola: 78 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: 300 markings, 300 edges
lola: ========================================
lola: subprocess 10 will run for 1585 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p74))) OR (((1 <= p65)) OR (G (((1 <= p8))) AND F ((F (((1 <= p74))) OR ((1 <= p65)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1585 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p65))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p65))
lola: processed formula length: 12
lola: 78 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 11 will run for 3171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p8)))
lola: processed formula length: 15
lola: 78 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: 56 markings, 56 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 11 will run for 3171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p144))) OR (G (F (((p20 <= 0) OR (p22 <= 0)))) AND F (G (((1 <= p144))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p144)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p144)))
lola: processed formula length: 17
lola: 78 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: 56 markings, 56 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p20 <= 0) OR (p22 <= 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 (((p20 <= 0) OR (p22 <= 0))))
lola: processed formula length: 35
lola: 78 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: 314 markings, 319 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F (G ((X (((p97 <= 0) OR (p99 <= 0))) OR (((p4 <= 0)) OR (((p23 <= 0)) OR ((p156 <= 0))))))) OR (((p156 <= 0)) R ((p97 <= 0) OR (p99 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((X (((p97 <= 0) OR (p99 <= 0))) OR (((p4 <= 0)) OR (((p23 <= 0)) OR ((p156 <= 0))))))) OR (((p156 <= 0)) R ((p97 <= 0) OR (p99 <= 0)))))
lola: processed formula length: 148
lola: 78 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: 850025 markings, 2884104 edges, 170005 markings/sec, 0 secs
lola: 1649009 markings, 5739451 edges, 159797 markings/sec, 5 secs
lola: 2369800 markings, 8576957 edges, 144158 markings/sec, 10 secs
lola: 3100295 markings, 11406288 edges, 146099 markings/sec, 15 secs
lola: 3831580 markings, 14173512 edges, 146257 markings/sec, 20 secs
lola: 4528218 markings, 16953468 edges, 139328 markings/sec, 25 secs
lola: 5205373 markings, 19720667 edges, 135431 markings/sec, 30 secs
lola: 5833145 markings, 22514313 edges, 125554 markings/sec, 35 secs
lola: 6476625 markings, 25294293 edges, 128696 markings/sec, 40 secs
lola: 7108777 markings, 28076441 edges, 126430 markings/sec, 45 secs
lola: 7942345 markings, 30808380 edges, 166714 markings/sec, 50 secs
lola: 8677123 markings, 33462038 edges, 146956 markings/sec, 55 secs
lola: 9411719 markings, 36147950 edges, 146919 markings/sec, 60 secs
lola: 10107992 markings, 38799434 edges, 139255 markings/sec, 65 secs
lola: 10849564 markings, 41468407 edges, 148314 markings/sec, 70 secs
lola: 11641499 markings, 44209115 edges, 158387 markings/sec, 75 secs
lola: 12385718 markings, 46818640 edges, 148844 markings/sec, 80 secs
lola: 13014041 markings, 49271104 edges, 125665 markings/sec, 85 secs
lola: 13620243 markings, 51720732 edges, 121240 markings/sec, 90 secs
lola: 14242411 markings, 54292128 edges, 124434 markings/sec, 95 secs
lola: 14853213 markings, 56913051 edges, 122160 markings/sec, 100 secs
lola: 15489677 markings, 59541999 edges, 127293 markings/sec, 105 secs
lola: 16140852 markings, 62179694 edges, 130235 markings/sec, 110 secs
lola: 16807032 markings, 64819164 edges, 133236 markings/sec, 115 secs
lola: 17520236 markings, 67448048 edges, 142641 markings/sec, 120 secs
lola: 18173914 markings, 70056430 edges, 130736 markings/sec, 125 secs
lola: 18789531 markings, 72622362 edges, 123123 markings/sec, 130 secs
lola: 19380406 markings, 75066568 edges, 118175 markings/sec, 135 secs
lola: 19916249 markings, 77409323 edges, 107169 markings/sec, 140 secs
lola: 20539899 markings, 79910735 edges, 124730 markings/sec, 145 secs
lola: 21131093 markings, 82358342 edges, 118239 markings/sec, 150 secs
lola: 21801441 markings, 84950237 edges, 134070 markings/sec, 155 secs
lola: 22505204 markings, 87590479 edges, 140753 markings/sec, 160 secs
lola: 23173753 markings, 90240036 edges, 133710 markings/sec, 165 secs
lola: 23817785 markings, 92891727 edges, 128806 markings/sec, 170 secs
lola: 24421855 markings, 95505521 edges, 120814 markings/sec, 175 secs
lola: 25066143 markings, 98148072 edges, 128858 markings/sec, 180 secs
lola: 25702482 markings, 100794986 edges, 127268 markings/sec, 185 secs
lola: 26376846 markings, 103465342 edges, 134873 markings/sec, 190 secs
lola: 27024414 markings, 106087663 edges, 129514 markings/sec, 195 secs
lola: 27654553 markings, 108693620 edges, 126028 markings/sec, 200 secs
lola: 28195349 markings, 111225036 edges, 108159 markings/sec, 205 secs
lola: 28777887 markings, 113837789 edges, 116508 markings/sec, 210 secs
lola: 29311051 markings, 116402725 edges, 106633 markings/sec, 215 secs
lola: 29846675 markings, 118954406 edges, 107125 markings/sec, 220 secs
lola: 30410226 markings, 121499800 edges, 112710 markings/sec, 225 secs
lola: 30953144 markings, 124021413 edges, 108584 markings/sec, 230 secs
lola: 31547636 markings, 126625215 edges, 118898 markings/sec, 235 secs
lola: 32159783 markings, 129218438 edges, 122429 markings/sec, 240 secs
lola: 32737384 markings, 131726472 edges, 115520 markings/sec, 245 secs
lola: 33285207 markings, 134269277 edges, 109565 markings/sec, 250 secs
lola: 33853597 markings, 136801898 edges, 113678 markings/sec, 255 secs
lola: 34334876 markings, 139277860 edges, 96256 markings/sec, 260 secs
lola: 34902093 markings, 141816689 edges, 113443 markings/sec, 265 secs
lola: 35440847 markings, 144287689 edges, 107751 markings/sec, 270 secs
lola: 35955882 markings, 146675275 edges, 103007 markings/sec, 275 secs
lola: 36507334 markings, 149074720 edges, 110290 markings/sec, 280 secs
lola: 37080950 markings, 151320179 edges, 114723 markings/sec, 285 secs
lola: 37691189 markings, 153620745 edges, 122048 markings/sec, 290 secs
lola: 38281878 markings, 155948682 edges, 118138 markings/sec, 295 secs
lola: 38929988 markings, 158404284 edges, 129622 markings/sec, 300 secs
lola: 39562542 markings, 160726367 edges, 126511 markings/sec, 305 secs
lola: 40109126 markings, 163058360 edges, 109317 markings/sec, 310 secs
lola: 40640469 markings, 165445673 edges, 106269 markings/sec, 315 secs
lola: 41197369 markings, 167825090 edges, 111380 markings/sec, 320 secs
lola: 41731731 markings, 170062897 edges, 106872 markings/sec, 325 secs
lola: 42474608 markings, 172757393 edges, 148575 markings/sec, 330 secs
lola: 43162497 markings, 175465716 edges, 137578 markings/sec, 335 secs
lola: 43876240 markings, 178176598 edges, 142749 markings/sec, 340 secs
lola: 44583491 markings, 180815241 edges, 141450 markings/sec, 345 secs
lola: 45223929 markings, 183482232 edges, 128088 markings/sec, 350 secs
lola: 45814025 markings, 186110893 edges, 118019 markings/sec, 355 secs
lola: 46436236 markings, 188783100 edges, 124442 markings/sec, 360 secs
lola: 47082418 markings, 191411812 edges, 129236 markings/sec, 365 secs
lola: 47793530 markings, 194182275 edges, 142222 markings/sec, 370 secs
lola: 48500229 markings, 196951570 edges, 141340 markings/sec, 375 secs
lola: 49117699 markings, 199707795 edges, 123494 markings/sec, 380 secs
lola: 49766780 markings, 202472052 edges, 129816 markings/sec, 385 secs
lola: 50380424 markings, 205222455 edges, 122729 markings/sec, 390 secs
lola: 51071236 markings, 207911624 edges, 138162 markings/sec, 395 secs
lola: 51900298 markings, 210628615 edges, 165812 markings/sec, 400 secs
lola: 52664185 markings, 213233812 edges, 152777 markings/sec, 405 secs
lola: 53343522 markings, 215734133 edges, 135867 markings/sec, 410 secs
lola: 54031041 markings, 218247753 edges, 137504 markings/sec, 415 secs
lola: 54741941 markings, 220823668 edges, 142180 markings/sec, 420 secs
lola: 55460153 markings, 223374563 edges, 143642 markings/sec, 425 secs
lola: 56084625 markings, 225893197 edges, 124894 markings/sec, 430 secs
lola: 56652902 markings, 228280984 edges, 113655 markings/sec, 435 secs
lola: 57381891 markings, 230847029 edges, 145798 markings/sec, 440 secs
lola: 58067200 markings, 233324329 edges, 137062 markings/sec, 445 secs
lola: 58746283 markings, 235893259 edges, 135817 markings/sec, 450 secs
lola: 59425056 markings, 238389702 edges, 135755 markings/sec, 455 secs
lola: 60091768 markings, 240854505 edges, 133342 markings/sec, 460 secs
lola: 60837053 markings, 243448155 edges, 149057 markings/sec, 465 secs
lola: 61568471 markings, 245973711 edges, 146284 markings/sec, 470 secs
lola: 62240885 markings, 248487778 edges, 134483 markings/sec, 475 secs
lola: 62949796 markings, 251074547 edges, 141782 markings/sec, 480 secs
lola: 63582688 markings, 253588641 edges, 126578 markings/sec, 485 secs
lola: 64149938 markings, 255973259 edges, 113450 markings/sec, 490 secs
lola: 64788555 markings, 258505352 edges, 127723 markings/sec, 495 secs
lola: 65362067 markings, 260957220 edges, 114702 markings/sec, 500 secs
lola: 65882048 markings, 263156641 edges, 103996 markings/sec, 505 secs
lola: 66494309 markings, 265574248 edges, 122452 markings/sec, 510 secs
lola: 67009471 markings, 267939875 edges, 103032 markings/sec, 515 secs
lola: 67511832 markings, 270187740 edges, 100472 markings/sec, 520 secs
lola: 68075102 markings, 272562594 edges, 112654 markings/sec, 525 secs
lola: 68614270 markings, 274878633 edges, 107834 markings/sec, 530 secs
lola: 69201976 markings, 277249506 edges, 117541 markings/sec, 535 secs
lola: 69775717 markings, 279663220 edges, 114748 markings/sec, 540 secs
lola: 70346803 markings, 282062883 edges, 114217 markings/sec, 545 secs
lola: 70960447 markings, 284553586 edges, 122729 markings/sec, 550 secs
lola: 71575225 markings, 287060182 edges, 122956 markings/sec, 555 secs
lola: 72198242 markings, 289590726 edges, 124603 markings/sec, 560 secs
lola: 72809356 markings, 291962823 edges, 122223 markings/sec, 565 secs
lola: 73450583 markings, 294495360 edges, 128245 markings/sec, 570 secs
lola: 74151610 markings, 296995780 edges, 140205 markings/sec, 575 secs
lola: 74776787 markings, 299465447 edges, 125035 markings/sec, 580 secs
lola: 75333273 markings, 301905627 edges, 111297 markings/sec, 585 secs
lola: 75910505 markings, 304280014 edges, 115446 markings/sec, 590 secs
lola: 76520507 markings, 306749406 edges, 122000 markings/sec, 595 secs
lola: 77090736 markings, 309192253 edges, 114046 markings/sec, 600 secs
lola: 77632059 markings, 311411413 edges, 108265 markings/sec, 605 secs
lola: 78172531 markings, 313775851 edges, 108094 markings/sec, 610 secs
lola: 78617003 markings, 315963229 edges, 88894 markings/sec, 615 secs
lola: 79226468 markings, 318352953 edges, 121893 markings/sec, 620 secs
lola: 79782147 markings, 320726870 edges, 111136 markings/sec, 625 secs
lola: 80291653 markings, 322915795 edges, 101901 markings/sec, 630 secs
lola: 80898656 markings, 325331975 edges, 121401 markings/sec, 635 secs
lola: 81472074 markings, 327752058 edges, 114684 markings/sec, 640 secs
lola: 82005071 markings, 330009412 edges, 106599 markings/sec, 645 secs
lola: 82625455 markings, 332453749 edges, 124077 markings/sec, 650 secs
lola: 83215249 markings, 334846792 edges, 117959 markings/sec, 655 secs
lola: 83788809 markings, 337075343 edges, 114712 markings/sec, 660 secs
lola: 84422759 markings, 339561813 edges, 126790 markings/sec, 665 secs
lola: 85099425 markings, 341984061 edges, 135333 markings/sec, 670 secs
lola: 85711228 markings, 344398679 edges, 122361 markings/sec, 675 secs
lola: 86247738 markings, 346760838 edges, 107302 markings/sec, 680 secs
lola: 86828540 markings, 349100593 edges, 116160 markings/sec, 685 secs
lola: 87418588 markings, 351531595 edges, 118010 markings/sec, 690 secs
lola: 87974874 markings, 353920085 edges, 111257 markings/sec, 695 secs
lola: 88556441 markings, 356268804 edges, 116313 markings/sec, 700 secs
lola: 89106500 markings, 358705426 edges, 110012 markings/sec, 705 secs
lola: 89574473 markings, 360985477 edges, 93595 markings/sec, 710 secs
lola: 90189243 markings, 363404845 edges, 122954 markings/sec, 715 secs
lola: 90760857 markings, 365817071 edges, 114323 markings/sec, 720 secs
lola: 91291447 markings, 368105290 edges, 106118 markings/sec, 725 secs
lola: 91891338 markings, 370522838 edges, 119978 markings/sec, 730 secs
lola: 92482651 markings, 372957883 edges, 118263 markings/sec, 735 secs
lola: 93023305 markings, 375264255 edges, 108131 markings/sec, 740 secs
lola: 93646542 markings, 377755496 edges, 124647 markings/sec, 745 secs
lola: 94257208 markings, 380179758 edges, 122133 markings/sec, 750 secs
lola: 94831356 markings, 382478579 edges, 114830 markings/sec, 755 secs
lola: 95374807 markings, 384879449 edges, 108690 markings/sec, 760 secs
lola: 95960706 markings, 387236646 edges, 117180 markings/sec, 765 secs
lola: 96485745 markings, 389627761 edges, 105008 markings/sec, 770 secs
lola: 96953254 markings, 391846253 edges, 93502 markings/sec, 775 secs
lola: 97505515 markings, 394270808 edges, 110452 markings/sec, 780 secs
lola: 97968831 markings, 396546065 edges, 92663 markings/sec, 785 secs
lola: 98485855 markings, 398869313 edges, 103405 markings/sec, 790 secs
lola: 98978442 markings, 401219681 edges, 98517 markings/sec, 795 secs
lola: 99481972 markings, 403477439 edges, 100706 markings/sec, 800 secs
lola: 99947104 markings, 405846579 edges, 93026 markings/sec, 805 secs
lola: 100372279 markings, 408027429 edges, 85035 markings/sec, 810 secs
lola: 100900225 markings, 410447561 edges, 105589 markings/sec, 815 secs
lola: 101368772 markings, 412743061 edges, 93709 markings/sec, 820 secs
lola: 101922287 markings, 415160967 edges, 110703 markings/sec, 825 secs
lola: 102408155 markings, 417544047 edges, 97174 markings/sec, 830 secs
lola: 102915411 markings, 419861675 edges, 101451 markings/sec, 835 secs
lola: 103444675 markings, 422270300 edges, 105853 markings/sec, 840 secs
lola: 103909364 markings, 424515790 edges, 92938 markings/sec, 845 secs
lola: 104455982 markings, 426943783 edges, 109324 markings/sec, 850 secs
lola: 104986893 markings, 429344920 edges, 106182 markings/sec, 855 secs
lola: 105508711 markings, 431589728 edges, 104364 markings/sec, 860 secs
lola: 106004577 markings, 433848316 edges, 99173 markings/sec, 865 secs
lola: 106593017 markings, 436320940 edges, 117688 markings/sec, 870 secs
lola: 107114207 markings, 438564698 edges, 104238 markings/sec, 875 secs
lola: 107677844 markings, 440974847 edges, 112727 markings/sec, 880 secs
lola: 108135074 markings, 443276627 edges, 91446 markings/sec, 885 secs
lola: 108664972 markings, 445574413 edges, 105980 markings/sec, 890 secs
lola: 109142363 markings, 447918109 edges, 95478 markings/sec, 895 secs
lola: 109615950 markings, 450093636 edges, 94717 markings/sec, 900 secs
lola: 110149818 markings, 452471083 edges, 106774 markings/sec, 905 secs
lola: 110585884 markings, 454696341 edges, 87213 markings/sec, 910 secs
lola: 111093871 markings, 457056404 edges, 101597 markings/sec, 915 secs
lola: 111479842 markings, 459215731 edges, 77194 markings/sec, 920 secs
lola: 111988753 markings, 461380744 edges, 101782 markings/sec, 925 secs
lola: 112359774 markings, 463291350 edges, 74204 markings/sec, 930 secs
lola: 112846266 markings, 465356309 edges, 97298 markings/sec, 935 secs
lola: 113274674 markings, 467520346 edges, 85682 markings/sec, 940 secs
lola: 113753871 markings, 469628599 edges, 95839 markings/sec, 945 secs
lola: 114178694 markings, 471706887 edges, 84965 markings/sec, 950 secs
lola: 114652440 markings, 473737916 edges, 94749 markings/sec, 955 secs
lola: 115066200 markings, 475768510 edges, 82752 markings/sec, 960 secs
lola: 115500351 markings, 477713987 edges, 86830 markings/sec, 965 secs
lola: 115984945 markings, 479908884 edges, 96919 markings/sec, 970 secs
lola: 116480350 markings, 481992915 edges, 99081 markings/sec, 975 secs
lola: 116875635 markings, 483634300 edges, 79057 markings/sec, 980 secs
lola: 117100728 markings, 484438404 edges, 45019 markings/sec, 985 secs
lola: 117436323 markings, 485786228 edges, 67119 markings/sec, 990 secs
lola: 117785654 markings, 487062791 edges, 69866 markings/sec, 995 secs
lola: 118341175 markings, 488988273 edges, 111104 markings/sec, 1000 secs
lola: 118854931 markings, 490888096 edges, 102751 markings/sec, 1005 secs
lola: 119255700 markings, 492471910 edges, 80154 markings/sec, 1010 secs
lola: 119709025 markings, 494226736 edges, 90665 markings/sec, 1015 secs
lola: 120240716 markings, 496243062 edges, 106338 markings/sec, 1020 secs
lola: 120672573 markings, 497890843 edges, 86371 markings/sec, 1025 secs
lola: 121126076 markings, 499763435 edges, 90701 markings/sec, 1030 secs
lola: 121565766 markings, 501604459 edges, 87938 markings/sec, 1035 secs
lola: 122001393 markings, 503327818 edges, 87125 markings/sec, 1040 secs
lola: 122442859 markings, 505046223 edges, 88293 markings/sec, 1045 secs
lola: 122946446 markings, 506969803 edges, 100717 markings/sec, 1050 secs
lola: 123460095 markings, 508928607 edges, 102730 markings/sec, 1055 secs
lola: 123860594 markings, 510489525 edges, 80100 markings/sec, 1060 secs
lola: 124362436 markings, 512371747 edges, 100368 markings/sec, 1065 secs
lola: 124785939 markings, 513890835 edges, 84701 markings/sec, 1070 secs
lola: 125324409 markings, 515857618 edges, 107694 markings/sec, 1075 secs
lola: 125719712 markings, 517334794 edges, 79061 markings/sec, 1080 secs
lola: 126052839 markings, 518846269 edges, 66625 markings/sec, 1085 secs
lola: 126352659 markings, 520087720 edges, 59964 markings/sec, 1090 secs
lola: 126854484 markings, 522006186 edges, 100365 markings/sec, 1095 secs
lola: 127261120 markings, 523746030 edges, 81327 markings/sec, 1100 secs
lola: 127682245 markings, 525604510 edges, 84225 markings/sec, 1105 secs
lola: 128131699 markings, 527482897 edges, 89891 markings/sec, 1110 secs
lola: 128449927 markings, 528927839 edges, 63646 markings/sec, 1115 secs
lola: 128887263 markings, 530814248 edges, 87467 markings/sec, 1120 secs
lola: 129283287 markings, 532504978 edges, 79205 markings/sec, 1125 secs
lola: 129624368 markings, 534090323 edges, 68216 markings/sec, 1130 secs
lola: 129994704 markings, 535786960 edges, 74067 markings/sec, 1135 secs
lola: 130347987 markings, 537491966 edges, 70657 markings/sec, 1140 secs
lola: 130836672 markings, 539538764 edges, 97737 markings/sec, 1145 secs
lola: 131174710 markings, 541070751 edges, 67608 markings/sec, 1150 secs
lola: 131569707 markings, 542767023 edges, 78999 markings/sec, 1155 secs
lola: 131975132 markings, 544509093 edges, 81085 markings/sec, 1160 secs
lola: 132295248 markings, 545936491 edges, 64023 markings/sec, 1165 secs
lola: 132443903 markings, 546570449 edges, 29731 markings/sec, 1170 secs
lola: 132738835 markings, 547771959 edges, 58986 markings/sec, 1175 secs
lola: 132919905 markings, 548602656 edges, 36214 markings/sec, 1180 secs
lola: 133179536 markings, 549664227 edges, 51926 markings/sec, 1185 secs
lola: 133517998 markings, 551039538 edges, 67692 markings/sec, 1190 secs
lola: 133908633 markings, 552650725 edges, 78127 markings/sec, 1195 secs
lola: 134358341 markings, 554356210 edges, 89942 markings/sec, 1200 secs
lola: 134954765 markings, 556657728 edges, 119285 markings/sec, 1205 secs
lola: 135300916 markings, 557952005 edges, 69230 markings/sec, 1210 secs
lola: 135859723 markings, 560213954 edges, 111761 markings/sec, 1215 secs
lola: 136418013 markings, 562101116 edges, 111658 markings/sec, 1220 secs
lola: 136791367 markings, 563498758 edges, 74671 markings/sec, 1225 secs
lola: 136882369 markings, 563830265 edges, 18200 markings/sec, 1230 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p74))) OR (((1 <= p65)) OR (G (((1 <= p8))) AND F ((F (((1 <= p74))) OR ((1 <= p65)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p65))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p65))
lola: processed formula length: 12
lola: 78 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: ...considering subproblem: G (((1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p8)))
lola: processed formula length: 15
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: ========================================
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: 56 markings, 56 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (((1 <= p74)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p74 <= 0))
lola: processed formula length: 12
lola: 80 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 56 markings, 56 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no unknown no no no
lola:
preliminary result: no no no no no no no no unknown no no no
lola: memory consumption: 3972 KB
lola: time consumption: 1640 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="ShieldPPPt-PT-002B"
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 ShieldPPPt-PT-002B, 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 r227-tall-162098231200358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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