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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K 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.2K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 27 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 19:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 19:02 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 54K 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 ShieldRVt-PT-020A-00
FORMULA_NAME ShieldRVt-PT-020A-01
FORMULA_NAME ShieldRVt-PT-020A-02
FORMULA_NAME ShieldRVt-PT-020A-03
FORMULA_NAME ShieldRVt-PT-020A-04
FORMULA_NAME ShieldRVt-PT-020A-05
FORMULA_NAME ShieldRVt-PT-020A-06
FORMULA_NAME ShieldRVt-PT-020A-07
FORMULA_NAME ShieldRVt-PT-020A-08
FORMULA_NAME ShieldRVt-PT-020A-09
FORMULA_NAME ShieldRVt-PT-020A-10
FORMULA_NAME ShieldRVt-PT-020A-11
FORMULA_NAME ShieldRVt-PT-020A-12
FORMULA_NAME ShieldRVt-PT-020A-13
FORMULA_NAME ShieldRVt-PT-020A-14
FORMULA_NAME ShieldRVt-PT-020A-15

=== Now, execution of the tool begins

BK_START 1621321127707

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 06:58:50] [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-18 06:58:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 06:58:51] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2021-05-18 06:58:51] [INFO ] Transformed 163 places.
[2021-05-18 06:58:51] [INFO ] Transformed 163 transitions.
[2021-05-18 06:58:51] [INFO ] Found NUPN structural information;
[2021-05-18 06:58:51] [INFO ] Parsed PT model containing 163 places and 163 transitions in 193 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 496 ms. (steps per millisecond=201 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1]
// Phase 1: matrix 162 rows 163 cols
[2021-05-18 06:58:51] [INFO ] Computed 81 place invariants in 9 ms
[2021-05-18 06:58:52] [INFO ] [Real]Absence check using 81 positive place invariants in 113 ms returned sat
[2021-05-18 06:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:58:52] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2021-05-18 06:58:52] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 45 ms.
[2021-05-18 06:58:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:58:52] [INFO ] [Nat]Absence check using 81 positive place invariants in 42 ms returned sat
[2021-05-18 06:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:58:52] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2021-05-18 06:58:52] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 26 ms.
[2021-05-18 06:58:53] [INFO ] Added : 161 causal constraints over 33 iterations in 1131 ms. Result :sat
[2021-05-18 06:58:54] [INFO ] [Real]Absence check using 81 positive place invariants in 45 ms returned sat
[2021-05-18 06:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:58:54] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-18 06:58:54] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 17 ms.
[2021-05-18 06:58:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:58:54] [INFO ] [Nat]Absence check using 81 positive place invariants in 31 ms returned sat
[2021-05-18 06:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:58:54] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-18 06:58:54] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 18 ms.
[2021-05-18 06:58:55] [INFO ] Added : 157 causal constraints over 32 iterations in 613 ms. Result :sat
[2021-05-18 06:58:55] [INFO ] [Real]Absence check using 81 positive place invariants in 33 ms returned sat
[2021-05-18 06:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:58:55] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-18 06:58:55] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 16 ms.
[2021-05-18 06:58:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:58:55] [INFO ] [Nat]Absence check using 81 positive place invariants in 31 ms returned sat
[2021-05-18 06:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:58:55] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-18 06:58:55] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 14 ms.
[2021-05-18 06:58:56] [INFO ] Added : 161 causal constraints over 33 iterations in 628 ms. Result :sat
[2021-05-18 06:58:56] [INFO ] [Real]Absence check using 81 positive place invariants in 29 ms returned sat
[2021-05-18 06:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:58:56] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2021-05-18 06:58:56] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 15 ms.
[2021-05-18 06:58:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:58:56] [INFO ] [Nat]Absence check using 81 positive place invariants in 35 ms returned sat
[2021-05-18 06:58:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:58:56] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2021-05-18 06:58:56] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 17 ms.
[2021-05-18 06:58:57] [INFO ] Added : 160 causal constraints over 33 iterations in 622 ms. Result :sat
[2021-05-18 06:58:57] [INFO ] [Real]Absence check using 81 positive place invariants in 33 ms returned sat
[2021-05-18 06:58:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:58:57] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-18 06:58:57] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 14 ms.
[2021-05-18 06:58:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:58:57] [INFO ] [Nat]Absence check using 81 positive place invariants in 32 ms returned sat
[2021-05-18 06:58:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:58:57] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-18 06:58:57] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 14 ms.
[2021-05-18 06:58:58] [INFO ] Added : 159 causal constraints over 33 iterations in 622 ms. Result :sat
[2021-05-18 06:58:58] [INFO ] [Real]Absence check using 81 positive place invariants in 31 ms returned sat
[2021-05-18 06:58:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:58:58] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-18 06:58:58] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 33 ms.
[2021-05-18 06:58:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:58:59] [INFO ] [Nat]Absence check using 81 positive place invariants in 52 ms returned sat
[2021-05-18 06:58:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:58:59] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2021-05-18 06:58:59] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 14 ms.
[2021-05-18 06:58:59] [INFO ] Added : 160 causal constraints over 33 iterations in 590 ms. Result :sat
[2021-05-18 06:58:59] [INFO ] [Real]Absence check using 81 positive place invariants in 33 ms returned sat
[2021-05-18 06:58:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:58:59] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-18 06:59:00] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 12 ms.
[2021-05-18 06:59:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:59:00] [INFO ] [Nat]Absence check using 81 positive place invariants in 35 ms returned sat
[2021-05-18 06:59:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:59:00] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2021-05-18 06:59:00] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 24 ms.
[2021-05-18 06:59:00] [INFO ] Added : 159 causal constraints over 33 iterations in 618 ms. Result :sat
[2021-05-18 06:59:00] [INFO ] [Real]Absence check using 81 positive place invariants in 34 ms returned sat
[2021-05-18 06:59:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:59:01] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-18 06:59:01] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 11 ms.
[2021-05-18 06:59:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:59:01] [INFO ] [Nat]Absence check using 81 positive place invariants in 32 ms returned sat
[2021-05-18 06:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:59:01] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-18 06:59:01] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 19 ms.
[2021-05-18 06:59:01] [INFO ] Added : 158 causal constraints over 32 iterations in 616 ms. Result :sat
[2021-05-18 06:59:02] [INFO ] [Real]Absence check using 81 positive place invariants in 28 ms returned sat
[2021-05-18 06:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:59:02] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2021-05-18 06:59:02] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 13 ms.
[2021-05-18 06:59:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:59:02] [INFO ] [Nat]Absence check using 81 positive place invariants in 33 ms returned sat
[2021-05-18 06:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:59:02] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-18 06:59:02] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 13 ms.
[2021-05-18 06:59:02] [INFO ] Added : 161 causal constraints over 33 iterations in 564 ms. Result :sat
[2021-05-18 06:59:03] [INFO ] [Real]Absence check using 81 positive place invariants in 35 ms returned sat
[2021-05-18 06:59:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 06:59:03] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2021-05-18 06:59:03] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 10 ms.
[2021-05-18 06:59:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 06:59:03] [INFO ] [Nat]Absence check using 81 positive place invariants in 32 ms returned sat
[2021-05-18 06:59:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 06:59:03] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2021-05-18 06:59:03] [INFO ] Computed and/alt/rep : 161/699/161 causal constraints in 12 ms.
[2021-05-18 06:59:04] [INFO ] Added : 158 causal constraints over 33 iterations in 606 ms. Result :sat
[2021-05-18 06:59:04] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-18 06:59:04] [INFO ] Flatten gal took : 101 ms
FORMULA ShieldRVt-PT-020A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 06:59:04] [INFO ] Applying decomposition
[2021-05-18 06:59:04] [INFO ] Flatten gal took : 36 ms
[2021-05-18 06:59:04] [INFO ] Decomposing Gal with order
[2021-05-18 06:59:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 06:59:04] [INFO ] Removed a total of 60 redundant transitions.
[2021-05-18 06:59:04] [INFO ] Flatten gal took : 92 ms
[2021-05-18 06:59:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-05-18 06:59:04] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2021-05-18 06:59:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldRVt-PT-020A @ 3570 seconds

