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.r227-tall-162098230700001.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 SharedMemory-COL-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098230700001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 139K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 11:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 11:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 14:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 14:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:52 instance
-rw-r--r-- 1 mcc users 5 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 12K May 5 16:52 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 SharedMemory-COL-000005-00
FORMULA_NAME SharedMemory-COL-000005-01
FORMULA_NAME SharedMemory-COL-000005-02
FORMULA_NAME SharedMemory-COL-000005-03
FORMULA_NAME SharedMemory-COL-000005-04
FORMULA_NAME SharedMemory-COL-000005-05
FORMULA_NAME SharedMemory-COL-000005-06
FORMULA_NAME SharedMemory-COL-000005-07
FORMULA_NAME SharedMemory-COL-000005-08
FORMULA_NAME SharedMemory-COL-000005-09
FORMULA_NAME SharedMemory-COL-000005-10
FORMULA_NAME SharedMemory-COL-000005-11
FORMULA_NAME SharedMemory-COL-000005-12
FORMULA_NAME SharedMemory-COL-000005-13
FORMULA_NAME SharedMemory-COL-000005-14
FORMULA_NAME SharedMemory-COL-000005-15

=== Now, execution of the tool begins

BK_START 1621103791706

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-15 18:36:33] [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-15 18:36:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 18:36:33] [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-15 18:36:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 564 ms
[2021-05-15 18:36:33] [INFO ] sort/places :
P->OwnMemAcc,Queue,Memory,Active,
Dot->Ext_Bus,
PxP->Ext_Mem_Acc,

[2021-05-15 18:36:33] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 46 PT places and 85.0 transition bindings in 15 ms.
[2021-05-15 18:36:33] [INFO ] Computed order based on color domains.
[2021-05-15 18:36:34] [INFO ] Unfolded HLPN to a Petri net with 46 places and 60 transitions in 16 ms.
[2021-05-15 18:36:34] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 5 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 437 ms. (steps per millisecond=228 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 55 rows 41 cols
[2021-05-15 18:36:34] [INFO ] Computed 11 place invariants in 5 ms
[2021-05-15 18:36:34] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
[2021-05-15 18:36:34] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2021-05-15 18:36:34] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2021-05-15 18:36:34] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2021-05-15 18:36:34] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2021-05-15 18:36:34] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-15 18:36:34] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2021-05-15 18:36:34] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2021-05-15 18:36:34] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2021-05-15 18:36:34] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-15 18:36:34] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2021-05-15 18:36:34] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2021-05-15 18:36:34] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
Successfully simplified 13 atomic propositions for a total of 18 simplifications.
[2021-05-15 18:36:34] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-15 18:36:34] [INFO ] Flatten gal took : 25 ms
FORMULA SharedMemory-COL-000005-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 18:36:34] [INFO ] Applying decomposition
[2021-05-15 18:36:34] [INFO ] Flatten gal took : 8 ms
[2021-05-15 18:36:34] [INFO ] Decomposing Gal with order
[2021-05-15 18:36:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 18:36:34] [INFO ] Removed a total of 98 redundant transitions.
[2021-05-15 18:36:34] [INFO ] Flatten gal took : 35 ms
[2021-05-15 18:36:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-15 18:36:34] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-15 18:36:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SharedMemory-COL-000005 @ 3570 seconds

FORMULA SharedMemory-COL-000005-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000005-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000005-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000005-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000005-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000005-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for LTLCardinality @ SharedMemory-COL-000005

