fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987914200681
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for CSRepetitions-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.070 3600000.00 27618.00 180.00 FFFFFTFFFFTTFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987914200681.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is CSRepetitions-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914200681
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 23K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 33K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 56K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 176K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.0K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 279K Apr 27 15:14 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 CSRepetitions-PT-05-00
FORMULA_NAME CSRepetitions-PT-05-01
FORMULA_NAME CSRepetitions-PT-05-02
FORMULA_NAME CSRepetitions-PT-05-03
FORMULA_NAME CSRepetitions-PT-05-04
FORMULA_NAME CSRepetitions-PT-05-05
FORMULA_NAME CSRepetitions-PT-05-06
FORMULA_NAME CSRepetitions-PT-05-07
FORMULA_NAME CSRepetitions-PT-05-08
FORMULA_NAME CSRepetitions-PT-05-09
FORMULA_NAME CSRepetitions-PT-05-10
FORMULA_NAME CSRepetitions-PT-05-11
FORMULA_NAME CSRepetitions-PT-05-12
FORMULA_NAME CSRepetitions-PT-05-13
FORMULA_NAME CSRepetitions-PT-05-14
FORMULA_NAME CSRepetitions-PT-05-15

=== Now, execution of the tool begins

BK_START 1591171505114

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 08:05:09] [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-03 08:05:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 08:05:09] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2020-06-03 08:05:09] [INFO ] Transformed 206 places.
[2020-06-03 08:05:09] [INFO ] Transformed 325 transitions.
[2020-06-03 08:05:09] [INFO ] Parsed PT model containing 206 places and 325 transitions in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 59 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1624 resets, run finished after 637 ms. (steps per millisecond=156 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 325 rows 206 cols
[2020-06-03 08:05:10] [INFO ] Computed 30 place invariants in 16 ms
[2020-06-03 08:05:10] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned unsat
[2020-06-03 08:05:10] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned unsat
[2020-06-03 08:05:10] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned unsat
[2020-06-03 08:05:10] [INFO ] [Real]Absence check using 30 positive place invariants in 3 ms returned unsat
[2020-06-03 08:05:11] [INFO ] [Real]Absence check using 30 positive place invariants in 28 ms returned unsat
[2020-06-03 08:05:11] [INFO ] [Real]Absence check using 30 positive place invariants in 6 ms returned unsat
[2020-06-03 08:05:11] [INFO ] [Real]Absence check using 30 positive place invariants in 48 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 8 simplifications.
[2020-06-03 08:05:11] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 08:05:11] [INFO ] Flatten gal took : 111 ms
FORMULA CSRepetitions-PT-05-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-05-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-05-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-05-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-05-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-05-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 08:05:11] [INFO ] Flatten gal took : 53 ms
[2020-06-03 08:05:11] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2020-06-03 08:05:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CSRepetitions-PT-05 @ 3570 seconds

FORMULA CSRepetitions-PT-05-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-05-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-05-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-05-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-05-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-05-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-05-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-05-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-05-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-PT-05-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3559
rslt: Output for LTLCardinality @ CSRepetitions-PT-05