FORMULA ShieldRVt-PT-020A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-020A-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2812
rslt: Output for LTLFireability @ ShieldRVt-PT-020A

{
"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": "Tue May 18 06:59:05 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 1,
"aconj": 6,
"adisj": 0,
"aneg": 2,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "((G (((p52 <= 0) OR (p53 <= 0) OR (p56 <= 0))) OR ((1 <= p88) AND (1 <= p90) AND (1 <= p95))) U X ((G (((p88 <= 0) OR (p90 <= 0) OR (p95 <= 0))) AND (((1 <= p136)) AND (((1 <= p138)) AND ((1 <= p143)))))))",
"processed_size": 209,
"rewrites": 101
},
"result":
{
"edges": 136,
"markings": 136,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X ((X ((X (G (((p96 <= 0) OR (p98 <= 0) OR (p103 <= 0)))) U ((1 <= p108) AND (1 <= p109) AND (1 <= p112)))) AND ((1 <= p27))))",
"processed_size": 128,
"rewrites": 101
},
"result":
{
"edges": 134,
"markings": 134,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 <= p27)))",
"processed_size": 16,
"rewrites": 101
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((G (((p134 <= 0) OR (p137 <= 0))) OR (X (((1 <= p14) AND (1 <= p17))) U ((1 <= p27)))))",
"processed_size": 91,
"rewrites": 101
},
"result":
{
"edges": 134,
"markings": 134,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p110) AND (1 <= p113))",
"processed_size": 29,
"rewrites": 101
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 398
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p75 <= 0) OR (p84 <= 0) OR (p90 <= 0))",
"processed_size": 42,
"rewrites": 101
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 455
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (G ((G ((F (((p75 <= 0) OR (p84 <= 0) OR (p90 <= 0))) AND ((1 <= p88) AND (1 <= p90) AND (1 <= p95)))) AND ((1 <= p141)))))",
"processed_size": 127,
"rewrites": 101
},
"result":
{
"edges": 134,
"markings": 134,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 637
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G (((X (((p139 <= 0))) R ((p89 <= 0))) AND (F (((p128 <= 0) OR (p130 <= 0) OR (p135 <= 0))) OR G (((p89 <= 0)))))))",
"processed_size": 120,
"rewrites": 101
},
"result":
{
"edges": 85137,
"markings": 24720,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1062
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F (((p101 <= 0))) AND (((1 <= p126) AND (1 <= p129)) OR ((p101 <= 0))))))",
"processed_size": 80,
"rewrites": 101
},
"result":
{
"edges": 1136,
"markings": 853,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": 1593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 3,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((F (((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0))) AND (((p3 <= 0) OR (p12 <= 0) OR (p18 <= 0)) OR ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0))))))",
"processed_size": 150,
"rewrites": 101
},
"result":
{
"edges": 1838,
"markings": 1632,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3186
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 1,
"aneg": 5,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p100) AND (1 <= p101) AND (1 <= p104))) AND ((((G (((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0))) AND ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0))) OR ((1 <= p72) AND (1 <= p74) AND (1 <= p79))) R (((p6 <= 0) OR (p9 <= 0)) R ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0)))) OR ((1 <= p100) AND (1 <= p101) AND (1 <= p104)))))",
"processed_size": 331,
"rewrites": 101
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p110) AND (1 <= p113))",
"processed_size": 29,
"rewrites": 101
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3912,
"runtime": 758.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((G(*) OR **) U X((G(*) AND (** AND (** AND **))))) : F(G((F(**) AND (** OR **)))) : X((X((X(G(**)) U **)) AND **)) : F(G((F(**) AND (** OR **)))) : (X((G(*) OR (X(**) U **))) OR G(**)) : X(X(G(*))) : ((X(G(**)) R F(*)) OR **) : (X(G((G((F(**) AND **)) AND **))) AND **) : F(**) : (F(G(**)) AND G(((X(**) U **) OR X(G(**))))) : G((G(((X(F(*)) OR **) AND **)) AND X(**))) : X(G(((X(*) R *) AND (F(*) OR G(*))))) : G((F(**) AND ((((G(*) AND *) OR *) R (* R *)) OR **)))"
},
"net":
{
"arcs": 684,
"conflict_clusters": 43,
"places": 163,
"places_significant": 82,
"singleton_clusters": 0,
"transitions": 162
},
"result":
{
"preliminary_value": "no no no no no no unknown no no no no no no ",
"value": "no no no no no no unknown no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 325/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 163
lola: finding significant places
lola: 163 places, 162 transitions, 82 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: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p161 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: ((NOT(F (((1 <= p52) AND (1 <= p53) AND (1 <= p56)))) OR ((1 <= p88) AND (1 <= p90) AND (1 <= p95))) U X ((((NOT(F (((1 <= p88) AND (1 <= p90) AND (1 <= p95)))) AND ((1 <= p136))) AND ((1 <= p138))) AND ((1 <= p143))))) : G (X (F (NOT(X (NOT(G ((((1 <= p126) AND (1 <= p129)) U ((p101 <= 0)))))))))) : X (((G (X (X (((p96 <= 0) OR (p98 <= 0) OR (p103 <= 0))))) U X (((1 <= p108) AND (1 <= p109) AND (1 <= p112)))) AND ((1 <= p27)))) : NOT(G (F (NOT((((p3 <= 0) OR (p12 <= 0) OR (p18 <= 0)) U ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0))))))) : ((X (NOT(F (((1 <= p134) AND (1 <= p137))))) OR X ((X (((1 <= p14) AND (1 <= p17))) U ((1 <= p27))))) OR G (((1 <= p27)))) : X (X (NOT(F ((((1 <= p59)) U ((1 <= p40) AND (1 <= p42) AND (1 <= p47))))))) : (NOT((NOT(G (X (G (((1 <= p149)))))) U G (((1 <= p149))))) OR ((1 <= p110) AND (1 <= p113))) : (G (X (((G (F (((p75 <= 0) OR (p84 <= 0) OR (p90 <= 0)))) AND G (((1 <= p88) AND (1 <= p90) AND (1 <= p95)))) AND ((1 <= p141))))) AND ((p75 <= 0) OR (p84 <= 0) OR (p90 <= 0))) : (X (((X (G (((1 <= p148) AND (1 <= p149) AND (1 <= p152)))) OR NOT(F (((1 <= p148) AND (1 <= p149) AND (1 <= p152))))) OR ((1 <= p76) AND (1 <= p77) AND (1 <= p80)))) U F (((1 <= p2) AND (1 <= p4) AND (1 <= p10)))) : G (((X (((1 <= p116) AND (1 <= p117) AND (1 <= p120))) U ((1 <= p101))) U G (X (((1 <= p75) AND (1 <= p84) AND (1 <= p90)))))) : G ((G (((F (NOT(G (X (((1 <= p54) AND (1 <= p57)))))) OR ((1 <= p35))) AND ((p158 <= 0) OR (p161 <= 0)))) AND X (((1 <= p54) AND (1 <= p57))))) : NOT(X (F ((G (((1 <= p128) AND (1 <= p130) AND (1 <= p135))) U (X (((1 <= p139))) U ((1 <= p89))))))) : G ((NOT((((F (((1 <= p16) AND (1 <= p18) AND (1 <= p23))) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23))) AND ((p72 <= 0) OR (p74 <= 0) OR (p79 <= 0))) U (((1 <= p6) AND (1 <= p9)) U ((1 <= p16) AND (1 <= p18) AND (1 <= p23))))) U ((1 <= p100) AND (1 <= p101) AND (1 <= p104))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((p52 <= 0) OR (p53 <= 0) OR (p56 <= 0))) OR ((1 <= p88) AND (1 <= p90) AND (1 <= p95))) U X ((G (((p88 <= 0) OR (p90 <= 0) OR (p95 <= 0))) AND (((1 <= p136)) AND (((1 <= p138)) AND ((1 <= p143)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((p52 <= 0) OR (p53 <= 0) OR (p56 <= 0))) OR ((1 <= p88) AND (1 <= p90) AND (1 <= p95))) U X ((G (((p88 <= 0) OR (p90 <= 0) OR (p95 <= 0))) AND (((1 <= p136)) AND (((1 <= p138)) AND ((1 <= p143)))))))
lola: processed formula length: 209
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 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: 136 markings, 136 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((X (G (((p96 <= 0) OR (p98 <= 0) OR (p103 <= 0)))) U ((1 <= p108) AND (1 <= p109) AND (1 <= p112)))) AND ((1 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((X (G (((p96 <= 0) OR (p98 <= 0) OR (p103 <= 0)))) U ((1 <= p108) AND (1 <= p109) AND (1 <= p112)))) AND ((1 <= p27))))
lola: processed formula length: 128
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 134 markings, 134 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G (((p134 <= 0) OR (p137 <= 0))) OR (X (((1 <= p14) AND (1 <= p17))) U ((1 <= p27))))) OR G (((1 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p27)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p27)))
lola: processed formula length: 16
lola: 101 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((p134 <= 0) OR (p137 <= 0))) OR (X (((1 <= p14) AND (1 <= p17))) U ((1 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p134 <= 0) OR (p137 <= 0))) OR (X (((1 <= p14) AND (1 <= p17))) U ((1 <= p27)))))
lola: processed formula length: 91
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 134 markings, 134 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p40 <= 0) OR (p42 <= 0) OR (p47 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p40 <= 0) OR (p42 <= 0) OR (p47 <= 0)))))
lola: processed formula length: 54
lola: 101 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: 134 markings, 134 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (G (((1 <= p149)))) R F (((p149 <= 0)))) OR ((1 <= p110) AND (1 <= p113)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p110) AND (1 <= p113))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p110) AND (1 <= p113))
lola: processed formula length: 29
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p149)))) R F (((p149 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((1 <= p149)))) R F (((p149 <= 0))))
lola: processed formula length: 43
lola: 101 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: 2196336 markings, 2327456 edges, 439267 markings/sec, 0 secs
lola: 4352172 markings, 4612005 edges, 431167 markings/sec, 5 secs
lola: 6494050 markings, 6881756 edges, 428376 markings/sec, 10 secs
lola: 8667565 markings, 9185033 edges, 434703 markings/sec, 15 secs
lola: 10821664 markings, 11467736 edges, 430820 markings/sec, 20 secs
lola: 12933355 markings, 13705495 edges, 422338 markings/sec, 25 secs
lola: 15015951 markings, 15912427 edges, 416519 markings/sec, 30 secs
lola: 17029378 markings, 18046056 edges, 402685 markings/sec, 35 secs
lola: 18369229 markings, 20145749 edges, 267970 markings/sec, 40 secs
lola: 19495830 markings, 22254076 edges, 225320 markings/sec, 45 secs
lola: 20471184 markings, 24220559 edges, 195071 markings/sec, 50 secs
lola: 21432325 markings, 26226367 edges, 192228 markings/sec, 55 secs
lola: 22355240 markings, 28201126 edges, 184583 markings/sec, 60 secs
lola: 23341209 markings, 30208803 edges, 197194 markings/sec, 65 secs
lola: 24297430 markings, 32183217 edges, 191244 markings/sec, 70 secs
lola: 25178906 markings, 34073344 edges, 176295 markings/sec, 75 secs
lola: 26146787 markings, 36064357 edges, 193576 markings/sec, 80 secs
lola: 27022306 markings, 37946724 edges, 175104 markings/sec, 85 secs
lola: 27869148 markings, 39831544 edges, 169368 markings/sec, 90 secs
lola: 28762090 markings, 41768814 edges, 178588 markings/sec, 95 secs
lola: 29658857 markings, 43732575 edges, 179353 markings/sec, 100 secs
lola: 30547083 markings, 45643334 edges, 177645 markings/sec, 105 secs
lola: 31592259 markings, 47683854 edges, 209035 markings/sec, 110 secs
lola: 32702205 markings, 49772833 edges, 221989 markings/sec, 115 secs
lola: 33709539 markings, 51826610 edges, 201467 markings/sec, 120 secs
lola: 34642282 markings, 53827992 edges, 186549 markings/sec, 125 secs
lola: 35615613 markings, 55869476 edges, 194666 markings/sec, 130 secs
lola: 36577443 markings, 57908489 edges, 192366 markings/sec, 135 secs
lola: 37530671 markings, 59896447 edges, 190646 markings/sec, 140 secs
lola: 38493044 markings, 61894146 edges, 192475 markings/sec, 145 secs
lola: 39406521 markings, 63845251 edges, 182695 markings/sec, 150 secs
lola: 40417348 markings, 65896259 edges, 202165 markings/sec, 155 secs
lola: 41362642 markings, 67914940 edges, 189059 markings/sec, 160 secs
lola: 42244866 markings, 69856389 edges, 176445 markings/sec, 165 secs
lola: 43111261 markings, 71766724 edges, 173279 markings/sec, 170 secs
lola: 43944761 markings, 73645052 edges, 166700 markings/sec, 175 secs
lola: 44787796 markings, 75534343 edges, 168607 markings/sec, 180 secs
lola: 45601948 markings, 77375576 edges, 162830 markings/sec, 185 secs
lola: 46408143 markings, 79211246 edges, 161239 markings/sec, 190 secs
lola: 47216811 markings, 81054762 edges, 161734 markings/sec, 195 secs
lola: 48005456 markings, 82858706 edges, 157729 markings/sec, 200 secs
lola: 48780757 markings, 84654081 edges, 155060 markings/sec, 205 secs
lola: 49558321 markings, 86450421 edges, 155513 markings/sec, 210 secs
lola: 50331940 markings, 88245730 edges, 154724 markings/sec, 215 secs
lola: 51061900 markings, 89956411 edges, 145992 markings/sec, 220 secs
lola: 51815599 markings, 91724786 edges, 150740 markings/sec, 225 secs
lola: 52563238 markings, 93478510 edges, 149528 markings/sec, 230 secs
lola: 53301527 markings, 95241210 edges, 147658 markings/sec, 235 secs
lola: 54035270 markings, 96984312 edges, 146749 markings/sec, 240 secs
lola: 54766369 markings, 98729142 edges, 146220 markings/sec, 245 secs
lola: 55505839 markings, 100480769 edges, 147894 markings/sec, 250 secs
lola: 56213713 markings, 102182911 edges, 141575 markings/sec, 255 secs
lola: 56761781 markings, 103506143 edges, 109614 markings/sec, 260 secs
lola: 57315928 markings, 104835059 edges, 110829 markings/sec, 265 secs
lola: 57931154 markings, 106320248 edges, 123045 markings/sec, 270 secs
lola: 58596340 markings, 107929039 edges, 133037 markings/sec, 275 secs
lola: 59147206 markings, 109267481 edges, 110173 markings/sec, 280 secs
lola: 59809844 markings, 110848235 edges, 132528 markings/sec, 285 secs
lola: 60466406 markings, 112435450 edges, 131312 markings/sec, 290 secs
lola: 60999961 markings, 113715879 edges, 106711 markings/sec, 295 secs
lola: 61643056 markings, 115271008 edges, 128619 markings/sec, 300 secs
lola: 62146662 markings, 116481978 edges, 100721 markings/sec, 305 secs
lola: 62752751 markings, 117930879 edges, 121218 markings/sec, 310 secs
lola: 63320690 markings, 119295785 edges, 113588 markings/sec, 315 secs
lola: 64002545 markings, 120957126 edges, 136371 markings/sec, 320 secs
lola: 64605423 markings, 122410729 edges, 120576 markings/sec, 325 secs
lola: 65306082 markings, 123966485 edges, 140132 markings/sec, 330 secs
lola: 65957548 markings, 125441330 edges, 130293 markings/sec, 335 secs
lola: 66577643 markings, 126943010 edges, 124019 markings/sec, 340 secs
lola: 67316767 markings, 128484041 edges, 147825 markings/sec, 345 secs
lola: 68073244 markings, 129960056 edges, 151295 markings/sec, 350 secs
lola: 68821987 markings, 131507160 edges, 149749 markings/sec, 355 secs
lola: 69538678 markings, 133034715 edges, 143338 markings/sec, 360 secs
lola: 70162278 markings, 134504234 edges, 124720 markings/sec, 365 secs
lola: 70685441 markings, 135787761 edges, 104633 markings/sec, 370 secs
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 5 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((G ((F (((p75 <= 0) OR (p84 <= 0) OR (p90 <= 0))) AND ((1 <= p88) AND (1 <= p90) AND (1 <= p95)))) AND ((1 <= p141))))) AND ((p75 <= 0) OR (p84 <= 0) OR (p90 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p75 <= 0) OR (p84 <= 0) OR (p90 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p75 <= 0) OR (p84 <= 0) OR (p90 <= 0))
lola: processed formula length: 42
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((F (((p75 <= 0) OR (p84 <= 0) OR (p90 <= 0))) AND ((1 <= p88) AND (1 <= p90) AND (1 <= p95)))) AND ((1 <= p141)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((F (((p75 <= 0) OR (p84 <= 0) OR (p90 <= 0))) AND ((1 <= p88) AND (1 <= p90) AND (1 <= p95)))) AND ((1 <= p141)))))
lola: processed formula length: 127
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 134 markings, 134 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p75) AND (1 <= p84) AND (1 <= p90)))) AND G (((X (((1 <= p116) AND (1 <= p117) AND (1 <= p120))) U ((1 <= p101))) OR X (G (((1 <= p75) AND (1 <= p84) AND (1 <= p90)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p75) AND (1 <= p84) AND (1 <= p90))))
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 <= p75) AND (1 <= p84) AND (1 <= p90))))
lola: processed formula length: 50
lola: 101 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: 9 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((X (F (((p54 <= 0) OR (p57 <= 0)))) OR ((1 <= p35))) AND ((p158 <= 0) OR (p161 <= 0)))) AND X (((1 <= p54) AND (1 <= p57)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((X (F (((p54 <= 0) OR (p57 <= 0)))) OR ((1 <= p35))) AND ((p158 <= 0) OR (p161 <= 0)))) AND X (((1 <= p54) AND (1 <= p57)))))
lola: processed formula length: 135
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 134 markings, 134 edges
lola: ========================================
lola: subprocess 8 will run for 637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((X (((p139 <= 0))) R ((p89 <= 0))) AND (F (((p128 <= 0) OR (p130 <= 0) OR (p135 <= 0))) OR G (((p89 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((X (((p139 <= 0))) R ((p89 <= 0))) AND (F (((p128 <= 0) OR (p130 <= 0) OR (p135 <= 0))) OR G (((p89 <= 0)))))))
lola: processed formula length: 120
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24720 markings, 85137 edges
lola: ========================================
lola: subprocess 9 will run for 796 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p2) AND (1 <= p4) AND (1 <= p10)))
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: ((p2 <= 0) OR (p4 <= 0) OR (p10 <= 0))
lola: processed formula length: 40
lola: 103 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 10 will run for 1062 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((p101 <= 0))) AND (((1 <= p126) AND (1 <= p129)) OR ((p101 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((p101 <= 0))) AND (((1 <= p126) AND (1 <= p129)) OR ((p101 <= 0))))))
lola: processed formula length: 80
lola: 101 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: 853 markings, 1136 edges
lola: ========================================
lola: subprocess 11 will run for 1593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0))) AND (((p3 <= 0) OR (p12 <= 0) OR (p18 <= 0)) OR ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0))) AND (((p3 <= 0) OR (p12 <= 0) OR (p18 <= 0)) OR ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0))))))
lola: processed formula length: 150
lola: 101 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: 1632 markings, 1838 edges
lola: ========================================
lola: subprocess 12 will run for 3186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p100) AND (1 <= p101) AND (1 <= p104))) AND ((((G (((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0))) AND ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0))) OR ((1 <= p72) AND (1 <= p74) AND (1 <= p79))) R (((p6 <= 0) OR (p9 <= 0)) R ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0)))) OR ((1 <= p100) AND (1 <= p101) AND (1 <= p104)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p100) AND (1 <= p101) AND (1 <= p104))) AND ((((G (((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0))) AND ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0))) OR ((1 <= p72) AND (1 <= p74) AND (1 <= p79))) R (((p6 <= 0) OR (p9 <= 0)) R ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0)))) OR ((1 <= p100) AND (1 <= p101) AND (1 <= p104)))))
lola: processed formula length: 331
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 8 markings, 8 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((X (G (((1 <= p149)))) R F (((p149 <= 0)))) OR ((1 <= p110) AND (1 <= p113)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p110) AND (1 <= p113))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p110) AND (1 <= p113))
lola: processed formula length: 29
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (G (((1 <= p149)))) R F (((p149 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((1 <= p149)))) R F (((p149 <= 0))))
lola: processed formula length: 43
lola: 101 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: 1864554 markings, 1975869 edges, 372911 markings/sec, 0 secs
lola: 4003202 markings, 4242198 edges, 427730 markings/sec, 5 secs
lola: 6119502 markings, 6484846 edges, 423260 markings/sec, 10 secs
lola: 8253416 markings, 8746153 edges, 426783 markings/sec, 15 secs
lola: 10365327 markings, 10984152 edges, 422382 markings/sec, 20 secs
lola: 12467440 markings, 13211762 edges, 420423 markings/sec, 25 secs
lola: 14390523 markings, 15249659 edges, 384617 markings/sec, 30 secs
lola: 16451849 markings, 17434050 edges, 412265 markings/sec, 35 secs
lola: 18107744 markings, 19611208 edges, 331179 markings/sec, 40 secs
lola: 19274223 markings, 21826027 edges, 233296 markings/sec, 45 secs
lola: 20355982 markings, 23980058 edges, 216352 markings/sec, 50 secs
lola: 21355894 markings, 26067729 edges, 199982 markings/sec, 55 secs
lola: 22272078 markings, 28020667 edges, 183237 markings/sec, 60 secs
lola: 23232701 markings, 29996233 edges, 192125 markings/sec, 65 secs
lola: 24232705 markings, 32047491 edges, 200001 markings/sec, 70 secs
lola: 25131463 markings, 33983595 edges, 179752 markings/sec, 75 secs
lola: 26140402 markings, 36050853 edges, 201788 markings/sec, 80 secs
lola: 27032437 markings, 37969589 edges, 178407 markings/sec, 85 secs
lola: 27909720 markings, 39925996 edges, 175457 markings/sec, 90 secs
lola: 28793989 markings, 41838297 edges, 176854 markings/sec, 95 secs
lola: 29691192 markings, 43802862 edges, 179441 markings/sec, 100 secs
lola: 30570899 markings, 45695758 edges, 175941 markings/sec, 105 secs
lola: 31690095 markings, 47866658 edges, 223839 markings/sec, 110 secs
lola: 32818843 markings, 49992131 edges, 225750 markings/sec, 115 secs
lola: 33853416 markings, 52129958 edges, 206915 markings/sec, 120 secs
lola: 34770318 markings, 54109267 edges, 183380 markings/sec, 125 secs
lola: 35768614 markings, 56191128 edges, 199659 markings/sec, 130 secs
lola: 36697274 markings, 58158881 edges, 185732 markings/sec, 135 secs
lola: 37694166 markings, 60211536 edges, 199378 markings/sec, 140 secs
lola: 38658346 markings, 62248472 edges, 192836 markings/sec, 145 secs
lola: 39595946 markings, 64259297 edges, 187520 markings/sec, 150 secs
lola: 40647908 markings, 66377501 edges, 210392 markings/sec, 155 secs
lola: 41588179 markings, 68410040 edges, 188054 markings/sec, 160 secs
lola: 42477394 markings, 70370603 edges, 177843 markings/sec, 165 secs
lola: 43347477 markings, 72294734 edges, 174017 markings/sec, 170 secs
lola: 44190268 markings, 74192413 edges, 168558 markings/sec, 175 secs
lola: 45029528 markings, 76082064 edges, 167852 markings/sec, 180 secs
lola: 45857831 markings, 77958556 edges, 165661 markings/sec, 185 secs
lola: 46680415 markings, 79833311 edges, 164517 markings/sec, 190 secs
lola: 47505877 markings, 81712728 edges, 165092 markings/sec, 195 secs
lola: 48317337 markings, 83578081 edges, 162292 markings/sec, 200 secs
lola: 49114076 markings, 85434796 edges, 159348 markings/sec, 205 secs
lola: 49917990 markings, 87286954 edges, 160783 markings/sec, 210 secs
lola: 50707220 markings, 89123732 edges, 157846 markings/sec, 215 secs
lola: 51488536 markings, 90954181 edges, 156263 markings/sec, 220 secs
lola: 52261995 markings, 92776434 edges, 154692 markings/sec, 225 secs
lola: 53032793 markings, 94596764 edges, 154160 markings/sec, 230 secs
lola: 53798348 markings, 96420300 edges, 153111 markings/sec, 235 secs
lola: 54558926 markings, 98239080 edges, 152116 markings/sec, 240 secs
lola: 55331007 markings, 100056272 edges, 154416 markings/sec, 245 secs
lola: 56076618 markings, 101851761 edges, 149122 markings/sec, 250 secs
lola: 56684282 markings, 103322725 edges, 121533 markings/sec, 255 secs
lola: 57331396 markings, 104872223 edges, 129423 markings/sec, 260 secs
lola: 57776120 markings, 105945160 edges, 88945 markings/sec, 265 secs
lola: 58469991 markings, 107619494 edges, 138774 markings/sec, 270 secs
lola: 59077289 markings, 109098030 edges, 121460 markings/sec, 275 secs
lola: 59673628 markings, 110524461 edges, 119268 markings/sec, 280 secs
lola: 60316746 markings, 112069267 edges, 128624 markings/sec, 285 secs
lola: 60906569 markings, 113491769 edges, 117965 markings/sec, 290 secs
lola: 61511525 markings, 114944053 edges, 120991 markings/sec, 295 secs
lola: 62094916 markings, 116356335 edges, 116678 markings/sec, 300 secs
lola: 62757701 markings, 117941111 edges, 132557 markings/sec, 305 secs
lola: 63378856 markings, 119434164 edges, 124231 markings/sec, 310 secs
lola: 64027967 markings, 121019035 edges, 129822 markings/sec, 315 secs
lola: 64666254 markings, 122508363 edges, 127657 markings/sec, 320 secs
lola: 65385599 markings, 124111789 edges, 143869 markings/sec, 325 secs
lola: 66097396 markings, 125774157 edges, 142359 markings/sec, 330 secs
lola: 66760175 markings, 127387641 edges, 132556 markings/sec, 335 secs
lola: 67590041 markings, 129022299 edges, 165973 markings/sec, 340 secs
lola: 68419445 markings, 130666646 edges, 165881 markings/sec, 345 secs
lola: 69163200 markings, 132229558 edges, 148751 markings/sec, 350 secs
lola: 69843639 markings, 133716171 edges, 136088 markings/sec, 355 secs
lola: 70508754 markings, 135355231 edges, 133023 markings/sec, 360 secs
lola: 70756657 markings, 135957587 edges, 49581 markings/sec, 365 secs
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: RESULT
lola:
SUMMARY: no no no no no no unknown no no no no no no
lola:
preliminary result: no no no no no no unknown no no no no no no
lola: memory consumption: 3912 KB
lola: time consumption: 758 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="ShieldRVt-PT-020A"
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 ShieldRVt-PT-020A, 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 r246-smll-162106594300138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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