Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r166-smll-158987787400257.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-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 itslola
Input is AirplaneLD-PT-0050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787400257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 23K Mar 24 10:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 24 10:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 24 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 24 09:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 20K Apr 8 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 06:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 8 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 06:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 24 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Mar 24 07:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 24 06:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 24 06:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 24 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Mar 24 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 404K Mar 24 05:37 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 AirplaneLD-PT-0050-00
FORMULA_NAME AirplaneLD-PT-0050-01
FORMULA_NAME AirplaneLD-PT-0050-02
FORMULA_NAME AirplaneLD-PT-0050-03
FORMULA_NAME AirplaneLD-PT-0050-04
FORMULA_NAME AirplaneLD-PT-0050-05
FORMULA_NAME AirplaneLD-PT-0050-06
FORMULA_NAME AirplaneLD-PT-0050-07
FORMULA_NAME AirplaneLD-PT-0050-08
FORMULA_NAME AirplaneLD-PT-0050-09
FORMULA_NAME AirplaneLD-PT-0050-10
FORMULA_NAME AirplaneLD-PT-0050-11
FORMULA_NAME AirplaneLD-PT-0050-12
FORMULA_NAME AirplaneLD-PT-0050-13
FORMULA_NAME AirplaneLD-PT-0050-14
FORMULA_NAME AirplaneLD-PT-0050-15

=== Now, execution of the tool begins

