Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428600398.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is MAPKbis-PT-5320, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428600398
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 116K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 27 06:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 25 07:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 07:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 170K May 5 16:51 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 MAPKbis-PT-5320-00
FORMULA_NAME MAPKbis-PT-5320-01
FORMULA_NAME MAPKbis-PT-5320-02
FORMULA_NAME MAPKbis-PT-5320-03
FORMULA_NAME MAPKbis-PT-5320-04
FORMULA_NAME MAPKbis-PT-5320-05
FORMULA_NAME MAPKbis-PT-5320-06
FORMULA_NAME MAPKbis-PT-5320-07
FORMULA_NAME MAPKbis-PT-5320-08
FORMULA_NAME MAPKbis-PT-5320-09
FORMULA_NAME MAPKbis-PT-5320-10
FORMULA_NAME MAPKbis-PT-5320-11
FORMULA_NAME MAPKbis-PT-5320-12
FORMULA_NAME MAPKbis-PT-5320-13
FORMULA_NAME MAPKbis-PT-5320-14
FORMULA_NAME MAPKbis-PT-5320-15

=== Now, execution of the tool begins

BK_START 1620938088062

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:34: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]
[2021-05-13 20:34:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:34:49] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2021-05-13 20:34:49] [INFO ] Transformed 106 places.
[2021-05-13 20:34:49] [INFO ] Transformed 173 transitions.
[2021-05-13 20:34:49] [INFO ] Found NUPN structural information;
[2021-05-13 20:34:49] [INFO ] Parsed PT model containing 106 places and 173 transitions in 101 ms.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 33 places and 106 transitions.
Reduce places removed 25 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 81314 steps, including 2388 resets, run visited all 15 properties in 268 ms. (steps per millisecond=303 )
[2021-05-13 20:34:50] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2021-05-13 20:34:50] [INFO ] Flatten gal took : 32 ms
FORMULA MAPKbis-PT-5320-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5320-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5320-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5320-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5320-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5320-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5320-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5320-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5320-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 20:34:50] [INFO ] Applying decomposition
[2021-05-13 20:34:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 20:34:50] [INFO ] Flatten gal took : 9 ms
[2021-05-13 20:34:50] [INFO ] Decomposing Gal with order
[2021-05-13 20:34:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 20:34:50] [INFO ] Removed a total of 86 redundant transitions.
[2021-05-13 20:34:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 20:34:50] [INFO ] Flatten gal took : 37 ms
[2021-05-13 20:34:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-13 20:34:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MAPKbis-PT-5320-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 20:34:50] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-13 20:34:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ MAPKbis-PT-5320 @ 3570 seconds

FORMULA MAPKbis-PT-5320-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPKbis-PT-5320-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for LTLFireability @ MAPKbis-PT-5320

