fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033476900082
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldIIPs-PT-003B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.290 3600000.00 709331.00 6016.30 FT?TFT?????F???? normal

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-159033476900082.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-003B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033476900082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.5K May 14 00:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 14 00:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 17:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 17:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.2K May 13 13:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 13:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 49K 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-003B-00
FORMULA_NAME ShieldIIPs-PT-003B-01
FORMULA_NAME ShieldIIPs-PT-003B-02
FORMULA_NAME ShieldIIPs-PT-003B-03
FORMULA_NAME ShieldIIPs-PT-003B-04
FORMULA_NAME ShieldIIPs-PT-003B-05
FORMULA_NAME ShieldIIPs-PT-003B-06
FORMULA_NAME ShieldIIPs-PT-003B-07
FORMULA_NAME ShieldIIPs-PT-003B-08
FORMULA_NAME ShieldIIPs-PT-003B-09
FORMULA_NAME ShieldIIPs-PT-003B-10
FORMULA_NAME ShieldIIPs-PT-003B-11
FORMULA_NAME ShieldIIPs-PT-003B-12
FORMULA_NAME ShieldIIPs-PT-003B-13
FORMULA_NAME ShieldIIPs-PT-003B-14
FORMULA_NAME ShieldIIPs-PT-003B-15

=== Now, execution of the tool begins

BK_START 1591284272718

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

