fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987853100378
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for NoC3x3-PT-4A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.170 3600000.00 385361.00 1120.10 TFFF???FF??????? normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853100378.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is NoC3x3-PT-4A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853100378
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 3.5K Apr 8 15:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 8 15:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 7 18:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 7 18:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 6 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 6 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 6 03:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 6 03:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 144K Mar 24 05:37 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 NoC3x3-PT-4A-00
FORMULA_NAME NoC3x3-PT-4A-01
FORMULA_NAME NoC3x3-PT-4A-02
FORMULA_NAME NoC3x3-PT-4A-03
FORMULA_NAME NoC3x3-PT-4A-04
FORMULA_NAME NoC3x3-PT-4A-05
FORMULA_NAME NoC3x3-PT-4A-06
FORMULA_NAME NoC3x3-PT-4A-07
FORMULA_NAME NoC3x3-PT-4A-08
FORMULA_NAME NoC3x3-PT-4A-09
FORMULA_NAME NoC3x3-PT-4A-10
FORMULA_NAME NoC3x3-PT-4A-11
FORMULA_NAME NoC3x3-PT-4A-12
FORMULA_NAME NoC3x3-PT-4A-13
FORMULA_NAME NoC3x3-PT-4A-14
FORMULA_NAME NoC3x3-PT-4A-15

=== Now, execution of the tool begins

