Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033476900074.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldIIPs-PT-003A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033476900074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.7K May 14 00:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 00:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 17:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 17:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.6K May 13 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 07:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 26K May 12 20:42 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 ShieldIIPs-PT-003A-00
FORMULA_NAME ShieldIIPs-PT-003A-01
FORMULA_NAME ShieldIIPs-PT-003A-02
FORMULA_NAME ShieldIIPs-PT-003A-03
FORMULA_NAME ShieldIIPs-PT-003A-04
FORMULA_NAME ShieldIIPs-PT-003A-05
FORMULA_NAME ShieldIIPs-PT-003A-06
FORMULA_NAME ShieldIIPs-PT-003A-07
FORMULA_NAME ShieldIIPs-PT-003A-08
FORMULA_NAME ShieldIIPs-PT-003A-09
FORMULA_NAME ShieldIIPs-PT-003A-10
FORMULA_NAME ShieldIIPs-PT-003A-11
FORMULA_NAME ShieldIIPs-PT-003A-12
FORMULA_NAME ShieldIIPs-PT-003A-13
FORMULA_NAME ShieldIIPs-PT-003A-14
FORMULA_NAME ShieldIIPs-PT-003A-15

=== Now, execution of the tool begins

BK_START 1591284242119

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 15:24:03] [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 15:24:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 15:24:04] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2020-06-04 15:24:04] [INFO ] Transformed 78 places.
[2020-06-04 15:24:04] [INFO ] Transformed 75 transitions.
[2020-06-04 15:24:04] [INFO ] Found NUPN structural information;
[2020-06-04 15:24:04] [INFO ] Parsed PT model containing 78 places and 75 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 1008 steps, including 5 resets, run visited all 44 properties in 15 ms. (steps per millisecond=67 )
[2020-06-04 15:24:04] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-04 15:24:04] [INFO ] Flatten gal took : 44 ms
FORMULA ShieldIIPs-PT-003A-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003A-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003A-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 15:24:04] [INFO ] Applying decomposition
[2020-06-04 15:24:04] [INFO ] Flatten gal took : 10 ms
[2020-06-04 15:24:04] [INFO ] Decomposing Gal with order
[2020-06-04 15:24:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 15:24:04] [INFO ] Removed a total of 51 redundant transitions.
[2020-06-04 15:24:04] [INFO ] Flatten gal took : 38 ms
[2020-06-04 15:24:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 5 ms.
[2020-06-04 15:24:04] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-04 15:24:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldIIPs-PT-003A @ 3570 seconds

FORMULA ShieldIIPs-PT-003A-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2327
rslt: Output for LTLFireability @ ShieldIIPs-PT-003A

{
"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 15:24:04 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G (((1 <= p72))))",
"processed_size": 20,
"rewrites": 101
},
"result":
{
"edges": 120,
"markings": 119,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F (((1 <= p22))))",
"processed_size": 20,
"rewrites": 101
},
"result":
{
"edges": 3076629,
"markings": 928589,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p65))) R X (F ((G (((1 <= p5) AND (1 <= p18))) AND X (((1 <= p13) AND (1 <= p21) AND (1 <= p25))))))))",
"processed_size": 116,
"rewrites": 101
},
"result":
{
"edges": 254,
"markings": 254,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 2,
"aneg": 3,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X (((F (((1 <= p36) AND (1 <= p40) AND (1 <= p52))) AND ((1 <= p72))) OR X ((((p72 <= 0)) R ((1 <= p61) AND (1 <= p67) AND (1 <= p76))))))",
"processed_size": 138,
"rewrites": 101
},
"result":
{
"edges": 254,
"markings": 254,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 404
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X (((1 <= p53) AND (1 <= p74))) OR (F (G (((p21 <= 0)))) AND G ((X (((1 <= p21))) OR G (((p21 <= 0))))))))",
"processed_size": 110,
"rewrites": 101
},
"result":
{
"edges": 724,
"markings": 658,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 462
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 462
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(F (((1 <= p11) AND (1 <= p15) AND (1 <= p27))) U ((1 <= p8) AND (1 <= p23)))",
"processed_size": 77,
"rewrites": 101
},
"result":
{
"edges": 325,
"markings": 325,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 539
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p11) AND (1 <= p15) AND (1 <= p27))) OR X (((1 <= p11) AND (1 <= p17) AND (1 <= p27)))))",
"processed_size": 102,
"rewrites": 101
},
"result":
{
"edges": 254,
"markings": 254,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 539
},
"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": "((p39 <= 0) OR (p60 <= 0))",
"processed_size": 27,
"rewrites": 103
},
"result":
{
"edges": 190872518,
"markings": 105820458,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 604
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p1 <= 0) OR (p20 <= 0)) R ((1 <= p56) AND (1 <= p66)))",
"processed_size": 58,
"rewrites": 101
},
"result":
{
"edges": 164,
"markings": 164,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 755
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((((p1 <= 0) OR (p20 <= 0)) R ((1 <= p56) AND (1 <= p66))))",
"processed_size": 62,
"rewrites": 101
},
"result":
{
"edges": 199,
"markings": 199,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1007
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((p38 <= 0) OR (p46 <= 0) OR (p50 <= 0)))",
"processed_size": 46,
"rewrites": 101
},
"result":
{
"edges": 202,
"markings": 202,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1511
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p15)) OR ((1 <= p63) AND (1 <= p71) AND (1 <= p75)))))",
"processed_size": 69,
"rewrites": 101
},
"result":
{
"edges": 1549810,
"markings": 463929,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3021
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F ((G (((p61 <= 0) OR (p65 <= 0) OR (p77 <= 0) OR (p51 <= 0) OR ((1 <= p4) AND (1 <= p19)))) AND F ((((p30 <= 0) OR (p43 <= 0)) AND ((p51 <= 0))))))",
"processed_size": 153,
"rewrites": 101
},
"result":
{
"edges": 129675427,
"markings": 19086842,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((1 <= p25)))",
"processed_size": 16,
"rewrites": 101
},
"result":
{
"edges": 164,
"markings": 164,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3692,
"runtime": 1242.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(G(**)) OR X(F(**))) : F((G(**) AND F(**))) : X((G(*) R X(F((G(**) AND X(**)))))) : (X(G((F(**) OR (G(F(**)) AND F(**))))) OR (G(*) AND F(G((F(**) OR (G(F(**)) AND F(**))))))) : X(((F(**) AND *) OR X((* R *)))) : G((X(F(**)) OR F(G(**)))) : G((X(**) OR (F(G(*)) AND G((X(**) OR G(*)))))) : ((F(**) U **) OR X((F(**) OR X(**)))) : (X((G(**) AND (** AND (** AND **)))) OR F(**)) : G(F(**)) : ((* R *) OR (G((X(**) OR **)) AND F((* R *)))) : X(F((F(**) OR (** OR **)))) : ((X(**) R *) AND G(*))"
},
"net":
{
"arcs": 330,
"conflict_clusters": 24,
"places": 78,
"places_significant": 50,
"singleton_clusters": 0,
"transitions": 75
},
"result":
{
"preliminary_value": "yes no no unknown no no no no yes no no yes no ",
"value": "yes no no unknown no no no no yes no no yes 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: 153/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2496
lola: finding significant places
lola: 78 places, 75 transitions, 50 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: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 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: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: (F (G (((1 <= p72)))) OR X (F (((1 <= p22))))) : F ((G (((p61 <= 0) OR (p65 <= 0) OR (p77 <= 0) OR (p51 <= 0) OR ((1 <= p4) AND (1 <= p19)))) AND F ((((p30 <= 0) OR (p43 <= 0)) AND ((p51 <= 0)))))) : NOT(X ((F (((p65 <= 0))) U NOT(F ((G (X (((1 <= p5) AND (1 <= p18)))) AND X (X (((1 <= p13) AND (1 <= p21) AND (1 <= p25)))))))))) : (NOT(F (((p25 <= 0)))) U X (G ((G (X (F (((1 <= p25))))) U F (((p57 <= 0) OR (p59 <= 0))))))) : NOT(X (((NOT((((1 <= p61) AND (1 <= p67) AND (1 <= p76)) U F (((1 <= p36) AND (1 <= p40) AND (1 <= p52))))) OR ((p72 <= 0))) AND X ((((1 <= p72)) U ((p61 <= 0) OR (p67 <= 0) OR (p76 <= 0))))))) : G ((F (X ((((1 <= p11) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p56) AND (1 <= p66))))) OR G (F (G (((1 <= p63) AND (1 <= p73) AND (1 <= p77))))))) : G ((X (((1 <= p53) AND (1 <= p74))) OR G ((X (((1 <= p21))) U NOT(F (((1 <= p21)))))))) : ((F (((1 <= p11) AND (1 <= p15) AND (1 <= p27))) U ((1 <= p8) AND (1 <= p23))) OR NOT(X ((NOT(F (((1 <= p11) AND (1 <= p15) AND (1 <= p27)))) AND NOT(X (((1 <= p11) AND (1 <= p17) AND (1 <= p27)))))))) : (X ((((G (((1 <= p36) AND (1 <= p40) AND (1 <= p52))) AND ((1 <= p30))) AND ((1 <= p43))) AND ((1 <= p71)))) OR (((p39 <= 0) OR (p60 <= 0)) U F (((1 <= p39) AND (1 <= p60))))) : F (NOT(F (NOT(F (X (X (NOT(X (G (NOT(F ((((1 <= p15)) OR ((1 <= p63) AND (1 <= p71) AND (1 <= p75))))))))))))))) : (G ((X (((1 <= p1) AND (1 <= p20))) OR ((1 <= p56) AND (1 <= p66)))) U NOT((((1 <= p1) AND (1 <= p20)) U ((p56 <= 0) OR (p66 <= 0))))) : X (F (((F (((1 <= p61) AND (1 <= p67) AND (1 <= p76))) OR ((p8 <= 0))) OR ((p23 <= 0))))) : (NOT((NOT(X (((1 <= p37) AND (1 <= p70)))) U ((1 <= p36) AND (1 <= p40) AND (1 <= p51) AND (1 <= p37) AND (1 <= p70)))) AND NOT(F (((1 <= p38) AND (1 <= p46) AND (1 <= p50)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:300
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:347
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p72)))) OR X (F (((1 <= p22)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p72))))
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 <= p72))))
lola: processed formula length: 20
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: 119 markings, 120 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p22))))
lola: processed formula length: 20
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: 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: 928589 markings, 3076629 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p65))) R X (F ((G (((1 <= p5) AND (1 <= p18))) AND X (((1 <= p13) AND (1 <= p21) AND (1 <= p25))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p65))) R X (F ((G (((1 <= p5) AND (1 <= p18))) AND X (((1 <= p13) AND (1 <= p21) AND (1 <= p25))))))))
lola: processed formula length: 116
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 254 markings, 254 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((F (((p57 <= 0) OR (p59 <= 0))) OR (G (F (((1 <= p25)))) AND F (((p57 <= 0) OR (p59 <= 0))))))) OR (G (((1 <= p25))) AND F (G ((F (((p57 <= 0) OR (p59 <= 0))) OR (G (F (((1 <= p25)))) AND F (((p57 <= 0) OR (p59 <= 0)))))))))
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 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p25)))
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: 164 markings, 164 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (((p57 <= 0) OR (p59 <= 0))) OR (G (F (((1 <= p25)))) AND F (((p57 <= 0) OR (p59 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (((p57 <= 0) OR (p59 <= 0))) OR (G (F (((1 <= p25)))) AND F (((p57 <= 0) OR (p59 <= 0)))))))
lola: processed formula length: 103
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: 1763211 markings, 5321324 edges, 352642 markings/sec, 0 secs
lola: 3358462 markings, 10473121 edges, 319050 markings/sec, 5 secs
lola: 4893014 markings, 15734202 edges, 306910 markings/sec, 10 secs
lola: 6393744 markings, 20750398 edges, 300146 markings/sec, 15 secs
lola: 7665633 markings, 25079163 edges, 254378 markings/sec, 20 secs
lola: 9152815 markings, 30078488 edges, 297436 markings/sec, 25 secs
lola: 10511030 markings, 34871363 edges, 271643 markings/sec, 30 secs
lola: 12032079 markings, 40029001 edges, 304210 markings/sec, 35 secs
lola: 13500851 markings, 44935268 edges, 293754 markings/sec, 40 secs
lola: 14797381 markings, 49465306 edges, 259306 markings/sec, 45 secs
lola: 16180420 markings, 54282753 edges, 276608 markings/sec, 50 secs
lola: 17696156 markings, 59369118 edges, 303147 markings/sec, 55 secs
lola: 19039819 markings, 64262836 edges, 268733 markings/sec, 60 secs
lola: 20353629 markings, 69137811 edges, 262762 markings/sec, 65 secs
lola: 21566927 markings, 73558930 edges, 242660 markings/sec, 70 secs
lola: 22704538 markings, 77730205 edges, 227522 markings/sec, 75 secs
lola: 24074919 markings, 82396727 edges, 274076 markings/sec, 80 secs
lola: 25381684 markings, 87047967 edges, 261353 markings/sec, 85 secs
lola: 26624382 markings, 91461957 edges, 248540 markings/sec, 90 secs
lola: 27990300 markings, 96436843 edges, 273184 markings/sec, 95 secs
lola: 29181521 markings, 100872380 edges, 238244 markings/sec, 100 secs
lola: 30449738 markings, 105164132 edges, 253643 markings/sec, 105 secs
lola: 31753154 markings, 109680495 edges, 260683 markings/sec, 110 secs
lola: 33299957 markings, 115058353 edges, 309361 markings/sec, 115 secs
lola: 34745694 markings, 120334391 edges, 289147 markings/sec, 120 secs
lola: 36101867 markings, 125363352 edges, 271235 markings/sec, 125 secs
lola: 37373280 markings, 130078268 edges, 254283 markings/sec, 130 secs
lola: 38697702 markings, 134783885 edges, 264884 markings/sec, 135 secs
lola: 40023558 markings, 139802379 edges, 265171 markings/sec, 140 secs
lola: 41307213 markings, 144724202 edges, 256731 markings/sec, 145 secs
lola: 42581433 markings, 149595486 edges, 254844 markings/sec, 150 secs
lola: 43893309 markings, 154316839 edges, 262375 markings/sec, 155 secs
lola: 45275208 markings, 159037691 edges, 276380 markings/sec, 160 secs
lola: 46753830 markings, 164178635 edges, 295724 markings/sec, 165 secs
lola: 48240993 markings, 169448250 edges, 297433 markings/sec, 170 secs
lola: 49528032 markings, 173827215 edges, 257408 markings/sec, 175 secs
lola: 50855169 markings, 178568425 edges, 265427 markings/sec, 180 secs
lola: 52347638 markings, 183825324 edges, 298494 markings/sec, 185 secs
lola: 53772994 markings, 189011586 edges, 285071 markings/sec, 190 secs
lola: 55120316 markings, 193977907 edges, 269464 markings/sec, 195 secs
lola: 56382371 markings, 198598378 edges, 252411 markings/sec, 200 secs
lola: 57722309 markings, 203325567 edges, 267988 markings/sec, 205 secs
lola: 58972485 markings, 207941451 edges, 250035 markings/sec, 210 secs
lola: 60185336 markings, 212538575 edges, 242570 markings/sec, 215 secs
lola: 61313425 markings, 216897483 edges, 225618 markings/sec, 220 secs
lola: 62575819 markings, 221754187 edges, 252479 markings/sec, 225 secs
lola: 63864882 markings, 226775976 edges, 257813 markings/sec, 230 secs
lola: 65147668 markings, 231794130 edges, 256557 markings/sec, 235 secs
lola: 66269568 markings, 235949831 edges, 224380 markings/sec, 240 secs
lola: 67342761 markings, 240026448 edges, 214639 markings/sec, 245 secs
lola: 68379900 markings, 244177809 edges, 207428 markings/sec, 250 secs
lola: 69467817 markings, 248478801 edges, 217583 markings/sec, 255 secs
lola: 70465872 markings, 252564203 edges, 199611 markings/sec, 260 secs
lola: 71738725 markings, 257545788 edges, 254571 markings/sec, 265 secs
lola: 73016651 markings, 262513391 edges, 255585 markings/sec, 270 secs
lola: 74270704 markings, 267530444 edges, 250811 markings/sec, 275 secs
lola: 75354134 markings, 272035152 edges, 216686 markings/sec, 280 secs
lola: 76478099 markings, 276532322 edges, 224793 markings/sec, 285 secs
lola: 77546454 markings, 280740843 edges, 213671 markings/sec, 290 secs
lola: 78714570 markings, 285438021 edges, 233623 markings/sec, 295 secs
lola: 79873664 markings, 290237875 edges, 231819 markings/sec, 300 secs
lola: 80965331 markings, 294713088 edges, 218333 markings/sec, 305 secs
lola: 82035165 markings, 299234728 edges, 213967 markings/sec, 310 secs
lola: 83428464 markings, 304211681 edges, 278660 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 12014768 KB
lola: time consumption: 330 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 12014768 KB
lola: time consumption: 330 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((F (((1 <= p36) AND (1 <= p40) AND (1 <= p52))) AND ((1 <= p72))) OR X ((((p72 <= 0)) R ((1 <= p61) AND (1 <= p67) AND (1 <= p76))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((F (((1 <= p36) AND (1 <= p40) AND (1 <= p52))) AND ((1 <= p72))) OR X ((((p72 <= 0)) R ((1 <= p61) AND (1 <= p67) AND (1 <= p76))))))
lola: processed formula length: 138
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: 254 markings, 254 edges
lola: ========================================
lola: subprocess 4 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F ((((1 <= p11) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p56) AND (1 <= p66))))) OR F (G (((1 <= p63) AND (1 <= p73) AND (1 <= p77))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F ((((1 <= p11) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p56) AND (1 <= p66))))) OR F (G (((1 <= p63) AND (1 <= p73) AND (1 <= p77))))))
lola: processed formula length: 144
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: 246 markings, 246 edges
lola: ========================================
lola: subprocess 5 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((1 <= p53) AND (1 <= p74))) OR (F (G (((p21 <= 0)))) AND G ((X (((1 <= p21))) OR G (((p21 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((1 <= p53) AND (1 <= p74))) OR (F (G (((p21 <= 0)))) AND G ((X (((1 <= p21))) OR G (((p21 <= 0))))))))
lola: processed formula length: 110
lola: 101 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 658 markings, 724 edges
lola: ========================================
lola: subprocess 6 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p11) AND (1 <= p15) AND (1 <= p27))) U ((1 <= p8) AND (1 <= p23))) OR X ((F (((1 <= p11) AND (1 <= p15) AND (1 <= p27))) OR X (((1 <= p11) AND (1 <= p17) AND (1 <= p27))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p11) AND (1 <= p15) AND (1 <= p27))) U ((1 <= p8) AND (1 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p11) AND (1 <= p15) AND (1 <= p27))) U ((1 <= p8) AND (1 <= p23)))
lola: processed formula length: 77
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: 325 markings, 325 edges
lola: ========================================
lola: subprocess 7 will run for 539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p11) AND (1 <= p15) AND (1 <= p27))) OR X (((1 <= p11) AND (1 <= p17) AND (1 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p11) AND (1 <= p15) AND (1 <= p27))) OR X (((1 <= p11) AND (1 <= p17) AND (1 <= p27)))))
lola: processed formula length: 102
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: 254 markings, 254 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G (((1 <= p36) AND (1 <= p40) AND (1 <= p52))) AND (((1 <= p30)) AND (((1 <= p43)) AND ((1 <= p71)))))) OR F (((1 <= p39) AND (1 <= p60))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p39) AND (1 <= p60)))
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: ((p39 <= 0) OR (p60 <= 0))
lola: processed formula length: 27
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: 2868719 markings, 5216212 edges, 573744 markings/sec, 0 secs
lola: 5463483 markings, 9995195 edges, 518953 markings/sec, 5 secs
lola: 7672248 markings, 14007582 edges, 441753 markings/sec, 10 secs
lola: 10059673 markings, 18271973 edges, 477485 markings/sec, 15 secs
lola: 12428705 markings, 22821950 edges, 473806 markings/sec, 20 secs
lola: 14970829 markings, 27738984 edges, 508425 markings/sec, 25 secs
lola: 17479450 markings, 32566314 edges, 501724 markings/sec, 30 secs
lola: 20030923 markings, 37164776 edges, 510295 markings/sec, 35 secs
lola: 22539730 markings, 41518488 edges, 501761 markings/sec, 40 secs
lola: 25185256 markings, 46431444 edges, 529105 markings/sec, 45 secs
lola: 27987925 markings, 51531829 edges, 560534 markings/sec, 50 secs
lola: 30605187 markings, 56417377 edges, 523452 markings/sec, 55 secs
lola: 33094761 markings, 61211048 edges, 497915 markings/sec, 60 secs
lola: 35811869 markings, 65920653 edges, 543422 markings/sec, 65 secs
lola: 38502290 markings, 70614623 edges, 538084 markings/sec, 70 secs
lola: 41181765 markings, 75242146 edges, 535895 markings/sec, 75 secs
lola: 43928497 markings, 80049217 edges, 549346 markings/sec, 80 secs
lola: 46206624 markings, 84248811 edges, 455625 markings/sec, 85 secs
lola: 48284039 markings, 88091024 edges, 415483 markings/sec, 90 secs
lola: 50320759 markings, 91878134 edges, 407344 markings/sec, 95 secs
lola: 52885002 markings, 96491738 edges, 512849 markings/sec, 100 secs
lola: 55251660 markings, 100805857 edges, 473332 markings/sec, 105 secs
lola: 57627165 markings, 105253195 edges, 475101 markings/sec, 110 secs
lola: 60224199 markings, 109909771 edges, 519407 markings/sec, 115 secs
lola: 62784062 markings, 114507812 edges, 511973 markings/sec, 120 secs
lola: 65049003 markings, 118863277 edges, 452988 markings/sec, 125 secs
lola: 67640598 markings, 123606570 edges, 518319 markings/sec, 130 secs
lola: 70097689 markings, 128030647 edges, 491418 markings/sec, 135 secs
lola: 72623923 markings, 132372815 edges, 505247 markings/sec, 140 secs
lola: 75058333 markings, 136609675 edges, 486882 markings/sec, 145 secs
lola: 77596667 markings, 141134490 edges, 507667 markings/sec, 150 secs
lola: 79493672 markings, 144537654 edges, 379401 markings/sec, 155 secs
lola: 81796646 markings, 148421302 edges, 460595 markings/sec, 160 secs
lola: 84225293 markings, 152743236 edges, 485729 markings/sec, 165 secs
lola: 86709382 markings, 157276465 edges, 496818 markings/sec, 170 secs
lola: 88875065 markings, 161073927 edges, 433137 markings/sec, 175 secs
lola: 90917745 markings, 165114991 edges, 408536 markings/sec, 180 secs
lola: 93246716 markings, 169240825 edges, 465794 markings/sec, 185 secs
lola: 95700719 markings, 173367864 edges, 490801 markings/sec, 190 secs
lola: 98283280 markings, 177912910 edges, 516512 markings/sec, 195 secs
lola: 100721181 markings, 182161241 edges, 487580 markings/sec, 200 secs
lola: 102919738 markings, 185921046 edges, 439711 markings/sec, 205 secs
lola: 105306071 markings, 189977132 edges, 477267 markings/sec, 210 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 105820458 markings, 190872518 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p1 <= 0) OR (p20 <= 0)) R ((1 <= p56) AND (1 <= p66))) OR (G ((X (((1 <= p1) AND (1 <= p20))) OR ((1 <= p56) AND (1 <= p66)))) AND F ((((p1 <= 0) OR (p20 <= 0)) R ((1 <= p56) AND (1 <= p66))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p1 <= 0) OR (p20 <= 0)) R ((1 <= p56) AND (1 <= p66)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p1 <= 0) OR (p20 <= 0)) R ((1 <= p56) AND (1 <= p66)))
lola: processed formula length: 58
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: 164 markings, 164 edges
lola: ========================================
lola: subprocess 9 will run for 755 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p1 <= 0) OR (p20 <= 0)) R ((1 <= p56) AND (1 <= p66))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((p1 <= 0) OR (p20 <= 0)) R ((1 <= p56) AND (1 <= p66))))
lola: processed formula length: 62
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: 199 markings, 199 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 755 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (((1 <= p61) AND (1 <= p67) AND (1 <= p76))) OR (((p8 <= 0)) OR ((p23 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (((1 <= p61) AND (1 <= p67) AND (1 <= p76))) OR (((p8 <= 0)) OR ((p23 <= 0))))))
lola: processed formula length: 89
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: 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: subprocess 10 will run for 1007 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((1 <= p37) AND (1 <= p70))) R ((p36 <= 0) OR (p40 <= 0) OR (p51 <= 0) OR (p37 <= 0) OR (p70 <= 0))) AND G (((p38 <= 0) OR (p46 <= 0) OR (p50 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1007 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p38 <= 0) OR (p46 <= 0) OR (p50 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p38 <= 0) OR (p46 <= 0) OR (p50 <= 0)))
lola: processed formula length: 46
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: 202 markings, 202 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 1511 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p15)) OR ((1 <= p63) AND (1 <= p71) AND (1 <= p75)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p15)) OR ((1 <= p63) AND (1 <= p71) AND (1 <= p75)))))
lola: processed formula length: 69
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: 463929 markings, 1549810 edges
lola: ========================================
lola: subprocess 12 will run for 3021 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p61 <= 0) OR (p65 <= 0) OR (p77 <= 0) OR (p51 <= 0) OR ((1 <= p4) AND (1 <= p19)))) AND F ((((p30 <= 0) OR (p43 <= 0)) AND ((p51 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p61 <= 0) OR (p65 <= 0) OR (p77 <= 0) OR (p51 <= 0) OR ((1 <= p4) AND (1 <= p19)))) AND F ((((p30 <= 0) OR (p43 <= 0)) AND ((p51 <= 0))))))
lola: processed formula length: 153
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: 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: 1001763 markings, 5749426 edges, 200353 markings/sec, 0 secs
lola: 1943381 markings, 11511870 edges, 188324 markings/sec, 5 secs
lola: 2920769 markings, 17404949 edges, 195478 markings/sec, 10 secs
lola: 3813269 markings, 23481791 edges, 178500 markings/sec, 15 secs
lola: 4647982 markings, 28798906 edges, 166943 markings/sec, 20 secs
lola: 5446588 markings, 34371680 edges, 159721 markings/sec, 25 secs
lola: 6273011 markings, 39981063 edges, 165285 markings/sec, 30 secs
lola: 7049163 markings, 45285915 edges, 155230 markings/sec, 35 secs
lola: 7946569 markings, 50848052 edges, 179481 markings/sec, 40 secs
lola: 8815098 markings, 56516736 edges, 173706 markings/sec, 45 secs
lola: 9675572 markings, 62534633 edges, 172095 markings/sec, 50 secs
lola: 10500526 markings, 68453372 edges, 164991 markings/sec, 55 secs
lola: 11415047 markings, 74285601 edges, 182904 markings/sec, 60 secs
lola: 12190999 markings, 79499060 edges, 155190 markings/sec, 65 secs
lola: 12957219 markings, 84793401 edges, 153244 markings/sec, 70 secs
lola: 13712202 markings, 90333643 edges, 150997 markings/sec, 75 secs
lola: 14400208 markings, 95688102 edges, 137601 markings/sec, 80 secs
lola: 15112687 markings, 101032740 edges, 142496 markings/sec, 85 secs
lola: 15780119 markings, 106299789 edges, 133486 markings/sec, 90 secs
lola: 16617752 markings, 111853705 edges, 167527 markings/sec, 95 secs
lola: 17378244 markings, 117629874 edges, 152098 markings/sec, 100 secs
lola: 18193442 markings, 123660241 edges, 163040 markings/sec, 105 secs
lola: 19046318 markings, 129431133 edges, 170575 markings/sec, 110 secs
lola: add low 15
lola: add low 23
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: 19086842 markings, 129675427 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (G ((F (((p57 <= 0) OR (p59 <= 0))) OR (G (F (((1 <= p25)))) AND F (((p57 <= 0) OR (p59 <= 0))))))) OR (G (((1 <= p25))) AND F (G ((F (((p57 <= 0) OR (p59 <= 0))) OR (G (F (((1 <= p25)))) AND F (((p57 <= 0) OR (p59 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (((1 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p25)))
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: 164 markings, 164 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((F (((p57 <= 0) OR (p59 <= 0))) OR (G (F (((1 <= p25)))) AND F (((p57 <= 0) OR (p59 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (((p57 <= 0) OR (p59 <= 0))) OR (G (F (((1 <= p25)))) AND F (((p57 <= 0) OR (p59 <= 0)))))))
lola: processed formula length: 103
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: 2046180 markings, 6225326 edges, 409236 markings/sec, 0 secs
lola: 3901760 markings, 12279430 edges, 371116 markings/sec, 5 secs
lola: 5579353 markings, 18123296 edges, 335519 markings/sec, 10 secs
lola: 7162117 markings, 23367426 edges, 316553 markings/sec, 15 secs
lola: 8754979 markings, 28746055 edges, 318572 markings/sec, 20 secs
lola: 10395949 markings, 34477316 edges, 328194 markings/sec, 25 secs
lola: 11970030 markings, 39803832 edges, 314816 markings/sec, 30 secs
lola: 13528885 markings, 45019129 edges, 311771 markings/sec, 35 secs
lola: 14938127 markings, 49975397 edges, 281848 markings/sec, 40 secs
lola: 16498772 markings, 55283312 edges, 312129 markings/sec, 45 secs
lola: 18115477 markings, 60970720 edges, 323341 markings/sec, 50 secs
lola: 19619636 markings, 66434367 edges, 300832 markings/sec, 55 secs
lola: 20966304 markings, 71337854 edges, 269334 markings/sec, 60 secs
lola: 22262948 markings, 76222050 edges, 259329 markings/sec, 65 secs
lola: 23742116 markings, 81175094 edges, 295834 markings/sec, 70 secs
lola: 25155937 markings, 86208119 edges, 282764 markings/sec, 75 secs
lola: 26484193 markings, 90988372 edges, 265651 markings/sec, 80 secs
lola: 27953320 markings, 96296994 edges, 293825 markings/sec, 85 secs
lola: 29290385 markings, 101301393 edges, 267413 markings/sec, 90 secs
lola: 30723913 markings, 106136036 edges, 286706 markings/sec, 95 secs
lola: 32131085 markings, 111067494 edges, 281434 markings/sec, 100 secs
lola: 33688098 markings, 116579614 edges, 311403 markings/sec, 105 secs
lola: 35167859 markings, 121934753 edges, 295952 markings/sec, 110 secs
lola: 36496816 markings, 126771298 edges, 265791 markings/sec, 115 secs
lola: 37777921 markings, 131598903 edges, 256221 markings/sec, 120 secs
lola: 39125360 markings, 136391398 edges, 269488 markings/sec, 125 secs
lola: 40387076 markings, 141194674 edges, 252343 markings/sec, 130 secs
lola: 41729352 markings, 146404808 edges, 268455 markings/sec, 135 secs
lola: 42994333 markings, 151145166 edges, 252996 markings/sec, 140 secs
lola: 44376972 markings, 155920081 edges, 276528 markings/sec, 145 secs
lola: 45768012 markings, 160756606 edges, 278208 markings/sec, 150 secs
lola: 47298803 markings, 166114548 edges, 306158 markings/sec, 155 secs
lola: 48720134 markings, 171070708 edges, 284266 markings/sec, 160 secs
lola: 50016645 markings, 175607301 edges, 259302 markings/sec, 165 secs
lola: 51440187 markings, 180656440 edges, 284708 markings/sec, 170 secs
lola: 52976231 markings, 186039287 edges, 307209 markings/sec, 175 secs
lola: 54351852 markings, 191195834 edges, 275124 markings/sec, 180 secs
lola: 55750841 markings, 196284712 edges, 279798 markings/sec, 185 secs
lola: 57173497 markings, 201415552 edges, 284531 markings/sec, 190 secs
lola: 58566663 markings, 206407290 edges, 278633 markings/sec, 195 secs
lola: 59859479 markings, 211244826 edges, 258563 markings/sec, 200 secs
lola: 61039766 markings, 215878289 edges, 236057 markings/sec, 205 secs
lola: 62311827 markings, 220746268 edges, 254412 markings/sec, 210 secs
lola: 63617608 markings, 225779040 edges, 261156 markings/sec, 215 secs
lola: 64901496 markings, 230924887 edges, 256778 markings/sec, 220 secs
lola: 66142373 markings, 235471744 edges, 248175 markings/sec, 225 secs
lola: 67289957 markings, 239810173 edges, 229517 markings/sec, 230 secs
lola: 68407446 markings, 244286234 edges, 223498 markings/sec, 235 secs
lola: 69551062 markings, 248830416 edges, 228723 markings/sec, 240 secs
lola: 70643877 markings, 253234579 edges, 218563 markings/sec, 245 secs
lola: 71919884 markings, 258237634 edges, 255201 markings/sec, 250 secs
lola: 73252776 markings, 263434315 edges, 266578 markings/sec, 255 secs
lola: 74524274 markings, 268546361 edges, 254300 markings/sec, 260 secs
lola: 75739781 markings, 273637877 edges, 243101 markings/sec, 265 secs
lola: 76862991 markings, 277999858 edges, 224642 markings/sec, 270 secs
lola: 77935203 markings, 282300411 edges, 214442 markings/sec, 275 secs
lola: 79148349 markings, 287158890 edges, 242629 markings/sec, 280 secs
lola: 80264184 markings, 291823980 edges, 223167 markings/sec, 285 secs
lola: 81392086 markings, 296488797 edges, 225580 markings/sec, 290 secs
lola: 82581977 markings, 301179147 edges, 237978 markings/sec, 295 secs
lola: 83933511 markings, 306028076 edges, 270307 markings/sec, 300 secs
lola: 85202086 markings, 310735652 edges, 253715 markings/sec, 305 secs
lola: 86345054 markings, 315258948 edges, 228594 markings/sec, 310 secs
lola: 87713224 markings, 320486815 edges, 273634 markings/sec, 315 secs
lola: 89108857 markings, 325871684 edges, 279127 markings/sec, 320 secs
lola: 90441135 markings, 331158482 edges, 266456 markings/sec, 325 secs
lola: 91642294 markings, 335580271 edges, 240232 markings/sec, 330 secs
lola: 92726053 markings, 339692438 edges, 216752 markings/sec, 335 secs
lola: 93805656 markings, 344012773 edges, 215921 markings/sec, 340 secs
lola: 94922944 markings, 348442163 edges, 223458 markings/sec, 345 secs
lola: 95949165 markings, 352622591 edges, 205244 markings/sec, 350 secs
lola: 97189174 markings, 357473886 edges, 248002 markings/sec, 355 secs
lola: 98495024 markings, 362542707 edges, 261170 markings/sec, 360 secs
lola: 99758540 markings, 367615704 edges, 252703 markings/sec, 365 secs
lola: 100914117 markings, 372443263 edges, 231115 markings/sec, 370 secs
lola: 102040181 markings, 376855246 edges, 225213 markings/sec, 375 secs
lola: 103032241 markings, 380834573 edges, 198412 markings/sec, 380 secs
lola: 104189503 markings, 385467530 edges, 231452 markings/sec, 385 secs
lola: 105342468 markings, 390258718 edges, 230593 markings/sec, 390 secs
lola: 106436442 markings, 394737395 edges, 218795 markings/sec, 395 secs
lola: 107490187 markings, 399190193 edges, 210749 markings/sec, 400 secs
lola: 108770474 markings, 404066661 edges, 256057 markings/sec, 405 secs
lola: 109889057 markings, 408707817 edges, 223717 markings/sec, 410 secs
lola: 111053856 markings, 413607773 edges, 232960 markings/sec, 415 secs
lola: 112166721 markings, 418388381 edges, 222573 markings/sec, 420 secs
lola: 113188304 markings, 423011049 edges, 204317 markings/sec, 425 secs
lola: 114225309 markings, 426803364 edges, 207401 markings/sec, 430 secs
lola: 115362666 markings, 431090367 edges, 227471 markings/sec, 435 secs
lola: 116522212 markings, 435239803 edges, 231909 markings/sec, 440 secs
lola: 117554485 markings, 439051067 edges, 206455 markings/sec, 445 secs
lola: 118422543 markings, 442339098 edges, 173612 markings/sec, 450 secs
lola: 119221815 markings, 445431272 edges, 159854 markings/sec, 455 secs
lola: 120057731 markings, 448738608 edges, 167183 markings/sec, 460 secs
lola: 120967030 markings, 452614240 edges, 181860 markings/sec, 465 secs
lola: 121586063 markings, 455139052 edges, 123807 markings/sec, 470 secs
lola: 122598257 markings, 458822621 edges, 202439 markings/sec, 475 secs
lola: 123543507 markings, 462491727 edges, 189050 markings/sec, 480 secs
lola: 124589721 markings, 466454372 edges, 209243 markings/sec, 485 secs
lola: 125523687 markings, 469959015 edges, 186793 markings/sec, 490 secs
lola: 126412844 markings, 473412079 edges, 177831 markings/sec, 495 secs
lola: 127122760 markings, 476277880 edges, 141983 markings/sec, 500 secs
lola: 128061816 markings, 479891899 edges, 187811 markings/sec, 505 secs
lola: 129274208 markings, 484539568 edges, 242478 markings/sec, 510 secs
lola: 130388306 markings, 488663060 edges, 222820 markings/sec, 515 secs
lola: 131602976 markings, 493396517 edges, 242934 markings/sec, 520 secs
lola: 132621934 markings, 497316025 edges, 203792 markings/sec, 525 secs
lola: 133841401 markings, 502063423 edges, 243893 markings/sec, 530 secs
lola: 134619925 markings, 505215089 edges, 155705 markings/sec, 535 secs
lola: 135381286 markings, 508210007 edges, 152272 markings/sec, 540 secs
lola: 136082176 markings, 511180987 edges, 140178 markings/sec, 545 secs
lola: 136783783 markings, 514029382 edges, 140321 markings/sec, 550 secs
lola: 137407921 markings, 516631853 edges, 124828 markings/sec, 555 secs
lola: 138123703 markings, 519422531 edges, 143156 markings/sec, 560 secs
lola: 139001884 markings, 523026208 edges, 175636 markings/sec, 565 secs
lola: 139182941 markings, 523731900 edges, 36211 markings/sec, 570 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: yes no no unknown no no no no yes no no yes no
lola:
preliminary result: yes no no unknown no no no no yes no no yes no
lola: memory consumption: 3692 KB
lola: time consumption: 1242 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="ShieldIIPs-PT-003A"
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 ShieldIIPs-PT-003A, 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 r211-tajo-159033476900074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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