{
"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": "Sat May 15 18:36:36 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((2 <= p15 + p16 + p17 + p18 + p19)))",
"processed_size": 42,
"rewrites": 23
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 26,
"visible_transitions": 0
},
"processed": "X (F ((F ((p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 <= p15 + p16 + p17 + p18 + p19)) OR (p15 + p16 + p17 + p18 + p19 <= p40))))",
"processed_size": 204,
"rewrites": 23
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((p15 + p16 + p17 + p18 + p19 <= p40))",
"processed_size": 40,
"rewrites": 23
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X ((p5 + p6 + p7 + p8 + p9 <= 0)))",
"processed_size": 37,
"rewrites": 23
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "G (F ((X ((p15 + p16 + p17 + p18 + p19 <= 1)) AND (p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p5 + p6 + p7 + p8 + p9))))",
"processed_size": 202,
"rewrites": 23
},
"result":
{
"edges": 5,
"markings": 5,
"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": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p15 + p16 + p17 + p18 + p19)) OR (p0 + p1 + p2 + p3 + p4 <= p40))))",
"processed_size": 83,
"rewrites": 23
},
"result":
{
"edges": 12750,
"markings": 3113,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 75,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 25,
"visible_transitions": 0
},
"processed": "F ((F (((p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 <= p5 + p6 + p7 + p8 + p9) OR (p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 <= p5 + p6 + p7 + p8 + p9))) AND F ((p5 + p6 + p7 + p8 + p9 + 1 <= p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39))))",
"processed_size": 465,
"rewrites": 23
},
"result":
{
"edges": 8,
"markings": 8,
"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": 18512,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((F(**) AND F(*))) : X(F(**)) : X(F((F(**) OR **))) : (X(X(*)) OR (G(**) AND X(X(F(*))))) : G(F((X(*) AND *))) : F(G((F(**) OR **)))"
},
"net":
{
"arcs": 200,
"conflict_clusters": 26,
"places": 41,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 55
},
"result":
{
"preliminary_value": "no yes yes no no yes ",
"value": "no yes yes no no yes "
},
"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: 96/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 41
lola: finding significant places
lola: 41 places, 55 transitions, 30 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: LP says that atomic proposition is always false: (3 <= p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39)
lola: NOT(G ((NOT(F (((p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 <= p5 + p6 + p7 + p8 + p9) OR (p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 <= p5 + p6 + p7 + p8 + p9)))) OR G ((p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 <= p5 + p6 + p7 + p8 + p9))))) : X (F ((2 <= p15 + p16 + p17 + p18 + p19))) : X (F ((F ((p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 <= p15 + p16 + p17 + p18 + p19)) OR (p15 + p16 + p17 + p18 + p19 <= p40)))) : (G ((p15 + p16 + p17 + p18 + p19 <= p40)) U X (NOT(X ((1 <= p5 + p6 + p7 + p8 + p9))))) : X (NOT(F (X (G ((X ((2 <= p15 + p16 + p17 + p18 + p19)) OR (p5 + p6 + p7 + p8 + p9 <= p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39))))))) : G (F (G ((F ((1 <= p15 + p16 + p17 + p18 + p19)) OR (p0 + p1 + p2 + p3 + p4 <= p40)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:300
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:431
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((2 <= p15 + p16 + p17 + p18 + p19)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((2 <= p15 + p16 + p17 + p18 + p19)))
lola: processed formula length: 42
lola: 23 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 <= p15 + p16 + p17 + p18 + p19)) OR (p15 + p16 + p17 + p18 + p19 <= p40))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 <= p15 + p16 + p17 + p18 + p19)) OR (p15 + p16 + p17 + p18 + p19 <= p40))))
lola: processed formula length: 204
lola: 23 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((p5 + p6 + p7 + p8 + p9 <= 0))) OR (G ((p15 + p16 + p17 + p18 + p19 <= p40)) AND X (X (F ((p5 + p6 + p7 + p8 + p9 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p15 + p16 + p17 + p18 + p19 <= p40))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p15 + p16 + p17 + p18 + p19 <= p40))
lola: processed formula length: 40
lola: 23 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: 8 markings, 8 edges
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((p5 + p6 + p7 + p8 + p9 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((p5 + p6 + p7 + p8 + p9 <= 0)))
lola: processed formula length: 37
lola: 23 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: 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: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X ((p15 + p16 + p17 + p18 + p19 <= 1)) AND (p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p5 + p6 + p7 + p8 + p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X ((p15 + p16 + p17 + p18 + p19 <= 1)) AND (p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p5 + p6 + p7 + p8 + p9))))
lola: processed formula length: 202
lola: 23 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p15 + p16 + p17 + p18 + p19)) OR (p0 + p1 + p2 + p3 + p4 <= p40))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p15 + p16 + p17 + p18 + p19)) OR (p0 + p1 + p2 + p3 + p4 <= p40))))
lola: processed formula length: 83
lola: 23 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: 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: 3113 markings, 12750 edges
lola: ========================================
lola: subprocess 5 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 <= p5 + p6 + p7 + p8 + p9) OR (p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 <= p5 + p6 + p7 + p8 + p9))) AND F ((p5 + p6 + p7 + p8 + p9 + 1 <= p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 <= p5 + p6 + p7 + p8 + p9) OR (p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p28 + p29 + p27 + p31 + p23 + p34 + p35 + p36 + p37 + p38 + p39 <= p5 + p6 + p7 + p8 + p9))) AND F ((p5 + p6 + p7 + p8 + p9 + 1 <= p33 + p20 + p21 + p22 + p32 + p24 + p25 + p26 + p30 + p2... (shortened)
lola: processed formula length: 465
lola: 23 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: 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: 8 markings, 8 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes
lola:
preliminary result: no yes yes no no yes
lola: memory consumption: 18512 KB
lola: time consumption: 2 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="SharedMemory-COL-000005"
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 SharedMemory-COL-000005, 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 r227-tall-162098230700001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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