fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r151-tall-162089151000062
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for NeoElection-COL-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4277.212 3600000.00 16124.00 1243.70 TTFTFFTFTFFTFFFT normal

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.r151-tall-162089151000062.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 NeoElection-COL-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151000062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K 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.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 06:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 07:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 07:31 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 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 75K 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 NeoElection-COL-3-00
FORMULA_NAME NeoElection-COL-3-01
FORMULA_NAME NeoElection-COL-3-02
FORMULA_NAME NeoElection-COL-3-03
FORMULA_NAME NeoElection-COL-3-04
FORMULA_NAME NeoElection-COL-3-05
FORMULA_NAME NeoElection-COL-3-06
FORMULA_NAME NeoElection-COL-3-07
FORMULA_NAME NeoElection-COL-3-08
FORMULA_NAME NeoElection-COL-3-09
FORMULA_NAME NeoElection-COL-3-10
FORMULA_NAME NeoElection-COL-3-11
FORMULA_NAME NeoElection-COL-3-12
FORMULA_NAME NeoElection-COL-3-13
FORMULA_NAME NeoElection-COL-3-14
FORMULA_NAME NeoElection-COL-3-15

=== Now, execution of the tool begins

BK_START 1620984646002

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 09:30:48] [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-14 09:30:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 09:30:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-14 09:30:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 651 ms
[2021-05-14 09:30:49] [INFO ] sort/places :
M * STAGE->P-stage,
M * POS->P-sendAnnPs__broadcasting,P-startNeg__broadcasting,
M * M * MT * M->P-network,P-poll__networl,
M * POS * M->P-masterList,
M * BOOL * M->P-masterState,
M * M * NEGSTEP->P-negotiation,
M->P-crashed,P-dead,P-electedPrimary,P-electedSecondary,P-electionFailed,P-electionInit,P-poll__handlingMessage,P-poll__pollEnd,P-poll__waitingMessage,P-polling,

[2021-05-14 09:30:49] [INFO ] Detected 4 constant HL places corresponding to 60 PT places.
[2021-05-14 09:30:49] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 972 PT places and 1808.0 transition bindings in 23 ms.
[2021-05-14 09:30:49] [INFO ] Computed order based on color domains.
[2021-05-14 09:30:49] [INFO ] Unfolded HLPN to a Petri net with 972 places and 964 transitions in 37 ms.
[2021-05-14 09:30:49] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 892 places in 4 ms
Reduce places removed 898 places and 906 transitions.
Reduce places removed 7 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 75 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 40 steps, including 0 resets, run visited all 15 properties in 3 ms. (steps per millisecond=13 )
[2021-05-14 09:30:49] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-14 09:30:49] [INFO ] Flatten gal took : 32 ms
FORMULA NeoElection-COL-3-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-3-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 09:30:49] [INFO ] Applying decomposition
[2021-05-14 09:30:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-14 09:30:49] [INFO ] Flatten gal took : 11 ms
[2021-05-14 09:30:49] [INFO ] Decomposing Gal with order
[2021-05-14 09:30:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 09:30:49] [INFO ] Removed a total of 99 redundant transitions.
[2021-05-14 09:30:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-14 09:30:49] [INFO ] Flatten gal took : 43 ms
[2021-05-14 09:30:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-14 09:30:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA NeoElection-COL-3-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 09:30:49] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-14 09:30:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ NeoElection-COL-3 @ 3570 seconds

FORMULA NeoElection-COL-3-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-3-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-3-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-3-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-3-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for LTLFireability @ NeoElection-COL-3

