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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 3.0K May 14 00:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 00:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 18:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 18:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 13:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 08:01 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 67K 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 ShieldIIPt-PT-004B-00
FORMULA_NAME ShieldIIPt-PT-004B-01
FORMULA_NAME ShieldIIPt-PT-004B-02
FORMULA_NAME ShieldIIPt-PT-004B-03
FORMULA_NAME ShieldIIPt-PT-004B-04
FORMULA_NAME ShieldIIPt-PT-004B-05
FORMULA_NAME ShieldIIPt-PT-004B-06
FORMULA_NAME ShieldIIPt-PT-004B-07
FORMULA_NAME ShieldIIPt-PT-004B-08
FORMULA_NAME ShieldIIPt-PT-004B-09
FORMULA_NAME ShieldIIPt-PT-004B-10
FORMULA_NAME ShieldIIPt-PT-004B-11
FORMULA_NAME ShieldIIPt-PT-004B-12
FORMULA_NAME ShieldIIPt-PT-004B-13
FORMULA_NAME ShieldIIPt-PT-004B-14
FORMULA_NAME ShieldIIPt-PT-004B-15

=== Now, execution of the tool begins

BK_START 1591295559627

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

FORMULA ShieldIIPt-PT-004B-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-004B-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-004B-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-004B-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-004B-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for LTLFireability @ ShieldIIPt-PT-004B