BK_START 1591373093935

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 16:04:56] [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]
[2020-06-05 16:04:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 16:04:56] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2020-06-05 16:04:56] [INFO ] Transformed 369 places.
[2020-06-05 16:04:56] [INFO ] Transformed 408 transitions.
[2020-06-05 16:04:56] [INFO ] Found NUPN structural information;
[2020-06-05 16:04:56] [INFO ] Parsed PT model containing 369 places and 408 transitions in 293 ms.
Reduce places removed 152 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 64 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 12577 resets, run finished after 834 ms. (steps per millisecond=119 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 408 rows 217 cols
[2020-06-05 16:04:57] [INFO ] Computed 3 place invariants in 32 ms
[2020-06-05 16:04:57] [INFO ] [Real]Absence check using 2 positive place invariants in 24 ms returned sat
[2020-06-05 16:04:57] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 7 ms returned sat
[2020-06-05 16:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:04:58] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2020-06-05 16:04:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:04:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned unsat
[2020-06-05 16:04:58] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-06-05 16:04:58] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-05 16:04:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:04:58] [INFO ] [Real]Absence check using state equation in 126 ms returned unsat
[2020-06-05 16:04:58] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-06-05 16:04:58] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 7 ms returned sat
[2020-06-05 16:04:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:04:59] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2020-06-05 16:04:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:04:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned unsat
[2020-06-05 16:04:59] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-06-05 16:04:59] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 5 ms returned sat
[2020-06-05 16:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:04:59] [INFO ] [Real]Absence check using state equation in 120 ms returned unsat
[2020-06-05 16:04:59] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-06-05 16:04:59] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 5 ms returned sat
[2020-06-05 16:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 16:04:59] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2020-06-05 16:04:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 16:05:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 99 ms returned sat
[2020-06-05 16:05:00] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 5 ms returned sat
[2020-06-05 16:05:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 16:05:00] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2020-06-05 16:05:00] [INFO ] Computed and/alt/rep : 204/4156/204 causal constraints in 60 ms.
[2020-06-05 16:05:00] [INFO ] Added : 2 causal constraints over 1 iterations in 122 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2020-06-05 16:05:00] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-05 16:05:00] [INFO ] Flatten gal took : 107 ms
FORMULA AirplaneLD-PT-0050-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0050-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 16:05:00] [INFO ] Applying decomposition
[2020-06-05 16:05:00] [INFO ] Flatten gal took : 48 ms
[2020-06-05 16:05:00] [INFO ] Decomposing Gal with order
[2020-06-05 16:05:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 16:05:01] [INFO ] Removed a total of 364 redundant transitions.
[2020-06-05 16:05:01] [INFO ] Flatten gal took : 130 ms
[2020-06-05 16:05:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 200 labels/synchronizations in 16 ms.
[2020-06-05 16:05:01] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2020-06-05 16:05:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ AirplaneLD-PT-0050 @ 3570 seconds

FORMULA AirplaneLD-PT-0050-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0050-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3137
rslt: Output for LTLCardinality @ AirplaneLD-PT-0050

{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 16:05:02 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 604,
"taut": 0,
"tconj": 3,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 153,
"visible_transitions": 0
},
"processed": "X ((X (G ((F ((p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 <= 0)) AND ((p206 <= p100 + p101 + p99 + p98 + p97 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96) OR (p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 <= 0))))) OR (G ((F ((((p102 <= 0)) OR ((1 <= p213)))) OR (1 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202))) AND F (G ((F ((p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 <= 0)) AND ((p206 <= p100 + p101 + p99 + p98 + p97 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96) OR (p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 <= 0))))))))",
"processed_size": 4252,
"rewrites": 91
},
"result":
{
"edges": 14359762,
"markings": 2106622,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 17
},
"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": 503
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 4,
"aconj": 11,
"adisj": 8,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X (X ((((p204 <= 0)) OR ((1 <= p213))))) OR ((((1 <= p204)) AND ((p213 <= 0))) OR (G (F (((((p102 <= 0)) OR ((1 <= p212))) AND (((p204 <= 0)) OR ((1 <= p213)))))) AND F ((X (X ((((p204 <= 0)) OR ((1 <= p213))))) OR (((1 <= p204)) AND ((p213 <= 0)))))))))",
"processed_size": 262,
"rewrites": 91
},
"result":
{
"edges": 60678750,
"markings": 15793796,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 557
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((X (F ((((p205 <= 0)) OR ((1 <= p210))))) OR (((1 <= p205)) AND ((p203 <= 0))))))",
"processed_size": 88,
"rewrites": 91
},
"result":
{
"edges": 35578047,
"markings": 8942444,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 647
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 5,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F (G ((((p216 <= 0)) OR ((1 <= p203))))) AND G (((((p51 <= 0)) OR ((1 <= p209))) OR G ((((p216 <= 0)) OR ((1 <= p203))))))))",
"processed_size": 131,
"rewrites": 91
},
"result":
{
"edges": 12274229,
"markings": 2637633,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 799
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p214))))",
"processed_size": 21,
"rewrites": 91
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"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": 1065
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((G (((1 <= p205))) AND (F (((1 <= p102))) OR G (((1 <= p205))))) OR F (((1 <= p214)))))",
"processed_size": 91,
"rewrites": 91
},
"result":
{
"edges": 1037910,
"markings": 525410,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1596
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 5,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G (((p102 <= 0) OR ((p214 <= 0)) OR ((1 <= p210)))) OR (X (F (((1 <= p206)))) AND ((p102 <= 0) OR ((p214 <= 0)) OR ((1 <= p210))))))",
"processed_size": 140,
"rewrites": 91
},
"result":
{
"edges": 17647072,
"markings": 3946023,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 3138
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((1 <= p51)) AND ((p213 <= 0)))",
"processed_size": 32,
"rewrites": 93
},
"result":
{
"edges": 22662,
"markings": 20263,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 151
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"error": null,
"memory": 30232,
"runtime": 433.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((X(G((F(**) AND (** OR **)))) OR (G((F(**) OR **)) AND F(G((F(**) AND (** OR **))))))) : F(**) : G((X(X(**)) OR (** OR (G(F(**)) AND F((X(X(**)) OR **)))))) : G(F((X(F(**)) OR **))) : X((F(G(*)) AND G((** OR G(*))))) : X(G(**)) : X(((G(**) AND (F(**) OR G(**))) OR F(**))) : F((G(*) OR (X(F(*)) AND *)))"
},
"net":
{
"arcs": 1145,
"conflict_clusters": 13,
"places": 217,
"places_significant": 214,
"singleton_clusters": 0,
"transitions": 408
},
"result":
{
"preliminary_value": "no yes no yes no no no yes ",
"value": "no yes no yes no 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: 625/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6944
lola: finding significant places
lola: 217 places, 408 transitions, 214 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 true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p209 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p214 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p102 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: NOT(X (NOT((G ((F ((((p102 <= 0)) OR ((1 <= p213)))) OR (1 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202))) U X (G (((p206 <= p100 + p101 + p99 + p98 + p97 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96) U (p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 <= 0)))))))) : F ((((1 <= 0) U ((1 <= p210))) U (((p51 <= 0)) OR ((1 <= p213))))) : G ((X (G (F (((((p102 <= 0)) OR ((1 <= p212))) AND (((p204 <= 0)) OR ((1 <= p213))))))) U (X (X ((((p204 <= 0)) OR ((1 <= p213))))) OR (((1 <= p204)) AND ((p213 <= 0)))))) : G (F ((F (X ((((p205 <= 0)) OR ((1 <= p210))))) OR (((1 <= p205)) AND ((p203 <= 0)))))) : X (G (((((p51 <= 0)) OR ((1 <= p209))) U NOT(F ((((1 <= p216)) AND ((p203 <= 0)))))))) : G (X (((1 <= p214)))) : X ((NOT((NOT(F (((1 <= p102)))) U NOT(G (((1 <= p205)))))) OR F (((1 <= p214))))) : NOT(G ((G (X (G (((p206 <= 0))))) U ((1 <= p102) AND ((1 <= p214)) AND ((p210 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((F ((p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((F ((p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + ... (shortened)
lola: processed formula length: 4252
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 17 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: 312038 markings, 1991148 edges, 62408 markings/sec, 0 secs
lola: 621215 markings, 3970495 edges, 61835 markings/sec, 5 secs
lola: 911486 markings, 5892743 edges, 58054 markings/sec, 10 secs
lola: 1115016 markings, 7482527 edges, 40706 markings/sec, 15 secs
lola: 1365540 markings, 9172460 edges, 50105 markings/sec, 20 secs
lola: 1637022 markings, 10978748 edges, 54296 markings/sec, 25 secs
lola: 1925000 markings, 12881768 edges, 57596 markings/sec, 30 secs
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: 2106622 markings, 14359762 edges
lola: ========================================
lola: subprocess 1 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X ((((p204 <= 0)) OR ((1 <= p213))))) OR ((((1 <= p204)) AND ((p213 <= 0))) OR (G (F (((((p102 <= 0)) OR ((1 <= p212))) AND (((p204 <= 0)) OR ((1 <= p213)))))) AND F ((X (X ((((p204 <= 0)) OR ((1 <= p213))))) OR (((1 <= p204)) AND ((p213 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X ((((p204 <= 0)) OR ((1 <= p213))))) OR ((((1 <= p204)) AND ((p213 <= 0))) OR (G (F (((((p102 <= 0)) OR ((1 <= p212))) AND (((p204 <= 0)) OR ((1 <= p213)))))) AND F ((X (X ((((p204 <= 0)) OR ((1 <= p213))))) OR (((1 <= p204)) AND ((p213 <= 0)))))))))
lola: processed formula length: 262
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
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: 580686 markings, 1465959 edges, 116137 markings/sec, 0 secs
lola: 1048843 markings, 3147128 edges, 93631 markings/sec, 5 secs
lola: 1269919 markings, 4926631 edges, 44215 markings/sec, 10 secs
lola: 1490027 markings, 6747062 edges, 44022 markings/sec, 15 secs
lola: 1818605 markings, 8491254 edges, 65716 markings/sec, 20 secs
lola: 2398314 markings, 10204528 edges, 115942 markings/sec, 25 secs
lola: 2965392 markings, 11948431 edges, 113416 markings/sec, 30 secs
lola: 3303845 markings, 13269686 edges, 67691 markings/sec, 35 secs
lola: 3795227 markings, 14876217 edges, 98276 markings/sec, 40 secs
lola: 4395519 markings, 16651881 edges, 120058 markings/sec, 45 secs
lola: 4908960 markings, 18337012 edges, 102688 markings/sec, 50 secs
lola: 5282151 markings, 19896499 edges, 74638 markings/sec, 55 secs
lola: 5800774 markings, 21408319 edges, 103725 markings/sec, 60 secs
lola: 6366957 markings, 23068634 edges, 113237 markings/sec, 65 secs
lola: 6798499 markings, 24546940 edges, 86308 markings/sec, 70 secs
lola: 7162918 markings, 25949401 edges, 72884 markings/sec, 75 secs
lola: 7565518 markings, 27496029 edges, 80520 markings/sec, 80 secs
lola: 8059362 markings, 29191879 edges, 98769 markings/sec, 85 secs
lola: 8560503 markings, 30929685 edges, 100228 markings/sec, 90 secs
lola: 9074111 markings, 32705040 edges, 102722 markings/sec, 95 secs
lola: 9599546 markings, 34515331 edges, 105087 markings/sec, 100 secs
lola: 10056104 markings, 36321929 edges, 91312 markings/sec, 105 secs
lola: 10256201 markings, 37670915 edges, 40019 markings/sec, 110 secs
lola: 10495060 markings, 39271255 edges, 47772 markings/sec, 115 secs
lola: 11019271 markings, 40976920 edges, 104842 markings/sec, 120 secs
lola: 11617443 markings, 42747410 edges, 119634 markings/sec, 125 secs
lola: 12067047 markings, 44308682 edges, 89921 markings/sec, 130 secs
lola: 12456666 markings, 45860000 edges, 77924 markings/sec, 135 secs
lola: 12838024 markings, 47441250 edges, 76272 markings/sec, 140 secs
lola: 13272043 markings, 49165577 edges, 86804 markings/sec, 145 secs
lola: 13718352 markings, 50923264 edges, 89262 markings/sec, 150 secs
lola: 14168826 markings, 52692002 edges, 90095 markings/sec, 155 secs
lola: 14602655 markings, 54415995 edges, 86766 markings/sec, 160 secs
lola: 15075370 markings, 56277353 edges, 94543 markings/sec, 165 secs
lola: 15378630 markings, 57871340 edges, 60652 markings/sec, 170 secs
lola: 15583526 markings, 59254395 edges, 40979 markings/sec, 175 secs
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: 15793796 markings, 60678750 edges
lola: ========================================
lola: subprocess 2 will run for 557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (F ((((p205 <= 0)) OR ((1 <= p210))))) OR (((1 <= p205)) AND ((p203 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (F ((((p205 <= 0)) OR ((1 <= p210))))) OR (((1 <= p205)) AND ((p203 <= 0))))))
lola: processed formula length: 88
lola: 91 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: 532662 markings, 1757170 edges, 106532 markings/sec, 0 secs
lola: 879742 markings, 3373360 edges, 69416 markings/sec, 5 secs
lola: 1323230 markings, 5094389 edges, 88698 markings/sec, 10 secs
lola: 1845296 markings, 6829328 edges, 104413 markings/sec, 15 secs
lola: 2267841 markings, 8367248 edges, 84509 markings/sec, 20 secs
lola: 2693138 markings, 10030342 edges, 85059 markings/sec, 25 secs
lola: 3167842 markings, 11694751 edges, 94941 markings/sec, 30 secs
lola: 3507816 markings, 13249421 edges, 67995 markings/sec, 35 secs
lola: 4021118 markings, 14948228 edges, 102660 markings/sec, 40 secs
lola: 4330639 markings, 16446246 edges, 61904 markings/sec, 45 secs
lola: 4832340 markings, 18170157 edges, 100340 markings/sec, 50 secs
lola: 5221734 markings, 19762326 edges, 77879 markings/sec, 55 secs
lola: 5784519 markings, 21400073 edges, 112557 markings/sec, 60 secs
lola: 6052673 markings, 22812689 edges, 53631 markings/sec, 65 secs
lola: 6574352 markings, 24506231 edges, 104336 markings/sec, 70 secs
lola: 6952860 markings, 26136890 edges, 75702 markings/sec, 75 secs
lola: 7363462 markings, 27826558 edges, 82120 markings/sec, 80 secs
lola: 7676580 markings, 29512754 edges, 62624 markings/sec, 85 secs
lola: 8126522 markings, 31292578 edges, 89988 markings/sec, 90 secs
lola: 8402839 markings, 32909362 edges, 55263 markings/sec, 95 secs
lola: 8855450 markings, 34708066 edges, 90522 markings/sec, 100 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: 8942444 markings, 35578047 edges
lola: ========================================
lola: subprocess 3 will run for 647 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((((p216 <= 0)) OR ((1 <= p203))))) AND G (((((p51 <= 0)) OR ((1 <= p209))) OR G ((((p216 <= 0)) OR ((1 <= p203))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((((p216 <= 0)) OR ((1 <= p203))))) AND G (((((p51 <= 0)) OR ((1 <= p209))) OR G ((((p216 <= 0)) OR ((1 <= p203))))))))
lola: processed formula length: 131
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 458187 markings, 1613607 edges, 91637 markings/sec, 0 secs
lola: 846699 markings, 3270431 edges, 77702 markings/sec, 5 secs
lola: 1238766 markings, 4874719 edges, 78413 markings/sec, 10 secs
lola: 1584339 markings, 6520241 edges, 69115 markings/sec, 15 secs
lola: 1848371 markings, 7964355 edges, 52806 markings/sec, 20 secs
lola: 2143669 markings, 9509591 edges, 59060 markings/sec, 25 secs
lola: 2463235 markings, 11132303 edges, 63913 markings/sec, 30 secs
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: 2637633 markings, 12274229 edges
lola: ========================================
lola: subprocess 4 will run for 799 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p214))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p214))))
lola: processed formula length: 21
lola: 91 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 1065 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G (((1 <= p205))) AND (F (((1 <= p102))) OR G (((1 <= p205))))) OR F (((1 <= p214)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G (((1 <= p205))) AND (F (((1 <= p102))) OR G (((1 <= p205))))) OR F (((1 <= p214)))))
lola: processed formula length: 91
lola: 91 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: 525410 markings, 1037910 edges
lola: ========================================
lola: subprocess 6 will run for 1596 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p102 <= 0) OR ((p214 <= 0)) OR ((1 <= p210)))) OR (X (F (((1 <= p206)))) AND ((p102 <= 0) OR ((p214 <= 0)) OR ((1 <= p210))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p102 <= 0) OR ((p214 <= 0)) OR ((1 <= p210)))) OR (X (F (((1 <= p206)))) AND ((p102 <= 0) OR ((p214 <= 0)) OR ((1 <= p210))))))
lola: processed formula length: 140
lola: 91 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: 404161 markings, 1615571 edges, 80832 markings/sec, 0 secs
lola: 786189 markings, 3372013 edges, 76406 markings/sec, 5 secs
lola: 1163672 markings, 4996777 edges, 75497 markings/sec, 10 secs
lola: 1543027 markings, 6604699 edges, 75871 markings/sec, 15 secs
lola: 1904438 markings, 8233510 edges, 72282 markings/sec, 20 secs
lola: 2257367 markings, 9837771 edges, 70586 markings/sec, 25 secs
lola: 2607331 markings, 11350479 edges, 69993 markings/sec, 30 secs
lola: 2950417 markings, 12925860 edges, 68617 markings/sec, 35 secs
lola: 3330320 markings, 14517968 edges, 75981 markings/sec, 40 secs
lola: 3682690 markings, 16037038 edges, 70474 markings/sec, 45 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: 3946023 markings, 17647072 edges
lola: subprocess 7 will run for 3138 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p51 <= 0)) OR ((1 <= p213))))
lola: ========================================
lola: SUBTASK
lola: lola: checking eventual occurrence========================================

lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((1 <= p51)) AND ((p213 <= 0)))
lola: processed formula length: 32
lola: 93 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: 20263 markings, 22662 edges
lola: RESULT
lola:
SUMMARY: no yes no yes no no no yes
lola:
preliminary result: no yes no yes no no no yes
lola: ========================================
lola: memory consumption: 30232 KB
lola: time consumption: 433 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="AirplaneLD-PT-0050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is AirplaneLD-PT-0050, 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 r166-smll-158987787400257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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