{
"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": "Wed Jun 3 08:05:12 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "X ((G ((p86 <= 2)) AND F ((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 + 1 <= p4 + p100 + p187 + p191 + p38))))",
"processed_size": 225,
"rewrites": 63
},
"result":
{
"edges": 64,
"markings": 64,
"produced_by": "LTL model checker",
"value": false
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "(F (((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 <= p4 + p100 + p187 + p191 + p38) R F ((2 <= p4 + p100 + p187 + p191 + p38)))) U X (G ((p86 <= 1))))",
"processed_size": 264,
"rewrites": 63
},
"result":
{
"edges": 204969,
"markings": 41138,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((((p19 <= 0) R (p101 + 1 <= p86)) AND ((p38 + 1 <= p86) AND (X ((p101 + 1 <= p86)) OR (p101 + 1 <= p86)))) U G ((p38 + 1 <= p86)))",
"processed_size": 131,
"rewrites": 63
},
"result":
{
"edges": 64,
"markings": 64,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": 5,
"visible_transitions": 0
},
"processed": "X (F ((X ((G ((p113 <= p6)) AND F ((p181 <= p86)))) OR F ((p187 + 1 <= p86)))))",
"processed_size": 79,
"rewrites": 63
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "LTL model checker",
"value": true
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 50,
"visible_transitions": 0
},
"processed": "G (F ((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126)))",
"processed_size": 331,
"rewrites": 63
},
"result":
{
"edges": 28386,
"markings": 10503,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((G ((p86 <= p146)) OR (2 <= p86)))",
"processed_size": 37,
"rewrites": 63
},
"result":
{
"edges": 56,
"markings": 56,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": 2,
"visible_transitions": 0
},
"processed": "F (G ((F ((p177 <= p6)) AND (((p177 <= p6)) OR (p177 <= p6)))))",
"processed_size": 63,
"rewrites": 63
},
"result":
{
"edges": 223,
"markings": 106,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 281,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 156,
"visible_transitions": 0
},
"processed": "G ((F ((3 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126)) AND ((p1 + p2 + p5 + p6 + p7 + p9 + p103 + p104 + p105 + p108 + p109 + p110 + p112 + p114 + p116 + p117 + p118 + p120 + p121 + p124 + p125 + p94 + p127 + p128 + p129 + p132 + p135 + p91 + p139 + p140 + p142 + p144 + p147 + p148 + p149 + p150 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p90 + p165 + p166 + p167 + p168 + p170 + p172 + p173 + p174 + p175 + p176 + p180 + p89 + p88 + p87 + p186 + p189 + p190 + p193 + p194 + p195 + p196 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p10 + p12 + p13 + p16 + p17 + p18 + p85 + p21 + p22 + p24 + p84 + p26 + p27 + p28 + p83 + p30 + p32 + p33 + p34 + p36 + p37 + p81 + p80 + p79 + p43 + p78 + p47 + p48 + p49 + p50 + p51 + p77 + p76 + p54 + p55 + p74 + p57 + p58 + p59 + p71 + p64 + p65 + p70 + p68 + p69 + p92 + p93 + p95 + p97 + p98 + 1 <= p4 + p100 + p187 + p191 + p38) OR (p1 + p2 + p5 + p6 + p7 + p9 + p103 + p104 + p105 + p108 + p109 + p110 + p112 + p114 + p116 + p117 + p118 + p120 + p121 + p124 + p125 + p94 + p127 + p128 + p129 + p132 + p135 + p91 + p139 + p140 + p142 + p144 + p147 + p148 + p149 + p150 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p90 + p165 + p166 + p167 + p168 + p170 + p172 + p173 + p174 + p175 + p176 + p180 + p89 + p88 + p87 + p186 + p189 + p190 + p193 + p194 + p195 + p196 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p10 + p12 + p13 + p16 + p17 + p18 + p85 + p21 + p22 + p24 + p84 + p26 + p27 + p28 + p83 + p30 + p32 + p33 + p34 + p36 + p37 + p81 + p80 + p79 + p43 + p78 + p47 + p48 + p49 + p50 + p51 + p77 + p76 + p54 + p55 + p74 + p57 + p58 + p59 + p71 + p64 + p65 + p70 + p68 + p69 + p92 + p93 + p95 + p97 + p98 + 1 <= p86))))",
"processed_size": 1849,
"rewrites": 63
},
"result":
{
"edges": 40,
"markings": 40,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 1783
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 26,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 26,
"visible_transitions": 0
},
"processed": "G (F ((p86 + 1 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126)))",
"processed_size": 181,
"rewrites": 63
},
"result":
{
"edges": 122,
"markings": 116,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"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": 50,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 50,
"visible_transitions": 0
},
"processed": "F (G ((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126)))",
"processed_size": 331,
"rewrites": 63
},
"result":
{
"edges": 6719605,
"markings": 822491,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3559
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((p4 + p100 + p187 + p191 + p38 <= 2)))",
"processed_size": 44,
"rewrites": 63
},
"result":
{
"edges": 50,
"markings": 49,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((p4 + p100 + p187 + p191 + p38 <= 2)))",
"processed_size": 44,
"rewrites": 63
},
"result":
{
"edges": 50,
"markings": 49,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 276,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 151,
"visible_transitions": 0
},
"processed": "G (((p1 + p2 + p5 + p6 + p7 + p9 + p103 + p104 + p105 + p108 + p109 + p110 + p112 + p114 + p116 + p117 + p118 + p120 + p121 + p124 + p125 + p94 + p127 + p128 + p129 + p132 + p135 + p91 + p139 + p140 + p142 + p144 + p147 + p148 + p149 + p150 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p90 + p165 + p166 + p167 + p168 + p170 + p172 + p173 + p174 + p175 + p176 + p180 + p89 + p88 + p87 + p186 + p189 + p190 + p193 + p194 + p195 + p196 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p10 + p12 + p13 + p16 + p17 + p18 + p85 + p21 + p22 + p24 + p84 + p26 + p27 + p28 + p83 + p30 + p32 + p33 + p34 + p36 + p37 + p81 + p80 + p79 + p43 + p78 + p47 + p48 + p49 + p50 + p51 + p77 + p76 + p54 + p55 + p74 + p57 + p58 + p59 + p71 + p64 + p65 + p70 + p68 + p69 + p92 + p93 + p95 + p97 + p98 + 1 <= p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99) R (p86 + 1 <= p1 + p2 + p5 + p6 + p7 + p9 + p103 + p104 + p105 + p108 + p109 + p110 + p112 + p114 + p116 + p117 + p118 + p120 + p121 + p124 + p125 + p94 + p127 + p128 + p129 + p132 + p135 + p91 + p139 + p140 + p142 + p144 + p147 + p148 + p149 + p150 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p90 + p165 + p166 + p167 + p168 + p170 + p172 + p173 + p174 + p175 + p176 + p180 + p89 + p88 + p87 + p186 + p189 + p190 + p193 + p194 + p195 + p196 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p10 + p12 + p13 + p16 + p17 + p18 + p85 + p21 + p22 + p24 + p84 + p26 + p27 + p28 + p83 + p30 + p32 + p33 + p34 + p36 + p37 + p81 + p80 + p79 + p43 + p78 + p47 + p48 + p49 + p50 + p51 + p77 + p76 + p54 + p55 + p74 + p57 + p58 + p59 + p71 + p64 + p65 + p70 + p68 + p69 + p92 + p93 + p95 + p97 + p98)))",
"processed_size": 1797,
"rewrites": 63
},
"result":
{
"edges": 39,
"markings": 39,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 26872,
"runtime": 11.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(G(**)) OR (G(F(*)) AND F(G(**)))) : G((F(**) AND *)) : X((G(*) AND F(**))) : (F((* R F(*))) U X(G(*))) : G(F(*)) : (F(G(*)) OR G((* R *))) : (((* R *) AND (** AND (X(*) OR **))) U G(**)) : X(F((X((G(**) AND F(**))) OR F(**)))) : G((G(*) OR **)) : F(G((F(**) AND (** OR **))))"
},
"net":
{
"arcs": 1175,
"conflict_clusters": 27,
"places": 206,
"places_significant": 176,
"singleton_clusters": 0,
"transitions": 325
},
"result":
{
"preliminary_value": "no no no no no no no yes no no ",
"value": "no no no no no no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 531/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6592
lola: finding significant places
lola: 206 places, 325 transitions, 176 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always false: (3 <= p181)
lola: (((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 <= p1 + p2 + p5 + p6 + p7 + p9 + p103 + p104 + p105 + p108 + p109 + p110 + p112 + p114 + p116 + p117 + p118 + p120 + p121 + p124 + p125 + p94 + p127 + p128 + p129 + p132 + p135 + p91 + p139 + p140 + p142 + p144 + p147 + p148 + p149 + p150 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p90 + p165 + p166 + p167 + p168 + p170 + p172 + p173 + p174 + p175 + p176 + p180 + p89 + p88 + p87 + p186 + p189 + p190 + p193 + p194 + p195 + p196 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p10 + p12 + p13 + p16 + p17 + p18 + p85 + p21 + p22 + p24 + p84 + p26 + p27 + p28 + p83 + p30 + p32 + p33 + p34 + p36 + p37 + p81 + p80 + p79 + p43 + p78 + p47 + p48 + p49 + p50 + p51 + p77 + p76 + p54 + p55 + p74 + p57 + p58 + p59 + p71 + p64 + p65 + p70 + p68 + p69 + p92 + p93 + p95 + p97 + p98) U F (G (NOT(G ((p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126 <= p86)))))) U F (G ((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126)))) : G ((G (((0 <= 0) U (3 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126))) AND NOT(F (((p4 + p100 + p187 + p191 + p38 <= p1 + p2 + p5 + p6 + p7 + p9 + p103 + p104 + p105 + p108 + p109 + p110 + p112 + p114 + p116 + p117 + p118 + p120 + p121 + p124 + p125 + p94 + p127 + p128 + p129 + p132 + p135 + p91 + p139 + p140 + p142 + p144 + p147 + p148 + p149 + p150 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p90 + p165 + p166 + p167 + p168 + p170 + p172 + p173 + p174 + p175 + p176 + p180 + p89 + p88 + p87 + p186 + p189 + p190 + p193 + p194 + p195 + p196 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p10 + p12 + p13 + p16 + p17 + p18 + p85 + p21 + p22 + p24 + p84 + p26 + p27 + p28 + p83 + p30 + p32 + p33 + p34 + p36 + p37 + p81 + p80 + p79 + p43 + p78 + p47 + p48 + p49 + p50 + p51 + p77 + p76 + p54 + p55 + p74 + p57 + p58 + p59 + p71 + p64 + p65 + p70 + p68 + p69 + p92 + p93 + p95 + p97 + p98) AND (p86 <= p1 + p2 + p5 + p6 + p7 + p9 + p103 + p104 + p105 + p108 + p109 + p110 + p112 + p114 + p116 + p117 + p118 + p120 + p121 + p124 + p125 + p94 + p127 + p128 + p129 + p132 + p135 + p91 + p139 + p140 + p142 + p144 + p147 + p148 + p149 + p150 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p90 + p165 + p166 + p167 + p168 + p170 + p172 + p173 + p174 + p175 + p176 + p180 + p89 + p88 + p87 + p186 + p189 + p190 + p193 + p194 + p195 + p196 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p10 + p12 + p13 + p16 + p17 + p18 + p85 + p21 + p22 + p24 + p84 + p26 + p27 + p28 + p83 + p30 + p32 + p33 + p34 + p36 + p37 + p81 + p80 + p79 + p43 + p78 + p47 + p48 + p49 + p50 + p51 + p77 + p76 + p54 + p55 + p74 + p57 + p58 + p59 + p71 + p64 + p65 + p70 + p68 + p69 + p92 + p93 + p95 + p97 + p98)))))) : (NOT(F (X ((3 <= p86)))) AND F (X ((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 + 1 <= p4 + p100 + p187 + p191 + p38)))) : (F (NOT(((p4 + p100 + p187 + p191 + p38 + 1 <= p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99) U G ((p4 + p100 + p187 + p191 + p38 <= 1))))) U G (NOT(X ((2 <= p86))))) : G (NOT(G (((0 <= 0) U F (G (X ((p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126 + 1 <= p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99)))))))) : (X (F (NOT(G (F ((3 <= p4 + p100 + p187 + p191 + p38)))))) OR G (NOT(((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 <= p1 + p2 + p5 + p6 + p7 + p9 + p103 + p104 + p105 + p108 + p109 + p110 + p112 + p114 + p116 + p117 + p118 + p120 + p121 + p124 + p125 + p94 + p127 + p128 + p129 + p132 + p135 + p91 + p139 + p140 + p142 + p144 + p147 + p148 + p149 + p150 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p90 + p165 + p166 + p167 + p168 + p170 + p172 + p173 + p174 + p175 + p176 + p180 + p89 + p88 + p87 + p186 + p189 + p190 + p193 + p194 + p195 + p196 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p10 + p12 + p13 + p16 + p17 + p18 + p85 + p21 + p22 + p24 + p84 + p26 + p27 + p28 + p83 + p30 + p32 + p33 + p34 + p36 + p37 + p81 + p80 + p79 + p43 + p78 + p47 + p48 + p49 + p50 + p51 + p77 + p76 + p54 + p55 + p74 + p57 + p58 + p59 + p71 + p64 + p65 + p70 + p68 + p69 + p92 + p93 + p95 + p97 + p98) U (p1 + p2 + p5 + p6 + p7 + p9 + p103 + p104 + p105 + p108 + p109 + p110 + p112 + p114 + p116 + p117 + p118 + p120 + p121 + p124 + p125 + p94 + p127 + p128 + p129 + p132 + p135 + p91 + p139 + p140 + p142 + p144 + p147 + p148 + p149 + p150 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p90 + p165 + p166 + p167 + p168 + p170 + p172 + p173 + p174 + p175 + p176 + p180 + p89 + p88 + p87 + p186 + p189 + p190 + p193 + p194 + p195 + p196 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p10 + p12 + p13 + p16 + p17 + p18 + p85 + p21 + p22 + p24 + p84 + p26 + p27 + p28 + p83 + p30 + p32 + p33 + p34 + p36 + p37 + p81 + p80 + p79 + p43 + p78 + p47 + p48 + p49 + p50 + p51 + p77 + p76 + p54 + p55 + p74 + p57 + p58 + p59 + p71 + p64 + p65 + p70 + p68 + p69 + p92 + p93 + p95 + p97 + p98 <= p86))))) : (((NOT(((1 <= p19) U (p86 <= p101))) AND (p38 + 1 <= p86)) AND (NOT(X ((p86 <= p101))) OR (p101 + 1 <= p86))) U G ((p38 + 1 <= p86))) : F (X ((X ((G ((p113 <= p6)) AND F ((p181 <= p86)))) OR F ((p187 + 1 <= p86))))) : G ((NOT(F ((X ((G ((2 <= p86)) AND (p86 <= p146))) U (p146 + 1 <= p86)))) OR (2 <= p86))) : X (G (X (F (G (((1 <= 0) U F (G ((((p177 <= p6)) U (p177 <= p6))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((p86 <= 2)) AND F ((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 + 1 <= p4 + p100 + p187 + p191 + p38))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((p86 <= 2)) AND F ((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 + 1 <= p4 + p100 + p187 + p191 + p38))))
lola: processed formula length: 225
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 64 markings, 64 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 <= p4 + p100 + p187 + p191 + p38) R F ((2 <= p4 + p100 + p187 + p191 + p38)))) U X (G ((p86 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 <= p4 + p100 + p187 + p191 + p38) R F ((2 <= p4 + p100 + p187 + p191 + p38)))) U X (G ((p86 <= 1))))
lola: processed formula length: 264
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 41138 markings, 204969 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p19 <= 0) R (p101 + 1 <= p86)) AND ((p38 + 1 <= p86) AND (X ((p101 + 1 <= p86)) OR (p101 + 1 <= p86)))) U G ((p38 + 1 <= p86)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p19 <= 0) R (p101 + 1 <= p86)) AND ((p38 + 1 <= p86) AND (X ((p101 + 1 <= p86)) OR (p101 + 1 <= p86)))) U G ((p38 + 1 <= p86)))
lola: processed formula length: 131
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 64 markings, 64 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((G ((p113 <= p6)) AND F ((p181 <= p86)))) OR F ((p187 + 1 <= p86)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((G ((p113 <= p6)) AND F ((p181 <= p86)))) OR F ((p187 + 1 <= p86)))))
lola: processed formula length: 79
lola: 63 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: 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: 26 markings, 25 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126)))
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 ((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126)))
lola: processed formula length: 331
lola: 63 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: 10503 markings, 28386 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((p86 <= p146)) OR (2 <= p86)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((p86 <= p146)) OR (2 <= p86)))
lola: processed formula length: 37
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 56 markings, 56 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p177 <= p6)) AND (((p177 <= p6)) OR (p177 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p177 <= p6)) AND (((p177 <= p6)) OR (p177 <= p6)))))
lola: processed formula length: 63
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 106 markings, 223 edges
lola: ========================================
lola: subprocess 7 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((3 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126)) AND ((p1 + p2 + p5 + p6 + p7 + p9 + p103 + p104 + p105 + p108 + p109 + p110 + p112 + p114 + p116 + p117 + p118 + p120 + p121 + p124 + p125 + p94 + p127 + p128 + p129 + p132 + p135 + p91 + p139 + p140 + p142 + p144 + p147 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((3 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126)) AND ((p1 + p2 + p5 + p6 + p7 + p9 + p103 + p104 + p105 + p108 + p109 + p110 + p112 + p114 + p116 + p117 + p118 + p120 + p121 + p124 + p125 + p94 + p127 + p128 + p129 + p132 + p135 + p91 + p139 + p140 + p142 + p144 + p147 + p... (shortened)
lola: processed formula length: 1849
lola: 63 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 40 markings, 40 edges
lola: ========================================
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126))) OR (G (F ((p86 + 1 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p86 + 1 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126)))
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 ((p86 + 1 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126)))
lola: processed formula length: 181
lola: 63 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: 116 markings, 122 edges
lola: ========================================
lola: subprocess 9 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p0 + p8 + p115 + p130 + p131 + p141 + p151 + p171 + p177 + p188 + p66 + p56 + p75 + p52 + p44 + p39 + p29 + p25 + p19 + p185 + p184 + p164 + p138 + p96 + p99 <= p3 + p101 + p102 + p113 + p119 + p123 + p134 + p136 + p143 + p146 + p152 + p181 + p198 + p11 + p46 + p63 + p60 + p73 + p53 + p41 + p40 + p35 + p14 + p182 + p126)))
lola: processed formula length: 331
lola: 63 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: 541184 markings, 4213027 edges, 108237 markings/sec, 0 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: 822491 markings, 6719605 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 3559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p4 + p100 + p187 + p191 + p38 <= 2))) OR G (((p1 + p2 + p5 + p6 + p7 + p9 + p103 + p104 + p105 + p108 + p109 + p110 + p112 + p114 + p116 + p117 + p118 + p120 + p121 + p124 + p125 + p94 + p127 + p128 + p129 + p132 + p135 + p91 + p139 + p140 + p142 + p144 + p147 + p148 + p149 + p150 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p90 + p165 + p166 + p167 + p168 + p170... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p4 + p100 + p187 + p191 + p38 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p4 + p100 + p187 + p191 + p38 <= 2)))
lola: processed formula length: 44
lola: 63 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: 49 markings, 50 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: (F (G ((p4 + p100 + p187 + p191 + p38 <= 2))) OR G (((p1 + p2 + p5 + p6 + p7 + p9 + p103 + p104 + p105 + p108 + p109 + p110 + p112 + p114 + p116 + p117 + p118 + p120 + p121 + p124 + p125 + p94 + p127 + p128 + p129 + p132 + p135 + p91 + p139 + p140 + p142 + p144 + p147 + p148 + p149 + p150 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p90 + p165 + p166 + p167 + p168 + p170... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (G ((p4 + p100 + p187 + p191 + p38 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p4 + p100 + p187 + p191 + p38 <= 2)))
lola: processed formula length: 44
lola: 63 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: 49 markings, 50 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((p1 + p2 + p5 + p6 + p7 + p9 + p103 + p104 + p105 + p108 + p109 + p110 + p112 + p114 + p116 + p117 + p118 + p120 + p121 + p124 + p125 + p94 + p127 + p128 + p129 + p132 + p135 + p91 + p139 + p140 + p142 + p144 + p147 + p148 + p149 + p150 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p90 + p165 + p166 + p167 + p168 + p170 + p172 + p173 + p174 + p175 + p176 + p180 + p89 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p1 + p2 + p5 + p6 + p7 + p9 + p103 + p104 + p105 + p108 + p109 + p110 + p112 + p114 + p116 + p117 + p118 + p120 + p121 + p124 + p125 + p94 + p127 + p128 + p129 + p132 + p135 + p91 + p139 + p140 + p142 + p144 + p147 + p148 + p149 + p150 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p90 + p165 + p166 + p167 + p168 + p170 + p172 + p173 + p174 + p175 + p176 + p180 + p89 ... (shortened)
lola: processed formula length: 1797
lola: 63 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: 39 markings, 39 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no no no no no no yes no no
lola:
preliminary result: no no no no no no no yes no no
lola: ========================================
lola: memory consumption: 26872 KB
lola: time consumption: 11 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="CSRepetitions-PT-05"
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 CSRepetitions-PT-05, 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 r182-oct2-158987914200681"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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