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

About the Execution of 2020-gold for LamportFastMutEx-COL-4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4277.771 3600000.00 55647.00 50572.80 FFTFFFF??FFTFTFF 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.r132-tall-162075428500301.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 LamportFastMutEx-COL-4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428500301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 103K 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 3.7K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 40K 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 LamportFastMutEx-COL-4-00
FORMULA_NAME LamportFastMutEx-COL-4-01
FORMULA_NAME LamportFastMutEx-COL-4-02
FORMULA_NAME LamportFastMutEx-COL-4-03
FORMULA_NAME LamportFastMutEx-COL-4-04
FORMULA_NAME LamportFastMutEx-COL-4-05
FORMULA_NAME LamportFastMutEx-COL-4-06
FORMULA_NAME LamportFastMutEx-COL-4-07
FORMULA_NAME LamportFastMutEx-COL-4-08
FORMULA_NAME LamportFastMutEx-COL-4-09
FORMULA_NAME LamportFastMutEx-COL-4-10
FORMULA_NAME LamportFastMutEx-COL-4-11
FORMULA_NAME LamportFastMutEx-COL-4-12
FORMULA_NAME LamportFastMutEx-COL-4-13
FORMULA_NAME LamportFastMutEx-COL-4-14
FORMULA_NAME LamportFastMutEx-COL-4-15

=== Now, execution of the tool begins