FORMULA ShieldIIPs-PT-003B-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003B-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldIIPs-PT-003B-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for LTLFireability @ ShieldIIPs-PT-003B

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 3,
"X": 3,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"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": "(X (X (X (((((1 <= p114)) U ((p77 <= 0))) U ((1 <= p6)))))) U G (((p41 <= 0))))",
"processed_size": 79,
"rewrites": 73
},
"result":
{
"edges": 773,
"markings": 773,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 326
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"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": 6,
"visible_transitions": 0
},
"processed": "X ((G (((p39 <= 0) OR ((1 <= p88) AND (1 <= p107) AND (1 <= p121)))) OR F (((p17 <= 0) OR (p42 <= 0)))))",
"processed_size": 106,
"rewrites": 73
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"error": null,
"memory": 4070964,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((((** U **) OR (G(*) AND F(**))) U (F(**) AND X(**)))) : F((X(*) AND (X((G(*) OR X(*))) OR (** OR **)))) : (((** U **) AND **) U X(G((F(**) AND **)))) : (X(X(X(((** U **) U **)))) U G(*)) : X((G(*) OR F(*))) : (X(X(X(G(*)))) OR G(F(*))) : G((X(*) OR ((* R *) OR **))) : (X(G(*)) AND **) : F((X(**) AND **)) : X((F((F(**) AND *)) AND (F(*) OR **))) : (G(**) OR (** OR (F(**) AND F(G(*))))) : F(G((X(**) OR (X(F(**)) AND F(G(**)))))) : X((F(**) AND (* R X(G(*))))) : ((** U **) OR X(*))"
},
"net":
{
"arcs": 540,
"conflict_clusters": 129,
"places": 183,
"places_significant": 155,
"singleton_clusters": 0,
"transitions": 180
},
"result":
{
"interim_value": "no yes unknown no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "no yes unknown no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown "
},
"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: 363/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5856
lola: finding significant places
lola: 183 places, 180 transitions, 155 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: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p158 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p154 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p170 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p142 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p166 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p166 <= 1)
lola: (X ((NOT(F (((1 <= p17) AND (1 <= p42)))) U (((1 <= p138) AND (1 <= p155)) U ((1 <= p88) AND (1 <= p107) AND (1 <= p121))))) U X ((F (((1 <= p88) AND (1 <= p107) AND (1 <= p121))) AND X (((1 <= p88) AND (1 <= p107) AND (1 <= p121)))))) : F ((NOT(X (((1 <= p158)))) AND ((NOT(X ((F (((1 <= p88) AND (1 <= p107) AND (1 <= p121))) AND X (((1 <= p65)))))) OR ((p65 <= 0))) OR ((p158 <= 0))))) : (((((1 <= p129)) U ((1 <= p65))) AND ((1 <= p129))) U G (X ((F (((1 <= p88) AND (1 <= p110) AND (1 <= p121))) AND ((1 <= p170)))))) : (X (X (X (((((1 <= p114)) U ((p77 <= 0))) U ((1 <= p6)))))) U NOT(F (((1 <= p41))))) : NOT(X ((F (((1 <= p39) AND ((p88 <= 0) OR (p107 <= 0) OR (p121 <= 0)))) AND G (((1 <= p17) AND (1 <= p42)))))) : (NOT(X (X (X (F (((1 <= p146))))))) OR NOT(F (X (G (((1 <= p26) AND (1 <= p34) AND (1 <= p61))))))) : G (((NOT(X (((p41 <= 0) OR ((1 <= p154))))) OR NOT((((1 <= p154)) U ((1 <= p19))))) OR ((p154 <= 0)))) : (NOT(X (F (((1 <= p162))))) AND ((p111 <= 0) OR (p94 <= 0))) : F (((X (G (((1 <= p76) AND (1 <= p101)))) OR ((1 <= p151))) U (X (((1 <= p151))) AND ((1 <= p170))))) : X ((NOT(G ((NOT(F (((1 <= p15)))) OR ((p8 <= 0))))) AND (NOT(G (((1 <= p48)))) OR ((p66 <= 0))))) : (G (((1 <= p91) AND (1 <= p142))) OR (NOT(F (G (X (F (((p53 <= 0))))))) U ((1 <= p28)))) : F (X (G ((F (((((1 <= p113)) OR ((1 <= p85) AND (1 <= p93) AND (1 <= p120))) U G (((1 <= p145))))) U X (((1 <= p122))))))) : (X (F (((1 <= p122)))) AND NOT(X ((((1 <= p28)) U X (F (((1 <= p122) AND (1 <= p28)))))))) : ((((1 <= p166)) U ((1 <= p106))) OR NOT(X ((((1 <= p48)) OR ((1 <= p166))))))
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:410
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: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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:329
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:428
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((((1 <= p138) AND (1 <= p155)) U ((1 <= p88) AND (1 <= p107) AND (1 <= p121))) OR (G (((p17 <= 0) OR (p42 <= 0))) AND F (((1 <= p88) AND (1 <= p107) AND (1 <= p121))))) U (F (((1 <= p88) AND (1 <= p107) AND (1 <= p121))) AND X (((1 <= p88) AND (1 <= p107) AND (1 <= p121))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((((1 <= p138) AND (1 <= p155)) U ((1 <= p88) AND (1 <= p107) AND (1 <= p121))) OR (G (((p17 <= 0) OR (p42 <= 0))) AND F (((1 <= p88) AND (1 <= p107) AND (1 <= p121))))) U (F (((1 <= p88) AND (1 <= p107) AND (1 <= p121))) AND X (((1 <= p88) AND (1 <= p107) AND (1 <= p121))))))
lola: processed formula length: 282
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 22 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: 649 markings, 649 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((p158 <= 0))) AND (X ((G (((p88 <= 0) OR (p107 <= 0) OR (p121 <= 0))) OR X (((p65 <= 0))))) OR (((p65 <= 0)) OR ((p158 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((p158 <= 0))) AND (X ((G (((p88 <= 0) OR (p107 <= 0) OR (p121 <= 0))) OR X (((p65 <= 0))))) OR (((p65 <= 0)) OR ((p158 <= 0))))))
lola: processed formula length: 139
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((1 <= p129)) U ((1 <= p65))) AND ((1 <= p129))) U X (G ((F (((1 <= p88) AND (1 <= p110) AND (1 <= p121))) AND ((1 <= p170))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((((1 <= p129)) U ((1 <= p65))) AND ((1 <= p129))) U X (G ((F (((1 <= p88) AND (1 <= p110) AND (1 <= p121))) AND ((1 <= p170))))))
lola: processed formula length: 131
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 482060 markings, 2784606 edges, 96412 markings/sec, 0 secs
lola: 935453 markings, 5843292 edges, 90679 markings/sec, 5 secs
lola: 1363470 markings, 8910720 edges, 85603 markings/sec, 10 secs
lola: 1806628 markings, 12024488 edges, 88632 markings/sec, 15 secs
lola: 2239106 markings, 15099303 edges, 86496 markings/sec, 20 secs
lola: 2683228 markings, 18277834 edges, 88824 markings/sec, 25 secs
lola: 3108491 markings, 21246939 edges, 85053 markings/sec, 30 secs
lola: 3503966 markings, 24276074 edges, 79095 markings/sec, 35 secs
lola: 3873693 markings, 27339863 edges, 73945 markings/sec, 40 secs
lola: 4252329 markings, 30312009 edges, 75727 markings/sec, 45 secs
lola: 4593749 markings, 33204974 edges, 68284 markings/sec, 50 secs
lola: 5001082 markings, 36225751 edges, 81467 markings/sec, 55 secs
lola: 5378494 markings, 39254474 edges, 75482 markings/sec, 60 secs
lola: 5824838 markings, 42494715 edges, 89269 markings/sec, 65 secs
lola: 6220825 markings, 45527865 edges, 79197 markings/sec, 70 secs
lola: 6555495 markings, 48355070 edges, 66934 markings/sec, 75 secs
lola: 6947797 markings, 51274352 edges, 78460 markings/sec, 80 secs
lola: 7321036 markings, 54373904 edges, 74648 markings/sec, 85 secs
lola: 7736169 markings, 57712777 edges, 83027 markings/sec, 90 secs
lola: 8138413 markings, 61001045 edges, 80449 markings/sec, 95 secs
lola: 8550038 markings, 64179368 edges, 82325 markings/sec, 100 secs
lola: 9062196 markings, 67523296 edges, 102432 markings/sec, 105 secs
lola: 9493640 markings, 70854579 edges, 86289 markings/sec, 110 secs
lola: 9887409 markings, 74131468 edges, 78754 markings/sec, 115 secs
lola: 10312473 markings, 77337965 edges, 85013 markings/sec, 120 secs
lola: 10694459 markings, 80507322 edges, 76397 markings/sec, 125 secs
lola: 11089380 markings, 83694114 edges, 78984 markings/sec, 130 secs
lola: 11491153 markings, 86940877 edges, 80355 markings/sec, 135 secs
lola: 11860913 markings, 90014055 edges, 73952 markings/sec, 140 secs
lola: 12221963 markings, 93120871 edges, 72210 markings/sec, 145 secs
lola: 12566111 markings, 96374853 edges, 68830 markings/sec, 150 secs
lola: 12889158 markings, 99126971 edges, 64609 markings/sec, 155 secs
lola: 13219430 markings, 102245676 edges, 66054 markings/sec, 160 secs
lola: 13604481 markings, 105427341 edges, 77010 markings/sec, 165 secs
lola: 13890524 markings, 108289177 edges, 57209 markings/sec, 170 secs
lola: 14299854 markings, 111321468 edges, 81866 markings/sec, 175 secs
lola: 14655250 markings, 114352934 edges, 71079 markings/sec, 180 secs
lola: 15012930 markings, 117549478 edges, 71536 markings/sec, 185 secs
lola: 15336075 markings, 120488746 edges, 64629 markings/sec, 190 secs
lola: 15644858 markings, 123197445 edges, 61757 markings/sec, 195 secs
lola: 15982119 markings, 126298677 edges, 67452 markings/sec, 200 secs
lola: 16303607 markings, 129125823 edges, 64298 markings/sec, 205 secs
lola: 16605931 markings, 131998432 edges, 60465 markings/sec, 210 secs
lola: 16915418 markings, 134785052 edges, 61897 markings/sec, 215 secs
lola: 17238698 markings, 137473974 edges, 64656 markings/sec, 220 secs
lola: 17682361 markings, 140372414 edges, 88733 markings/sec, 225 secs
lola: 18043097 markings, 143132312 edges, 72147 markings/sec, 230 secs
lola: 18367140 markings, 145700558 edges, 64809 markings/sec, 235 secs
lola: 18716789 markings, 148559436 edges, 69930 markings/sec, 240 secs
lola: 19027838 markings, 151022852 edges, 62210 markings/sec, 245 secs
lola: 19322675 markings, 153417716 edges, 58967 markings/sec, 250 secs
lola: 19672648 markings, 156193581 edges, 69995 markings/sec, 255 secs
lola: 20015983 markings, 159011724 edges, 68667 markings/sec, 260 secs
lola: 20390701 markings, 162035273 edges, 74944 markings/sec, 265 secs
lola: 20732827 markings, 164961620 edges, 68425 markings/sec, 270 secs
lola: 21046077 markings, 167786943 edges, 62650 markings/sec, 275 secs
lola: 21347626 markings, 170496539 edges, 60310 markings/sec, 280 secs
lola: 21648827 markings, 173148870 edges, 60240 markings/sec, 285 secs
lola: 21941375 markings, 175827333 edges, 58510 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 3305604 KB
lola: time consumption: 300 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 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (((((1 <= p114)) U ((p77 <= 0))) U ((1 <= p6)))))) U G (((p41 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (X (((((1 <= p114)) U ((p77 <= 0))) U ((1 <= p6)))))) U G (((p41 <= 0))))
lola: processed formula length: 79
lola: 73 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: 773 markings, 773 edges
lola: ========================================
lola: subprocess 4 will run for 326 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((p39 <= 0) OR ((1 <= p88) AND (1 <= p107) AND (1 <= p121)))) OR F (((p17 <= 0) OR (p42 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p39 <= 0) OR ((1 <= p88) AND (1 <= p107) AND (1 <= p121)))) OR F (((p17 <= 0) OR (p42 <= 0)))))
lola: processed formula length: 106
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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 5 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (G (((p146 <= 0)))))) OR G (F (((p26 <= 0) OR (p34 <= 0) OR (p61 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p26 <= 0) OR (p34 <= 0) OR (p61 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p26 <= 0) OR (p34 <= 0) OR (p61 <= 0))))
lola: processed formula length: 50
lola: 73 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: 592876 markings, 3379091 edges, 118575 markings/sec, 0 secs
lola: 1048724 markings, 6735034 edges, 91170 markings/sec, 5 secs
lola: 1487821 markings, 10010378 edges, 87819 markings/sec, 10 secs
lola: 1948308 markings, 13459336 edges, 92097 markings/sec, 15 secs
lola: 2392181 markings, 16705857 edges, 88775 markings/sec, 20 secs
lola: 2923902 markings, 20342912 edges, 106344 markings/sec, 25 secs
lola: 3421622 markings, 23950802 edges, 99544 markings/sec, 30 secs
lola: 3885198 markings, 27547466 edges, 92715 markings/sec, 35 secs
lola: 4349911 markings, 31141062 edges, 92943 markings/sec, 40 secs
lola: 4893581 markings, 34621622 edges, 108734 markings/sec, 45 secs
lola: 5361232 markings, 38130550 edges, 93530 markings/sec, 50 secs
lola: 5781301 markings, 41345256 edges, 84014 markings/sec, 55 secs
lola: 6153835 markings, 44573980 edges, 74507 markings/sec, 60 secs
lola: 6523388 markings, 47723574 edges, 73911 markings/sec, 65 secs
lola: 6865286 markings, 50939114 edges, 68380 markings/sec, 70 secs
lola: 7251414 markings, 54167650 edges, 77226 markings/sec, 75 secs
lola: 7597111 markings, 56995318 edges, 69139 markings/sec, 80 secs
lola: 8006844 markings, 60450597 edges, 81947 markings/sec, 85 secs
lola: 8361196 markings, 63770196 edges, 70870 markings/sec, 90 secs
lola: 8702420 markings, 66886801 edges, 68245 markings/sec, 95 secs
lola: 9047471 markings, 70185054 edges, 69010 markings/sec, 100 secs
lola: 9401788 markings, 73658404 edges, 70863 markings/sec, 105 secs
lola: 9681048 markings, 76473465 edges, 55852 markings/sec, 110 secs
lola: 10064107 markings, 79962508 edges, 76612 markings/sec, 115 secs
lola: 10391824 markings, 83321820 edges, 65543 markings/sec, 120 secs
lola: 10761171 markings, 86643444 edges, 73869 markings/sec, 125 secs
lola: 11151060 markings, 89932926 edges, 77978 markings/sec, 130 secs
lola: 11546789 markings, 93234015 edges, 79146 markings/sec, 135 secs
lola: 11919041 markings, 96512865 edges, 74450 markings/sec, 140 secs
lola: 12340937 markings, 99886175 edges, 84379 markings/sec, 145 secs
lola: 12745040 markings, 103246592 edges, 80821 markings/sec, 150 secs
lola: 13063700 markings, 106174365 edges, 63732 markings/sec, 155 secs
lola: 13448897 markings, 109049246 edges, 77039 markings/sec, 160 secs
lola: 13800607 markings, 112272061 edges, 70342 markings/sec, 165 secs
lola: 14172508 markings, 115451730 edges, 74380 markings/sec, 170 secs
lola: 14527333 markings, 118360518 edges, 70965 markings/sec, 175 secs
lola: 14914291 markings, 121497815 edges, 77392 markings/sec, 180 secs
lola: 15266638 markings, 124833823 edges, 70469 markings/sec, 185 secs
lola: 15605573 markings, 128083321 edges, 67787 markings/sec, 190 secs
lola: 16002994 markings, 131526329 edges, 79484 markings/sec, 195 secs
lola: 16384801 markings, 134942795 edges, 76361 markings/sec, 200 secs
lola: 16759551 markings, 138181815 edges, 74950 markings/sec, 205 secs
lola: 17093013 markings, 141118793 edges, 66692 markings/sec, 210 secs
lola: 17430140 markings, 144092334 edges, 67425 markings/sec, 215 secs
lola: 17735491 markings, 146876871 edges, 61070 markings/sec, 220 secs
lola: 18054320 markings, 149603880 edges, 63766 markings/sec, 225 secs
lola: 18403228 markings, 152767234 edges, 69782 markings/sec, 230 secs
lola: 18699828 markings, 155670121 edges, 59320 markings/sec, 235 secs
lola: 18961919 markings, 158436548 edges, 52418 markings/sec, 240 secs
lola: 19513983 markings, 161121842 edges, 110413 markings/sec, 245 secs
lola: 20298717 markings, 163546683 edges, 156947 markings/sec, 250 secs
lola: 20702999 markings, 166419905 edges, 80856 markings/sec, 255 secs
lola: 21119178 markings, 169326805 edges, 83236 markings/sec, 260 secs
lola: 21509614 markings, 172275845 edges, 78087 markings/sec, 265 secs
lola: 21921925 markings, 175533573 edges, 82462 markings/sec, 270 secs
lola: 22366930 markings, 178837171 edges, 89001 markings/sec, 275 secs
lola: 22753279 markings, 181809129 edges, 77270 markings/sec, 280 secs
lola: 23110609 markings, 184832333 edges, 71466 markings/sec, 285 secs
lola: 23467615 markings, 187940299 edges, 71401 markings/sec, 290 secs
lola: 23795502 markings, 190871521 edges, 65577 markings/sec, 295 secs
lola: 24141416 markings, 193827170 edges, 69183 markings/sec, 300 secs
lola: 24485608 markings, 196873816 edges, 68838 markings/sec, 305 secs
lola: 24809940 markings, 199892871 edges, 64866 markings/sec, 310 secs
lola: 25150421 markings, 203129752 edges, 68096 markings/sec, 315 secs
lola: 25467817 markings, 206288749 edges, 63479 markings/sec, 320 secs
lola: 25773776 markings, 209312962 edges, 61192 markings/sec, 325 secs
lola: 26109797 markings, 212507796 edges, 67204 markings/sec, 330 secs
lola: 26447250 markings, 215616429 edges, 67491 markings/sec, 335 secs
lola: 26735945 markings, 218611877 edges, 57739 markings/sec, 340 secs
lola: 27101482 markings, 221622428 edges, 73107 markings/sec, 345 secs
lola: 27465808 markings, 224604827 edges, 72865 markings/sec, 350 secs
lola: 27790643 markings, 227395512 edges, 64967 markings/sec, 355 secs
lola: local time limit reached - aborting
lola: local time limit reached - aborting
lola: lola:
preliminary result: no yes unknown no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown

preliminary result: no yes unknown no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4070928 KB
lola: time consumption: 664 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: no yes unknown no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: no yes unknown no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4070964 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 12082792 kB
After kill :
MemTotal: 16427456 kB
MemFree: 12082612 kB

--------------------
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-003B"
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-003B, 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-159033476900082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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