{
"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": "Fri May 14 09:30:52 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 10,
"adisj": 1,
"aneg": 1,
"comp": 28,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 28,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X (X (F ((((p3 <= 0) OR (p29 <= 0) OR (p49 <= 0)) AND ((p45 <= 0) OR (p51 <= 0)) AND ((p6 <= 0) OR (p37 <= 0) OR (p50 <= 0)) AND ((p5 <= 0) OR (p33 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p51 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p49 <= 0)) AND ((p6 <= 0) OR (p33 <= 0) OR (p50 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p49 <= 0)) AND ((p4 <= 0) OR (p29 <= 0) OR (p49 <= 0)) AND ((p5 <= 0) OR (p37 <= 0) OR (p50 <= 0))))))",
"processed_size": 441,
"rewrites": 23
},
"result":
{
"edges": 12,
"markings": 10,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 3,
"aneg": 2,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "G ((F (G (((1 <= p66) OR (1 <= p63) OR (1 <= p60)))) OR (G (F ((((p13 <= 0) OR (p61 <= 0)) AND ((p22 <= 0) OR (p65 <= 0)) AND ((p10 <= 0) OR (p59 <= 0)) AND ((p7 <= 0) OR (p58 <= 0)) AND ((p19 <= 0) OR (p64 <= 0)) AND ((p16 <= 0) OR (p62 <= 0))))) AND X (((p53 <= 0) AND (p54 <= 0) AND (p52 <= 0))))))",
"processed_size": 309,
"rewrites": 23
},
"result":
{
"edges": 3642645,
"markings": 983916,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1188
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((1 <= p0) OR (1 <= p1) OR (1 <= p2)) U ((G (((1 <= p0) OR (1 <= p1) OR (1 <= p2))) AND ((p0 <= 0) AND ((p1 <= 0) AND (p2 <= 0)))) OR ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0))))",
"processed_size": 180,
"rewrites": 23
},
"result":
{
"edges": 2706,
"markings": 1393,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"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": 1782
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"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 (((1 <= p0) OR (1 <= p1) OR (1 <= p2)))",
"processed_size": 43,
"rewrites": 23
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"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 (((p53 <= 0) AND (p54 <= 0) AND (p52 <= 0))))",
"processed_size": 50,
"rewrites": 23
},
"result":
{
"edges": 88,
"markings": 88,
"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": 3564
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 18,
"adisj": 2,
"aneg": 0,
"comp": 60,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "G (F (((((1 <= p47) AND (1 <= p51)) OR ((1 <= p31) AND (1 <= p49)) OR ((1 <= p43) AND (1 <= p51)) OR ((1 <= p27) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p35) AND (1 <= p50))) AND G ((((1 <= p5) AND (1 <= p17) AND (1 <= p40) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p28) AND (1 <= p49)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p28) AND (1 <= p49)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p32) AND (1 <= p49)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p28) AND (1 <= p49)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p40) AND (1 <= p50)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p32) AND (1 <= p49)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p40) AND (1 <= p50)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p28) AND (1 <= p49)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p32) AND (1 <= p49)) OR ((1 <= p6) AND (1 <= p14) AND (1 <= p40) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p32) AND (1 <= p49)))))))",
"processed_size": 933,
"rewrites": 23
},
"result":
{
"edges": 89,
"markings": 89,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"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": 39600,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(F(*))) : G((F(G(**)) OR (G(F(*)) AND X(*)))) : ((** U ((G(**) AND (** AND (** AND **))) OR **)) AND X(**)) : X(G(*)) : G(F((** AND G(**))))"
},
"net":
{
"arcs": 272,
"conflict_clusters": 27,
"places": 67,
"places_significant": 47,
"singleton_clusters": 0,
"transitions": 58
},
"result":
{
"preliminary_value": "yes no yes no no ",
"value": "yes no yes 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: 125/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 67
lola: finding significant places
lola: 67 places, 58 transitions, 47 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: F (NOT(X (X ((((1 <= p3) AND (1 <= p29) AND (1 <= p49)) OR ((1 <= p45) AND (1 <= p51)) OR ((1 <= p6) AND (1 <= p37) AND (1 <= p50)) OR ((1 <= p5) AND (1 <= p33) AND (1 <= p50)) OR ((1 <= p41) AND (1 <= p51)) OR ((1 <= p4) AND (1 <= p25) AND (1 <= p49)) OR ((1 <= p6) AND (1 <= p33) AND (1 <= p50)) OR ((1 <= p3) AND (1 <= p25) AND (1 <= p49)) OR ((1 <= p4) AND (1 <= p29) AND (1 <= p49)) OR ((1 <= p5) AND (1 <= p37) AND (1 <= p50))))))) : G ((F (G (((1 <= p66) OR (1 <= p63) OR (1 <= p60)))) OR (NOT(F (G ((((1 <= p13) AND (1 <= p61)) OR ((1 <= p22) AND (1 <= p65)) OR ((1 <= p10) AND (1 <= p59)) OR ((1 <= p7) AND (1 <= p58)) OR ((1 <= p19) AND (1 <= p64)) OR ((1 <= p16) AND (1 <= p62)))))) AND NOT(X (((1 <= p53) OR (1 <= p54) OR (1 <= p52))))))) : ((((1 <= p0) OR (1 <= p1) OR (1 <= p2)) U ((((G (((1 <= p0) OR (1 <= p1) OR (1 <= p2))) AND (p0 <= 0)) AND (p1 <= 0)) AND (p2 <= 0)) OR ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0)))) AND X (((1 <= p0) OR (1 <= p1) OR (1 <= p2)))) : NOT(F (X (F (((1 <= p53) OR (1 <= p54) OR (1 <= p52)))))) : X (G (F (((((1 <= p47) AND (1 <= p51)) OR ((1 <= p31) AND (1 <= p49)) OR ((1 <= p43) AND (1 <= p51)) OR ((1 <= p27) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p35) AND (1 <= p50))) AND (F ((X ((((p47 <= 0) OR (p51 <= 0)) AND ((p31 <= 0) OR (p49 <= 0)) AND ((p43 <= 0) OR (p51 <= 0)) AND ((p27 <= 0) OR (p49 <= 0)) AND ((p39 <= 0) OR (p50 <= 0)) AND ((p35 <= 0) OR (p50 <= 0)))) U (1 <= 0))) OR G ((((1 <= p5) AND (1 <= p17) AND (1 <= p40) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p28) AND (1 <= p49)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p28) AND (1 <= p49)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p32) AND (1 <= p49)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p28) AND (1 <= p49)) OR ((1 <= p6) AND (1 <= p17) AND (1 <= p40) AND (1 <= p50)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p32) AND (1 <= p49)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p40) AND (1 <= p50)) OR ((1 <= p3) AND (1 <= p11) AND (1 <= p28) AND (1 <= p49)) OR ((1 <= p3) AND (1 <= p8) AND (1 <= p32) AND (1 <= p49)) OR ((1 <= p6) AND (1 <= p14) AND (1 <= p40) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p32) AND (1 <= p49)))))))))
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((p3 <= 0) OR (p29 <= 0) OR (p49 <= 0)) AND ((p45 <= 0) OR (p51 <= 0)) AND ((p6 <= 0) OR (p37 <= 0) OR (p50 <= 0)) AND ((p5 <= 0) OR (p33 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p51 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p49 <= 0)) AND ((p6 <= 0) OR (p33 <= 0) OR (p50 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p49 <= 0)) AND ((p4 <= 0) OR (p29 <= 0) OR (p49 <= 0)) AND ((p5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((p3 <= 0) OR (p29 <= 0) OR (p49 <= 0)) AND ((p45 <= 0) OR (p51 <= 0)) AND ((p6 <= 0) OR (p37 <= 0) OR (p50 <= 0)) AND ((p5 <= 0) OR (p33 <= 0) OR (p50 <= 0)) AND ((p41 <= 0) OR (p51 <= 0)) AND ((p4 <= 0) OR (p25 <= 0) OR (p49 <= 0)) AND ((p6 <= 0) OR (p33 <= 0) OR (p50 <= 0)) AND ((p3 <= 0) OR (p25 <= 0) OR (p49 <= 0)) AND ((p4 <= 0) OR (p29 <= 0) OR (p49 <= 0)) AND ((p5... (shortened)
lola: processed formula length: 441
lola: 23 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 10 markings, 12 edges
lola: ========================================
lola: subprocess 1 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G (((1 <= p66) OR (1 <= p63) OR (1 <= p60)))) OR (G (F ((((p13 <= 0) OR (p61 <= 0)) AND ((p22 <= 0) OR (p65 <= 0)) AND ((p10 <= 0) OR (p59 <= 0)) AND ((p7 <= 0) OR (p58 <= 0)) AND ((p19 <= 0) OR (p64 <= 0)) AND ((p16 <= 0) OR (p62 <= 0))))) AND X (((p53 <= 0) AND (p54 <= 0) AND (p52 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G (((1 <= p66) OR (1 <= p63) OR (1 <= p60)))) OR (G (F ((((p13 <= 0) OR (p61 <= 0)) AND ((p22 <= 0) OR (p65 <= 0)) AND ((p10 <= 0) OR (p59 <= 0)) AND ((p7 <= 0) OR (p58 <= 0)) AND ((p19 <= 0) OR (p64 <= 0)) AND ((p16 <= 0) OR (p62 <= 0))))) AND X (((p53 <= 0) AND (p54 <= 0) AND (p52 <= 0))))))
lola: processed formula length: 309
lola: 23 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 983916 markings, 3642645 edges
lola: ========================================
lola: subprocess 2 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p0) OR (1 <= p1) OR (1 <= p2)) U ((G (((1 <= p0) OR (1 <= p1) OR (1 <= p2))) AND ((p0 <= 0) AND ((p1 <= 0) AND (p2 <= 0)))) OR ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0)))) AND X (((1 <= p0) OR (1 <= p1) OR (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p0) OR (1 <= p1) OR (1 <= p2)) U ((G (((1 <= p0) OR (1 <= p1) OR (1 <= p2))) AND ((p0 <= 0) AND ((p1 <= 0) AND (p2 <= 0)))) OR ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p0) OR (1 <= p1) OR (1 <= p2)) U ((G (((1 <= p0) OR (1 <= p1) OR (1 <= p2))) AND ((p0 <= 0) AND ((p1 <= 0) AND (p2 <= 0)))) OR ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0))))
lola: processed formula length: 180
lola: 23 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 1393 markings, 2706 edges
lola: subprocess 3 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p0) OR (1 <= p1) OR (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p0) OR (1 <= p1) OR (1 <= p2)))
lola: processed formula length: 43
lola: 23 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p53 <= 0) AND (p54 <= 0) AND (p52 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p53 <= 0) AND (p54 <= 0) AND (p52 <= 0))))
lola: processed formula length: 50
lola: 23 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: 88 markings, 88 edges
lola: ========================================
lola: subprocess 4 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((1 <= p47) AND (1 <= p51)) OR ((1 <= p31) AND (1 <= p49)) OR ((1 <= p43) AND (1 <= p51)) OR ((1 <= p27) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p35) AND (1 <= p50))) AND G ((((1 <= p5) AND (1 <= p17) AND (1 <= p40) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p28) AND (1 <= p49)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p28) AND (1 <= p49)) OR ((1 <= p4) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((1 <= p47) AND (1 <= p51)) OR ((1 <= p31) AND (1 <= p49)) OR ((1 <= p43) AND (1 <= p51)) OR ((1 <= p27) AND (1 <= p49)) OR ((1 <= p39) AND (1 <= p50)) OR ((1 <= p35) AND (1 <= p50))) AND G ((((1 <= p5) AND (1 <= p17) AND (1 <= p40) AND (1 <= p50)) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p28) AND (1 <= p49)) OR ((1 <= p4) AND (1 <= p11) AND (1 <= p28) AND (1 <= p49)) OR ((1 <= p4) AN... (shortened)
lola: processed formula length: 933
lola: 23 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: 89 markings, 89 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no
lola:
preliminary result: yes no yes no no
lola: memory consumption: 39600 KB
lola: time consumption: 6 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="NeoElection-COL-3"
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 NeoElection-COL-3, 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 r151-tall-162089151000062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-3.tgz
mv NeoElection-COL-3 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 ;