Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938700234.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is RobotManipulation-PT-10000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938700234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.8K Apr 12 11:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 11:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 12:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 10 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 10 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 9 23:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 9 23:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:38 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 RobotManipulation-PT-10000-00
FORMULA_NAME RobotManipulation-PT-10000-01
FORMULA_NAME RobotManipulation-PT-10000-02
FORMULA_NAME RobotManipulation-PT-10000-03
FORMULA_NAME RobotManipulation-PT-10000-04
FORMULA_NAME RobotManipulation-PT-10000-05
FORMULA_NAME RobotManipulation-PT-10000-06
FORMULA_NAME RobotManipulation-PT-10000-07
FORMULA_NAME RobotManipulation-PT-10000-08
FORMULA_NAME RobotManipulation-PT-10000-09
FORMULA_NAME RobotManipulation-PT-10000-10
FORMULA_NAME RobotManipulation-PT-10000-11
FORMULA_NAME RobotManipulation-PT-10000-12
FORMULA_NAME RobotManipulation-PT-10000-13
FORMULA_NAME RobotManipulation-PT-10000-14
FORMULA_NAME RobotManipulation-PT-10000-15

=== Now, execution of the tool begins

BK_START 1591232208335

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

FORMULA RobotManipulation-PT-10000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1973
rslt: Output for LTLFireability @ RobotManipulation-PT-10000

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 00:56:55 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 3,
"aconj": 5,
"adisj": 0,
"aneg": 4,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F (((((p0 <= 0) OR (p4 <= 0)) R ((p13 <= 0) OR (p14 <= 0))) AND (F (((1 <= p13) AND (1 <= p14))) OR G (((p13 <= 0) OR (p14 <= 0)))))) AND X (X (X (((p13 <= 0) OR (p14 <= 0)))))))",
"processed_size": 186,
"rewrites": 78
},
"result":
{
"edges": 20009,
"markings": 20009,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 15
},
"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": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((F (G ((X ((1 <= p7)) OR (1 <= p7)))) OR (X ((p7 <= 0)) AND (1 <= p10))))",
"processed_size": 76,
"rewrites": 78
},
"result":
{
"edges": 20014,
"markings": 20014,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((X (G (((p1 <= 0) OR (p5 <= 0) OR (p2 <= 0) OR (p9 <= 0)))) AND (F (((p2 <= 0) OR (p9 <= 0))) AND (((p2 <= 0) OR (p9 <= 0)) U ((1 <= p0) AND (1 <= p4))))))",
"processed_size": 163,
"rewrites": 78
},
"result":
{
"edges": 1619961,
"markings": 939985,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 369
},
"child":
[

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 475
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((p0 <= 0) OR (p4 <= 0))",
"processed_size": 25,
"rewrites": 80
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 554
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "X ((F ((1 <= p12)) AND ((1 <= p0) AND (1 <= p4))))",
"processed_size": 50,
"rewrites": 78
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 554
},
"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 <= p0) AND (1 <= p4))",
"processed_size": 25,
"rewrites": 78
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 665
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"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": 1,
"visible_transitions": 0
},
"processed": "((1 <= p8) U X ((1 <= p8)))",
"processed_size": 27,
"rewrites": 78
},
"result":
{
"edges": 20006,
"markings": 20006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 665
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (G ((X (((1 <= p7) AND (1 <= p11))) OR G ((1 <= p10))))) OR (1 <= p10)))",
"processed_size": 78,
"rewrites": 78
},
"result":
{
"edges": 20006,
"markings": 20006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 831
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((((p3 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)))))",
"processed_size": 65,
"rewrites": 78
},
"result":
{
"edges": 20008,
"markings": 20007,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 1108
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"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": 4,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p12) AND ((p1 <= 0) OR (p5 <= 0)))) OR (p8 <= 0))))",
"processed_size": 69,
"rewrites": 78
},
"result":
{
"edges": 340025,
"markings": 260018,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1662
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3325
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G (((1 <= p0) AND (1 <= p4)))",
"processed_size": 29,
"rewrites": 78
},
"result":
{
"edges": 100005,
"markings": 100005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3325
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3768,
"runtime": 1597.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((F(((* R *) AND (F(**) OR G(*)))) AND X(X(X(*))))) : X((F(G((X(**) OR **))) OR (X(*) AND **))) : X((X(G(*)) AND (F(*) AND (** U **)))) : F(G((* AND *))) : X(G((** AND (F(**) OR X(**))))) : (X(F(**)) OR (G(**) AND **)) : X((G((F(**) OR **)) OR (X(*) AND **))) : (X((F(**) AND (* AND *))) AND F(**)) : ((F(**) U G(**)) OR (F(**) U **)) : (X(G(*)) AND ((** U X(**)) OR **)) : (F(**) OR G(**)) : X((X(G((X(**) OR G(**)))) OR **)) : G(F((G((* AND *)) OR *)))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 9,
"places": 15,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no no no no unknown yes yes yes unknown no no no no ",
"value": "no no no no unknown yes yes yes unknown 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: 26/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 480
lola: finding significant places
lola: 15 places, 11 transitions, 9 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: G ((NOT(G ((NOT(F (((1 <= p13) AND (1 <= p14)))) U (((1 <= p0) AND (1 <= p4)) U ((1 <= p13) AND (1 <= p14)))))) AND NOT(X (X (X (((1 <= p13) AND (1 <= p14)))))))) : X ((F (X (G (X ((X ((1 <= p7)) OR (1 <= p7)))))) OR (NOT(X ((1 <= p7))) AND (1 <= p10)))) : X (((NOT(X (F (((1 <= p1) AND (1 <= p5) AND (1 <= p2) AND (1 <= p9))))) AND NOT(G (((1 <= p2) AND (1 <= p9))))) AND (((p2 <= 0) OR (p9 <= 0)) U ((1 <= p0) AND (1 <= p4))))) : F (X ((((1 <= p7) AND (1 <= p11)) U X (G (X ((NOT(X (((1 <= p3) AND (1 <= p5)))) AND NOT(X (((1 <= p1) AND (1 <= p5))))))))))) : X (G (((p6 <= 0) AND (F (((1 <= p7) AND (1 <= p11))) OR X (((1 <= p8) OR (1 <= p6))))))) : (F (X ((p10 <= 0))) OR (G ((p10 <= 0)) AND (1 <= p10))) : X ((G ((F ((1 <= p10)) OR (1 <= p8))) OR (NOT(X ((1 <= p10))) AND (p10 <= 0)))) : (NOT(X (((NOT((((1 <= p0) AND (1 <= p4)) U F ((1 <= p12)))) OR (p0 <= 0)) OR (p4 <= 0)))) AND F (((1 <= p0) AND (1 <= p4)))) : ((F (((1 <= p2) AND (1 <= p9))) U G (((1 <= p7) AND (1 <= p11)))) OR (F (((1 <= p2) AND (1 <= p9))) U (1 <= p10))) : (G (NOT(X ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p4)))))) AND (((1 <= p8) U X ((1 <= p8))) OR ((1 <= p0) AND (1 <= p4)))) : ((F (((1 <= p1) AND (1 <= p5))) U (F (((1 <= p1) AND (1 <= p5))) U F ((1 <= p8)))) OR G (((1 <= p0) AND (1 <= p4)))) : X ((X (G ((X (((1 <= p7) AND (1 <= p11))) OR G ((1 <= p10))))) OR (1 <= p10))) : NOT(F ((G ((((1 <= p12) U (p12 <= 0)) OR (((1 <= p2) AND (1 <= p9)) U F (((1 <= p1) AND (1 <= p5)))))) AND G ((1 <= p8)))))
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:419
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:318
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((((p0 <= 0) OR (p4 <= 0)) R ((p13 <= 0) OR (p14 <= 0))) AND (F (((1 <= p13) AND (1 <= p14))) OR G (((p13 <= 0) OR (p14 <= 0)))))) AND X (X (X (((p13 <= 0) OR (p14 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((((p0 <= 0) OR (p4 <= 0)) R ((p13 <= 0) OR (p14 <= 0))) AND (F (((1 <= p13) AND (1 <= p14))) OR G (((p13 <= 0) OR (p14 <= 0)))))) AND X (X (X (((p13 <= 0) OR (p14 <= 0)))))))
lola: processed formula length: 186
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 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: 20009 markings, 20009 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((X ((1 <= p7)) OR (1 <= p7)))) OR (X ((p7 <= 0)) AND (1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((X ((1 <= p7)) OR (1 <= p7)))) OR (X ((p7 <= 0)) AND (1 <= p10))))
lola: processed formula length: 76
lola: 78 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: 20014 markings, 20014 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((p1 <= 0) OR (p5 <= 0) OR (p2 <= 0) OR (p9 <= 0)))) AND (F (((p2 <= 0) OR (p9 <= 0))) AND (((p2 <= 0) OR (p9 <= 0)) U ((1 <= p0) AND (1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((p1 <= 0) OR (p5 <= 0) OR (p2 <= 0) OR (p9 <= 0)))) AND (F (((p2 <= 0) OR (p9 <= 0))) AND (((p2 <= 0) OR (p9 <= 0)) U ((1 <= p0) AND (1 <= p4))))))
lola: processed formula length: 163
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: 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: 939985 markings, 1619961 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p6 <= 0) AND (F (((1 <= p7) AND (1 <= p11))) OR X (((1 <= p8) OR (1 <= p6)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p6 <= 0) AND (F (((1 <= p7) AND (1 <= p11))) OR X (((1 <= p8) OR (1 <= p6)))))))
lola: processed formula length: 89
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: 4511630 markings, 6737444 edges, 902326 markings/sec, 0 secs
lola: 8640056 markings, 12930082 edges, 825685 markings/sec, 5 secs
lola: 12646836 markings, 18940253 edges, 801356 markings/sec, 10 secs
lola: 16293918 markings, 24410875 edges, 729416 markings/sec, 15 secs
lola: 20161846 markings, 30212768 edges, 773586 markings/sec, 20 secs
lola: 23956060 markings, 35904088 edges, 758843 markings/sec, 25 secs
lola: 27753710 markings, 41600564 edges, 759530 markings/sec, 30 secs
lola: 31488521 markings, 47202780 edges, 746962 markings/sec, 35 secs
lola: 35166562 markings, 52719840 edges, 735608 markings/sec, 40 secs
lola: 38762527 markings, 58113789 edges, 719193 markings/sec, 45 secs
lola: 42405639 markings, 63578457 edges, 728622 markings/sec, 50 secs
lola: 46009444 markings, 68984164 edges, 720761 markings/sec, 55 secs
lola: 49644370 markings, 74436554 edges, 726985 markings/sec, 60 secs
lola: 53226366 markings, 79809548 edges, 716399 markings/sec, 65 secs
lola: 56823033 markings, 85204548 edges, 719333 markings/sec, 70 secs
lola: 60369003 markings, 90523503 edges, 709194 markings/sec, 75 secs
lola: 63935612 markings, 95873417 edges, 713322 markings/sec, 80 secs
lola: 67462568 markings, 101163851 edges, 705391 markings/sec, 85 secs
lola: 70999556 markings, 106469331 edges, 707398 markings/sec, 90 secs
lola: 74495306 markings, 111712958 edges, 699150 markings/sec, 95 secs
lola: 78026344 markings, 117009515 edges, 706208 markings/sec, 100 secs
lola: 81503510 markings, 122225264 edges, 695433 markings/sec, 105 secs
lola: 85026692 markings, 127510037 edges, 704636 markings/sec, 110 secs
lola: 88467234 markings, 132670850 edges, 688108 markings/sec, 115 secs
lola: 91985344 markings, 137948014 edges, 703622 markings/sec, 120 secs
lola: 95488624 markings, 143202934 edges, 700656 markings/sec, 125 secs
lola: 98970807 markings, 148426208 edges, 696437 markings/sec, 130 secs
lola: 102431307 markings, 153616959 edges, 692100 markings/sec, 135 secs
lola: 105906060 markings, 158829088 edges, 694951 markings/sec, 140 secs
lola: 109342556 markings, 163983831 edges, 687299 markings/sec, 145 secs
lola: 112800154 markings, 169170229 edges, 691520 markings/sec, 150 secs
lola: 116219866 markings, 174299798 edges, 683942 markings/sec, 155 secs
lola: 119674038 markings, 179481055 edges, 690834 markings/sec, 160 secs
lola: 122831162 markings, 184216742 edges, 631425 markings/sec, 165 secs
lola: 124270320 markings, 186375494 edges, 287832 markings/sec, 170 secs
lola: 127390086 markings, 191057390 edges, 623953 markings/sec, 175 secs
lola: 130547678 markings, 195794537 edges, 631518 markings/sec, 180 secs
lola: 133510649 markings, 200235972 edges, 592594 markings/sec, 185 secs
lola: 135795744 markings, 203663615 edges, 457019 markings/sec, 190 secs
lola: 138262810 markings, 207364213 edges, 493413 markings/sec, 195 secs
lola: 140675848 markings, 210983772 edges, 482608 markings/sec, 200 secs
lola: 143232054 markings, 214818081 edges, 511241 markings/sec, 205 secs
lola: 145339332 markings, 217978997 edges, 421456 markings/sec, 210 secs
lola: 147474756 markings, 221182133 edges, 427085 markings/sec, 215 secs
lola: 149657222 markings, 224455832 edges, 436493 markings/sec, 220 secs
lola: 151916386 markings, 227844578 edges, 451833 markings/sec, 225 secs
lola: 153936952 markings, 230875427 edges, 404113 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p10 <= 0))) OR (G ((p10 <= 0)) AND (1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p10)
lola: processed formula length: 10
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: subprocess 5 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p10 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p10 <= 0)))
lola: processed formula length: 18
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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((F ((1 <= p10)) OR (1 <= p8))) OR (X ((p10 <= 0)) AND (p10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((F ((1 <= p10)) OR (1 <= p8))) OR (X ((p10 <= 0)) AND (p10 <= 0))))
lola: processed formula length: 74
lola: 78 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 6 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F ((1 <= p12)) AND ((1 <= p0) AND (1 <= p4)))) AND F (((1 <= p0) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p0) AND (1 <= p4)))
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: ((p0 <= 0) OR (p4 <= 0))
lola: processed formula length: 25
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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: subprocess 7 will run for 554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((1 <= p12)) AND ((1 <= p0) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((1 <= p12)) AND ((1 <= p0) AND (1 <= p4))))
lola: processed formula length: 50
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: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p4 <= 0))))) AND (((1 <= p8) U X ((1 <= p8))) OR ((1 <= p0) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) AND (1 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p0) AND (1 <= p4))
lola: processed formula length: 25
lola: 78 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 8 will run for 665 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p8) U X ((1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p8) U X ((1 <= p8)))
lola: processed formula length: 27
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: 20006 markings, 20006 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 665 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((X (((1 <= p7) AND (1 <= p11))) OR G ((1 <= p10))))) OR (1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((X (((1 <= p7) AND (1 <= p11))) OR G ((1 <= p10))))) OR (1 <= p10)))
lola: processed formula length: 78
lola: 78 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: 20006 markings, 20006 edges
lola: ========================================
lola: subprocess 9 will run for 831 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p3 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p3 <= 0) OR (p5 <= 0)) AND ((p1 <= 0) OR (p5 <= 0)))))
lola: processed formula length: 65
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: 20007 markings, 20008 edges
lola: ========================================
lola: subprocess 10 will run for 1108 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p12) AND ((p1 <= 0) OR (p5 <= 0)))) OR (p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p12) AND ((p1 <= 0) OR (p5 <= 0)))) OR (p8 <= 0))))
lola: processed formula length: 69
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: 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: 260018 markings, 340025 edges
lola: ========================================
lola: subprocess 11 will run for 1662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p8)) OR G (((1 <= p0) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p8))
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: (p8 <= 0)
lola: processed formula length: 9
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: 100004 markings, 100004 edges
lola: ========================================
lola: subprocess 12 will run for 3325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p0) AND (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p0) AND (1 <= p4)))
lola: processed formula length: 29
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: 100005 markings, 100005 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 3325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p2) AND (1 <= p9))) U G (((1 <= p7) AND (1 <= p11)))) OR (F (((1 <= p2) AND (1 <= p9))) U (1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p2) AND (1 <= p9))) U (1 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p2) AND (1 <= p9))) U (1 <= p10))
lola: processed formula length: 44
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: 3374512 markings, 4991726 edges, 674902 markings/sec, 0 secs
lola: 6279037 markings, 9348477 edges, 580905 markings/sec, 5 secs
lola: 9353639 markings, 13960341 edges, 614920 markings/sec, 10 secs
lola: 12569994 markings, 18784833 edges, 643271 markings/sec, 15 secs
lola: 15749904 markings, 23554658 edges, 635982 markings/sec, 20 secs
lola: 18924160 markings, 28316001 edges, 634851 markings/sec, 25 secs
lola: 22060278 markings, 33020138 edges, 627224 markings/sec, 30 secs
lola: 25170465 markings, 37685379 edges, 622037 markings/sec, 35 secs
lola: 28244114 markings, 42295812 edges, 614730 markings/sec, 40 secs
lola: 31309811 markings, 46894317 edges, 613139 markings/sec, 45 secs
lola: 34097418 markings, 51075692 edges, 557521 markings/sec, 50 secs
lola: 36392017 markings, 54517561 edges, 458920 markings/sec, 55 secs
lola: 38754369 markings, 58061086 edges, 472470 markings/sec, 60 secs
lola: 41124715 markings, 61616569 edges, 474069 markings/sec, 65 secs
lola: 43222396 markings, 64763039 edges, 419536 markings/sec, 70 secs
lola: 45170071 markings, 67684526 edges, 389535 markings/sec, 75 secs
lola: 47132252 markings, 70627771 edges, 392436 markings/sec, 80 secs
lola: 49056417 markings, 73513992 edges, 384833 markings/sec, 85 secs
lola: 51267727 markings, 76830927 edges, 442262 markings/sec, 90 secs
lola: 53668917 markings, 80432681 edges, 480238 markings/sec, 95 secs
lola: 56328084 markings, 84421396 edges, 531833 markings/sec, 100 secs
lola: 59120027 markings, 88609271 edges, 558389 markings/sec, 105 secs
lola: 61907903 markings, 92791048 edges, 557575 markings/sec, 110 secs
lola: 64682147 markings, 96952377 edges, 554849 markings/sec, 115 secs
lola: 67097852 markings, 100575902 edges, 483141 markings/sec, 120 secs
lola: 69297475 markings, 103875304 edges, 439925 markings/sec, 125 secs
lola: 71690891 markings, 107465397 edges, 478683 markings/sec, 130 secs
lola: 74297739 markings, 111375632 edges, 521370 markings/sec, 135 secs
lola: 76908033 markings, 115291037 edges, 522059 markings/sec, 140 secs
lola: 79600419 markings, 119329579 edges, 538477 markings/sec, 145 secs
lola: 82226177 markings, 123268180 edges, 525152 markings/sec, 150 secs
lola: 84919194 markings, 127307667 edges, 538603 markings/sec, 155 secs
lola: 87575214 markings, 131291659 edges, 531204 markings/sec, 160 secs
lola: 90271165 markings, 135335546 edges, 539190 markings/sec, 165 secs
lola: 92959328 markings, 139367754 edges, 537633 markings/sec, 170 secs
lola: 95656968 markings, 143414176 edges, 539528 markings/sec, 175 secs
lola: 98380023 markings, 147498718 edges, 544611 markings/sec, 180 secs
lola: 101073820 markings, 151539375 edges, 538759 markings/sec, 185 secs
lola: 103743778 markings, 155544273 edges, 533992 markings/sec, 190 secs
lola: 105582561 markings, 158302422 edges, 367757 markings/sec, 195 secs
lola: 107797978 markings, 161625514 edges, 443083 markings/sec, 200 secs
lola: 109791347 markings, 164615539 edges, 398674 markings/sec, 205 secs
lola: 111881845 markings, 167751255 edges, 418100 markings/sec, 210 secs
lola: 114033020 markings, 170977986 edges, 430235 markings/sec, 215 secs
lola: 116221240 markings, 174260284 edges, 437644 markings/sec, 220 secs
lola: 118423142 markings, 177563104 edges, 440380 markings/sec, 225 secs
lola: 120625736 markings, 180866962 edges, 440519 markings/sec, 230 secs
lola: 122849709 markings, 184202888 edges, 444795 markings/sec, 235 secs
lola: 125136171 markings, 187632547 edges, 457292 markings/sec, 240 secs
lola: 126639402 markings, 189888004 edges, 300646 markings/sec, 245 secs
lola: 128383287 markings, 192503172 edges, 348777 markings/sec, 250 secs
lola: 130099315 markings, 195077188 edges, 343206 markings/sec, 255 secs
lola: 131736689 markings, 197533223 edges, 327475 markings/sec, 260 secs
lola: 133934370 markings, 200829712 edges, 439536 markings/sec, 265 secs
lola: 136239177 markings, 204286887 edges, 460961 markings/sec, 270 secs
lola: 137959990 markings, 206868079 edges, 344163 markings/sec, 275 secs
lola: 139819097 markings, 209656712 edges, 371821 markings/sec, 280 secs
lola: 141632849 markings, 212377311 edges, 362750 markings/sec, 285 secs
lola: 143452624 markings, 215106944 edges, 363955 markings/sec, 290 secs
lola: 144297071 markings, 216373603 edges, 168889 markings/sec, 295 secs
lola: 144843666 markings, 217193487 edges, 109319 markings/sec, 300 secs
lola: 145463310 markings, 218122942 edges, 123929 markings/sec, 305 secs
lola: 146088816 markings, 219061192 edges, 125101 markings/sec, 310 secs
lola: 147264136 markings, 220824154 edges, 235064 markings/sec, 315 secs
lola: 148904785 markings, 223285102 edges, 328130 markings/sec, 320 secs
lola: 150570174 markings, 225783159 edges, 333078 markings/sec, 325 secs
lola: 152134003 markings, 228128878 edges, 312766 markings/sec, 330 secs
lola: 153697539 markings, 230474157 edges, 312707 markings/sec, 335 secs
lola: 155275716 markings, 232841397 edges, 315635 markings/sec, 340 secs
lola: 156873334 markings, 235241352 edges, 319524 markings/sec, 345 secs
lola: Child process aborted or communication problem between parent and child process
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: ========================================
lola: ...considering subproblem: X (G (((p6 <= 0) AND (F (((1 <= p7) AND (1 <= p11))) OR X (((1 <= p8) OR (1 <= p6)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p6 <= 0) AND (F (((1 <= p7) AND (1 <= p11))) OR X (((1 <= p8) OR (1 <= p6)))))))
lola: processed formula length: 89
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: 3958300 markings, 5907449 edges, 791660 markings/sec, 0 secs
lola: 7626792 markings, 11410187 edges, 733698 markings/sec, 5 secs
lola: 11166928 markings, 16720391 edges, 708027 markings/sec, 10 secs
lola: 14659149 markings, 21958722 edges, 698444 markings/sec, 15 secs
lola: 18403316 markings, 27574972 edges, 748833 markings/sec, 20 secs
lola: 21722664 markings, 32553995 edges, 663870 markings/sec, 25 secs
lola: 24776972 markings, 37135456 edges, 610862 markings/sec, 30 secs
lola: 28160488 markings, 42210731 edges, 676703 markings/sec, 35 secs
lola: 31842956 markings, 47734432 edges, 736494 markings/sec, 40 secs
lola: 35469767 markings, 53174649 edges, 725362 markings/sec, 45 secs
lola: 38474750 markings, 57682124 edges, 600997 markings/sec, 50 secs
lola: 41566446 markings, 62319667 edges, 618339 markings/sec, 55 secs
lola: 44972058 markings, 67428086 edges, 681122 markings/sec, 60 secs
lola: 48474874 markings, 72682310 edges, 700563 markings/sec, 65 secs
lola: 51834422 markings, 77721632 edges, 671910 markings/sec, 70 secs
lola: 55111404 markings, 82637105 edges, 655396 markings/sec, 75 secs
lola: 58640475 markings, 87930711 edges, 705814 markings/sec, 80 secs
lola: 62173574 markings, 93230360 edges, 706620 markings/sec, 85 secs
lola: 65738496 markings, 98577743 edges, 712984 markings/sec, 90 secs
lola: 69282785 markings, 103894176 edges, 708858 markings/sec, 95 secs
lola: 72841848 markings, 109232770 edges, 711813 markings/sec, 100 secs
lola: 76385474 markings, 114548209 edges, 708725 markings/sec, 105 secs
lola: 79980412 markings, 119940617 edges, 718988 markings/sec, 110 secs
lola: 83578440 markings, 125337659 edges, 719606 markings/sec, 115 secs
lola: 87109850 markings, 130634773 edges, 706282 markings/sec, 120 secs
lola: 90657829 markings, 135956742 edges, 709596 markings/sec, 125 secs
lola: 94192478 markings, 141258716 edges, 706930 markings/sec, 130 secs
lola: 97705206 markings, 146527807 edges, 702546 markings/sec, 135 secs
lola: 101117953 markings, 151646928 edges, 682549 markings/sec, 140 secs
lola: 104597313 markings, 156865968 edges, 695872 markings/sec, 145 secs
lola: 108076680 markings, 162085018 edges, 695873 markings/sec, 150 secs
lola: 111423701 markings, 167105550 edges, 669404 markings/sec, 155 secs
lola: 114658740 markings, 171958108 edges, 647008 markings/sec, 160 secs
lola: 117924985 markings, 176857476 edges, 653249 markings/sec, 165 secs
lola: 121245674 markings, 181838510 edges, 664138 markings/sec, 170 secs
lola: 124220987 markings, 186302863 edges, 595063 markings/sec, 175 secs
lola: 127047556 markings, 190541658 edges, 565314 markings/sec, 180 secs
lola: 129059313 markings, 193558968 edges, 402351 markings/sec, 185 secs
lola: 131041771 markings, 196532657 edges, 396492 markings/sec, 190 secs
lola: 133370752 markings, 200026127 edges, 465796 markings/sec, 195 secs
lola: 135142976 markings, 202684463 edges, 354445 markings/sec, 200 secs
lola: 137090437 markings, 205605654 edges, 389492 markings/sec, 205 secs
lola: 137715038 markings, 206542556 edges, 124920 markings/sec, 210 secs
lola: 138391220 markings, 207556829 edges, 135236 markings/sec, 215 secs
lola: 139470482 markings, 209175720 edges, 215852 markings/sec, 220 secs
lola: 140247704 markings, 210341555 edges, 155444 markings/sec, 225 secs
lola: 141745270 markings, 212587903 edges, 299513 markings/sec, 230 secs
lola: 143271738 markings, 214877607 edges, 305294 markings/sec, 235 secs
lola: 144728976 markings, 217063461 edges, 291448 markings/sec, 240 secs
lola: 146530592 markings, 219765888 edges, 360323 markings/sec, 245 secs
lola: 148266740 markings, 222370109 edges, 347230 markings/sec, 250 secs
lola: 150333705 markings, 225470556 edges, 413393 markings/sec, 255 secs
lola: 151579429 markings, 227339144 edges, 249145 markings/sec, 260 secs
lola: 152676652 markings, 228984977 edges, 219445 markings/sec, 265 secs
lola: 153861708 markings, 230762561 edges, 237011 markings/sec, 270 secs
lola: 154996752 markings, 232465126 edges, 227009 markings/sec, 275 secs
lola: 155228623 markings, 232812933 edges, 46374 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p2) AND (1 <= p9))) U G (((1 <= p7) AND (1 <= p11)))) OR (F (((1 <= p2) AND (1 <= p9))) U (1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p2) AND (1 <= p9))) U (1 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p2) AND (1 <= p9))) U (1 <= p10))
lola: processed formula length: 44
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: 3735886 markings, 5533782 edges, 747177 markings/sec, 0 secs
lola: 7008292 markings, 10442349 edges, 654481 markings/sec, 5 secs
lola: 10002791 markings, 14934061 edges, 598900 markings/sec, 10 secs
lola: 12964342 markings, 19376350 edges, 592310 markings/sec, 15 secs
lola: 15766419 markings, 23579430 edges, 560415 markings/sec, 20 secs
lola: 18665253 markings, 27927644 edges, 579767 markings/sec, 25 secs
lola: 21655206 markings, 32412535 edges, 597991 markings/sec, 30 secs
lola: 24444595 markings, 36596583 edges, 557878 markings/sec, 35 secs
lola: 27404251 markings, 41036028 edges, 591931 markings/sec, 40 secs
lola: 29901733 markings, 44782218 edges, 499496 markings/sec, 45 secs
lola: 32388364 markings, 48512133 edges, 497326 markings/sec, 50 secs
lola: 35092580 markings, 52568422 edges, 540843 markings/sec, 55 secs
lola: 37888311 markings, 56761982 edges, 559146 markings/sec, 60 secs
lola: 40547127 markings, 60750171 edges, 531763 markings/sec, 65 secs
lola: 43364270 markings, 64975848 edges, 563429 markings/sec, 70 secs
lola: 46196603 markings, 69224310 edges, 566467 markings/sec, 75 secs
lola: 49093115 markings, 73569040 edges, 579302 markings/sec, 80 secs
lola: 51823324 markings, 77664316 edges, 546042 markings/sec, 85 secs
lola: 54016914 markings, 80954672 edges, 438718 markings/sec, 90 secs
lola: 56050559 markings, 84005112 edges, 406729 markings/sec, 95 secs
lola: 58186754 markings, 87209376 edges, 427239 markings/sec, 100 secs
lola: 60208523 markings, 90242002 edges, 404354 markings/sec, 105 secs
lola: 62153784 markings, 93159867 edges, 389052 markings/sec, 110 secs
lola: 64077193 markings, 96044954 edges, 384682 markings/sec, 115 secs
lola: 66182757 markings, 99203271 edges, 421113 markings/sec, 120 secs
lola: 68908124 markings, 103291285 edges, 545073 markings/sec, 125 secs
lola: 71692959 markings, 107468499 edges, 556967 markings/sec, 130 secs
lola: 74415457 markings, 111552207 edges, 544500 markings/sec, 135 secs
lola: 77188585 markings, 115711860 edges, 554626 markings/sec, 140 secs
lola: 79891373 markings, 119766006 edges, 540558 markings/sec, 145 secs
lola: 82646640 markings, 123898868 edges, 551053 markings/sec, 150 secs
lola: 85361893 markings, 127971709 edges, 543051 markings/sec, 155 secs
lola: 88092539 markings, 132067640 edges, 546129 markings/sec, 160 secs
lola: 90827156 markings, 136169527 edges, 546923 markings/sec, 165 secs
lola: 93512124 markings, 140196940 edges, 536994 markings/sec, 170 secs
lola: 96221820 markings, 144261446 edges, 541939 markings/sec, 175 secs
lola: 98863678 markings, 148224195 edges, 528372 markings/sec, 180 secs
lola: 101598833 markings, 152326887 edges, 547031 markings/sec, 185 secs
lola: 104261621 markings, 156321031 edges, 532558 markings/sec, 190 secs
lola: 106988032 markings, 160410606 edges, 545282 markings/sec, 195 secs
lola: 109652367 markings, 164407070 edges, 532867 markings/sec, 200 secs
lola: 112352094 markings, 168456622 edges, 539945 markings/sec, 205 secs
lola: 114976888 markings, 172393774 edges, 524959 markings/sec, 210 secs
lola: 117661339 markings, 176420411 edges, 536890 markings/sec, 215 secs
lola: 120289670 markings, 180362868 edges, 525666 markings/sec, 220 secs
lola: 122970329 markings, 184383816 edges, 536132 markings/sec, 225 secs
lola: 125285753 markings, 187856916 edges, 463085 markings/sec, 230 secs
lola: 125867379 markings, 188744771 edges, 116325 markings/sec, 235 secs
lola: 126641444 markings, 189890432 edges, 154813 markings/sec, 240 secs
lola: 128196278 markings, 192222661 edges, 310967 markings/sec, 245 secs
lola: 130509261 markings, 195692101 edges, 462597 markings/sec, 250 secs
lola: 132891148 markings, 199264895 edges, 476377 markings/sec, 255 secs
lola: 134428609 markings, 201571063 edges, 307492 markings/sec, 260 secs
lola: 135495403 markings, 203171237 edges, 213359 markings/sec, 265 secs
lola: 136622239 markings, 204861474 edges, 225367 markings/sec, 270 secs
lola: 137244010 markings, 205794121 edges, 124354 markings/sec, 275 secs
lola: 139109643 markings, 208592543 edges, 373127 markings/sec, 280 secs
lola: 139677262 markings, 209443961 edges, 113524 markings/sec, 285 secs
lola: 139821031 markings, 209659613 edges, 28754 markings/sec, 290 secs
lola: 141608556 markings, 212340873 edges, 357505 markings/sec, 295 secs
lola: 142773569 markings, 214088374 edges, 233003 markings/sec, 300 secs
lola: 143138794 markings, 214636204 edges, 73045 markings/sec, 305 secs
lola: 143138794 markings, 214636204 edges, 0 markings/sec, 310 secs
lola: 144170696 markings, 216184042 edges, 206380 markings/sec, 315 secs
lola: 145400488 markings, 218028710 edges, 245958 markings/sec, 320 secs
lola: 145793021 markings, 218617503 edges, 78507 markings/sec, 325 secs
lola: 146831521 markings, 220175239 edges, 207700 markings/sec, 330 secs
lola: 148457974 markings, 222614892 edges, 325291 markings/sec, 335 secs
lola: 150013524 markings, 224948192 edges, 311110 markings/sec, 340 secs
lola: 151969894 markings, 227882715 edges, 391274 markings/sec, 345 secs
lola: 153665109 markings, 230425512 edges, 339043 markings/sec, 350 secs
lola: 155288927 markings, 232861214 edges, 324764 markings/sec, 355 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p2) AND (1 <= p9))) U G (((1 <= p7) AND (1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p2) AND (1 <= p9))) U G (((1 <= p7) AND (1 <= p11))))
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: 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: 3955953 markings, 5863881 edges, 791191 markings/sec, 0 secs
lola: 7390349 markings, 11015431 edges, 686879 markings/sec, 5 secs
lola: 10699563 markings, 15979211 edges, 661843 markings/sec, 10 secs
lola: 13924313 markings, 20816295 edges, 644950 markings/sec, 15 secs
lola: 17063071 markings, 25524392 edges, 627752 markings/sec, 20 secs
lola: 20093434 markings, 30069929 edges, 606073 markings/sec, 25 secs
lola: 23144804 markings, 34646913 edges, 610274 markings/sec, 30 secs
lola: 26163728 markings, 39175260 edges, 603785 markings/sec, 35 secs
lola: 29101584 markings, 43582006 edges, 587571 markings/sec, 40 secs
lola: 32040836 markings, 47990845 edges, 587850 markings/sec, 45 secs
lola: 34760861 markings, 52070848 edges, 544005 markings/sec, 50 secs
lola: 37703282 markings, 56484441 edges, 588484 markings/sec, 55 secs
lola: 40557954 markings, 60766410 edges, 570934 markings/sec, 60 secs
lola: 43461257 markings, 65121326 edges, 580661 markings/sec, 65 secs
lola: 46356035 markings, 69463456 edges, 578956 markings/sec, 70 secs
lola: 49258564 markings, 73817209 edges, 580506 markings/sec, 75 secs
lola: 52133268 markings, 78129228 edges, 574941 markings/sec, 80 secs
lola: 54969049 markings, 82382861 edges, 567156 markings/sec, 85 secs
lola: 57760184 markings, 86569527 edges, 558227 markings/sec, 90 secs
lola: 60546613 markings, 90749132 edges, 557286 markings/sec, 95 secs
lola: 63340802 markings, 94940377 edges, 558838 markings/sec, 100 secs
lola: 66134973 markings, 99131596 edges, 558834 markings/sec, 105 secs
lola: 68930576 markings, 103324962 edges, 559121 markings/sec, 110 secs
lola: 71711417 markings, 107496186 edges, 556168 markings/sec, 115 secs
lola: 74406191 markings, 111538309 edges, 538955 markings/sec, 120 secs
lola: 77196645 markings, 115723952 edges, 558091 markings/sec, 125 secs
lola: 79960190 markings, 119869231 edges, 552709 markings/sec, 130 secs
lola: 82781480 markings, 124101125 edges, 564258 markings/sec, 135 secs
lola: 85589147 markings, 128312587 edges, 561533 markings/sec, 140 secs
lola: 88375469 markings, 132492031 edges, 557264 markings/sec, 145 secs
lola: 91154295 markings, 136660230 edges, 555765 markings/sec, 150 secs
lola: 93925626 markings, 140817187 edges, 554266 markings/sec, 155 secs
lola: 96697102 markings, 144974362 edges, 554295 markings/sec, 160 secs
lola: 99455155 markings, 149111400 edges, 551611 markings/sec, 165 secs
lola: 102123344 markings, 153113647 edges, 533638 markings/sec, 170 secs
lola: 104859307 markings, 157217551 edges, 547193 markings/sec, 175 secs
lola: 107556694 markings, 161263592 edges, 539477 markings/sec, 180 secs
lola: 110303924 markings, 165384397 edges, 549446 markings/sec, 185 secs
lola: 113033510 markings, 169478735 edges, 545917 markings/sec, 190 secs
lola: 115762303 markings, 173571884 edges, 545759 markings/sec, 195 secs
lola: 118394903 markings, 177520746 edges, 526520 markings/sec, 200 secs
lola: 121080500 markings, 181549101 edges, 537119 markings/sec, 205 secs
lola: 123734504 markings, 185530068 edges, 530801 markings/sec, 210 secs
lola: 125377000 markings, 187993787 edges, 328499 markings/sec, 215 secs
lola: 126160735 markings, 189170026 edges, 156747 markings/sec, 220 secs
lola: 126841115 markings, 190189936 edges, 136076 markings/sec, 225 secs
lola: 127399689 markings, 191027790 edges, 111715 markings/sec, 230 secs
lola: 127922229 markings, 191811591 edges, 104508 markings/sec, 235 secs
lola: 128620315 markings, 192858709 edges, 139617 markings/sec, 240 secs
lola: 129118364 markings, 193605775 edges, 99610 markings/sec, 245 secs
lola: 130364057 markings, 195474295 edges, 249139 markings/sec, 250 secs
lola: 131959415 markings, 197867309 edges, 319072 markings/sec, 255 secs
lola: 133645513 markings, 200396431 edges, 337220 markings/sec, 260 secs
lola: 135508039 markings, 203190191 edges, 372505 markings/sec, 265 secs
lola: 136311868 markings, 204395921 edges, 160766 markings/sec, 270 secs
lola: 136311868 markings, 204395921 edges, 0 markings/sec, 275 secs
lola: 137109688 markings, 205592640 edges, 159564 markings/sec, 280 secs
lola: 138951628 markings, 208355522 edges, 368388 markings/sec, 285 secs
lola: 140757947 markings, 211064971 edges, 361264 markings/sec, 290 secs
lola: 142388702 markings, 213511079 edges, 326151 markings/sec, 295 secs
lola: 143966315 markings, 215877474 edges, 315523 markings/sec, 300 secs
lola: 145669224 markings, 218431813 edges, 340582 markings/sec, 305 secs
lola: 146768117 markings, 220080133 edges, 219779 markings/sec, 310 secs
lola: 148796799 markings, 223123124 edges, 405736 markings/sec, 315 secs
lola: 150730794 markings, 226024086 edges, 386799 markings/sec, 320 secs
lola: 153098277 markings, 229575275 edges, 473497 markings/sec, 325 secs
lola: 155177503 markings, 232694078 edges, 415845 markings/sec, 330 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 unknown yes yes yes unknown no no no no
lola:
preliminary result: no no no no unknown yes yes yes unknown no no no no
lola: memory consumption: 3768 KB
lola: time consumption: 1597 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="RobotManipulation-PT-10000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is RobotManipulation-PT-10000, 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 r186-oct2-158987938700234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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