BK_START 1620928991199

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:03:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 18:03:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:03:23] [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-13 18:03:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 581 ms
[2021-05-13 18:03:23] [INFO ] sort/places :
pid * pid->P-wait,P-done,
pid * bool->P-b,
pid->P-start_1,x,y,P-setx_3,P-setbi_5,P-ify0_4,P-sety_9,P-ifxi_10,P-setbi_11,P-fordo_12,P-await_13,P-ifyi_15,P-awaity,P-CS_21,P-setbi_24,

[2021-05-13 18:03:23] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 35 ms.
[2021-05-13 18:03:23] [INFO ] Computed order based on color domains.
[2021-05-13 18:03:23] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions in 15 ms.
[2021-05-13 18:03:23] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 395 ms. (steps per millisecond=253 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
[2021-05-13 18:03:24] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2021-05-13 18:03:24] [INFO ] Computed 26 place invariants in 6 ms
[2021-05-13 18:03:24] [INFO ] [Real]Absence check using 26 positive place invariants in 20 ms returned unsat
[2021-05-13 18:03:24] [INFO ] [Real]Absence check using 26 positive place invariants in 12 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-13 18:03:24] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-13 18:03:24] [INFO ] Flatten gal took : 53 ms
FORMULA LamportFastMutEx-COL-4-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 18:03:24] [INFO ] Applying decomposition
[2021-05-13 18:03:24] [INFO ] Flatten gal took : 19 ms
[2021-05-13 18:03:24] [INFO ] Decomposing Gal with order
[2021-05-13 18:03:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 18:03:24] [INFO ] Removed a total of 231 redundant transitions.
[2021-05-13 18:03:24] [INFO ] Flatten gal took : 92 ms
[2021-05-13 18:03:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 10 ms.
[2021-05-13 18:03:24] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 18:03:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ LamportFastMutEx-COL-4 @ 3570 seconds

FORMULA LamportFastMutEx-COL-4-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-COL-4-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for LTLCardinality @ LamportFastMutEx-COL-4

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 18:03:25 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "G ((X ((3 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)) OR (1 <= p66 + p67 + p68 + p69)))",
"processed_size": 142,
"rewrites": 42
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "F (G ((X (F (((p66 + p67 + p68 + p69 + 1 <= p46 + p47 + p48 + p49) OR (p89 + p88 + p87 + p86 + 1 <= p34 + p35 + p36 + p37)))) OR (p30 + p31 + p32 + p33 <= p100 + p101 + p98 + p99))))",
"processed_size": 183,
"rewrites": 42
},
"result":
{
"edges": 72847,
"markings": 22998,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F ((X (X (F ((3 <= p89 + p88 + p87 + p86)))) OR (3 <= p46 + p47 + p48 + p49)))",
"processed_size": 78,
"rewrites": 42
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "F (G ((F ((X ((1 <= p93 + p92 + p91 + p90)) AND (p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p73 + p72 + p71 + p70 <= p26 + p27 + p28 + p29))) OR ((p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p73 + p72 + p71 + p70 <= p26 + p27 + p28 + p29) OR ((p22 + p23 + p24 + p25 <= p93 + p92 + p91 + p90) AND (p30 + p31 + p32 + p33 <= p100 + p101 + p98 + p99))))))",
"processed_size": 408,
"rewrites": 42
},
"result":
{
"edges": 61408,
"markings": 21026,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(p89 + p88 + p87 + p86 <= p95 + p94 + p96 + p97)",
"processed_size": 48,
"rewrites": 44
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 48
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "F (G ((p66 + p67 + p68 + p69 <= p38 + p39 + p40 + p41)))",
"processed_size": 56,
"rewrites": 42
},
"result":
{
"edges": 467,
"markings": 354,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "G ((F (((p95 + p94 + p96 + p97 + 1 <= p30 + p31 + p32 + p33) OR (2 <= p34 + p35 + p36 + p37))) OR G ((F ((p34 + p35 + p36 + p37 <= p46 + p47 + p48 + p49)) AND ((p30 + p31 + p32 + p33 <= p95 + p94 + p96 + p97) OR (p34 + p35 + p36 + p37 <= p46 + p47 + p48 + p49))))))",
"processed_size": 266,
"rewrites": 42
},
"result":
{
"edges": 20671253,
"markings": 3644859,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"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": 23296,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : F(**) : G((X(**) OR **)) : F(G((X(F(*)) OR *))) : (G(F(*)) AND F(**)) : (* AND (F((F(*) AND *)) OR G(*))) : F((X(X(F(**))) OR **)) : G((F(**) OR G((F(**) AND (** OR **))))) : F(G((F((X(**) AND **)) OR (** OR **))))"
},
"net":
{
"arcs": 768,
"conflict_clusters": 7,
"places": 102,
"places_significant": 76,
"singleton_clusters": 0,
"transitions": 180
},
"result":
{
"interim_value": "no no no no unknown unknown no yes no ",
"preliminary_value": "no no no no unknown unknown no yes 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: 282/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 102
lola: finding significant places
lola: 102 places, 180 transitions, 76 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 LTLCardinality.xml
lola: F (((F ((p100 + p101 + p98 + p99 <= p95 + p94 + p96 + p97)) OR G ((p22 + p23 + p24 + p25 <= p89 + p88 + p87 + p86))) U G (X ((p66 + p67 + p68 + p69 <= p38 + p39 + p40 + p41))))) : F (((F (X (((0 <= 0) U G ((p89 + p88 + p87 + p86 <= p95 + p94 + p96 + p97))))) OR (2 <= p89 + p88 + p87 + p86)) U (p95 + p94 + p96 + p97 + 1 <= p89 + p88 + p87 + p86))) : G ((X ((3 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)) OR (1 <= p66 + p67 + p68 + p69))) : F (NOT(F ((G (X (((p46 + p47 + p48 + p49 <= p66 + p67 + p68 + p69) AND (p34 + p35 + p36 + p37 <= p89 + p88 + p87 + p86)))) AND (p100 + p101 + p98 + p99 + 1 <= p30 + p31 + p32 + p33))))) : (X (NOT(X (F (X (G ((1 <= p22 + p23 + p24 + p25))))))) AND F ((p34 + p35 + p36 + p37 <= p26 + p27 + p28 + p29))) : NOT((G ((G ((p26 + p27 + p28 + p29 <= p34 + p35 + p36 + p37)) OR (p26 + p27 + p28 + p29 <= p34 + p35 + p36 + p37))) U (p30 + p31 + p32 + p33 + 1 <= p95 + p94 + p96 + p97))) : (F (((2 <= p34 + p35 + p36 + p37) U X ((2 <= p34 + p35 + p36 + p37)))) U F ((F (X (X ((3 <= p89 + p88 + p87 + p86)))) OR (3 <= p46 + p47 + p48 + p49)))) : G ((F (((p95 + p94 + p96 + p97 + 1 <= p30 + p31 + p32 + p33) OR (2 <= p34 + p35 + p36 + p37))) OR G (((p30 + p31 + p32 + p33 <= p95 + p94 + p96 + p97) U (p34 + p35 + p36 + p37 <= p46 + p47 + p48 + p49))))) : F (G (((F ((X ((1 <= p93 + p92 + p91 + p90)) AND (p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p73 + p72 + p71 + p70 <= p26 + p27 + p28 + p29))) OR (p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p73 + p72 + p71 + p70 <= p26 + p27 + p28 + p29)) OR ((p22 + p23 + p24 + p25 <= p93 + p92 + p91 + p90) AND (p30 + p31 + p32 + p33 <= p100 + p101 + p98 + p99)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((3 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)) OR (1 <= p66 + p67 + p68 + p69)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((3 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65)) OR (1 <= p66 + p67 + p68 + p69)))
lola: processed formula length: 142
lola: 42 rewrites
lola: closed formula file LTLCardinality.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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F (((p66 + p67 + p68 + p69 + 1 <= p46 + p47 + p48 + p49) OR (p89 + p88 + p87 + p86 + 1 <= p34 + p35 + p36 + p37)))) OR (p30 + p31 + p32 + p33 <= p100 + p101 + p98 + p99))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F (((p66 + p67 + p68 + p69 + 1 <= p46 + p47 + p48 + p49) OR (p89 + p88 + p87 + p86 + 1 <= p34 + p35 + p36 + p37)))) OR (p30 + p31 + p32 + p33 <= p100 + p101 + p98 + p99))))
lola: processed formula length: 183
lola: 42 rewrites
lola: closed formula file LTLCardinality.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: 22998 markings, 72847 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (X (F ((3 <= p89 + p88 + p87 + p86)))) OR (3 <= p46 + p47 + p48 + p49)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (X (F ((3 <= p89 + p88 + p87 + p86)))) OR (3 <= p46 + p47 + p48 + p49)))
lola: processed formula length: 78
lola: 42 rewrites
lola: closed formula file LTLCardinality.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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((X ((1 <= p93 + p92 + p91 + p90)) AND (p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p73 + p72 + p71 + p70 <= p26 + p27 + p28 + p29))) OR ((p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p73 + p72 + p71 + p70 <= p26 + p27 + p28 + p29) OR ((p22 + p23 + p24 + p25 <= p93 + p92 + p91 + p90) AND (p30 + p31 + p32 + p33 <= p100 + p101 + p98 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((X ((1 <= p93 + p92 + p91 + p90)) AND (p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p73 + p72 + p71 + p70 <= p26 + p27 + p28 + p29))) OR ((p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p73 + p72 + p71 + p70 <= p26 + p27 + p28 + p29) OR ((p22 + p23 + p24 + p25 <= p93 + p92 + p91 + p90) AND (p30 + p31 + p32 + p33 <= p100 + p101 + p98 + p... (shortened)
lola: processed formula length: 408
lola: 42 rewrites
lola: closed formula file LTLCardinality.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: 21026 markings, 61408 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p95 + p94 + p96 + p97 + 1 <= p89 + p88 + p87 + p86))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p89 + p88 + p87 + p86 <= p95 + p94 + p96 + p97)
lola: processed formula length: 48
lola: 44 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p66 + p67 + p68 + p69 <= p38 + p39 + p40 + p41)))
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 ((p66 + p67 + p68 + p69 <= p38 + p39 + p40 + p41)))
lola: processed formula length: 56
lola: 42 rewrites
lola: closed formula file LTLCardinality.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: 354 markings, 467 edges
lola: ========================================
lola: subprocess 6 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((p95 + p94 + p96 + p97 + 1 <= p30 + p31 + p32 + p33) OR (2 <= p34 + p35 + p36 + p37))) OR G ((F ((p34 + p35 + p36 + p37 <= p46 + p47 + p48 + p49)) AND ((p30 + p31 + p32 + p33 <= p95 + p94 + p96 + p97) OR (p34 + p35 + p36 + p37 <= p46 + p47 + p48 + p49))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((p95 + p94 + p96 + p97 + 1 <= p30 + p31 + p32 + p33) OR (2 <= p34 + p35 + p36 + p37))) OR G ((F ((p34 + p35 + p36 + p37 <= p46 + p47 + p48 + p49)) AND ((p30 + p31 + p32 + p33 <= p95 + p94 + p96 + p97) OR (p34 + p35 + p36 + p37 <= p46 + p47 + p48 + p49))))))
lola: processed formula length: 266
lola: 42 rewrites
lola: closed formula file LTLCardinality.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: 650748 markings, 2495154 edges, 130150 markings/sec, 0 secs
lola: 1381225 markings, 6325793 edges, 146095 markings/sec, 5 secs
lola: 1858008 markings, 9178493 edges, 95357 markings/sec, 10 secs
lola: 2355809 markings, 12111240 edges, 99560 markings/sec, 15 secs
lola: 2819632 markings, 15241902 edges, 92765 markings/sec, 20 secs
lola: 3352726 markings, 18326267 edges, 106619 markings/sec, 25 secs
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: 3644859 markings, 20671253 edges
lola: ========================================
lola: subprocess 7 will run for 1765 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((p22 + p23 + p24 + p25 <= 0))) AND F ((p34 + p35 + p36 + p37 <= p26 + p27 + p28 + p29)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no no no no unknown unknown no yes no
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 23296 KB
lola: time consumption: 1804 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: time limit reached - aborting
lola:
preliminary result: no no no no unknown unknown no yes no
lola:
preliminary result: no no no no unknown unknown no yes no
lola: memory consumption: 23296 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16120344 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16120416 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="LamportFastMutEx-COL-4"
export BK_EXAMINATION="LTLCardinality"
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 LamportFastMutEx-COL-4, examination is LTLCardinality"
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-162075428500301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-4.tgz
mv LamportFastMutEx-COL-4 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;