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.r208-smll-162089471100109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is SafeBus-COL-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-162089471100109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K 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:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 11:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 11:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 42K 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 SafeBus-COL-06-00
FORMULA_NAME SafeBus-COL-06-01
FORMULA_NAME SafeBus-COL-06-02
FORMULA_NAME SafeBus-COL-06-03
FORMULA_NAME SafeBus-COL-06-04
FORMULA_NAME SafeBus-COL-06-05
FORMULA_NAME SafeBus-COL-06-06
FORMULA_NAME SafeBus-COL-06-07
FORMULA_NAME SafeBus-COL-06-08
FORMULA_NAME SafeBus-COL-06-09
FORMULA_NAME SafeBus-COL-06-10
FORMULA_NAME SafeBus-COL-06-11
FORMULA_NAME SafeBus-COL-06-12
FORMULA_NAME SafeBus-COL-06-13
FORMULA_NAME SafeBus-COL-06-14
FORMULA_NAME SafeBus-COL-06-15

=== Now, execution of the tool begins

BK_START 1621042307403

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-15 01:31:50] [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 01:31:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 01:31:50] [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 01:31:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1237 ms
[2021-05-15 01:31:51] [INFO ] sort/places :
Dom->AMC,wait_ack,
Dot->cable_free,ACK,T_out,R_tout,S_tout,FMCb,
It->Cpt2,Cpt1,msgl,cable_used,FMC,wait_cable,listen,RMC,PMC,MSG,wait_msg,loop_em,

[2021-05-15 01:31:51] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2021-05-15 01:31:51] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 65 ms.
[2021-05-15 01:31:51] [INFO ] Computed order based on color domains.
[2021-05-15 01:31:51] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions in 31 ms.
[2021-05-15 01:31:51] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 12 places and 12 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 70 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 782 ms. (steps per millisecond=127 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0]
[2021-05-15 01:31:52] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2021-05-15 01:31:52] [INFO ] Computed 29 place invariants in 36 ms
[2021-05-15 01:31:53] [INFO ] [Real]Absence check using 13 positive place invariants in 39 ms returned sat
[2021-05-15 01:31:53] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 12 ms returned unsat
[2021-05-15 01:31:53] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2021-05-15 01:31:53] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 16 ms returned unsat
[2021-05-15 01:31:53] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned unsat
[2021-05-15 01:31:53] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2021-05-15 01:31:53] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 17 ms returned unsat
[2021-05-15 01:31:53] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned unsat
[2021-05-15 01:31:53] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned unsat
[2021-05-15 01:31:53] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2021-05-15 01:31:53] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 10 ms returned unsat
[2021-05-15 01:31:53] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2021-05-15 01:31:53] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 11 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
[2021-05-15 01:31:53] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-15 01:31:53] [INFO ] Flatten gal took : 155 ms
FORMULA SafeBus-COL-06-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-06-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 01:31:53] [INFO ] Applying decomposition
[2021-05-15 01:31:53] [INFO ] Flatten gal took : 76 ms
[2021-05-15 01:31:54] [INFO ] Decomposing Gal with order
[2021-05-15 01:31:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 01:31:54] [INFO ] Removed a total of 1629 redundant transitions.
[2021-05-15 01:31:54] [INFO ] Flatten gal took : 290 ms
[2021-05-15 01:31:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 24 ms.
[2021-05-15 01:31:54] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2021-05-15 01:31:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 16 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SafeBus-COL-06 @ 3570 seconds

FORMULA SafeBus-COL-06-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SafeBus-COL-06-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3475
rslt: Output for LTLCardinality @ SafeBus-COL-06

{
"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 01:31:55 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X (X (G ((F ((p110 + p111 + p112 + p113 + p114 + p115 <= p123)) OR (p109 <= p103 + p104 + p105 + p106 + p107 + p108)))))",
"processed_size": 120,
"rewrites": 42
},
"result":
{
"edges": 29904954,
"markings": 6816763,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 347
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 91,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 49,
"visible_transitions": 0
},
"processed": "X ((G ((X ((p103 + p104 + p105 + p106 + p107 + p108 <= p116 + p117 + p118 + p119 + p120 + p121)) R (p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90 + 1 <= p100 + p101 + p102 + p97 + p98 + p99))) AND (F ((p103 + p104 + p105 + p106 + p107 + p108 <= p116 + p117 + p118 + p119 + p120 + p121)) OR (p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90 <= p123))))",
"processed_size": 612,
"rewrites": 42
},
"result":
{
"edges": 92,
"markings": 92,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 386
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 42,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X (F (((p13 + p14 + p15 + p16 + p17 + p18 <= p116 + p117 + p118 + p119 + p120 + p121) OR (G ((G ((1 <= p103 + p104 + p105 + p106 + p107 + p108)) OR (p13 + p14 + p15 + p16 + p17 + p18 <= p116 + p117 + p118 + p119 + p120 + p121))) AND F ((p13 + p14 + p15 + p16 + p17 + p18 <= p116 + p117 + p118 + p119 + p120 + p121))))))",
"processed_size": 319,
"rewrites": 42
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 11
},
"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": 434
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 43,
"visible_transitions": 0
},
"processed": "X (X ((((p13 + p14 + p15 + p16 + p17 + p18 <= p12) U G ((X (G ((F ((1 <= p132 + p133 + p134 + p135 + p136 + p137)) AND ((1 <= p12) OR (1 <= p132 + p133 + p134 + p135 + p136 + p137))))) OR G ((1 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90))))) OR (1 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90))))",
"processed_size": 570,
"rewrites": 42
},
"result":
{
"edges": 98218,
"markings": 13020,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 29
},
"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": 496
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "F ((X ((((p100 + p101 + p102 + p97 + p98 + p99 <= 2) R (p124 + 1 <= p103 + p104 + p105 + p106 + p107 + p108)) OR (p125 + p126 + p127 + p128 + p129 + p130 <= 0))) OR (p100 + p101 + p102 + p97 + p98 + p99 <= 2)))",
"processed_size": 210,
"rewrites": 42
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"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": 579
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (X (X (F ((X (G ((p125 + p126 + p127 + p128 + p129 + p130 + 1 <= p123))) AND G ((1 <= p122)))))))",
"processed_size": 99,
"rewrites": 42
},
"result":
{
"edges": 91,
"markings": 91,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 5,
"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": 695
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((2 <= p103 + p104 + p105 + p106 + p107 + p108)))",
"processed_size": 54,
"rewrites": 42
},
"result":
{
"edges": 91,
"markings": 91,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 869
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 868
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(p116 + p117 + p118 + p119 + p120 + p121 <= p109)",
"processed_size": 49,
"rewrites": 42
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1158
},
"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": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "G ((p12 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90))",
"processed_size": 190,
"rewrites": 42
},
"result":
{
"edges": 61,
"markings": 61,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1737
},
"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": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "X (F ((p12 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90)))",
"processed_size": 194,
"rewrites": 42
},
"result":
{
"edges": 3912,
"markings": 3913,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1158
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X (X (G ((G ((p103 + p104 + p105 + p106 + p107 + p108 <= 0)) AND (p122 + 1 <= p100 + p101 + p102 + p97 + p98 + p99)))))",
"processed_size": 119,
"rewrites": 42
},
"result":
{
"edges": 91,
"markings": 91,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"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": 1737
},
"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": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G (F ((p125 + p126 + p127 + p128 + p129 + p130 <= p110 + p111 + p112 + p113 + p114 + p115)))",
"processed_size": 92,
"rewrites": 42
},
"result":
{
"edges": 117,
"markings": 114,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3475
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3475
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(2 <= p132 + p133 + p134 + p135 + p136 + p137)",
"processed_size": 46,
"rewrites": 44
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 42
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(2 <= p132 + p133 + p134 + p135 + p136 + p137)",
"processed_size": 46,
"rewrites": 44
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 42
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"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": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "G ((p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90 <= p109))",
"processed_size": 191,
"rewrites": 42
},
"result":
{
"edges": 64,
"markings": 64,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 29608,
"runtime": 95.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(G((F(**) OR **)))) : (G(**) AND F(**)) : X((G((X(**) R *)) AND (F(**) OR **))) : X(F((** OR (G((G(**) OR **)) AND F(**))))) : G(F(**)) : X(X(((** U G((X(G((F(**) AND (** OR **)))) OR G(**)))) OR **))) : F((X(((* R *) OR **)) OR **)) : X(X(X(F((X(G(*)) AND G(**)))))) : X(G(**)) : (G(**) OR (X(F(**)) AND **)) : X(X(G((G(*) AND *))))"
},
"net":
{
"arcs": 2908,
"conflict_clusters": 7,
"places": 138,
"places_significant": 109,
"singleton_clusters": 0,
"transitions": 451
},
"result":
{
"preliminary_value": "yes no no yes no no yes no no yes no ",
"value": "yes no no yes no no yes no 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: 589/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 138
lola: finding significant places
lola: 138 places, 451 transitions, 109 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: X (G ((X (F ((p110 + p111 + p112 + p113 + p114 + p115 <= p123))) OR X ((p109 <= p103 + p104 + p105 + p106 + p107 + p108))))) : (G ((p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90 <= p109)) AND F ((p132 + p133 + p134 + p135 + p136 + p137 <= 1))) : X ((G (NOT((NOT(X ((p103 + p104 + p105 + p106 + p107 + p108 <= p116 + p117 + p118 + p119 + p120 + p121))) U (p100 + p101 + p102 + p97 + p98 + p99 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90)))) AND (F ((p103 + p104 + p105 + p106 + p107 + p108 <= p116 + p117 + p118 + p119 + p120 + p121)) OR (p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90 <= p123)))) : X (F ((G ((G ((1 <= p103 + p104 + p105 + p106 + p107 + p108)) OR ((1 <= 0) U (p13 + p14 + p15 + p16 + p17 + p18 <= p116 + p117 + p118 + p119 + p120 + p121)))) U (p13 + p14 + p15 + p16 + p17 + p18 <= p116 + p117 + p118 + p119 + p120 + p121)))) : F (G (((0 <= 0) U X (X ((X ((1 <= p100 + p101 + p102 + p97 + p98 + p99)) U (p125 + p126 + p127 + p128 + p129 + p130 <= p110 + p111 + p112 + p113 + p114 + p115))))))) : X (X ((((p13 + p14 + p15 + p16 + p17 + p18 <= p12) U G ((X (G (((1 <= p12) U (1 <= p132 + p133 + p134 + p135 + p136 + p137)))) OR G ((1 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90))))) OR (1 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90)))) : F ((X ((NOT(((3 <= p100 + p101 + p102 + p97 + p98 + p99) U (p103 + p104 + p105 + p106 + p107 + p108 <= p124))) OR (p125 + p126 + p127 + p128 + p129 + p130 <= 0))) OR (p100 + p101 + p102 + p97 + p98 + p99 <= 2))) : X (X (F (X ((X (NOT(F ((p123 <= p125 + p126 + p127 + p128 + p129 + p130)))) AND G ((1 <= p122))))))) : (G (X ((2 <= p103 + p104 + p105 + p106 + p107 + p108))) AND (X (((2 <= p103 + p104 + p105 + p106 + p107 + p108))) U (0 <= 0))) : (G ((p12 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90)) OR (F (X ((p12 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90))) AND (p116 + p117 + p118 + p119 + p120 + p121 <= p109))) : G (NOT(X (X ((F ((1 <= p103 + p104 + p105 + p106 + p107 + p108)) OR (p100 + p101 + p102 + p97 + p98 + p99 <= p122))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F ((p110 + p111 + p112 + p113 + p114 + p115 <= p123)) OR (p109 <= p103 + p104 + p105 + p106 + p107 + p108)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F ((p110 + p111 + p112 + p113 + p114 + p115 <= p123)) OR (p109 <= p103 + p104 + p105 + p106 + p107 + p108)))))
lola: processed formula length: 120
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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 773326 markings, 1814814 edges, 154665 markings/sec, 0 secs
lola: 1423466 markings, 3663807 edges, 130028 markings/sec, 5 secs
lola: 1987461 markings, 5429823 edges, 112799 markings/sec, 10 secs
lola: 2483488 markings, 7098317 edges, 99205 markings/sec, 15 secs
lola: 2964769 markings, 8832822 edges, 96256 markings/sec, 20 secs
lola: 3438517 markings, 10614798 edges, 94750 markings/sec, 25 secs
lola: 3895757 markings, 12400342 edges, 91448 markings/sec, 30 secs
lola: 4333869 markings, 14213894 edges, 87622 markings/sec, 35 secs
lola: 4744770 markings, 15969003 edges, 82180 markings/sec, 40 secs
lola: 5159138 markings, 17803414 edges, 82874 markings/sec, 45 secs
lola: 5552091 markings, 19601064 edges, 78591 markings/sec, 50 secs
lola: 5949516 markings, 21469959 edges, 79485 markings/sec, 55 secs
lola: 6332922 markings, 23348081 edges, 76681 markings/sec, 60 secs
lola: 6659537 markings, 25240478 edges, 65323 markings/sec, 65 secs
lola: 6749069 markings, 26704139 edges, 17906 markings/sec, 70 secs
lola: 6791267 markings, 28225439 edges, 8440 markings/sec, 75 secs
lola: 6816645 markings, 29802786 edges, 5076 markings/sec, 80 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: 6816763 markings, 29904954 edges
lola: ========================================
lola: subprocess 1 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((X ((p103 + p104 + p105 + p106 + p107 + p108 <= p116 + p117 + p118 + p119 + p120 + p121)) R (p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90 + 1 <= p100 + p101 + p102 + p97 + p98 + p99))) AND (F ((p103 + p104 + p105 + p106 + p107 + p108 <= p116 + p117 + p118 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((X ((p103 + p104 + p105 + p106 + p107 + p108 <= p116 + p117 + p118 + p119 + p120 + p121)) R (p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90 + 1 <= p100 + p101 + p102 + p97 + p98 + p99))) AND (F ((p103 + p104 + p105 + p106 + p107 + p108 <= p116 + p117 + p118 + p1... (shortened)
lola: processed formula length: 612
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: 92 markings, 92 edges
lola: ========================================
lola: subprocess 2 will run for 386 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p13 + p14 + p15 + p16 + p17 + p18 <= p116 + p117 + p118 + p119 + p120 + p121) OR (G ((G ((1 <= p103 + p104 + p105 + p106 + p107 + p108)) OR (p13 + p14 + p15 + p16 + p17 + p18 <= p116 + p117 + p118 + p119 + p120 + p121))) AND F ((p13 + p14 + p15 + p16 + p17 + p18 <= p116 + p117 + p118 + p119 + p120 + p121))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p13 + p14 + p15 + p16 + p17 + p18 <= p116 + p117 + p118 + p119 + p120 + p121) OR (G ((G ((1 <= p103 + p104 + p105 + p106 + p107 + p108)) OR (p13 + p14 + p15 + p16 + p17 + p18 <= p116 + p117 + p118 + p119 + p120 + p121))) AND F ((p13 + p14 + p15 + p16 + p17 + p18 <= p116 + p117 + p118 + p119 + p120 + p121))))))
lola: processed formula length: 319
lola: 42 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((p13 + p14 + p15 + p16 + p17 + p18 <= p12) U G ((X (G ((F ((1 <= p132 + p133 + p134 + p135 + p136 + p137)) AND ((1 <= p12) OR (1 <= p132 + p133 + p134 + p135 + p136 + p137))))) OR G ((1 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90))))) OR (1 <= p89 + p88 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((p13 + p14 + p15 + p16 + p17 + p18 <= p12) U G ((X (G ((F ((1 <= p132 + p133 + p134 + p135 + p136 + p137)) AND ((1 <= p12) OR (1 <= p132 + p133 + p134 + p135 + p136 + p137))))) OR G ((1 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90))))) OR (1 <= p89 + p88 +... (shortened)
lola: processed formula length: 570
lola: 42 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 29 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: 13020 markings, 98218 edges
lola: ========================================
lola: subprocess 4 will run for 496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((((p100 + p101 + p102 + p97 + p98 + p99 <= 2) R (p124 + 1 <= p103 + p104 + p105 + p106 + p107 + p108)) OR (p125 + p126 + p127 + p128 + p129 + p130 <= 0))) OR (p100 + p101 + p102 + p97 + p98 + p99 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((((p100 + p101 + p102 + p97 + p98 + p99 <= 2) R (p124 + 1 <= p103 + p104 + p105 + p106 + p107 + p108)) OR (p125 + p126 + p127 + p128 + p129 + p130 <= 0))) OR (p100 + p101 + p102 + p97 + p98 + p99 <= 2)))
lola: processed formula length: 210
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: subprocess 5 will run for 579 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((X (G ((p125 + p126 + p127 + p128 + p129 + p130 + 1 <= p123))) AND G ((1 <= p122)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((X (G ((p125 + p126 + p127 + p128 + p129 + p130 + 1 <= p123))) AND G ((1 <= p122)))))))
lola: processed formula length: 99
lola: 42 rewrites
lola: closed formula file LTLCardinality.xml
lola: ========================================
lola: the resulting Büchi automaton has 10 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: 91 markings, 91 edges
lola: ========================================
lola: subprocess 6 will run for 695 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((2 <= p103 + p104 + p105 + p106 + p107 + p108)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((2 <= p103 + p104 + p105 + p106 + p107 + p108)))
lola: processed formula length: 54
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: 91 markings, 91 edges
lola: ========================================
lola: subprocess 7 will run for 869 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p12 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90)) OR (X (F ((p12 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90))) AND (p116... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 868 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p116 + p117 + p118 + p119 + p120 + p121 <= p109)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p116 + p117 + p118 + p119 + p120 + p121 <= p109)
lola: processed formula length: 49
lola: 42 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 1158 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p12 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p12 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90))
lola: processed formula length: 190
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: 61 markings, 61 edges
lola: ========================================
lola: subprocess 9 will run for 1737 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p12 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p12 <= p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90)))
lola: processed formula length: 194
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: 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: 3913 markings, 3912 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 1158 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((G ((p103 + p104 + p105 + p106 + p107 + p108 <= 0)) AND (p122 + 1 <= p100 + p101 + p102 + p97 + p98 + p99)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((G ((p103 + p104 + p105 + p106 + p107 + p108 <= 0)) AND (p122 + 1 <= p100 + p101 + p102 + p97 + p98 + p99)))))
lola: processed formula length: 119
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: 91 markings, 91 edges
lola: ========================================
lola: subprocess 9 will run for 1737 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p125 + p126 + p127 + p128 + p129 + p130 <= p110 + p111 + p112 + p113 + p114 + p115)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p125 + p126 + p127 + p128 + p129 + p130 <= p110 + p111 + p112 + p113 + p114 + p115)))
lola: processed formula length: 92
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: 114 markings, 117 edges
lola: ========================================
lola: subprocess 10 will run for 3475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90 <= p109)) AND F ((p132 + p133 + p134 + p135 + p136 + p137 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p132 + p133 + p134 + p135 + p136 + p137 <= 1))
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: (2 <= p132 + p133 + p134 + p135 + p136 + p137)
lola: processed formula length: 46
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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90 <= p109)) AND F ((p132 + p133 + p134 + p135 + p136 + p137 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((p132 + p133 + p134 + p135 + p136 + p137 <= 1))
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: (2 <= p132 + p133 + p134 + p135 + p136 + p137)
lola: processed formula length: 46
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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90 <= p109))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p89 + p88 + p87 + p86 + p84 + p83 + p82 + p81 + p79 + p78 + p77 + p76 + p74 + p73 + p61 + p62 + p63 + p64 + p72 + p66 + p67 + p68 + p69 + p71 + p70 + p65 + p75 + p80 + p85 + p90 <= p109))
lola: processed formula length: 191
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: 64 markings, 64 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no no yes no no yes no
lola:
preliminary result: yes no no yes no no yes no no yes no
lola: memory consumption: 29608 KB
lola: time consumption: 95 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="SafeBus-COL-06"
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 SafeBus-COL-06, 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 r208-smll-162089471100109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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