{
"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": "Thu May 13 20:34:51 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X (G ((F (G (((1 <= p25) AND (1 <= p44)))) AND (((1 <= p4)) AND (((1 <= p44)) AND ((1 <= p47))))))) OR G (((1 <= p25) AND (1 <= p44)))))",
"processed_size": 140,
"rewrites": 37
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p13) AND (1 <= p20) AND (1 <= p44))))",
"processed_size": 50,
"rewrites": 37
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(X (((((1 <= p11) AND (1 <= p21) AND (1 <= p31) AND (1 <= p38)) U ((p11 <= 0) OR (p21 <= 0) OR (p31 <= 0) OR (p38 <= 0))) R ((p11 <= 0) OR (p30 <= 0) OR (p38 <= 0) OR (p45 <= 0)))) U ((1 <= p11) AND (1 <= p21) AND (1 <= p31) AND (1 <= p38)))",
"processed_size": 247,
"rewrites": 37
},
"result":
{
"edges": 52,
"markings": 51,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((p28 <= 0) OR (p33 <= 0))))",
"processed_size": 35,
"rewrites": 37
},
"result":
{
"edges": 182756,
"markings": 20606,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p2 <= 0) OR (p21 <= 0)))",
"processed_size": 30,
"rewrites": 37
},
"result":
{
"edges": 30,
"markings": 30,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p42) AND (1 <= p47))) AND F (((p42 <= 0) OR (p47 <= 0)))))",
"processed_size": 73,
"rewrites": 37
},
"result":
{
"edges": 81,
"markings": 69,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 27724,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((X(G((F(G(**)) AND (** AND (** AND **))))) OR G(**))) : X(G(*)) : (X(((** U **) R *)) U **) : G(*) : F(G(*)) : G((F(**) AND F(*)))"
},
"net":
{
"arcs": 338,
"conflict_clusters": 1,
"places": 48,
"places_significant": 24,
"singleton_clusters": 0,
"transitions": 67
},
"result":
{
"preliminary_value": "no no no no no no ",
"value": "no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 115/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 48
lola: finding significant places
lola: 48 places, 67 transitions, 24 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: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: F ((G (X ((((F (G (((1 <= p25) AND (1 <= p44)))) AND ((1 <= p4))) AND ((1 <= p44))) AND ((1 <= p47))))) OR G (((1 <= p25) AND (1 <= p44))))) : X (G (NOT(((1 <= 0) U ((p13 <= 0) OR (p20 <= 0) OR (p44 <= 0)))))) : (NOT(X ((NOT((((1 <= p11) AND (1 <= p21) AND (1 <= p31) AND (1 <= p38)) U ((p11 <= 0) OR (p21 <= 0) OR (p31 <= 0) OR (p38 <= 0)))) U ((1 <= p11) AND (1 <= p30) AND (1 <= p38) AND (1 <= p45))))) U ((1 <= p11) AND (1 <= p21) AND (1 <= p31) AND (1 <= p38))) : NOT(F (((1 <= p2) AND (1 <= p21)))) : G (X (F (G (NOT(X (((1 <= p28) AND (1 <= p33)))))))) : (G (F (X (F (((1 <= p42) AND (1 <= p47)))))) AND F (NOT(F (G (X (((1 <= p42) AND (1 <= p47))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G ((F (G (((1 <= p25) AND (1 <= p44)))) AND (((1 <= p4)) AND (((1 <= p44)) AND ((1 <= p47))))))) OR G (((1 <= p25) AND (1 <= p44)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G ((F (G (((1 <= p25) AND (1 <= p44)))) AND (((1 <= p4)) AND (((1 <= p44)) AND ((1 <= p47))))))) OR G (((1 <= p25) AND (1 <= p44)))))
lola: processed formula length: 140
lola: 37 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p13) AND (1 <= p20) AND (1 <= p44))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p13) AND (1 <= p20) AND (1 <= p44))))
lola: processed formula length: 50
lola: 37 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 2 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((((1 <= p11) AND (1 <= p21) AND (1 <= p31) AND (1 <= p38)) U ((p11 <= 0) OR (p21 <= 0) OR (p31 <= 0) OR (p38 <= 0))) R ((p11 <= 0) OR (p30 <= 0) OR (p38 <= 0) OR (p45 <= 0)))) U ((1 <= p11) AND (1 <= p21) AND (1 <= p31) AND (1 <= p38)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((((1 <= p11) AND (1 <= p21) AND (1 <= p31) AND (1 <= p38)) U ((p11 <= 0) OR (p21 <= 0) OR (p31 <= 0) OR (p38 <= 0))) R ((p11 <= 0) OR (p30 <= 0) OR (p38 <= 0) OR (p45 <= 0)))) U ((1 <= p11) AND (1 <= p21) AND (1 <= p31) AND (1 <= p38)))
lola: processed formula length: 247
lola: 37 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 51 markings, 52 edges
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p28 <= 0) OR (p33 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p28 <= 0) OR (p33 <= 0))))
lola: processed formula length: 35
lola: 37 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: 20606 markings, 182756 edges
lola: ========================================
lola: subprocess 4 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p2 <= 0) OR (p21 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p2 <= 0) OR (p21 <= 0)))
lola: processed formula length: 30
lola: 37 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: 30 markings, 30 edges
lola: ========================================
lola: subprocess 5 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p42) AND (1 <= p47))) AND F (((p42 <= 0) OR (p47 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p42) AND (1 <= p47))) AND F (((p42 <= 0) OR (p47 <= 0)))))
lola: processed formula length: 73
lola: 37 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: 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: 69 markings, 81 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no
lola:
preliminary result: no no no no no no
lola: memory consumption: 27724 KB
lola: time consumption: 2 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MAPKbis-PT-5320"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is MAPKbis-PT-5320, 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 r132-tall-162075428600398"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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