{
"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 18:32:43 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": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((p216 <= 0)))",
"processed_size": 17,
"rewrites": 38
},
"result":
{
"edges": 92,
"markings": 92,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 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 <= p152))))",
"processed_size": 21,
"rewrites": 38
},
"result":
{
"edges": 92,
"markings": 91,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 324
},
"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 <= p152))))",
"processed_size": 21,
"rewrites": 38
},
"result":
{
"edges": 129,
"markings": 129,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": "G (F (((1 <= p262))))",
"processed_size": 21,
"rewrites": 38
},
"result":
{
"edges": 779,
"markings": 779,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 3,
"X": 1,
"aconj": 4,
"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": "((X (G (((1 <= p71)))) U ((1 <= p90) AND (1 <= p109))) U (((1 <= p152)) U ((1 <= p262))))",
"processed_size": 89,
"rewrites": 38
},
"result":
{
"edges": 92,
"markings": 92,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((((1 <= p263)) U G ((X (((p117 <= 0))) OR G (((1 <= p56)))))))",
"processed_size": 65,
"rewrites": 38
},
"result":
{
"edges": 108447,
"markings": 40863,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 5456224,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(*) OR ((F(G(**)) AND G((** OR G(**)))) OR X(F(**)))) : G(F((G(*) OR (* AND *)))) : (G(F(**)) OR ((X(G(**)) U **) U (** U **))) : X(X(G(((** U **) OR (F(**) AND F(G(**))))))) : F(((X(G(**)) AND (** AND **)) OR **)) : X((** U G((X(**) OR G(**))))) : (F((F(**) AND **)) OR X(G((G(*) AND *)))) : F((** AND X((* OR **)))) : (** U (** U **)) : (F(G((X(**) AND G(**)))) OR (F(**) AND **)) : G(F(*)) : X((X(G(*)) OR (F(**) OR **))) : F(**)"
},
"net":
{
"arcs": 654,
"conflict_clusters": 235,
"places": 283,
"places_significant": 246,
"singleton_clusters": 0,
"transitions": 263
},
"result":
{
"interim_value": "no unknown no no no no unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "no unknown no no no no 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: 546/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 9056
lola: finding significant places
lola: 283 places, 263 transitions, 246 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: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p225 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p255 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p262 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p263 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p270 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p166 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p207 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: ((NOT(F (((1 <= p216)))) OR G ((((1 <= p98)) U G (((1 <= p152)))))) OR X (F (((1 <= p152))))) : G (X (NOT(G ((((1 <= p87) AND (1 <= p115) AND ((p225 <= 0) OR (p253 <= 0))) U ((1 <= p255))))))) : (G (F (((1 <= p262)))) OR ((X (G (((1 <= p71)))) U ((1 <= p90) AND (1 <= p109))) U (((1 <= p152)) U ((1 <= p262))))) : X (X (G ((X (F (G (((1 <= p73))))) U (((1 <= p55)) U ((p141 <= 0))))))) : F ((((X (G (((1 <= p153) AND (1 <= p207)))) AND ((1 <= p153))) AND ((1 <= p207))) OR (((p218 <= 0)) AND (((1 <= p68)) OR ((1 <= p19)))))) : X ((((1 <= p263)) U G ((X (((p117 <= 0))) OR G (((1 <= p56))))))) : (F ((F ((((1 <= p165) AND (1 <= p178) AND (1 <= p212)) U ((1 <= p270)))) AND ((1 <= p248)))) OR X (NOT(F ((F (((1 <= p165) AND (1 <= p178) AND (1 <= p212))) OR ((1 <= p248))))))) : F ((((1 <= p166) AND (1 <= p264)) AND (NOT(X (((1 <= p12)))) OR X (((1 <= p48)))))) : (((p37 <= 0)) U (((p83 <= 0)) U ((1 <= p153) AND (1 <= p207)))) : (F (G ((X (((1 <= p243))) AND G (((1 <= p90) AND (1 <= p109)))))) OR (F (((1 <= p38))) AND ((1 <= p38)))) : F (X (G (NOT(G (((1 <= p32))))))) : X (((NOT(F (X (((p47 <= 0))))) OR F ((((1 <= p103)) OR ((1 <= p179))))) OR ((1 <= p47)))) : F (((1 <= p92) AND (1 <= p131)))
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p216 <= 0))) OR ((F (G (((1 <= p152)))) AND G ((((1 <= p98)) OR G (((1 <= p152)))))) OR X (F (((1 <= p152))))))
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: G (((p216 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p216 <= 0)))
lola: processed formula length: 17
lola: 38 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: 92 markings, 92 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p152))))
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 <= p152))))
lola: processed formula length: 21
lola: 38 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: 91 markings, 92 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p152))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p152))))
lola: processed formula length: 21
lola: 38 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 129 markings, 129 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p262)))) OR ((X (G (((1 <= p71)))) U ((1 <= p90) AND (1 <= p109))) U (((1 <= p152)) U ((1 <= p262)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p262))))
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 <= p262))))
lola: processed formula length: 21
lola: 38 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: 779 markings, 779 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (G (((1 <= p71)))) U ((1 <= p90) AND (1 <= p109))) U (((1 <= p152)) U ((1 <= p262))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (G (((1 <= p71)))) U ((1 <= p90) AND (1 <= p109))) U (((1 <= p152)) U ((1 <= p262))))
lola: processed formula length: 89
lola: 38 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: 92 markings, 92 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((((1 <= p55)) U ((p141 <= 0))) OR (F (((p141 <= 0))) AND F (G (((1 <= p73)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((((1 <= p55)) U ((p141 <= 0))) OR (F (((p141 <= 0))) AND F (G (((1 <= p73)))))))))
lola: processed formula length: 92
lola: 38 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6674 markings, 15926 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((X (G (((1 <= p153) AND (1 <= p207)))) AND (((1 <= p153)) AND ((1 <= p207)))) OR (((p218 <= 0)) AND (((1 <= p68)) OR ((1 <= p19))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((X (G (((1 <= p153) AND (1 <= p207)))) AND (((1 <= p153)) AND ((1 <= p207)))) OR (((p218 <= 0)) AND (((1 <= p68)) OR ((1 <= p19))))))
lola: processed formula length: 138
lola: 38 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 92 markings, 92 edges
lola: ========================================
lola: subprocess 4 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p263)) U G ((X (((p117 <= 0))) OR G (((1 <= p56)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p263)) U G ((X (((p117 <= 0))) OR G (((1 <= p56)))))))
lola: processed formula length: 65
lola: 38 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 40863 markings, 108447 edges
lola: ========================================
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F (((1 <= p270))) AND ((1 <= p248)))) OR X (G ((G (((p165 <= 0) OR (p178 <= 0) OR (p212 <= 0))) AND ((p248 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p270))) AND ((1 <= p248))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p270))) AND ((1 <= p248))))
lola: processed formula length: 41
lola: 38 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: 524886 markings, 2301554 edges, 104977 markings/sec, 0 secs
lola: 1078696 markings, 4903629 edges, 110762 markings/sec, 5 secs
lola: 1569066 markings, 7419953 edges, 98074 markings/sec, 10 secs
lola: 2056269 markings, 9739930 edges, 97441 markings/sec, 15 secs
lola: 2514932 markings, 12082661 edges, 91733 markings/sec, 20 secs
lola: 2977775 markings, 14431578 edges, 92569 markings/sec, 25 secs
lola: 3457286 markings, 16896094 edges, 95902 markings/sec, 30 secs
lola: 3920136 markings, 19336246 edges, 92570 markings/sec, 35 secs
lola: 4440967 markings, 21880358 edges, 104166 markings/sec, 40 secs
lola: 4919755 markings, 24364267 edges, 95758 markings/sec, 45 secs
lola: 5383812 markings, 26824173 edges, 92811 markings/sec, 50 secs
lola: 5890633 markings, 29265098 edges, 101364 markings/sec, 55 secs
lola: 6333005 markings, 31590016 edges, 88474 markings/sec, 60 secs
lola: 6764242 markings, 33868317 edges, 86247 markings/sec, 65 secs
lola: 7204800 markings, 36207762 edges, 88112 markings/sec, 70 secs
lola: 7589641 markings, 38426187 edges, 76968 markings/sec, 75 secs
lola: 7981056 markings, 40690455 edges, 78283 markings/sec, 80 secs
lola: 8410055 markings, 43024278 edges, 85800 markings/sec, 85 secs
lola: 8805941 markings, 45277087 edges, 79177 markings/sec, 90 secs
lola: 9198112 markings, 47541692 edges, 78434 markings/sec, 95 secs
lola: 9612467 markings, 49825292 edges, 82871 markings/sec, 100 secs
lola: 10016636 markings, 52119884 edges, 80834 markings/sec, 105 secs
lola: 10408147 markings, 54353036 edges, 78302 markings/sec, 110 secs
lola: 10832622 markings, 56712624 edges, 84895 markings/sec, 115 secs
lola: 11329261 markings, 59150260 edges, 99328 markings/sec, 120 secs
lola: 11792623 markings, 61532269 edges, 92672 markings/sec, 125 secs
lola: 12228141 markings, 63827367 edges, 87104 markings/sec, 130 secs
lola: 12669524 markings, 66171201 edges, 88277 markings/sec, 135 secs
lola: 13030203 markings, 68229687 edges, 72136 markings/sec, 140 secs
lola: 13391298 markings, 70300153 edges, 72219 markings/sec, 145 secs
lola: 13783562 markings, 72494752 edges, 78453 markings/sec, 150 secs
lola: 14187262 markings, 74743097 edges, 80740 markings/sec, 155 secs
lola: 14552595 markings, 76851483 edges, 73067 markings/sec, 160 secs
lola: 14917656 markings, 78968277 edges, 73012 markings/sec, 165 secs
lola: 15314640 markings, 81067745 edges, 79397 markings/sec, 170 secs
lola: 15686956 markings, 83214642 edges, 74463 markings/sec, 175 secs
lola: 16072529 markings, 85445038 edges, 77115 markings/sec, 180 secs
lola: 16483045 markings, 87678958 edges, 82103 markings/sec, 185 secs
lola: 16957442 markings, 89956488 edges, 94879 markings/sec, 190 secs
lola: 17388881 markings, 92207089 edges, 86288 markings/sec, 195 secs
lola: 17784536 markings, 94300518 edges, 79131 markings/sec, 200 secs
lola: 18198334 markings, 96491519 edges, 82760 markings/sec, 205 secs
lola: 18586502 markings, 98701704 edges, 77634 markings/sec, 210 secs
lola: 18945023 markings, 100758601 edges, 71704 markings/sec, 215 secs
lola: 19337958 markings, 102956573 edges, 78587 markings/sec, 220 secs
lola: 19746076 markings, 105235049 edges, 81624 markings/sec, 225 secs
lola: 20130795 markings, 107464244 edges, 76944 markings/sec, 230 secs
lola: 20546182 markings, 109782485 edges, 83077 markings/sec, 235 secs
lola: 20964905 markings, 112091086 edges, 83745 markings/sec, 240 secs
lola: 21351968 markings, 114332112 edges, 77413 markings/sec, 245 secs
lola: 21751572 markings, 116624718 edges, 79921 markings/sec, 250 secs
lola: 22242166 markings, 119106620 edges, 98119 markings/sec, 255 secs
lola: 22711364 markings, 121481122 edges, 93840 markings/sec, 260 secs
lola: 23161955 markings, 123837080 edges, 90118 markings/sec, 265 secs
lola: 23575863 markings, 126135297 edges, 82782 markings/sec, 270 secs
lola: 23976974 markings, 128417583 edges, 80222 markings/sec, 275 secs
lola: 24399961 markings, 130711841 edges, 84597 markings/sec, 280 secs
lola: 24782630 markings, 132918498 edges, 76534 markings/sec, 285 secs
lola: 25205531 markings, 135237785 edges, 84580 markings/sec, 290 secs
lola: 25613919 markings, 137541562 edges, 81678 markings/sec, 295 secs
lola: 26021352 markings, 139846915 edges, 81487 markings/sec, 300 secs
lola: 26406047 markings, 141960071 edges, 76939 markings/sec, 305 secs
lola: 26767545 markings, 144012872 edges, 72300 markings/sec, 310 secs
lola: 27124495 markings, 146070477 edges, 71390 markings/sec, 315 secs
lola: 27461955 markings, 148133349 edges, 67492 markings/sec, 320 secs
lola: 27812854 markings, 150324231 edges, 70180 markings/sec, 325 secs
lola: 28186842 markings, 152523203 edges, 74798 markings/sec, 330 secs
lola: 28529830 markings, 154663989 edges, 68598 markings/sec, 335 secs
lola: 28883285 markings, 156845027 edges, 70691 markings/sec, 340 secs
lola: 29261997 markings, 159102211 edges, 75742 markings/sec, 345 secs
lola: 29618531 markings, 161310567 edges, 71307 markings/sec, 350 secs
lola: 30018366 markings, 163601535 edges, 79967 markings/sec, 355 secs
lola: 30420374 markings, 165878182 edges, 80402 markings/sec, 360 secs
lola: 30819179 markings, 168156837 edges, 79761 markings/sec, 365 secs
lola: 31187729 markings, 170368081 edges, 73710 markings/sec, 370 secs
lola: 31538554 markings, 172536804 edges, 70165 markings/sec, 375 secs
lola: 31904897 markings, 174740629 edges, 73269 markings/sec, 380 secs
lola: 32257637 markings, 176890594 edges, 70548 markings/sec, 385 secs
lola: 32570011 markings, 178838623 edges, 62475 markings/sec, 390 secs
lola: 32870930 markings, 180625692 edges, 60184 markings/sec, 395 secs
lola: 33161229 markings, 182411940 edges, 58060 markings/sec, 400 secs
lola: 33448988 markings, 184183814 edges, 57552 markings/sec, 405 secs
lola: 33796991 markings, 186201056 edges, 69601 markings/sec, 410 secs
lola: 34155509 markings, 188207253 edges, 71704 markings/sec, 415 secs
lola: 34510491 markings, 190236725 edges, 70996 markings/sec, 420 secs
lola: 34860969 markings, 192257511 edges, 70096 markings/sec, 425 secs
lola: 35175360 markings, 194201932 edges, 62878 markings/sec, 430 secs
lola: 35491629 markings, 196181622 edges, 63254 markings/sec, 435 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown no no no no unknown unknown unknown unknown unknown unknown unknown
lola: local time limit reached - aborting
lola:
preliminary result: no unknown no no no no unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 5455936 KB
lola: time consumption: 449 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: no unknown no no no no unknown unknown unknown unknown unknown unknown unknown
lola: time limit reached - aborting
lola:
preliminary result: no unknown no no no no unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: no unknown no no no no unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 5456224 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: 10694652 kB
After kill :
MemTotal: 16427456 kB
MemFree: 10694848 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="ShieldIIPt-PT-004B"
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 ShieldIIPt-PT-004B, 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-159033477200274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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