BK_START 1591142927407

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 00:08:49] [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-03 00:08:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 00:08:49] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2020-06-03 00:08:49] [INFO ] Transformed 293 places.
[2020-06-03 00:08:49] [INFO ] Transformed 608 transitions.
[2020-06-03 00:08:49] [INFO ] Found NUPN structural information;
[2020-06-03 00:08:49] [INFO ] Parsed PT model containing 293 places and 608 transitions in 147 ms.
Ensure Unique test removed 155 transitions
Reduce redundant transitions removed 155 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 11675 steps, including 0 resets, run visited all 41 properties in 72 ms. (steps per millisecond=162 )
[2020-06-03 00:08:50] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 00:08:50] [INFO ] Flatten gal took : 84 ms
FORMULA NoC3x3-PT-4A-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 00:08:50] [INFO ] Applying decomposition
[2020-06-03 00:08:50] [INFO ] Flatten gal took : 37 ms
[2020-06-03 00:08:50] [INFO ] Decomposing Gal with order
[2020-06-03 00:08:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 00:08:50] [INFO ] Removed a total of 248 redundant transitions.
[2020-06-03 00:08:50] [INFO ] Flatten gal took : 85 ms
[2020-06-03 00:08:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 125 labels/synchronizations in 15 ms.
[2020-06-03 00:08:50] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2020-06-03 00:08:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ NoC3x3-PT-4A @ 3570 seconds

FORMULA NoC3x3-PT-4A-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-4A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-4A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for LTLFireability @ NoC3x3-PT-4A

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 4,
"X": 2,
"aconj": 7,
"adisj": 2,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G ((F (((F (((1 <= p213) AND (1 <= p228))) U G (((1 <= p247) AND (1 <= p258)))) AND (((p87 <= 0) OR (p113 <= 0)) U ((1 <= p213) AND (1 <= p228))))) AND (((1 <= p119) AND (1 <= p163)) OR X (X (((F (((1 <= p213) AND (1 <= p228))) U G (((1 <= p247) AND (1 <= p258)))) AND (((p87 <= 0) OR (p113 <= 0)) U ((1 <= p213) AND (1 <= p228)))))))))",
"processed_size": 338,
"rewrites": 99
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 19
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((F (((p118 <= 0))) AND F (((p88 <= 0) OR (p111 <= 0))))))",
"processed_size": 64,
"rewrites": 99
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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":
{
"error": null,
"memory": 8302356,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((* R X(*))) : G((F(((F(**) U G(**)) AND (** U **))) AND (** OR X(X(((F(**) U G(**)) AND (** U **))))))) : X(G((F(*) AND F(*)))) : (F(G((F(*) OR (* OR *)))) AND X(G(**))) : X(X(((** U **) U G(**)))) : F(G((X(*) R *))) : ((X(*) OR *) R X(X(G(*)))) : X(X(X(F(*)))) : X(X(F(((X(X(*)) R *) OR (X(*) OR *))))) : G((G(**) OR (F(G(**)) AND F(G((G(**) OR (X(**) AND (** AND **)))))))) : G(F(**)) : (X(X(G(*))) U (F(**) AND **)) : F((X(X((F(G(**)) AND **))) OR (** OR **)))"
},
"net":
{
"arcs": 1595,
"conflict_clusters": 50,
"places": 293,
"places_significant": 227,
"singleton_clusters": 0,
"transitions": 453
},
"result":
{
"interim_value": "yes no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "yes no no unknown 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: 746/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 293
lola: finding significant places
lola: 293 places, 453 transitions, 227 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: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p163 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p189 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p290 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p226 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p197 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p285 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p228 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p231 <= 1)
lola: LP says that atomic proposition is always true: (p264 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p265 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p291 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p195 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p196 <= 1)
lola: X (NOT((((1 <= p231) AND (1 <= p258)) U X (((1 <= p28) AND (1 <= p167)))))) : G ((((1 <= p119) AND (1 <= p163)) U X (X (((F (((1 <= p213) AND (1 <= p228))) U G (((1 <= p247) AND (1 <= p258)))) AND (((p87 <= 0) OR (p113 <= 0)) U ((1 <= p213) AND (1 <= p228)))))))) : X ((G (X (NOT(G (((1 <= p118)))))) AND G (X (X (F (NOT(X (((1 <= p88) AND (1 <= p111)))))))))) : (X (X (F (X (NOT(F (((G (((1 <= p160))) AND ((1 <= p189))) AND ((1 <= p195))))))))) AND G (X (((1 <= p14))))) : X ((X ((((1 <= p290)) U ((p214 <= 0) OR (p226 <= 0)))) U G (X (((1 <= p214) AND (1 <= p226)))))) : F (G (NOT((X (((1 <= p197) AND (1 <= p277))) U ((1 <= p197) AND (1 <= p277)))))) : NOT(((X (((1 <= p253) AND (1 <= p257))) AND ((1 <= p261))) U F (X (X (((1 <= p48))))))) : X (X (F (NOT(G (X (((1 <= p285)))))))) : F (NOT(X ((X ((X (X (((1 <= p53)))) U ((1 <= p162)))) AND X ((X (((1 <= p162))) AND ((1 <= p264)))))))) : G ((F (G ((G (((1 <= p228))) OR ((X (((1 <= p106) AND (1 <= p110))) AND ((1 <= p231))) AND ((1 <= p264)))))) U G (((1 <= p231) AND (1 <= p264))))) : NOT(G (X (G (F (G (NOT(G ((X (((1 <= p126) AND (1 <= p265))) U F (((1 <= p126) AND (1 <= p265)))))))))))) : (NOT(X (F (X ((X (X (((1 <= p107)))) U F (((1 <= p291)))))))) U (F (((1 <= p78))) AND ((1 <= p110)))) : F (((X (X ((F (G (((1 <= p187) AND (1 <= p196)))) AND ((1 <= p195))))) OR ((1 <= p195))) OR ((1 <= p187) AND (1 <= p196))))
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k: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: X ((((p231 <= 0) OR (p258 <= 0)) R X (((p28 <= 0) OR (p167 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p231 <= 0) OR (p258 <= 0)) R X (((p28 <= 0) OR (p167 <= 0)))))
lola: processed formula length: 70
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((F (((1 <= p213) AND (1 <= p228))) U G (((1 <= p247) AND (1 <= p258)))) AND (((p87 <= 0) OR (p113 <= 0)) U ((1 <= p213) AND (1 <= p228))))) AND (((1 <= p119) AND (1 <= p163)) OR X (X (((F (((1 <= p213) AND (1 <= p228))) U G (((1 <= p247) AND (1 <= p258)))) AND (((p87 <= 0) OR (p113 <= 0)) U ((1 <= p213) AND (1 <= p228)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((F (((1 <= p213) AND (1 <= p228))) U G (((1 <= p247) AND (1 <= p258)))) AND (((p87 <= 0) OR (p113 <= 0)) U ((1 <= p213) AND (1 <= p228))))) AND (((1 <= p119) AND (1 <= p163)) OR X (X (((F (((1 <= p213) AND (1 <= p228))) U G (((1 <= p247) AND (1 <= p258)))) AND (((p87 <= 0) OR (p113 <= 0)) U ((1 <= p213) AND (1 <= p228)))))))))
lola: processed formula length: 338
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 19 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (((p118 <= 0))) AND F (((p88 <= 0) OR (p111 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (((p118 <= 0))) AND F (((p88 <= 0) OR (p111 <= 0))))))
lola: processed formula length: 64
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F (((p160 <= 0))) OR (((p189 <= 0)) OR ((p195 <= 0)))))) AND X (G (((1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((p160 <= 0))) OR (((p189 <= 0)) OR ((p195 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((p160 <= 0))) OR (((p189 <= 0)) OR ((p195 <= 0))))))
lola: processed formula length: 63
lola: 99 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 660448 markings, 1515964 edges, 132090 markings/sec, 0 secs
lola: 1130781 markings, 2499375 edges, 94067 markings/sec, 5 secs
lola: 1635006 markings, 3556380 edges, 100845 markings/sec, 10 secs
lola: 2134003 markings, 4608950 edges, 99799 markings/sec, 15 secs
lola: 2646803 markings, 5678647 edges, 102560 markings/sec, 20 secs
lola: 3142535 markings, 6706961 edges, 99146 markings/sec, 25 secs
lola: 3656892 markings, 7775686 edges, 102871 markings/sec, 30 secs
lola: 4174362 markings, 8809128 edges, 103494 markings/sec, 35 secs
lola: 4697529 markings, 9873274 edges, 104633 markings/sec, 40 secs
lola: 5213583 markings, 10907552 edges, 103211 markings/sec, 45 secs
lola: 5728115 markings, 11921325 edges, 102906 markings/sec, 50 secs
lola: 6255915 markings, 12992923 edges, 105560 markings/sec, 55 secs
lola: 6777307 markings, 14013874 edges, 104278 markings/sec, 60 secs
lola: 7302701 markings, 15035011 edges, 105079 markings/sec, 65 secs
lola: 7825752 markings, 16044501 edges, 104610 markings/sec, 70 secs
lola: 8323699 markings, 17123042 edges, 99589 markings/sec, 75 secs
lola: 8817961 markings, 18206806 edges, 98852 markings/sec, 80 secs
lola: 9334063 markings, 19270796 edges, 103220 markings/sec, 85 secs
lola: 9833380 markings, 20324956 edges, 99863 markings/sec, 90 secs
lola: 10330182 markings, 21335459 edges, 99360 markings/sec, 95 secs
lola: 10859447 markings, 22400068 edges, 105853 markings/sec, 100 secs
lola: 11364016 markings, 23454280 edges, 100914 markings/sec, 105 secs
lola: 11887074 markings, 24535109 edges, 104612 markings/sec, 110 secs
lola: 12408145 markings, 25586966 edges, 104214 markings/sec, 115 secs
lola: 12928885 markings, 26616530 edges, 104148 markings/sec, 120 secs
lola: 13425408 markings, 27664771 edges, 99305 markings/sec, 125 secs
lola: 13937788 markings, 28697907 edges, 102476 markings/sec, 130 secs
lola: 14446278 markings, 29733268 edges, 101698 markings/sec, 135 secs
lola: 14960613 markings, 30769765 edges, 102867 markings/sec, 140 secs
lola: 15467709 markings, 31805214 edges, 101419 markings/sec, 145 secs
lola: 15939985 markings, 32773004 edges, 94455 markings/sec, 150 secs
lola: 16389838 markings, 33725516 edges, 89971 markings/sec, 155 secs
lola: 16845065 markings, 34650308 edges, 91045 markings/sec, 160 secs
lola: 17357718 markings, 35674586 edges, 102531 markings/sec, 165 secs
lola: 17855700 markings, 36668536 edges, 99596 markings/sec, 170 secs
lola: 18372581 markings, 37782735 edges, 103376 markings/sec, 175 secs
lola: 18879634 markings, 38840179 edges, 101411 markings/sec, 180 secs
lola: 19377963 markings, 39880289 edges, 99666 markings/sec, 185 secs
lola: 19887347 markings, 40929221 edges, 101877 markings/sec, 190 secs
lola: 20415871 markings, 41990090 edges, 105705 markings/sec, 195 secs
lola: 20931894 markings, 43027439 edges, 103205 markings/sec, 200 secs
lola: 21441235 markings, 44087786 edges, 101868 markings/sec, 205 secs
lola: 21951428 markings, 45150223 edges, 102039 markings/sec, 210 secs
lola: 22464281 markings, 46215573 edges, 102571 markings/sec, 215 secs
lola: 22960441 markings, 47232299 edges, 99232 markings/sec, 220 secs
lola: 23477595 markings, 48280836 edges, 103431 markings/sec, 225 secs
lola: 23946887 markings, 49243001 edges, 93858 markings/sec, 230 secs
lola: 24408004 markings, 50172347 edges, 92223 markings/sec, 235 secs
lola: 24863270 markings, 51078709 edges, 91053 markings/sec, 240 secs
lola: 25333343 markings, 52069329 edges, 94015 markings/sec, 245 secs
lola: 25808298 markings, 53115760 edges, 94991 markings/sec, 250 secs
lola: 26317308 markings, 54133567 edges, 101802 markings/sec, 255 secs
lola: 26807331 markings, 55144658 edges, 98005 markings/sec, 260 secs
lola: 27289065 markings, 56107756 edges, 96347 markings/sec, 265 secs
lola: 27761917 markings, 57029087 edges, 94570 markings/sec, 270 secs
lola: 28257938 markings, 58060212 edges, 99204 markings/sec, 275 secs
lola: 28765126 markings, 59008385 edges, 101438 markings/sec, 280 secs
lola: 29279916 markings, 60021596 edges, 102958 markings/sec, 285 secs
lola: 29792993 markings, 61037804 edges, 102615 markings/sec, 290 secs
lola: 30307846 markings, 62067821 edges, 102971 markings/sec, 295 secs
lola: 30828372 markings, 63122845 edges, 104105 markings/sec, 300 secs
lola: 31325395 markings, 64089721 edges, 99405 markings/sec, 305 secs
lola: 31828827 markings, 65105391 edges, 100686 markings/sec, 310 secs
lola: 32330765 markings, 66128485 edges, 100388 markings/sec, 315 secs
lola: 32836446 markings, 67162674 edges, 101136 markings/sec, 320 secs
lola: 33325960 markings, 68179523 edges, 97903 markings/sec, 325 secs
lola: 33813989 markings, 69183362 edges, 97606 markings/sec, 330 secs
lola: 34314566 markings, 70208364 edges, 100115 markings/sec, 335 secs
lola: 34827831 markings, 71278772 edges, 102653 markings/sec, 340 secs
lola: 35317844 markings, 72321830 edges, 98003 markings/sec, 345 secs
lola: 35827936 markings, 73368761 edges, 102018 markings/sec, 350 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: local time limit reached - aborting
lola:
preliminary result: yes no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 8302144 KB
lola: time consumption: 361 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: time limit reached - aborting
lola:
preliminary result: yes no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: yes no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 8302356 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: 16427364 kB
MemFree: 7844568 kB
After kill :
MemTotal: 16427364 kB
MemFree: 7844508 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="NoC3x3-PT-4A"
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 NoC3x3-PT-4A, 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 r174-csrt-158987853100378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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